C++ has one for template parameter instantiation and overload resolution. Haskell has one for typeclass search, another for pattern matching and binding expressions, and a third with monads.
-
-
Show this thread
-
At some point, we should take this realization seriously and start building backtracking, failure and unification into languages as first class constructs, to replace the funky sublanguages with a general language feature.
Show this thread -
Fortunately, most languages already have the low-level plumbing mechanisms to implement functional logic: futures (variables that can be unified), coroutines (for separating value production from consumption), and exceptions (for failing back to a join.)
Show this thread
End of conversation
New conversation -
-
-
Isn't backtracking an insane way to implement regular expression? https://swtch.com/~rsc/regexp/regexp1.html …
-
Sometimes you want to capture and back-reference. Yeah, the exception to the rule!
- 3 more replies
New conversation -
-
-
My favourite language is Racket, which has datalog embedded in the language https://docs.racket-lang.org/datalog/
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I've always loved how Wolfram created a layer over regex to unify their syntax with the pattern syntax used for arbitrary symbolic expressions everywhere in the language. Here I count the first million primes with doubled digits by pattern matching on lists of digits or strings.pic.twitter.com/gNQP5csblv
- End of conversation
New conversation -
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Wondering what your thoughts are on A.I driven programming.
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.
