The calculus of algebraic constructions

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

Volumn 1631, Issue , 1999, Pages 301-316

  Blanqui, Frédéric ^a   Jouannaud, Jean Pierre ^a   Okada, Mitsuhiro ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; PATTERN MATCHING;

CALCULUS OF ALGEBRAIC CONSTRUCTIONS; CALCULUS OF CONSTRUCTION; DEPENDENT TYPES; FIRST ORDER; HIGHER-ORDER; INDUCTIVE-TYPE; POSITIVITY CONDITIONS; REWRITE RULES;

ABSTRACT DATA TYPES;

EID: 84957655853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_25     Document Type: Conference Paper

References (22)

1. F. Barbanera, M. Fernández, and H. Geuvers. Modularity of strong normalization in the algebraic-λ-cube. Journal of Functional Programming, 7(6), 1997.
2. H. Barendregt. Introduction to generalized type systems. Journal of Functional Programming, 1992.
3. The Coq Proof Assistant Reference Manual Version 6.2. INRIA-Rocquencourt-CNRS-Université Paris Sud-ENS Lyon, 1998.
4. F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive Data Type Systems, 1998.
5. V. Breazu-Tannen. Combining algebra and higher-order types. In Third IEEE Annual Symposium on Logic in Computer Science, pages 82-90. 1988.
6. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 83(1):3-28, June 1991.
7. T. Coquand. Pattern matching with dependent types. In B. Nordström, K. Pettersson, G. Plotkin, editors, Workshop on Types for Proofs and Programs, 1992.
8. T. Coquand and J. Gallier. A proof of strong normalization for the Theory of Constructions using a Kripke-like interpretation. 1st Intl. Workshop on Logical Frameworks. 1990.
9. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76:96-120, 1988.
10. T. Coquand and C. Paulin-Mohring. Inductively defined types. In P. Martin-Löf and G. Mints, editors, Proceedings of Colog'88, LNCS 417. Springer-Verlag, 1990.
11. C. Cornes. Conception d'un langage de haut niveau de representation de preuves: Récurrence par filtrage de motifs; Unification en présence de types inductifs primitifs; Synthèse de lemmes d'inversion. PhD thesis, Université de Paris 7, 1997.
12. R. Di Cosmo and D. Kesner. Combining algebraic rewriting, extensional lambda calculi, and fixpoints. Theoretical Computer Science, 169(2):201-220, 1996.
13. J. Courant. A module calculus for Pure Type Systems. TLCA'97.
14. G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Technical Report 3400, INRIA, 1998.
15. J. Gallier. On Girard's "Candidats de Réductibilité". In P.-G. Odifreddi, editor, Logic and Computer Science. North Holland, 1990.
16. H. Geuvers. A short and flexible proof of strong normalization for the Calculus of Constructions. In P. Dybjer, B. Nordström, and J. Smith, editors, Selected Papers 2nd Intl. Workshop on Types for Proofs and Programs, TYPES'94, Båstad, Sweden, 6-10 June 1994, volume 996 of LNCS, pages 14-38. 1995.
17. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1988.
18. J.-P. Jouannaud and M. Okada. Abstract Data Type Systems. Theoretical Computer Science, 173(2):349-391, February 1997.
19. J. W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121(1-2):279-308, December 1993.
20. T. Nipkow. Higher-order critical pairs. In Proc. 6th IEEE Symp. Logic in Computer Science, Amsterdam, pages 342-349, 1991.
21. M. Okada. Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system. In G. H. Gonnet, editor, Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, pages 357-363. ACM Press, July 1989.
22. B. Werner. Une Théorie des Constructions Inductives. Thése, Université Paris 7, 1994.