Definitions by rewriting in the Calculus of Constructions

Mathematical Structures in Computer Science

Volumn 15, Issue 1, 2005, Pages 37-92

  Blanqui, Frédéric ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24044537070     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129504004426     Document Type: Article

References (103)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Lévy, J.-J. (1991) Explicit substitutions. Journal of Functional Programming 1 (4) 375-416.
2. Abel, A. (2001) A third-order representation of the λμ- calculus. In: Proc. of the Workshop on Mechanized Reasoning about Languages with Variable Binding. Electronic Notes in Theoretical Computer Science 58 (1).
3. Altenkirch, T. (1993) Constructions, Inductive Types and Strong Normalization, Ph.D. thesis, University of Edinburgh, United Kingdom.
4. Augustsson, L. (1985) Compiling pattern matching. In: Proc. of the Conf. on Functional Programming Languages and Computer Architecture. Springer-Verlag Lecture Notes in Computer Science 201.
5. Baader, F. and Nipkow, T. (1998) Term Rewriting and All That, Cambridge University Press.
6. Barbanera, F. (1990) Adding algebraic rewriting to the Calculus of Constructions: strong normalization preserved. In: Proc. of the 2nd Int. Work, on Conditional and Typed Rewriting Systems. Springer-Verlag Lecture Notes in Computer Science 516.
7. Barbanera, F., Fernández, M. and Geuvers, H. (1994) Modularity of strong normalization and confluence in the algebraic-λ-cube. In: Proc. of the 9th IEEE Symp. on Logic in Computer Science.
8. Barbanera, F., Fernández, M. and Geuvers, H. (1997) Modularity of strong normalization in the algebraic-λ-cube. Journal of Functional Programming 7 (6) 613-660.
9. Barendregt, H. (1984) The Lambda Calculus: Its Syntax and Semantics, 2nd edition, North-Holland.
10. Barendregt, H. (1992) Lambda calculi with types. In: Abramski, S., Gabbay, D. and Maibaum, T. (eds.) Handbook of logic in computer science, volume 2, Oxford University Press.
11. Barras, B. (1999) Auto-validation d'un système de preuves avec familles inductives, Ph.D. thesis, Université Paris VII, France.
12. Barthe, G. (1998) The relevance of proof-irrelevance. In: Proc. of the 25th Int. Colloq. on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 1443.
13. Barthe, G. and Geuvers, H. (1995a) Modular properties of algebraic type systems. In: Proc. of the 2nd Int. Work, on Higher-Order Algebra, Logic and Term Rewriting. Springer-Verlag Lecture Notes in Computer Science 1074.
14. Barthe, G. and Geuvers, H. (1995b) Congruence types. In: Proc. of the 9th Int. Work, on Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 1092.
15. Barthe, G. and Melliès, P.-A. (1996) On the subject reduction property for algebraic type systems. In: Proc. of the 10th Int. Work, on Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 1258.
16. Barthe, G. and van Raamsdonk, F. (1997) Termination of algebraic type systems: the syntactic approach. In: Proc. of the 6th Int. Conf. on Algebraic and Logic Programming. Springer-Verlag Lecture Notes in Computer Science 1298.
17. Bendix, P. and Knuth, D. (1970) Computational problems in abstract algebra, chapter entitled 'Simple word problems in universal algebra', Pergamon Press.
18. Blanqui, F. (2000) Termination and confluence of higher-order rewrite systems. In: Proc. of the 11th Int. Conf. on Rewriting Techniques and Applications. Springer-Verlag Lecture Notes in Computer Science 1833.
19. Blanqui, F. (2001) Theorie des Types et Récriture, Ph.D. thesis, Université Paris XI, Orsay, France.
20. Available in English as "Type Theory and Rewriting"
21. Blanqui, F. (2001) Definitions by rewriting in the Calculus of Constructions (extended abstract). In: Proc. of the 16th IEEE Symp. on Logic in Computer Science.
22. Blanqui, F. (2003a) Inductive types in the Calculus of Algebraic Constructions. In: Proceedings of the 6th International Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 2701.
23. Blanqui, F. (2003b) Rewriting modulo in Deduction modulo. In: Proceedings of the 14th International Conference on Rewriting Techniques and Applications. Springer-Verlag Lecture Notes in Computer Science 2706.
24. Blanqui, F., Jouannaud, J.-P. and Okada, M. (1999) The Calculus of Algebraic Constructions. In: Proc. of the 10th Int. Conf. on Rewriting Techniques and Applications. Springer-Verlag Lecture Notes in Computer Science 1631.
25. Blanqui, F., Jouannaud, J.-P. and Okada, M. (2002) Inductive-data-type Systems. Theoretical Computer Science 272 41-68.
26. Borovanský, P., Cirstea, H., Dubois, H., Kirchner, C., Kirchner, H., Moreau, P.-E., Ringeissen, C. and Vittek, M. (2000) ELAN User Manual, INRIA Nancy, France. (Available at http://elan.loria.fr/.)
27. Breazu-Tannen, V. (1988) Combining algebra and higher-order types. In: Proc. of the 3rd IEEE Symp. on Logic in Computer Science.
28. Breazu-Tannen, V. and Gallier, J. (1989) Polymorphic rewriting conserves algebraic strong normalization. In: Proc. of the 16th Int. Colloq. on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 372.
29. Breazu-Tannen, V. and Gallier, J. (1994) Polymorphic rewriting conserves algebraic confluence. Information and Computation 114 (1) 1-29.
30. Chrza̧szcz, J. (2000) Modular rewriting in the Calculus of Constructions. Presented at the International Workshop on Types for Proofs and Programs.
31. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J. and Quesada, J. (1999) Maude: Specification and Programming in Rewriting Logic, Computer Science Laboratory, SRI International, United States. (Available at http://maude.csl.sri.com/.)
32. Contejean, E., Marché, C., Monate, B. and Urbain, X. (2000) CiME. (Available at http://cime.lri.fr/.)
33. Coq Development Team (2002) The Coq Proof Assistant Reference Manual - Version 7.3, INRIA Rocquencourt, France. (Available at http://coq.inria.fr/.)
34. Coquand, T. (1985) Une théorie des constructions, Ph.D. thesis, Université Paris VII, France.
35. Coquand, T. (1986) An analysis of Girard's paradox. In: Proc. of the 1st IEEE Symp. on Logic in Computer Science.
36. Coquand, T. (1991) An algorithm for testing conversion in type theory. In: Huet, G. and Plotkin, G. (eds.) Logical Frameworks, Cambridge University Press 255-279.
37. Coquand, T. (1992) Pattern matching with dependent types. In: Proc. of the Int. Work. on Types for Proofs and Programs. (Available at http://www.lfcs.informatics.ed.ac.uk/research/types-bra/proc/.)
38. Coquand, T. and Gallier, J. (1990) A proof of strong normalization for the Theory of Constructions using a Kripke-like interpretation. (Paper presented at the First International Workshop on Logical Frameworks, but not published in the proceedings - available at ftp://ftp.cis.upenn.edu/pub/papers/gallier/ sntoc.dvi.Z.)
39. Coquand, T. and Huet, G. (1988) The Calculus of Constructions. Information and Computation 76 (2-3) 95-120.
40. Coquand, T. and Paulin-Mohring, C. (1988) Inductively defined types. In: Proc. of the Int. Conf. on Computer Logic. Springer-Verlag Lecture Notes in Computer Science 417.
41. Courtieu, P. (2001) Normalized types. In: Proc. of the 15th Int. Work, on Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 2142.
42. de Bruijn, N. (1968) The mathematical language AUTOMATH, its usage, and some of its extensions. In: Proc. of the Symp. on Automatic Demonstration. Springer-Verlag Lecture Notes in Mathematics.
43. (Reprinted in: Geuvers, H., Nederpelt, R. and de Vrijer, R. (eds.) (1994) Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics 133, North-Holland.)
44. Dershowitz, N. (1982) Orderings for term rewriting systems. Theoretical Computer Science 17 279-301.
45. Dershowitz, N. (1994) Hierarchical termination. In: Proc. of the 4th Int. Work, on Conditional and Typed Rewriting Systems. Springer-Verlag Lecture Notes in Computer Science 968.
46. Dershowitz, N. and Jouannaud, J.-P. (1990) Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science B Chapter 6, North-Holland.
47. Dougherty, D. (1991) Adding algebraic rewriting to the untyped lambda calculus. In: Proc. of the 4th Int. Conf. on Rewriting Techniques and Applications. Springer-Verlag Lecture Notes in Computer Science 488.
48. Dowek, G. (1999) La part du calcul, Mémoire d'habilitation.
49. Dowek, G. and Werner, B. (1998) Proof normalization modulo. In: Proc. of the Int. Work, on Types for Proofs and Programs. Springer-Verlag Lecture Notes in Computer Science 1657.
50. Dowek, G. and Werner, B. (2000) An inconsistent theory modulo defined by a confluent and terminating rewrite system.
51. Dowek, G., Hardin, T. and Kirchner, C. (1998) Theorem proving modulo. Technical Report 3400, INRIA Rocquencourt, France.
52. Dowek, G., Hardin, T. and Kirchner, C. (2001) HOL-λσ: an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science 11 21-45.
53. Drosten, K. (1989) Termersetzungssysteme, Ph.D. thesis, Universität Passau, Germany.
54. Eker, S. (1996) Fast matching in combinations of regular equational theories. In: Proceedings of the 1 st International Workshop on Rewriting Logic and Applications. Electronic Notes in Theoretical Computer Science 4.
55. Fernández, M. (1993) Modèles de calculs multiparadigmes fondés sur la réécriture, Ph.D. thesis, Université Paris XI, Orsay, France.
56. Gallier, J. (1990) On Girard's "Candidats de Ré ductibilité". In: Odifreddi, P.-G. (ed.) Logic and Computer Science, North-Holland.
57. Geuvers, H. (1994) A short and flexible proof of strong normalization for the Calculus of Constructions. In: Proc. of the Int. Work, on Types for Proofs and Programs. Springer-Verlag Lecture Notes in Computer Science 996.
58. Geuvers, H. (1993) Logics and Type Systems, Ph.D. thesis, Katholiecke Universiteit Nijmegen, The Netherlands.
59. Geuvers, H. and Nederhof, M.-J. (1991) A modular proof of strong normalization for the Calculus of Constructions. Journal of Functional Programming 1 (2) 155-189.
60. Geuvers, H., Nederpelt, R. and de Vrijer, R. (eds.) (1994) Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics 133, North-Holland.
61. Giménez, E. (1996) Un Calcul de Constructions infinies et son application à la vérification de systèmes communiquants, Ph.D. thesis, ENS Lyon, France.
62. Giménez, E. (1998) Structural recursive definitions in type theory. In: Proc. of the 25th Int. Colloq. on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 1443.
63. Girard, J.-Y. (1971) Une extension de l'interprétation de Gödel à l'analyse et son application à l'élimination des coupures dans l'analyse et la théorie des types. In: Fenstad, J. (ed.) Proc. of the 2nd Scandinavian Logic Symposium. Studies in Logic and the Foundations of Mathematics 63, North-Holland.
64. Girard, J.-Y. (1972) Interprétation fonctionelle et élimination des coupures dans l'arithmetique d'ordre supérieur, Ph.D. thesis, Université Paris VII, France.
65. Girard, J.-Y., Lafont, Y. and Taylor, P. (1988) Proofs and Types, Cambridge University Press.
66. Grégoire, B. and Leroy, X. (2002) A compiled implementation of strong reduction. In: Proceedings of the 7th ACM SIGPLAN International Conference on Functional Programming.
67. Guttag, J. and Horning, J. (1978) The algebraic specification of abstract data types. Acta Informatica 10 (1) 27-52.
68. Harper, R. and Mitchell, J. (1999) Parametricity and variants of Girard's J operator. Information Processing Letters 70 1-5.
69. Hsiang, J. (1982) Topics in Automated Theorem Proving and Program Generation, Ph.D. thesis, University of Illinois, Urbana-Champaign, United States.
70. Jouannaud, J.-P. and Kounalis, E. (1986) Proof by induction in equational theories without constructors. In: Proc. of the 1st IEEE Symp. on Logic in Computer Science.
71. Jouannaud, J.-P. and Okada, M. (1991) Executable higher-order algebraic specification languages. In: Proc. of the 6th IEEE Symp. on Logic in Computer Science.
72. Jouannaud, J.-P. and Okada, M. (1997) Abstract Data Type Systems. Theoretical Computer Science 173 (2) 349-391.
73. Jouannaud, J.-P. and Rubio, A. (1999) The Higher-Order Recursive Path Ordering. In: Proc. of the 14th IEEE Symp. on Logic in Computer Science.
74. Kirchner, H. and Moreau, P.-E. (2001) Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories. Journal of Functional Programming 11 (2) 207-251.
75. Klop, J.-W., van Oostrom, V. and van Raamsdonk, F. (1993) Combinatory reduction systems: introduction and survey. Theoretical Computer Science 121 279-308.
76. Kounalis, E. (1985) Completeness in data type specifications. In: Proc. of the European Conf. on Computer Algebra. Springer-Verlag Lecture Notes in Computer Science 204.
77. Luo, Z. and Pollack, R. (1992) LEGO Proof Development System: User's manual, University of Edinburgh, United Kingdom. (Available at http://www.dcs.ed.ac.uk/home/lego/.)
78. Martin-Löf, P. (1984) Intuitionistic type theory, Bibliopolis, Napoli, Italy.
79. Matthes, R. (2000) Lambda calculus: A case for inductive definitions.
80. Mendler, N. P. (1987) Inductive Definition in Type Theory, Ph.D. thesis, Cornell University, United States.
81. Müller, F. (1992) Confluence of the lambda calculus with left-linear algebraic rewriting. Information Processing Letters 41 (6) 293-299.
82. Nederpelt, R. (1973) Strong normalization in a typed lambda calculus with lambda structured types, Ph.D. thesis, Technische Universiteit Eindhoven, The Netherlands.
83. Nipkow, T. (1991) Higher-order critical pairs. In: Proc. of the 6th IEEE Symp. on Logic in Computer Science.
84. Okada, M. (1989) Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system. In: Proc. of the 1989 Int. Symp. on Symbolic and Algebraic Computation, ACM Press.
85. Paulin-Mohring, C. (1989) Extracting Fω's programs from proofs in the Calculus of Constructions. In: Proc. of the 16th ACM Symp. on Principles of Programming Languages.
86. Peterson, G. and Stickel, M. (1981) Complete sets of reductions for some equational theories. Journal of the ACM 28 (2) 233-264.
87. Plaisted, D.A. (1978) A recursively defined ordering for proving termination of term rewriting systems. Technical report, University of Illinois, Urbana-Champaign, United States.
88. Poll, E. and Severi, P. (1994) Pure Types Systems with definitions. In: Proc. of the 3rd Int. Symp. on Logical Foundations of Computer Science. Springer-Verlag Lecture Notes in Computer Science 813.
89. Reynolds, J. (1983) Types, abstraction and parametric poymorphism. In: Proc. of the 9th IFIP World Computer Congress, North-Holland.
90. Rusinowitch, M. (1987) On termination of the direct sum of term-rewriting systems. Information Processing Letters.
91. Sellink, M. P. A. (1993) Verifying process algebra proofs in type theory. In: Proc. of the Int. Work, on Semantics of Specification Languages, Workshops in Computing.
92. Stefanova, M. (1998) Properties of Typing Systems, Ph.D. thesis, Katholiecke Universiteit Nijmegen, The Netherlands.
93. Tait, W.W. (1967) Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic 32 (2) 198-212.
94. Thiel, J.-J. (1984) Stop losing sleep over incomplete specifications. In: Proc. of the 11th ACM Symp. on Principles of Programming Languages.
95. Toyama, Y. (1987) Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters 25 (3) 141-143.
96. Van de Pol, J. (1993) Termination proofs for higher-order rewrite systems. In: Proc. of the 1st Int. Work, on Higher-Order Algebra, Logic and Term Rewriting. Springer-Verlag Lecture Notes in Computer Science 816.
97. Van de Pol, J. (1996) Termination of higher-order rewrite systems, Ph.D. thesis, Utrecht Universiteit, Nederlands.
98. van de Pol, J. and Schwichtenberg, H. (1995) Strict functionals for termination proofs. In: Proc. of the 2nd Int. Conf. on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 902.
99. van Oostrom, V. (1994) Confluence for Abstract and Higher-Order Rewriting, Ph.D. thesis, Vrije Universiteit Amsterdam, The Netherlands.
100. Walukiewicz, D. (2000) Termination of rewriting in the Calculus of Constructions (extended abstract). In: Proc. of the Workshop on Logical Frameworks and Meta-languages.
101. Walukiewicz-Chrza̧szcz, D. (2002) Termination of rewriting in the Calculus of Constructions. (To appear in Journal of Functional Programming.)
102. Werner, B. (1994) Une Théorie des Constructions Inductives, Ph.D. thesis, Université Paris VII, France.
103. Zantema, H. (1994) Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation 17 (1) 23-50.