Polymorphic higher-order recursive path orderings

Journal of the ACM

Volumn 54, Issue 1, 2007, Pages

  Jouannaud, Jean Pierre ^a   Rubio, Albert ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Automated termination prover tool; G del's polymorphic recursor; Higher order rewriting; Termination orderings; Typed lambda calculus

Indexed keywords

DIFFERENTIATION (CALCULUS); FUNCTION EVALUATION; NUMBER THEORY; OPTIMIZATION;

AUTOMATED TERMINATION PROVER TOOLS; GODEL'S POLYMORPHIC RECURSOR; HIGHER-ORDER REWRITING; TERMINATION ORDERINGS; TYPED LAMBDA CALCULUS;

CRITICAL PATH ANALYSIS;

EID: 33947318628     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1206035.1206037     Document Type: Article

References (39)

1. BAADER, F., AND NIPKOW, T. 1998. Term Rewriting and All That. Cambridge University Press, Cambridge, MA.
2. BARENDREGT, H. 1990. Functional programming and lambda calculus. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. Elsevier Science Publishers B.V.
3. BARENDREGT, H. 1992. Typed lambda calculi. In Handbook of Logic in Computer Science, S. Abramsky, T. S. E. Maibaum, and D. M. Gabbay, Eds. Vol. 2. Oxford University Press.
4. BEZEM, M., KLOP, J., AND DE VRUER, R., EDS. 2003. Term Rewriting Systems. Number 55 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, MA.
5. BLANQUI, F. 2003. Inductive types in the calculus of algebraic constructions. In Proceedings of the 6th International Conference on Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, vol. 2701. Springer-Verlag, New York, 46-59.
6. BLANQUI, F., JOUANNAUD, J.-P., AND OKADA, M. 1999. The calculus of algebraic constructions. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 1631. Springer-Verlag, New York, 301-316.
7. BLANQUI, F., JOUANNAUD, J.-P., AND OKADA, M. 2002. Inductive data types. Theoret. Comput. Sci. 272, 1-2, 41-68.
8. BLANQUI, F., JOUANNAUD, J.-P, AND RUBIO, A. 2006. Higher-order termination: From Kruskal to computability. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, vol. 4246. Springer-Verlag, New York, 1-14.
9. BLANQUI, F., JOUANNAUD, J.-P., AND STRUB, P.-Y. 2005. The Calculus of Congruent Constructions. Draft available from the web at http://www.lix.polytechnique.fr/Labo/Jean-Pierre . Jouannaud.
10. BORRALLERAS, C., AND RUBIO, A. 2001. A monotonic, higher-order semantic path ordering. In Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, vol. 2250. Springer-Verlag, New York, 531-547.
11. BUCHHOLZ, W. 1995. Proof-theoretic analysis of termination proofs. Ann. Pure Appl. Logic 75, 1-2, 57-65.
12. COQUAND, T., AND DYBJER, P. 1994. Inductive definitions and type theory: An introduction (preliminary version). In Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 880. Springer-Verlag, New York, pp. 60-76.
13. COQUAND, T., AND PAULIN-MOHRING, C. 1990. Inductively defined types. In Proceedings of the International Conf. on Computer Logic, 1988. Lecture Notes in Computer Science, vol. 417. Springer-Verlag, New York, 50-66.
14. DERSHOWITZ, N. 1982. Orderings for term rewriting systems. Theoret. Comput. Sci. 17, 3, 279-301.
15. DERSHOWITZ, N., AND JOUANNAUD, J.-P. 1990. Rewrite systems. Vol. B. North-Holland, Amsterdam, The Netherlands, 243-309.
16. FERNÁNDEZ, M., AND JOUANNAUD, J.-P. 1995. Modular termination of term rewriting systems revisited. Lecture Notes in Computer Science, vol. 906. Springer-Verlag, New York, 255-272.
17. GALLIER, J. 1990. On girard's "candidats de reductibilité". In Logic and Computer Science. Academic Press, Orlando, FL, 123-203.
18. GIESL, J., THIEMANN, R., AND SCHNEIDER-KAMP, P. 2005. Proving and disproving termination of higher-order functions. In Proceedings of the 5th International Workshop on Frontiers of Combining Systems. Lecture Notes in Computer Science, vol. 3717. Springer-Verlag, New York, 216-231.
19. GIRARD, J.-Y, LAFONT, Y., AND TAYLOR, P. 1989. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.
20. GOUBAULT-LARRECQ, J. 2001. Well founded recursive relations. In Proceedings of the 15th International Workshop on Computer Science Logic. Lecture Notes in Computer Science, vol. 2142. Springer-Verlag, New York, 484-497.
21. JONES, N., AND BOHR, N. 2004. Termination analysis of the untyped lambda-calculus. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 3091. Springer-Verlag, New York, 1-23.
22. JOUANNAUD, J.-P. 2005a. Extension orderings revisited. Available from the web at http://www.lix.polytechnique.fr/Labo/Jean-Pierre.Jouannaud.
23. JOUANNAUD, J.-P. 2005b. Higher-order rewriting: framework, confluence and termination. In Processes, Terms and Cycles: Steps on the Road to Infinity. Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday. Springer-Verlag, New York.
24. JOUANNAUD, J.-P., AND OKADA, M. 1991. A computation model for executable higher-order algebraic specifications languages. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 350-361.
25. JOUANNAUD, J.-P., AND RUBIO, A. 1998. Rewrite orderings for higher-order terms in η-long β-normal form and the recursive path ordering. Theoret. Comput. Sci. 208, 1-2, 3-31.
26. JOUANNAUD, J.-P, AND RUBIO, A. 1999. The higher-order recursive path ordering. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 402-411.
27. JOUANNAUD, J.-P, AND RUBIO, A. 2006. Higher-order orderings for normal rewriting. In Proceedings of the 17th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 4098. Springer-Verlag, New York, 387-399.
28. JOUANNAUD, J.-P., VAN RAAMSDONK, F., AND RUBIO, A. 2005. Higher-order rewriting with types and arities. Available from the web at http://www.lix.polytechnique.fr/Labo/Jean- Pierre. Jouannaud.
29. KAMIN, S., AND LEVY, J.-J. 1980. Two generalizations of the recursive path ordering. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign.
30. KENNAWAY, J., KLOP, J. W., SLEEP, R., AND DE VRIES, F. 1996. Comparing curried and uncurried rewriting. J. Symb. Comput. 21, 15-39.
31. KLOP, J. 1980. Combinatory Reduction Systems. Number 127 in Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam.
32. KLOP, J. W. 1992. Term rewriting systems. In Handbook of Logic in Computer Science, S. Abramsky, T. S. E. Maibaum, and M. S. Gabbay, Eds. Vol. 2. Oxford University Press.
33. LORÍA-SÁENZ, C., AND STEINBACH, J. 1992. Termination of combined (rewrite and λ-calculus) systems. In Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems. Lecture Notes in Computer Science, vol. 656. Springer-Verlag, New York, 143-147.
34. MAL'CEV, A. 1961. On the elementary theories of locally free universal algebras. Soviet Math. Dokl. 2, 3, 768-771.
35. MAYR, R., AND NIPKOW, T. 1998. Higher-order rewrite systems and their confluence. Theoret. Comput. Sci. 192, 1, 3-29.
36. PAULSON, L. C. 1990. Isabelle: The next 700 theorem provers. In Logic and Computer Science. Academic Press, Orlando, FL, 361-386.
37. TAIT, W. W. 1967. International interpretations of functionals of finite type I. J. Symb. Logic 32, 2, 198-212.
38. VAN DE POL, J., AND SCHWICHTENBERG, H. 1995. Strict functional for termination proofs. In Proceedings of the 2nd International Conference on Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, vol. 902. Springer-Verlag, New York, 350-364.
39. WALUKIEWICZ-CHRZASZCZ, D. 2003. Termination of rewriting in the calculus of constructions. J. Funct. Prog. 13, 2, 339-414.