Universal algebra in type theory

20Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 de_ne the quotient of an algebra by a congruence. Standard constructions over algebras are de_ned and their basic properties are proved formally. To overcome the problem of de_ning 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.

Cite

CITATION STYLE

APA

Capretta, V. (1999). Universal algebra in type theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1690, pp. 131–148). Springer Verlag. https://doi.org/10.1007/3-540-48256-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free