I'd love to think there's a way to formally prove or disprove the "pure" form of Celluloid's concurrency model is truly deadlock-free
-
-
@bascule Eh, they're not so hard. Not much more complicated than, say -- Haskell's type system.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.