Abstract
Nested Term Graphs are syntactic representations of cyclic term graphs. Via a simple translation they contain μ-terms as a subset. There exists a characterization of the μ-terms that unwind to the same tree, presented as a complete proof system. This paper gives a similar characterization for Nested Term Graphs. The semantics of tree unwinding is presented via bisimulations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Z. M. Ariola and J. W. Klop. Equational Term Graph Rewriting. To appear in Fundamenta Informaticae. Extended version: CWI Report CS-R9552, 1995.
Z.M. Ariola and J.W. Klop. Cyclic Lambda Graph Rewriting. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 416–425, Paris, France, July 1994. IEEE Computer Society Press.
H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984.
H.P. Barendregt, M.J.C.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term Graph Reduction. In Proc. Conference on Parallel ARchitecture and Languages Europe (PARLE), pages 141–158, Eindhoven, The Netherlands, 1987. Springer-Verlag LNCS 259.
E. Barendsen. Types and Computations in Lambda Calculi and Graph Rewrite Systems. PhD thesis, University of Nijmegen, 1995.
S.L. Bloom and Z. Esik. Iteration Theories. EATCS Monograph. Springer, 1993.
C.C. Elgot. Monadic Computation and Iterative Algebraic Theories. In H. E. Rose and J. C. Shepherdson, editors, Logic Colloquium '73 (Bristol, England), number 80 in Studies in Logic and the Foundations of Mathematics, pages 175–230. North Holland, 1975.
J. W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 1–116. Oxford University Press, 1992.
R. Milner. A complete inference system for a class of regular behaviours. JCSS, 28:227–247, 1984.
S. L. Peyton Jones. The implementation of Functional Programming Languages. Prentice-Hall International, Englewood Cliffs, N.J., 1987.
M.R. Sleep, M.J. Plasmeijer, and M.C.D.J. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley & Sons, 1993.
S. Smetsers. Graph Rewriting and Functional Languages. PhD thesis, University of Nijmegen, 1993.
G. Ştefănescu. The Algebra of Flownomials Part 1: Binary Flownomials; Basic Theory. Technical report, Technical University Munich, November 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blom, S. (1996). A complete proof system for Nested Term Graphs. 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_20
Download citation
DOI: https://doi.org/10.1007/3-540-61254-8_20
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