Termination of rewriting in the calculus of constructions

Journal of Functional Programming

Volumn 13, Issue 2, 2003, Pages 339-414

  Walukiewicz Chrzaszcz, Daria ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

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

Author keywords

[No Author keywords available]

Indexed keywords

NORMALIZATION;

ALGEBRA; COMPUTATIONAL METHODS; PROBLEM SOLVING; SEMANTICS;

RECURSIVE FUNCTIONS;

EID: 0037350925     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004641     Document Type: Article

References (31)

1. Avenhaus, J. and Loria-Sáenz, C. (1995) A Reduction Ordering for Higher-order Terms. Technical report SR-95-03, University of Kaiserslautern.
2. Barbanera, F., Fernández, M. and Geuvers, H. (1994) Modularity of strong normalization and confluence in the λ-algebraic-cube. Proc. 9th IEEE Symp. Logic in Computer Science, pp. 406-415. Paris, France.
3. Barbanera, F., Fernández, M. and Geuvers, H. (1997) Modularity of strong normalization in the algebraic-λ-cube. J. Functional Programming, 7(6), 613-660.
4. Barendregt, K. (1990) Functional programming and lambda calculus. In: van Leeuwen, J., editor, Handbook of Theoretical Computer Science, vol. B, pp. 321-364. North-Holland.
5. Barendregt, H. (1993) Typed lambda calculi. In: Abramsky et al., editors, Handbook of Logic in Computer Science. Oxford University Press.
6. Barras, B., Boutin, S., Cornes, C., Courant, J., Coscoy, Y., Delahaye, D., de Rauglaudre, D., Filliâtre, J. C., Giménez, E., Herbelin, H., Huet, G., Laulhère, H., Loiseleur, P., Muñoz, C., Murthy, C., Parent, C., Paulin, C., Saïbi, A. and Werner, B. (1999) The Coq Proof Assistant Reference Manual - Version V6.3.
7. Blanqui, F., Jouannaud, J.-P. and Okada, M. (1999) The calculus of algebraic constructions. In: Narendran, P. and Rusinowitch, M., editors, 10th Intl. Conf. on Rewriting Techniques and Applications: Lecture Notes in Computer Science 1631. Springer-Verlag.
8. Blanqui, F. (2001) Definitions by rewriting in the calculus of constructions. Proc. 16th IEEE Symp. Logic in Computer Science. Boston, MA.
9. Breazu-Tannen, V. and Gallier, J. (1991) Polymorphic rewriting conserves algebraic strong normalization. Theor. Comput. Sci. 83(1), 3-28.
10. Coquand, T. and Gallier, J. (1990) A proof of strong normalization for the theory of constructions using a Kripke-like interpretation. In: Huet, G. and Plotkin, G., editors, Preliminary Proceedings 1st Int. Workshop on Logical Frameworks, pp. 479-497. Antibes, France.
11. Coquand, T. and Huet, G. (1988) The calculus of constructions. Infor. & Computation, 76(2/3), 95-120.
12. Coquand, T. and Paulin-Mohring, C. (1990) Inductively denned types. In: Martin-Löf, P. and Mints, G., editors, Proceedings of Colog'88: Lecture Notes in Computer Science 417. Springer-Verlag.
13. Dershowitz, N. (1982) Orderings for term rewriting systems. Theor. Comput. Sci. 17(3), 279-301.
14. Dershowitz, N. and Jouannaud, J.-P. (1990) Rewrite systems. In: van Leeuwen, J., editor, Handbook of Theoretical Computer Science, vol. B, pp. 243-309. North-Holland.
15. Dowek, G., Hardin, T. and Kirchner, C. (1998) Theorem Proving Modulo. Rapport de recherche INRIA 3400.
16. Dowek, G. and Werner, B. (1999) Proof normalization modulo. In: Altenkirch, T., Naraschewski, W. and Rues, B., editors, Types for Proofs and Programs 98: Lecture Notes in Computer Science 1657, pp. 62-77. Springer-Verlag.
17. 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 téorie des types. In: Fenstad, J. E., editor, Proceedings 2nd Scandinavian Logic Symposium, pp. 63-92. North-Holland.
18. Jouannaud, J.-P. and Okada, M. (1991) Executable higher-order algebraic specification languages. Proc. 6th IEEE Symp. Logic in Computer Science, pp. 350-361. Amsterdam, The Netherlands.
19. Jouannaud, J.-P. and Okada, M. (1997) Abstract data type systems. Theor. Comput. Sci. 173(2), 349-391.
20. Jouannaud, J.-P. and Rubio, A. (1998) Rewrite orderings for higher-order terms in η-long β-normal form and the recursive path ordering. Theor. Comput. Sci. 208(1-2), 3-31.
21. Jouannaud, J.-P. and Rubio, A. (1999) The higher-order recursive path ordering. In: Longo, G., editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science. Trento, Italy. IEEE Press.
22. Jouannaud, J.-P. and Rubio, A. (2001) Higher-order recursive path orderings "à la carte". First Japanese Conference on Logic and Computation, Sendai.
23. Klop, J. W. (1980) Combinatory reduction systems. Mathematical Centre Tracts 127, Mathematisch Centrum, Amsterdam.
24. Klop, J. W., van Oostrom, V. and van Raamsdonk, F. (1993) Combinatory Reduction Systems: introduction and survey. Theor. Comput. Sci. 121(1-2), 279-308.
25. Loría-Sáenz, C. and Steinbach, J. (1992) Termination of combined (rewrite and λ-calculus) systems. In: Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems: Lecture Notes in Computer Science 656, pp. 143-147. Springer-Verlag.
26. Lysne, O. and Piris, J. (1995) A termination ordering for higher order rewrite systems. In: Hsiang, J., editor, 6th Intl. Conf. on Rewriting Techniques and Applications: Lecture Notes in Computer Science 914, pp. 26-40. Springer-Verlag.
27. Nipkow, T. (1991) Higher order critical pairs. In: Kahn, G., editor, Proc. 6th IEEE Symp. on Logic in Comp. Science, pp. 342-349. Amsterdam, The Netherlands.
28. Paulin-Mohring, C. (1993) Inductive definitions in the system COQ. Typed Lambda Calculi and Applications: Lecture Notes in Computer Science 664, pp. 328-345. Springer-Verlag.
29. Stefanova, M. (1999) Properties of Typing Systems. PhD thesis, University of Nijmegen.
30. van de Pol, J. and Schwichtenberg, H. (1995) Strict functionals for termination proofs. Typed Lambda Calculi and Applications: Lecture Notes in Computer Science 902, pp. 350-364. Springer-Verlag.
31. Werner, B. (1994) Méta-théorie du calcul des constructions inductives. Thèse de doctorat, Universitè Paris VII.