Next Types Are Theorems; Programs Are Proofs 28

Negation

¬p ≡ p → ⊥

        undefined          ::  a
        loop x = loop x
        -- loop   :: b -> a
        -- loop x :: a

(¬p ∧ p) → ⊥
(p -> Void, p) → Void


Next Next