Unification-free ("keyword") type checking
(www.haskellforall.com)
from armchair_progamer@programming.dev to programming_languages@programming.dev on 22 Feb 2024 20:40
https://programming.dev/post/10424125
from armchair_progamer@programming.dev to programming_languages@programming.dev on 22 Feb 2024 20:40
https://programming.dev/post/10424125
The author claims that by removing some type inference (lambdas and generic instantiation) you can reduce the amount of code required to implement type-checking.
threaded - newest
That’s quite the drawback. I’m not sure if I believe a large number of keywords would have a good effect on ergonomics