Hacker News Reader

Prolog's constraint solving and unification are exactly what is required for solving type-checking constraints in a Hindley-Milner type system.

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