Hacker News new | ask | show | jobs
by taolson 213 days ago
Prolog's constraint solving and unification are exactly what is required for solving type-checking constraints in a Hindley-Milner type system.
1 comments

Yes, absolutely...I just wish the people who wrote FP compilers knew this.