Functional Programming, Formal Methods.
intersection of those 2 Nat : Set Nat = ιx. CNat (INat x) IZero : Nat IZero = [CZero, IZero] ISucc : Nat -> Nat ISucc = λn. [CSucc n.1, ISucc n.1 n.2] ind : (P : Set) -> ((n : Nat) -> P n -> P (Succ n)) -> (P Zero) -> (n : Nat) -> P n ind = … The proof of ind is a little more complicated, so I’ve