Haskell for all: Unification-free ("keyword") type checking

The post discusses the challenge of implementing a type system in programming languages without adding significant complexity to the implementation. It proposes a 'lean' type checking approach that eliminates the need for unification variables. However, this approach has limitations in terms of inferring lambda argument types Show more