Convergence in infinitary term graph rewriting systems is simple

[1]  Patrick Bahr,et al.  Modes of Convergence for Term Graph Rewriting , 2012, Log. Methods Comput. Sci..

[2]  Nachum Dershowitz,et al.  Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . , 1991, Theor. Comput. Sci..

[3]  Patrick Bahr.  Partial Order Infinitary Term Rewriting , 2014, Log. Methods Comput. Sci..

[4]  Jean-Jacques Lévy,et al.  Minimal and optimal computations of recursive programs , 1977, JACM.

[5]  Patrick Bahr.  Abstract Models of Transfinite Reductions , 2010, RTA.

[6]  Patrick Bahr.  Infinitary Term Graph Rewriting is Simple, Sound and Complete , 2012, RTA.

[7]  Simon Marlow,et al.  Haskell 2010 Language Report , 2010 .

[8]  Peter Henderson,et al.  A lazy evaluator , 1976, POPL.

[9]  J. R Kennaway.  On transfinite abstract reduction systems , 1992 .

[10]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[11]  Stefan Blom,et al.  Skew confluence and the lambda calculus with letrec , 2002, Ann. Pure Appl. Log..

[12]  Maurice Nivat,et al.  The metric space of infinite trees. Algebraic and topological properties , 1980, Fundam. Informaticae.

[13]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[14]  Jan Willem Klop,et al.  On the adequacy of graph rewriting for simulating term rewriting , 1994, TOPL.

[15]  Stefan Blom,et al.  Skew and omega-Skew Confluence and Abstract Böhm Semantics , 2005, Processes, Terms and Cycles.

[16]  Zena M. Ariola,et al.  Lambda Calculus with Explicit Recursion , 1997, Inf. Comput..

[17]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[18]  John Hughes,et al.  Why Functional Programming Matters , 1989, Comput. J..

[19]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[20]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.