Abstract
In this paper, we present a compiler for conditional term rewriting systems. With respect to traditional interpreters, the gain in execution time that we obtain is of several orders of magnitude. We discuss several optimizations, among which a method to share code in the premises of the conditional rules, well-adapted to algebraic specifications.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R.Erickson, D.Thompson (eds.), AFFIRM Reference Manual, USC-ISI, Marina Del Rey (California), 1981.
M.Bidoit, F.Capy, C.Choppy, N.Choquet, C.Gresse, S.Kaplan, F.Schlienger, F.Voisin, ASSPRO: un environement de programmation interactif et intégré, to appear in T.S.I., 1986.
J.Aho, D.Ullmann, Principles of Compiler Design, Addison Wesley Publishing Co., 1977.
L. Augustsson, Compiling Pattern Matching, Proc. of the Conf. on Functional Programming Languages and Computer Architectures, LNCS 201 (1985).
J.Bergstra, J.Tucker, Algebraic Specifications of Computable and Semi-Computable Data Types, Report CS-R8619, CWI, Amsterdam (1986).
M.Bidoit, C.Choppy, Asspegique: an Integrated Environment for Algebraic Specifications, Proc. of the TAPSOFT'85 Conf., LNCS 186 (1985).
R.Burstall, D.MacQueen, D.Sanella, HOPE: an Experimental Applicative Language, Conf. Record of the 1980 Lisp Conf., 1980.
J. Cohen, describing Prolog by its Interpretation and its Compilation, CACM 28, 12, September 1985.
D.Coleman, R.Gallimore, V.Stavridiou, F.Ali, the Design of a Rewrite Rule Interpreter for UMIST OBJ, UMIST Internal Report (Manchester), 1985.
J.Darlington, the Unification of Logic and Functional Languages, in Logic Programming: Relations, Functions and Equations, DeGroot and Lindstrom Eds., Prentice Hall, 1986.
K.Futatsugi, J.Goguen, J.-P.Jouannaud, J.Meseguer, Principles of OBJ2, Proc. of the 12th ACM POPL Conf., New-Orleans, 1985.
R.Gallimore, D.Coleman, F.Ali, V.Stavridiou, UMIST OBJ: A Language for Executable Specifications, UMIST Internal Report (Manchester), 1985.
M.-C.Gaudel, S.Kaplan, How to Build Meaningful Algebraic Specifications, Esprit Meteor Project Report, University of Paris-South, 1986.
M.Hecht, Flow Analysis of Computer Programs, North-Holland Publishing Company, 1977.
G.Huet, D.C.Oppen, Equations and Rewrite Rules: a Survey, in Formal Languages: Perspective and Open Problems, R. Book Ed., Academic Press, 1980.
A.Houri, E.Shapiro, A Sequential Abstract Machine for Flat Concurrent Prolog, Technical Report CS86-20, Weizmann Institute (Israel), 1986.
G.Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, Proc. of the 18th FOCS Symposium, 1977.
A.Josephson, N.Dershowitz, Efficient Implementations of Narrowing: the RITE Way, Internal Report, University of Illinois, 1986.
N.Jones, Flow Analysis of Lazy Higher-Order Functional Programs, Internal Report, University of Copenhagen, 1986.
S.Kaplan, Conditional Rewrite Rules, in Theoretical Computer Science 33, 1984.
S.Kaplan, Simplifying Conditional Term Rewriting Systems, Internal Report, Weizmann Institute (Israel), 1986.
A.Mycroft, N.Jones, A Relational Approach to Program Flow Analysis, in Programs as Data Objects, LNCS 217, 1985.
M.Stickel, A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler, Proc. of the 8th CAD Conference, LNCS 230, 1986.
J.-L.Rémy, H.Zhang, Contextual Rewriting, Proc. of the 1st Conf. on Rewriting Techniques and Applications, LNCS 202, 1985.
D.Warren, Logic Programming and Computer Writing, in Software Practice and Experience 10, 1980.
D.Warren, An Abstract Prolog Instruction Set, A.I. Technical Report 309, SRI INternational, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaplan, S. (1987). A compiler for conditional term rewriting systems. In: Lescanne, P. (eds) Rewriting Techniques and Applications. RTA 1987. Lecture Notes in Computer Science, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17220-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-17220-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17220-8
Online ISBN: 978-3-540-47421-0
eBook Packages: Springer Book Archive