A. Arnold & M. Nivat (1980):
The metric space of infinite trees. Algebraic and topological properties.
Fundam. Inf. 3(4),
pp. 445–476.
P. Bahr (2009):
Infinitary Rewriting - Theory and Applications.
Master's thesis.
Vienna University of Technology,
Vienna.
P. Bahr (2010):
Abstract Models of Transfinite Reductions.
In: C. Lynch: RTA'10 6,
pp. 49–66,
doi:10.4230/LIPIcs.RTA.2010.49.
P. Bahr (2010):
Partial Order Infinitary Term Rewriting and Böhm Trees.
In: C. Lynch: RTA'10 6,
pp. 67–84,
doi:10.4230/LIPIcs.RTA.2010.67.
P. Bahr (2012):
Infinitary Term Graph Rewriting is Simple, Sound and Complete.
In: A. Tiwari: RTA'12 15,
pp. 69–84,
doi:10.4230/LIPIcs.RTA.2012.69.
P. Bahr (2012):
Modes of Convergence for Term Graph Rewriting.
Logical Methods in Computer Science 8(2):6,
doi:10.2168/LMCS-8(2:6)2012.
P. Bahr (2013):
Convergence in Infinitary Term Graph Rewriting Systems is Simple.
Math. Struct. in Comp. Science, to appear.
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, R. Kennaway, M.J. Plasmeijer & M.R. Sleep (1987):
Term graph rewriting.
In: Philip C. Treleaven Jaco de Bakker, A. J. Nijman: PARLE'87,
LNCS 259.
Springer,
pp. 141–158,
doi:10.1007/3-540-17945-3_8.
E. Barendsen (2003):
Term Graph Rewriting.
In: Terese: Term Rewriting Systems, chapter 13.
Cambridge University Press,
pp. 712–743.
M. Barr (1993):
Terminal coalgebras in well-founded set theory.
Theor. Comput. Sci. 114(2),
pp. 299 – 315,
doi:10.1016/0304-3975(93)90076-6.
G. Berry & J.-J. Lévy (1977):
Minimal and optimal computations of recursive programs.
In: POPL'77,
pp. 215–226,
doi:10.1145/512950.512971.
A. Corradini (1993):
Term rewriting in CT_Σ.
In: M.-C. Gaudel & J.-P. Jouannaud: TAPSOFT'93,
pp. 468–484,
doi:10.1007/3-540-56610-4_83.
J.A. Goguen, J.W. Thatcher, E.G. Wagner & J.B. Wright (1977):
Initial Algebra Semantics and Continuous Algebras.
J. ACM 24(1),
pp. 68–95,
doi:10.1145/321992.321997.
P. Henderson & J.H. Morris, Jr. (1976):
A lazy evaluator.
In: POPL'76,
pp. 95–103,
doi:10.1145/800168.811543.
R. Kennaway, J.W. Klop, M.R. Sleep & F.-J. de Vries (1994):
On the adequacy of graph rewriting for simulating term rewriting.
ACM Trans. Program. Lang. Syst. 16(3),
pp. 493–523,
doi:10.1145/177492.177577.
R. Kennaway, J.W. Klop, M.R. Sleep & F.-J. de Vries (1995):
Transfinite Reductions in Orthogonal Term Rewriting Systems.
Inf. Comput. 119(1),
pp. 18–38,
doi:10.1006/inco.1995.1075.
R. Kennaway & F.-J. de Vries (2003):
Infinitary Rewriting.
In: Terese: Term Rewriting Systems,
1st edition, chapter 12.
Cambridge University Press,
pp. 668–711.
S. Marlow (2010):
Haskell 2010 Language Report.
D. Plump (1999):
Term graph rewriting.
In: H. Ehrig, G. Engels, H.-J. Kreowski & G. Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformation 2.
World Scientific Publishing Co., Inc.,
pp. 3–61,
doi:10.1142/9789812815149_0001.
eptcs@eptcs.org