5 ms·
If I understand correctly, Hindley-Milner type inference performs unification but not resolution. So I don't think the above is correct. I don't think there's
by YeGoblynQueenne 7y ago
If I understand correctly, Hindley-Milner type inference performs unification but not resolution.
So I don't think the above is correct. I don't think there's any language that has built-in SLD-resolution theorem proving that isn't a logic programming language.
And Prolog is not really a constraint solver. Constraint Logic Programming languages have been implemented in Prolog but the concept of "constraint" is not built-in to Prolog.
- dreamcompiler 7y agoProlog has constraints but they're limited to "equality" for some notion of that word. Constraint solvers and constraint extensions to Prolog broaden that considerably.
- YeGoblynQueenne 7y agoDo you mean the equality predicates, like ==/2 or =:=/2 etc, or do you mean unification? I dont' really think of unification as a constraint but, I don't know, maybe you have a point.
- dreamcompiler 7y agoYes I was talking about unification. When you can expand what unification means and program how it works, you have a real constraint system.