You can say an abstraction is leaky but what implementation details can a developer depend on? Matters. Poorly defined. Consistently emits unpredicted states.
-
They emit information through EMF. They constrain where none exists in the proof. Formally verified algorithms get owned all the time by unseen constraints. That's why all abstractions are leaky and all oracles are heuristic. Gödel's Incompleteness is related.
Here is an abstraction called f. (forall x. x -> f x, forall a b. (a -> f b) -> f a -> f b) Where is the leak?
-
-
As lambda calc is a formal logic system, it is necessarily incomplete. Curry's paradox is one example. I can't remember enough lambda calc to do it myself, but how would it handle a contradiction like that?
-
This is not true. Where is the leak?
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.