Prolog's constraint solving and unification are exactly what is required for sol... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		taolson 38 days ago \| parent \| context \| favorite \| on: Learn Prolog Now (2006) Prolog's constraint solving and unification are exactly what is required for solving type-checking constraints in a Hindley-Milner type system.

hunterpayne 38 days ago [–]

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

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact