Higher-order orderings for normal rewriting

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

Volumn 4098 LNCS, Issue , 2006, Pages 387-399

  Jouannaud, Jean Pierre ^a   Rubio, Albert ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; DATA STRUCTURES; DATABASE SYSTEMS; PATTERN MATCHING;

NORMAL REWRITING; TERMINATION PROOF;

COMPUTER PROGRAM LISTINGS;

EID: 33749378346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_29     Document Type: Conference Paper

References (22)

1. F. Blanqui, J.-P. Jouannaud, and M. Okada. The Calculus of Algebraic Constructions. In Narendran and Rusinowitch, Proc. RTA'99, 1999.
2. F. Blanqui. Termination and Confluence of Higher-Order Rewriting Systems. In Proc. RTA'00, 2000.
3. F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive Data Type Systems. Theoretical Computer Science, 272(1-2):41-68. 2002.
4. H. Barendregt. Functional Programming and Lambda Calculus. In [22], pages 321-364.
5. H. Barendregt. Handbook of Logic in Computer Science, chapter Typed lambda calculi. Oxford Univ. Press, 1993. eds. Abramsky et al.
6. J. van de Pol. Termination of Higher-Order Rewrite Systems. PhD thesis, Department of Philosophy, Utrecht University, 1996.
7. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279-301, March 1982.
8. J. van de Pol and H. Schwichtenberg. Strict functional for termination proofs. In Typed Lambda Calculi and Applications, Edinburgh. Springer-Verlag, 1995.
9. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In [22], pages 321-364.
10. J.-P. Jouannaud. Higher-Order rewriting: Framework, Confluence and termination. In A. Middeldorp, V. van Oostrom, F. van Raamsdonk and R. de Vrijer eds., Processes, Terms and Cycles: Steps on the road to infinity. Essays Dedicated to Jan Willem Klop on the occasion of his 60th Birthday. LNCS 3838. Springer Verlag, 2005.
11. J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In Giuseppe Longo, editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Comp. Soc. Press.
12. J.-P. Jouannaud and A. Rubio. Polymorphic Higher-Order Recursive Path Orderings. 2005. Submitted to JACM. http://www.lix.polytechnique.fr/Labo/Jean- Pierre.Jouannaud.
13. J.-P. Jouannaud and A. Rubio. Higher-Order Orderings for Normal Rewriting. 2005. Full version. http://www.lix.polytechnique.fr/Labo/Jean-Pierre. Jouannaud.
14. J.-P. Jouannaud and A. Rubio. Higher-Order Recursive Path Orderings à la carte. 2001. http://www.lix.polytechnique.fr/Labo/Jean-Pierre. Jouannaiid.
15. J.-P. Jouannaud, F. van Raamsdonk and A. Rubio Higher-order rewriting with types and arities. 2005. http://www.lix.polytechnique.fr/Labo/Jean-Pierre. Jouannaud.
16. J. W. Klop. Combinatory Reduction Relations. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam, 1980.
17. J. W. Klop. Term Rewriting Systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum eds., Handbook of Logic in Computer Science, vol. 2:2-116. Oxford University Press, 1992.
18. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192(1):3-29, February 1998.
19. D. Miller. A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. In Journal and Logic and Computation 1(4):497-536, 1991.
20. T. Nipkow. Higher-order critical pairs. In 6th IEEE Symp. on Logic in Computer Science, pages 342-349. IEEE Computer Society Press, 1991.
21. L. C. Paulson. Isabelle: the next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science. Academic Press, 1990.
22. J. van Leeuwen, ed. Handbook of Theoretical Computer Science, vol. B. North-Holland, 1990.