top | item 45905735

(no title)

taolson | 3 months ago

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

discuss

order

hunterpayne|3 months ago

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