I suppose you could hack a bug-ridden implementation of Prolog unification in Prolog but why? Hindley-Milner type inference is unification over types and unification is built-in to Prolog. Functional programmers ignore…
More to the point, our mathematics work to solve real problems up to a certain point. For instance our mathematics have not yet been able to identify polynomial-time solutions to problems in the class NP and it's…
> And the Pythagorean theorem is a universal truth that holds everywhere. Or at least in every world where there exist straight lines, yes? For instance: > The Pythagorean theorem is derived from the axioms of Euclidean…
I suppose you could hack a bug-ridden implementation of Prolog unification in Prolog but why? Hindley-Milner type inference is unification over types and unification is built-in to Prolog. Functional programmers ignore…
More to the point, our mathematics work to solve real problems up to a certain point. For instance our mathematics have not yet been able to identify polynomial-time solutions to problems in the class NP and it's…
> And the Pythagorean theorem is a universal truth that holds everywhere. Or at least in every world where there exist straight lines, yes? For instance: > The Pythagorean theorem is derived from the axioms of Euclidean…