It's strange that printing is so amenable to composable overloading in most programming languages, yet parsing is not. They are inverses.
-
-
Replying to @TimSweeneyEpic
when you use continuations, the inverse works just as well.
1 reply 0 retweets 1 like -
Replying to @paniq @TimSweeneyEpic
as
@pervognsen implied, the "strange intruder" here is the 'return' idiom whose typing isn't symmetrical to input argument typing.4 replies 0 retweets 1 like -
Replying to @paniq @TimSweeneyEpic
Yes, the CPS encoding is particularly nice for Church encoded variant types for the return value.
1 reply 0 retweets 2 likes -
In which case the producer essentially invokes different callbacks depending on the variant type of the result.
1 reply 0 retweets 2 likes -
Replying to @pervognsen @paniq
Perhaps one could write a Prolog definition that runs in either direction.
1 reply 0 retweets 1 like -
It is strange that Haskell has a compile-time backtracking functional logic language, but not a runtime one.
2 replies 0 retweets 2 likes -
Replying to @TimSweeneyEpic @paniq
You mean the crazy Oleg thing with type inference for typeclasses with functional dependencies? Ye gawds.
2 replies 0 retweets 1 like
-
-
Replying to @TimSweeneyEpic @pervognsen
Rust has tagged unions (called "enum") which also work at runtime btw
0 replies 0 retweets 0 likesThanks. 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.
