We can't easily get away with using unification to infer types (since we have to elaborate at the same time); so to have simple type inference for lambdas we would have to require type annotations, like \x : int. x + 3. In turn that would mean adding a parser for types, and so on.
We can't easily get away with using unification to infer types (since we have to elaborate at the same time); so to have simple type inference for lambdas we would have to require type annotations, like
\x : int. x + 3
. In turn that would mean adding a parser for types, and so on.It could easily be worth it though, both because of things like https://github.com/swarm-game/swarm/issues/1584#issuecomment-2187331271 and because of the increased expressivity.