Safe Haskell | None |
---|---|
Language | Haskell98 |
An interface to continuations using Peirce's law
This module is bogus, as the following proof demonstrates:
peirce (f -> f 1 == f 2) == 1
peirce (f -> f 2 == f 1) == 2
f 1 == f 2
Therefore, 1 == 2.
Safe Haskell | None |
---|---|
Language | Haskell98 |
An interface to continuations using Peirce's law
This module is bogus, as the following proof demonstrates:
peirce (f -> f 1 == f 2) == 1
peirce (f -> f 2 == f 1) == 2
f 1 == f 2
Therefore, 1 == 2.