I have that in an earlier prototype (called "None"), will soon also add it to this one. Can be done without bidi.
Rather, you write "X=A+1" and get a new future that's ready when A is ready. Sort of a dual to Haskell thunks and lazy evaluation.
-
-
Despite all of this, side-effectful operations always execute in order relative to each other.
-
This is practicable only because most code is purely functional, with mutation and low-level I/O being rare.
End of conversation
New conversation -
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.