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 @pervognsen
What's the minimum feature set needed to write composable bidirectional functions? Hypothesis: unification, bidirectional implication.
2 replies 0 retweets 1 like -
Simple example: f(a,b) {((a==0) <=> (b==1)) && ((a==1)<=>(b==0))}
1 reply 0 retweets 0 likes
Perhaps the overhead of something like this could be acceptable in mainstream programming, versus costly full-program backtracking.
12:41 PM - 28 May 2017
0 replies
0 retweets
0 likes
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.