ACME-0.0.0.1: Essential features

Safe HaskellNone
LanguageHaskell98

Acme.Peirce

Description

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.

Synopsis

Documentation

falseVoid :: Void -> a Source

Ex falso

peirce :: ((a -> a1) -> a) -> a Source

Peirce's law

lem :: (a -> b) -> ((a -> Void) -> b) -> b Source

Law of excluded middle

doubleNeg :: ((b -> Void) -> Void) -> b Source

Double negation law