A compiler for nondeterministic term rewriting systems

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

Volumn 1103, Issue , 1996, Pages 154-168

  Vittek, Marian ^a,b  

^a INRIA   (France)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; SPECIFICATION LANGUAGES;

COMPILATION METHODS; IMPERATIVE LANGUAGES; REWRITING LOGIC; TERM REWRITING SYSTEMS;

PROGRAM COMPILERS;

EID: 84957618420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_50     Document Type: Conference Paper

References (14)

1. [AM87] A. W. Appel and D. B. MacQueen. A Standard ML Compiler. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, volume 274 of Lecture Notes in Computer Science, pages 301-324, Portland, Oregon, USA, September 14-16, 1987. Springer-Verlag.
2. [Aug85] L. Augustsson. Compiling pattern matching. In Proceedings 2nd Conference on Functional Programming Languages and Computer Architecture, Nancy (France), volume 201 of Lecture Notes in Computer Science, Nancy (France), 1985. Springer-Verlag.
3. +94] K. Didrich, A. Fett, C. Gerke, W. Grieskamp, and P. Pepper. OPAL: Design and implementation of an algebraic programming language. In J. Gutknecht, editor, Programming Languages and System Architectures PLSA '94, volume 782 of Lecture Notes in Computer Science, pages 228- 244. Springer-Verlag, March 1994.
4. [Frü95] T. Frühwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, March 1995.
5. [H082] C. M. Hoffmann and M. J. O'Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68-95, 1982.
6. [JK91] J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257-321. The MIT press, Cambridge (MA, USA), 1991.
7. [Kap87] S. Kaplan. A compiler for conditioned term rewriting system. In P. Lescanne, editor, Proceedings 2nd Conference on Rewriting Techniques and Applications, Bordeaux (France), volume 256 of Lecture Notes in Computer Science, pages 25-41, Bordeaux (France), May 1987. Springer-Verlag.
8. [KKV95] C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Vein Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., pages 131-158. The MIT press, 1995.
9. [KL91] E. Kounalis and D. Lugiez. Compilation of pattern matching with associative commutative functions. In 16th Colloquium on Trees in Algebra and Programming, volume 493 of Lecture Notes in Computer Science, pages 57-73. Springer-Verlag, 1991.
10. [MOM93] N. Martì-Oliet and J. Meseguer. Rewriting logic as a logical and semantical framework. Technical report, SRI International, May 1993.
11. +93] M. Meier, J. Schimpf, et al. ECLiPSe User Manual. Technical report ECRC-93-6, ECRC, Munich (Germany), 1993.
12. [Vit90] M. Vittek. An efficient many-to-one unification algorithm for linear terms. (in Slovak language). In Proceedings of the First Czechoslovak Logic Programming Conference, 1990.
13. [Vit94] M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de pro- grammation avec contraintes. These de Doctorat d'Université, Université Henri Poincaré - Nancy 1, October 1994.
14. [War83] D. H. D. Warren. An Abstract PROLOG Instruction Set. Technical Report 309, Artificial Intelligence Center, Computer Science and Technology Division, SRI International, Menlo Park, CA, October 1983.