C++ makes you express validity constraints with SFINAE, then write the same expression in the implementation. Haskell has Wadler’s Theorems for Free mechanism. Only functional logic languages really address unification, failure and backtracking rigorously.
-
-
Show this thread
-
My view after 20 years of floundering on type systems is that type deduction is as hopelessly unscalable as automated theorem proving, and that a language should expose functional logic constructs so programmers can write constraints naturally.
Show this thread
End of conversation
New conversation -
-
-
fmap in Haskell essentially has an implementation per type it supports. For simple types there is only one possible implementation but for complex ones there is no way to make a deduction since multiple different choices are possible.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.