Abstract
Orthogonal term rewriting systems (OTRSs) provide a well-known description of functional languages and their implementation. This paper describes some ways of transforming such systems into systems having simpler left-hand sides, the goal being to transform them into “flat” OTRSs, which have a particularly simple form. A class of systems, the transformable OTRSs, is defined which allow such a transformation. This class lies between the strongly sequential constructor systems and the strongly sequential systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky, D. Gabbay, and T. Maibaum, editors. Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992.
Z. Ariola, J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Syntactic definitions of undefined: On defining the undefined. In Theoretical Aspect of Computer Software, Springer-Verlag, Lecture Notes in Computer Science 789, pages 543–554, 1994.
H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, second edition, 1984.
S. Byun. The Simulation of Term Rewriting Systems by the Lambda Calculus. PhD thesis, Univeristy of East Anglia, 1994.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In van Leeuwen [vL90], chapter 15.
G. Huet and J.-J. Lévy. Call-by-need computations in non-ambiguous systems. Technical Report 359, INRIA, 1979.
G. Huet and J.-J. Lévy. Computations in orthogonal rewrite systems I and II. In Lassez and Plotkin [LP91], pages 394–443. (Originally appeared as [HL79].).
J.R. Kennaway. Implementing term rewriting languages in Dactl. Theoretical Computer Science, 72:225–249, 1990.
J.W. Klop. Combinatory Reduction Systems, Volume 127 of Mathematical Centre Tracts. CWI, Amsterdam, 1980. PhD Thesis.
J.W. Klop. Term rewriting systems. In Abramsky et al. [AGM92], pages 1–116.
J.W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewriting systems. Journal of Symbolic Computation, 12:161–195, 1991.
J.-L. Lassez and G.D. Plotkin, editors. Computational Logic: Essay in Honor of Alan Robinson. MIT Press, 1991.
L. Maranget. Two techniques for compiling lazy pattern matching. Technical Report 2385, INRIA, 1994.
M.R. Sleep, M.J. Plasmeijer, and M.C.J.D. van Eekelen, editors. Term Graph Rewriting Theory and Practice. John Wiley & Sons, 1993.
Y. Toyama, S. Smetsers, M.C.J.D. van Eekelen, and M. J. Plasmeijer. The functional strategy and transitive term rewriting systems. In Sleep et al. [SPvE93], pages 61–75.
J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Method and Semantics. North-Holland, Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Byun, S., Kennaway, R., Sleep, R. (1995). Transformation of orthogonal term rewriting systems. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_36
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive