Abstract
Our concern is incremental term rewriting: efficient normalization of a sequence of terms that are related to one another by some set of disjoint subterm replacements. Such sequences of similar terms arise frequently in practical applications of term rewriting systems. Previous approaches to this problem [9, 10], have applied only to a limited class of reduction systems and rewriting strategies. In this paper, we present a new algorithm, \({\text{IN}}{{\text{C}}_{f\mathcal{R}}}\), for carrying out incremental term rewriting in an arbitrary left-linear term rewriting system \(\mathcal{R}\) possessing a non-parallel normalizing rewriting strategy \({f_\mathcal{R}}\). This algorithm is based on a novel variant of graph rewriting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H., Van Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., and Sleep, M. Term graph rewriting. In Proc. PARLE Conference, Vol. II: Parallel Languages (Eindhoven, The Netherlands, 1987), Springer-Verlag, pp. 141–158. Lecture Notes in Computer Science 259.
Demers, A., Reps, T., and Teitelbaum, T. Incremental evaluation for attribute grammars with application to syntax-directed editors. Proc. Eighth ACM Symp. on Principles of Programming Languages (1981), 105–116.
Field, J. Incremental Reduction in the Lambda Calculus and Related Reduction Systems. PhD thesis, Department of Computer Science, Cornell University, May 1991.
Field, J. A graph reduction approach to incremental term rewriting. Tech. rep., IBM T.J. Watson Research Center, 1993. (Forthcoming).
Field, J., and Teitelbaum, T. Incremental reduction in the lambda calculus. In Proc. ACM Conference on Lisp and Functional Programming (Nice, France, June 1990), pp. 307–322.
Huet, G., and Lévy, J.-J. Computations in orthogonal rewriting systems, I. In Computational Logic, J.-L. Lassez and G. Plotkin, Eds. MIT Press, Cambridge, MA, 1991, ch. 11, pp. 395–414.
Maranget, L. Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems. In Proc. Eighteenth ACM Symp. on Principles of Programming Languages (Orlando, FL, January 1991), pp. 255–269.
Maranget, L. La Stratégie Paresseuse. PhD thesis, Université de Paris VIII, 1992. (Thèse de Doctorat, in French).
Meulen, E. v. d. Deriving incremental implementations from algebraic specifications. Report CS-R9072, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 1990. Extended abstract appeared in AMAST'91: Proceedings of the Second International Conference on Algebraic Methodology and Software Technology, Workshops in Computing, Springer-Verlag.
Meulen, E. v. d. Fine-grain incremental implementation of algebraic specifications. Report CS-R9159, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Field, J. (1993). A graph reduction approach to incremental term rewriting. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive