Are there some theoretical reasons for that (like that the type checking or type inference would become undecidable), or practical reasons (too difficult to implement properly)?
Currently, we can wrap things into newtype like
newtype Pair a = Pair (a, a)
and then have Pair :: * -> *
but we cannot do something like λ(a:*). (a,a).
(There are some languages that have them, for example, Scala does.)
-
4Choosing one kind of type system into use excludes the other kind of type systems since the whole thing needs to be consistent. Type level lambda would be very strange in category theory...tp1– tp12012年12月01日 09:29:29 +00:00Commented Dec 1, 2012 at 9:29
-
1stackoverflow.com/questions/4922560/… is also related.Edward Z. Yang– Edward Z. Yang2016年10月14日 21:08:14 +00:00Commented Oct 14, 2016 at 21:08
1 Answer 1
Type inference with type level lambdas would require higher order unification which is undecidable. This is the motivation for disallowing them. But as has happened with other undecidable features (like type inference for GADTs), it might be possible to require type signatures and allow it. I'm not sure if that's been investigated by anyone.
Explore related questions
See similar questions with these tags.