Abstract
We discuss some aspects of term graph rewriting based on systems of recursion equations. This is done for first-order signatures as well as lambda calculus. Also relations with infinitary rewriting are discussed.
This work was partially supported by ESPRIT Working Group 6345 Semagraph, and by ESPRIT BRA 6454 CONFER.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 4(1): 375–416, 1991.
Z.M. Ariola and J.W. Klop. Cyclic lambda graph rewriting. In Proc. Ninth Symposium on Logic in Computer Science (LICS '94), Paris, France, pages 416–425, 1994.
Z.M. Ariola and J.W. Klop. Equational Term Graph Rewriting. To appear in Fundamenta Informaticae, 1996.
Z.M. Ariola and J.W. Klop. Lambda calculus with explicit recursion. To appear as Report CS-R96xx, CWI Amsterdam, 1996.
E. Barendsen. Types and Computations in Lambda Calculi and Graph Rewrite Systems. PhD thesis, University of Nijmegen, 1995.
S.C.C. Blom. A Complete Proof System for Nested Term Graphs. In this proceedings.
E. Barendsen and J.E.W. Smetsers. Conventional and uniqueness typing in graph rewrite systems. Technical Report CSI-R9328, Computing Science Institute, University of Nijmegen, 1993.
B. Courcelle, G. Kahn and J. Vuillemin. Algorithmes d'équivalence et de réduction à des expressions minimales dans une classe d'équations récursives simples. In J. Loeckx, editor, Proc. 2nd Colloquium on Automata, Languages and Programming (ICALP '74), University of Saarbrucken, Springer-Verlag LNCS 14, pages 200–213, 1974.
J.R. Kennaway, J.W. Klop, M.R. Sleep and F.J. de Vries. The adequacy of term graph rewriting for simulating term rewriting. Transactions on Programming Languages and Systems, 16(3): 493–523, 1994.
J.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.
J.R. Kennaway, J.W. Klop, M.R. Sleep and F.J. de Vries. Infinitary lambda calculus. To appear in Theoretical Computer Science, 1996.
K.H. Rose. Explicit cyclic substitutions. In M. Rusinowitch and J.L. Rémy, editors, Proc. 3rd International Workshop on Conditional Term Rewriting Systems (CTRS '92), Pont-à -Mousson, France, Springer-Verlag LNCS 656, pages 36–50, 1992.
J.E.W. Smetsers. Graph Rewriting and Functional Languages. PhD thesis, University of Nijmegen, 1993.
M.R. Sleep, M.J. Plasmeijer and M.C.D.J. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley & Sons, 1993.
T. Schmidt and T. Ströhlein. Relations and Graphs. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.
C. Wadsworth. Semantics and Pragmatics of the Lambda-Calculus. PhD thesis, University of Oxford, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klop, J.W. (1996). Term graph rewriting. In: Dowek, G., Heering, J., Meinke, K., Möller, B. (eds) Higher-Order Algebra, Logic, and Term Rewriting. HOA 1995. Lecture Notes in Computer Science, vol 1074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61254-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-61254-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61254-4
Online ISBN: 978-3-540-68389-6
eBook Packages: Springer Book Archive