coq - Cong, subst and equality type in dependently typed programming languages -
in dependently typed type theory there's equality type. when type defined, number of utilities, namely cong , subst introduced. how expressive are? possible express can eliminator equality them?
no, can't prove uniqueness of identity proofs cong, subst , eliminator.
uip : {α : level} {a : set α} {x y : a} -> (p q : x ≡ y) -> p ≡ q
here explanation: http://homotopytypetheory.org/2011/04/10/just-kidding-understanding-identity-elimination-in-homotopy-type-theory/
Comments
Post a Comment