Rewrite strategies in the rewriting calculus

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 4, 2003, Pages 593-624

  Cirstea, Horatiu ^a,b   Kirchner, Claude ^b   Liquori, Luigi ^b,c   Wack, Benjamin ^b,d  

^a UNIVERSITÉ DE LORRAINE   (France)

^b LORI a and INRIa ^*  (France)

^c INRIA   (France)

^d LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATION THEORY; COMPUTER PROGRAMMING; GRAPH THEORY; THEOREM PROVING;

ELAN LANGUAGE; EQUATIONAL LOGIC; REWRITING CALCULUS;

COMPUTER SCIENCE;

EID: 16644367666     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82613-1     Document Type: Conference Paper

References (25)

1. Baader F., Nipkow T. Term Rewriting and all That. 1998;Cambridge University Press
2. Barendregt H. The lambda;-calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics. Second edition :1984;Elsevier Science Publishers B. V., (North-Holland), Amsterdam
3. Borovanský P. Le contrôle de la réécriture: étude et implantation d'un formalisme de stratégies. Thèse de Doctorat d'Université October 1998;Université Henri Poincaré - Nancy 1, France. also TR LORIA 98-T-326.
4. Borovansky P., Kirchner C., Kirchner H., Moreau P.-E. ELAN from a rewriting logic point of view. Theoretical Computer Science. (285):July 2002;155-185
5. Borovanský P., Kirchner C., Kirchner H., Moreau P.-E., Ringeissen C. An overview of ELAN. Kirchner C., Kirchner H. Proceedings of the second International Workshop on Rewriting Logic and Applications. 15:September 1998;Pont-á-Mousson, France. Electronic Notes in Theoretical Computer Science, http://www.elsevier.nl/locate/entcs/volumel6.html
6. Cirstea H. Calcul de réécriture: fondements et applications. Thése de Doctorat d'Université 2000;Université Henri Poincaré - Nancy I
7. Cirstea H., Kirchner C. Combining higher-order and first-order computation using p-calculus: Towards a semantics of ELAN. Gabbay D., de Rijke M. Frontiers of Combining Systems 2, Research Studies, ISBN 0863802524. 1999;95-120 Wiley
8. Cirstea H., Kirchner C. The rewriting calculus - Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics. 9:(3):May 2001;427-498
9. Cirstea H., Kirchner C., Liquori L. Matching Power. Middeldorp. Rewriting Techniques and Applications, volume 2051 of Lecture Notes in Computer Science Utrecht. May 2001;Springer-Verlag, The Netherlands
10. Cirstea H., Kirchner C., Liquori L. Rewriting Calculus with(out) Types. Workshop on Rewriting Logic and its Applications - WRLA '2002, Pisa, Italy. September 2002;ENTCS
11. Cirstea H., Liquori L., Wack B. Rewriting calculus with fixpoints: Untyped and first-order systems. Submitted. 2003
12. Dershowitz N., Jouannaud J.-P. Rewrite Systems. van Leeuwen. Handbook of Theoretical Computer Science, chapter 6. 1990;244-320 Elsevier Science Publishers B. V. (North-Holland)
13. G. Dowek, T. Hardin, C. Kirchner. Higher-order unification via explicit substitutions, extended abstract. Kozen, Proceedings of LICS'95, pages 366-374, San Diego, June 1995.
14. Fages F., Huet G. Unification and matching in equational theories. Proceedings Fifth Colloquium on Automata, Algebra and Programming, L'Aquila (Italy), volume 159 of Lecture Notes in Computer Science. 1983;205-220 Springer-Verlag
15. Faure G., Kirchner C. Exceptions in the rewriting calculus. Tison. Proceedings of the RTA conference, volume 2368 of Lecture Notes in Computer Science. July 2002;66-82 Springer-Verlag
16. Huet G. Résolution d'equations dans les langages d'ordre 1,2,...,ω Thèse de Doctorat d'Etat. 1976;Université de Paris 7, France
17. Jouannaud J.-P., Kirchner C. Solving equations in abstract algebras: a rule-based survey of unification. Lassez J.-L., Plotkin G. Computational Logic. Essays in honor of Alan Robinson, chapter 8. 1991;257-321 The MIT press, Cambridge (MA, USA)
18. Kahn. Natural Semantics G. Proc. of STACS, volume 247 of LNCS. 1987;22-39 Springer-Verlag
19. C. Kirchner, H. Kirchner. Rewriting, solving, proving. A preliminary version of a book available at www.loria.fr/~ckirchne/rsp.ps.gz, 1999.
20. Kirchner C., Kirchner H., Vittek M. Designing constraint logic programming languages using computational systems. Van Hentenryck, Saraswat V. Principles and Practice of Constraint Programming. The Newport Papers., chapter 8. 1995;131-158 The MIT press
21. Liquori L. Semantica e Pragmatica di un Linguaggio Funzionale con le Continuazioni Esplicite. Laurea in Science dell'Informazione. 1990;University of Udine. In Italian, 74
22. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. 96:(1):1992;73-155
23. Turing A.M. The ρ-functions in λ-K-conversion. The Journal of Symbolic Logic. 2:1937;164
24. Visser E., el Abidine Benaissa Z. A core language for rewriting. Kirchner H. Proceedings of the second International Workshop on Rewriting Logic and Applications. 15:September 1998;Pont-à-Mousson, France. http://www.elsevier.nl/locate/entcs/volumel6.html. Electronic Notes in Theoretical Computer Science.
25. Vittek M. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. Thèse de Doctorat d'Université October 1994;Université Henri Poincaré - Nancy 1