Universal Algebra in Type Theory

We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. We use setoids, i.e. types endowed with an arbitrary equivalence relation, as carriers for algebras. In this way it is possible to define the quotient of an algebra by a congruence. Standard constructions over algebras are defined and their basic properties are proved formally. To overcome the problem of defining term algebras in a uniform way, we use types of trees that generalize wellorderings. Our implementation gives tools to define new algebraic structures, to manipulate them and to prove their properties.

• Type: Conference
• Year: 1999
• Where: TPHOL
• Authors: Venanzio Capretta
• Keywords: Algebras, Arbitrary Equivalence Relation, Automated Reasoning, Proof Assistant Coq, TPHOL 1999