| HN Mirror

Y	Hacker News new \| ask \| show \| jobs


	by zozbot234 144 days ago
	> infer or constrain the amount of copies and allocations a piece of code has That's exactly what substructural logic/type systems allows you to do. Affine and linear types are one example of substructural type systems, but you can also go further in limiting moves, exchanges/swaps etc. which helps model scenarios where allocation and deallocation must be made explicit.

2 comments

I don't think it's been integrated in any mainstream language though.

Experimental and of course one can debate whether Haskell is mainstream but I figured it merits a mention.

I think by default Rust uses affine types, but that's about the extent of it.

I know some research languages are playing around with linear types, I wonder if we'll see it show up in some language or another.