Abstract
We provide some new results concerning the use of transfinite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly infinite constructor terms by transfinite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transfinite rewrite sequences into shorter (possibly finite) ones. We also investigate the role that (finitary) con uence plays in transfinite rewriting. We consider different (quite standard) rewriting semantics (mappings from input terms to sets of reducts obtained by (transfinite-rewriting) in a unified framework and investigate their algebraic structure. Such a framework is used to formulate, connect, and approximate different properties of TRSs.
This work has been partially supported by CICYT TIC 98-0445-C03-01.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Alpuente, S. Escobar, and S. Lucas. Redundancy Analyses in Term Rewriting. In Proc of WFLP’2000, pages 309–323, 2000.
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, pages 169–236, Cambridge University Press, Cambridge, 1985.
B. Courcelle. Fundamental Properties of Infinite Trees. Theoretical Computer Science 25:95–169, 1983.
B. Courcelle. Recursive Applicative Program Schemes. In Handbook of Theoretical Computer Science, pages 459–492, Elsevier, 1990.
N. Dershowitz, S. Kaplan, and D. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite. Theoretical Computer Science 83:71–96, 1991.
I. Durand and A. Middeldorp. Decidable Call by Need Computations in Term Rewriting (Extended Abstract). In Proc. of CADE’97, LNAI 1249:4–18, 1997.
M. Hanus and S. Lucas. An Evaluation Semantics for Narrowing-Based Functional Logic Languages. Journal of Functional and Logic Programming, to appear, 2001.
G. Huet and J.J. Lévy. Computations in orthogonal term rewriting systems. In Computational logic: essays in honour of J. Alan Robinson, pages 395–414 and 415–443. The MIT Press, Cambridge, MA, 1991.
F. Jacquemard. Decidable approximations to Term Rewriting Systems. In Proc. of RTA’96, LNCS 1103:362–376, 1996.
R. Kennaway, J.W. Klop, M.R. Sleep, and F.-J. de Vries. Transfinite reductions in Orthogonal Term Rewriting Systems. Information and Computation 119(1):18–38, 1995.
S. Lucas. Observable Semantics and Dynamic Analysis of Computational Processes. Technical Report LIX/RR/00/02, École Polytechnique, Palaiseau, France, 2000.
A. Middeldorp. Call by Need Computations to Root-Stable Form. In Proc. of POPL’97, pages 94–105, ACM Press, 1997.
A. Pitts. Operationally-Based Theories of Program Equivalence. In Semantics and Logics of Computation, pages 241–298, Cambridge University Press, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucas, S. (2001). Transfinite Rewriting Semantics for Term Rewriting Systems. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-45127-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42117-7
Online ISBN: 978-3-540-45127-3
eBook Packages: Springer Book Archive