Look at your favorite programming language and identify the little functional logic languages embedded in it (meaning: backtracking evaluation with unification to find unknowns). JavaScript, C#, and Java have one for regular expressions.
-
-
Actually, for Curry it’s sufficient to know how to map Haskell with overlapping pattern matching on the left-hand side to case-expressions to avoid non-intended non-determinism. Otherwise you can just use your Haskell programs one-to-one!
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.