Expression reduction systems with patterns

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

Volumn 2706, Issue , 2003, Pages 107-122

  Forest, Julien ^a   Kesner, Delia ^b  

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

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HIGHER-ORDER REWRITING; REDUCTION SYSTEMS; REWRITING RULES;

ABSTRACTING;

EID: 84947708846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_9     Document Type: Conference Paper

References (22)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984. Revised Edition.
3. F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive-Data-Type Systems. Theoretical Computer Science, 277, 2001.
4. E. Bonelli, D. Kesner, and A. Rìos. A de Bruijn notation for higher-order rewriting. In 11th RTA, LNCS 1833. 2000.
5. S. Cerrito and D. Kesner.: Pattern matching as cut elimination. Theoretical Computer Science. To appear.
6. S. Cerrito and D. Kesner. Pattern matching as cut elimination. In 14th LICS. IEEE. 1999.
7. H. Cirstea. Calcul de rèècriture: fondements et applications. Thèse de doctorat, Universitè Henri Poincarè - Nancy 1, 2000.
8. H. Cirstea and C. Kirchner. ρ-calculus, the rewriting calculus. In 5th CCL, 1998.
9. J. Forest. A weak calculus with explicit operators for pattern matching and substitution. In 13th RTA, LNCS 2378. 2002.
10. J. Forest and D. Kesner. Expression Reduction Systems with Patterns, 2003. Available on http://www.pps.jussieu.fr/~kesner/papers/.
11. J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In 14th LICS. IEEE. 1999.
12. D. Kesner, L. Puel, and V. Tannen. A Typed Pattern Calculus. Information and Computation, 124(1), 1996.
13. Z. Khasidashvili. Expression reduction systems. In Proceedings of IN Vekua Institute of Applied Mathematics, volume 36, Tbilisi, 1990.
14. C. Kirchner, H. Cirstea and L. Liquori. The Rho Cube. In FOSSACS’01, LNCS 2030. 2001.
15. J.-W. Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. CWI, Amsterdam, 1980. PhD Thesis.
16. J.-W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science 121, 1993.
17. T. Nipkow. Higher-order critical pairs. In 6th LICS. IEEE. 1991.
18. The Objective Caml language, http://caml.inria.fr/.
19. M. Takahashi. Parallel Reductions in lambda-Calculus. Journal of Symbolic Computation, 7(2), 1989.
20. V. van Oostrom and F. van Raamsdonk. Weak orthogonality implies confluence: the higher-order case. In 3rd LFCS, LNCS 813. 1994.
21. F. van Raamsdonk. On termination of higher-order rewriting. In 12th RTA, LNCS 2051. 2001.
22. D. Wolfram. The Clausal Theory of Types, volume 21of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1993.