During SPJ’s keynote about linear Haskell today, I started wondering about the relationship between linear and dependent types. It seems like there’s a big overlap in their use cases, and that DTs are strictly more powerful than LTs. Is that correct?
-
-
I haven't found anything yet that can't be expressed with dependent types, but linear types make things so much easier. And I expect that purity (that is, not even exceptions or partiality) will turn out to be very valuable.
-
when you say it makes things much easier, is it for this special cases or in general compared to dependent types?
- 2 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.