Z.M. Ariola
J.W. Klop
1996
Equational Term Graph Rewriting
Fundam. Inform.
26
3/4
207–240
A. Arnold
M. Nivat
1980
The metric space of infinite trees. Algebraic and topological properties
Fundamenta Informaticae
4
445–476
P. Baldan
C. Bertolissi
H. Cirstea
C. Kirchner
2007
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
17
3
363–406
P. Baldan
C. Bertolissi
H. Cirstea
C. Kirchner
2008
Towards a Sharing Strategy for the Graph Rewriting Calculus
Electr. Notes Theor. Comput. Sci.
204
111–127
H.P. Barendregt
M.C.J.D. van Eekelen
J.R.W. Glauert
J.R. Kennaway
M.J. Plasmeijer
M.R. Sleep
1987
Term graph reduction
J.W. de Bakker
A.J. Nijman
P.C. Treleaven
Parallel Architectures and Languages Europe
LNCS
259
Springer Verlag
141–158
G. Berry
J.-J. Lévy
1979
Minimal and Optimal Computations of Recursive Programs
J. ACM
26
1
148–175
A. Corradini
1993
Term Rewriting in CT_Σ
M.-C. Gaudel
J.-P. Jouannaud
Trees in Algebra and Programming
LNCS
668
Springer Verlag
468–484
A. Corradini
F. Gadducci
1997
A 2-Categorical Presentation of Term Graph Rewriting
E. Moggi
G. Rosolini
Category Theory and Computer Science
LNCS
1290
Springer Verlag
87–105
A. Corradini
F. Gadducci
1999
Rewriting on Cyclic Structures: Equivalence between the Operational and the Categorical Description
Informatique Théorique et Applications/Theoretical Informatics and Applications
33
467–493
A. Corradini
F. Rossi
1993
Hyperedge Replacement Jungle Rewriting for Term Rewriting Systems and Logic Programming
Theoretical Computer Science
109
7–48
H.B. Curry
R. Feys
1958
Combinatory Logic Volume I
Studies in Logic and the Foundations of Mathematics
North-Holland Publishing Company
Amsterdam
N. Dershowitz
S. Kaplan
1989
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite
Proc. POPL'89, Austin
250–259
N. Dershowitz
S. Kaplan
D.A. Plaisted
1989
Infinite Normal Forms (plus corrigendum)
Automata, Languages and Programming
249–262
D.J. Dougherty
P. Lescanne
L. Liquori
2006
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
16
4
667–709
D. Duval
R. Echahed
F. Prost
2007
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
Electr. Notes Theor. Comput. Sci.
176
1
65–84
H. Ehrig
1987
Tutorial introduction to the algebraic approach of graph-grammars
H. Ehrig
M. Nagl
G. Rozenberg
A. Rosenfeld
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
LNCS
291
Springer Verlag
3–14
W.M. Farmer
J.D. Ramsdell
R.J. Watro
1990
A correctness proof for combinator reduction with cycles
ACM Transactions on Programming Languages and Systems
12
123–134
W.M. Farmer
R.J. Watro
1991
Redex capturing in term graph rewriting
R.V. Book
Rewriting Techniques and Applications
LNCS
488
Springer Verlag
13–24
J.A. Goguen
J.W. Tatcher
E.G. Wagner
J.R Wright
1977
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM
24
68–95
B. Hoffmann
D. Plump
1991
Implementing Term Rewriting by Jungle Evaluation
Informatique Théorique et Applications/Theoretical Informatics and Applications
25
445–472
G. Huet
J.-J. Lévy
1991
Computations in orthogonal rewriting systems, I
J.-L. Lassez
G. Plotkin
Computational Logic: Essays in honour of Alan Robinson
MIT Press
395–414
J.R. Kennaway
1991
Graph rewriting in some categories of partial morphisms
Graph Grammars and their Application in Computer Science
LNCS
532
Springer Verlag
490–504
J.R. Kennaway
J.W. Klop
M.R. Sleep
F.J. de Vries
1994
On the Adequacy of Graph Rewriting for Simulating Term Rewriting
ACM Transactions on Programming Languages and Systems
16
493–523
S. Mac Lane
1971
Categories for the working mathematician
Springer Verlag
G Pacini
Carlo Montangero
Franco Turini
1974
Graph Representation and Computation Rules for Typeless Recursive Languages
J. Loeckx
ICALP
LNCS
14
Springer
157–169
J. Staples
1980
Computation of graph-like expressions
Theoretical Computer Science
10
171–195
D.A. Turner
1979
A New Implementation Technique for Applicative Languages
Softw., Pract. Exper.
9
1
31–49
J. Vuillemin
1974
Correct and Optimal Implementations of Recursion in a Simple Programming Language
J. Comput. Syst. Sci.
9
3
332–354