Currently exploring purely functional data structures and algorithms based on futures to ensure maximum async progress.
-
-
-
Replying to @dee_bloo
It's early, but so far the problem space feels "fortuitously constrained" to yield particularly clean and efficient solutions.
1 reply 0 retweets 0 likes -
Replying to @TimSweeneyEpic @dee_bloo
Specifically: minimizing dependencies on futures tends to force container designs that minimize combinatorial complexity.
1 reply 0 retweets 1 like -
Replying to @TimSweeneyEpic
forgive me if this is a simple question but is this an area where the concept of reactive steams comes into play?
1 reply 0 retweets 0 likes
Replying to @dee_bloo
It's very similar to functional reactive programming, which is simpler than imperative and is dual to lazy evaluation.
6:32 PM - 12 Jan 2017
0 replies
0 retweets
1 like
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.