Universal algebra in type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1690, Issue , 1999, Pages 131-148

  Capretta, Venanzio ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL LANGUAGES; FORMAL LOGIC;

ALGEBRAIC STRUCTURES; EQUIVALENCE RELATIONS; PROOF ASSISTANT; STANDARD CONSTRUCTIONS; TERM ALGEBRAS; TYPE THEORY; UNIVERSAL ALGEBRA;

THEOREM PROVING;

EID: 84957806112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48256-3_10     Document Type: Conference Paper

References (23)

1. Peter Aczel. Notes towards a formalisation of constructive galois theory. Draft report, 1994.
2. H. P. Barendregt. Lambda Calculi with Types. In S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2. Oxford University Press, 1992.
3. Bruno Barras, Samuel Boutin, Cristina Cornes, Judicaël Courant, Yann Coscoy, David Delahaye, Daniel de Rauglaudre, Jean-Christophe Filliâtre, Eduardo Giménez, Hugo Herbelin, Gérard Huet, Henri Laulhére, César Muñoz, Chetan Murthy, Catherine Parent-Vigouroux, Patrick Loiseleur, Christine Paulin- Mohring, Amokrane Saïbi, and Benjanin Werner. The Coq Proof Assistant Ref-erence Manual. Version 6.2.
4. G. Barthe, M. Ruys, and H. P. Barendregt. A two-level approach towards lean proof-checking. In S. Berardi and M. Coppo, editors, Types for Proofs and Pro-grams (TYPES'95), volume LNCS 1158, pages 16-35. Springer, 1995.
5. Samuel Boutin. Using reflection to build eficient and certiéd decision procedures. In Martín Abadi and Takayasu Ito, editors, Theoretical Aspects of Com-puter Software. Third International Symposium, TACS'97, volume LNCS 1281, pages 515-529. Springer, 1997.
6. R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Develop-ment System. Prentice Hall, 1986.
7. Thierry Coquand and Christine Paulin. Inductively defined types. In P. Martin- Löf, editor, Proceedings of Colog '88, volume 417 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
8. Thierry Coquand and Henrik Persson. Integrated Development of Algebra in Type Theory. Presented at the Calculemus and Types '98 workshop, 1998.
9. Eduardo Giménez. A Tutorial on Recursive Types in Coq. Technical report, Unité de recherche INRIA Rocquencourt, 1998.
10. Martin Hofmann. Elimination of extensionality in Martin-Löf type theory. In Barendregt and Nipkow, editors, Types for Proofs and Programs. International Workshop TYPES '93, pages 166-190. Springer-Verlag, 1993.
11. Martin Hofmann and Thomas Streicher. A groupoid model refutes uniqueness of identity proofs. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 208-212. IEEE Computer Society Press, 1994.
12. Douglas J. Howe. Computational metatheory in Nuprl. In E.Lusk and R. Overbeek, editors, 9th International Conference on Automated Deduction, volume LNCS 310, pages 238-257. Springer-Verlag, 1988.
13. Gérard Huet and Amokrane Saïbi. Constructive category theory. In In honor of Robin Milner. Cambridge University Press, 1997.
14. Paul Jackson. Exploring abstract algebra in constructive type theory. In Au-tomated Deduction - CADE-12, volume Lectures Notes in Artificial Intelligence 814, pages 591-604. Springer-Verlag, 1994.
15. Zhaohui Luo. Computation and Reasoning, A Type Theory for Computer Science, volume 11 of International Series of Monographs on Computer Science. Oxford University Press, 1994.
16. Per Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science, VI, 1979, pages 153-175. North-Holland, 1982.
17. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984. Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980.
18. K. Meinke and J. V. Tucker. Universal Algebra. In S. Abramsky,DovM. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 1. Oxford University Press, 1992.
19. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin-Löf 's Type Theory. Clarendon Press, 1990.
20. Kent Petersson and Dan Synek. A Set Constructor for Inductive Sets in Martin-Löf's Type Theory. In Proceedings of the 1989 Conference on Category Theory andComputer Science, Manchester, U.K., volume 389 of Lecture Notes in Computer Science. Springer-Verlag, 1989.
21. Amokrane Saïbi. Typing algorithm in type theory with inheritance. In POPL'97: The 12th ACM SIGPLAN-SIGACT Symposium on Principles of Programming languages, pages 292-301. Association for Computing Machinery, 1997.
22. Milena Stefanova. Properties of Typing Systems. PhD thesis, Computer Science Institute, University of Nijmegen, 1999.
23. Laurent Théry. Proving and Computing: a certiéd version of the Buchberger's algorithm. Technical report, INRIA, 1997.