BreakfastB0b

13 ms·

91.
by BreakfastB0b 6y ago
There’s a deep connection between Types and Logical Proofs (Curry Howard Correspondence). Haskell has a rich type system that allows you to “prove” (i.e. typecheck) many properties of your program. This is valuable when getting right the fi
92.
by BreakfastB0b 8y ago
You can get async / await for arbitrary monads in JavaScript using generator functions and coroutines.
93.
by BreakfastB0b 8y ago
Error/Either monads are the perfect middle ground IMHO. You get errors as data types and an efficient way to abstract away the boilerplate associated with it.
94.
by BreakfastB0b 8y ago
50+ Real-World Blockchain Use Cases that all involve some kind of trusted party thus invalidating the whole point of using a blockchain in the first place. Call me when you have a solution to the Trustless Oracle Problem. Until then just us
95.
by BreakfastB0b 8y ago
“The Myth of Sisyphus” by Albert Camus, if you find yourself worrying about existential nihilism then this is the book for you. I found it extremely useful after an intense psychedelic experience. The School of Life has a good overview of h
96.
by BreakfastB0b 9y ago
I haven't got up to proving things about floating point numbers in Coq. But my guess would be probably not. But Haskell's quickCheck doesn't seem to find a problem. λ quickCheck @(Float -> Bool) $ \x -> 2 * x == x +
97.
by BreakfastB0b 9y ago
One way is to use Functional Extensionality, which is to say that two functions are equal if for all possible inputs they return the same value. In Coq for instance. Axiom functional_extensionality: forall {X Y: Type} {f g : X -> Y},