News for hackers. Stuff that matters.
Re:What is Hindley-Milner and why is it cool? (2008) by krat0sprakhar on Sunday August 20, 2017 @02:26PM (#15059586)
Hindley Milner is awesome and surpursingly not super hard to implement. Shameless plug: Wrote a minimal implementation in OCaml back in college https://github.com/prakhar1989/type-inference
Re:What is Hindley-Milner and why is it cool? (2008) by Profan on Sunday August 20, 2017 @04:13PM (#15060047)
Hindley Milner is quite elegant, but as applied in languages it becomes a quite different beast (OCaml etc, yikes)

But also thanks to that detour, this article is a nice read on OCaml in particular: http://okmij.org/ftp/ML/generalization.html

Re:What is Hindley-Milner and why is it cool? (2008) by mbrock on Sunday August 20, 2017 @03:55PM (#15059976)
I first became interested in programming language theory back in high school when a guy in an IRC chat, who was a student at UIUC, asked me to do his homework for him. The assignment was to implement Hindley-Milner type checking with unification in OCaml. Thanks, lazy IRC guy!
Re:What is Hindley-Milner and why is it cool? (2008) by jjtheblunt on Sunday August 20, 2017 @04:14PM (#15060051)
Wow, good for you, ridiculous for the student's integrity; from UIUC also.
Re:What is Hindley-Milner and why is it cool? (2008) by chewxy on Sunday August 20, 2017 @03:51PM (#15059957)
The challenge is of course writing one that is fast enough to be used for runtime-compilation (imagine a service that compiles code).

I had to rewrite mine (https://github.com/chewxy/hm) twice, and finally removing typeclasses to be fast enough for a inference system I wrote.