D. Plump  Home/Search
Context Related
| informatik.unibreme...tgr_survey.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unibremen.de...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Reduction Systems . . . . . . . . . . 5 1.3 Term Graphs . . . . . . . . . . . . . . . . . . . . 9 1.4 Term Graph Rewriting . . . . . . . . . . . . . . 15 1.5 Completeness . . . . . . . . . . . . . . . . . . . 23 1.6 Termination . . . . . . . . . . . . . . . . . . . . 29 1.7 Confluence . . . . . . . . . . . . . . . . . . . . . 37 1.8 Term Graph Narrowing . . . . . . . . . . . . . 45 1.9 Further Topics . . . . . . . . . . . . . . . . . . . 53 References . . . . . . . . . . . . . . . . . . ... (Update)
Cited by: More
Graphical Verification of a Spatial Logic for the π-calculus - Gadducci, Lafuente (2005) (Correct)
From Trees to Graphs: Defining the Semantics of Diagram.. - Engels, Heckel (2000) (Correct)
Inequational Deduction as Term Graph Rewriting - Corradini, Gadducci, Kahl, König (Correct)
Similar documents (at the sentence level):
6.0%: Solving Equations by Graph Transformation - Habel, Plump (2001) (Correct)
5.2%: Bisimilarity in Term Graph Rewriting - Ariola, Klop, Plump (1998) (Correct)
Active bibliography (related documents): More All
8.8: Term Graph Rewriting - Plump (1998) (Correct)
2.6: Graph Transformation for Specification and Programming - Andries, Engels, Habel.. (1996) (Correct)
1.5: Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (Correct)
Similar documents based on text: More All
0.9: Term Graph Narrowing - Habel, Plump (1996) (Correct)
0.1: Parallel Library for Unstructured Mesh Problems (PLUMP) - Bröker, Deshpande.. (1996) (Correct)
0.0: PLUMP: Parallel Library For Unstructured Mesh Problems - Beg, Ling, Müller.. (1994) (Correct)
Related documents from co-citation: More All
13: Handbook of Graph Grammars and Computing by Graph Transformation (context) - Ehrig, Kreowski et al. - 1999
10: Application of graph transformation to visual languages - Bardohl, Minas et al. - 1999
9: Term Rewriting and All That (context) - Baader, Nipkow - 1998
BibTeX entry: (Update)
Detlef Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2. World Scientific, 1998. To appear. http://citeseer.ist.psu.edu/article/plump98term.html More
@misc{ plump98term,
author = "D. Plump",
title = "Term graph rewriting",
text = "Detlef Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski,
and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph
Transformation, volume 2. World Scientific, 1998. To appear.",
year = "1998",
url = "citeseer.ist.psu.edu/article/plump98term.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
447 Prentice Hall International (context) - Milner, Concurrency - 1989
430 Structure and Interpretation of Computer Programs (context) - Abelson, Sussman - 1985
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
254 The integration of functions into logic programming: From th.. (context) - Hanus - 1994
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
215 Theoretical Computer Science (context) - Raoult, rewritings - 1984
214 Orderings for term rewriting systems (context) - Dershowitz - 1982
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
138 Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, van Eekelen - 1993
116 Introduction to the algebraic theory of graph grammars (context) - Ehrig - 1979
102 Term graph rewriting (context) - Barendregt, van Eekelen et al. - 1987
83 Counterexamples to termination for the direct sum of term re.. (context) - Toyama - 1987
82 Variations on the common subexpression problem (context) - Downey, Sethi et al. - 1980
79 the Church-Rosser property for the direct sum of term rewrit.. (context) - Toyama - 1987
74 equivalence (context) - Newman, with et al. - 1942
71 Transfinite reductions in orthogonal term rewriting systems - Kennaway, Klop et al. - 1995
65 the uniform halting problem for term rewriting systems (context) - Huet, Lankford - 1978
63 Theoretical Computer Science (context) - Padawitz, operational - 1982
62 Term rewriting systems (context) - Klop - 1992
61 Term Graph Rewriting: Theory and Practice (context) - Sleep, Plasmeijer et al. - 1993
54 Tree-manipulating systems and Church-Rosser theorems (context) - Rosen - 1973
50 Generalized sufficient conditions for modular termination of.. - Gramlich - 1994
49 Equational term graph rewriting - Ariola, Klop - 1996
45 Completeness results for basic narrowing - Middeldorp, Hamoen - 1994
44 Equational reasoning and term rewriting systems - Plaisted - 1993
41 Interaction systems I: The theory of optimal reductions - Asperti, Laneve - 1994
41 the modularity of termination of term rewriting systems - Ohlebusch - 1994
37 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
34 Optimal derivations in weak lambda calculi and in orthogonal.. - Maranget - 1991
33 categorical presentation of term graph rewriting - Corradini, Gadducci - 1997
30 Transactions of the American Mathematical Society (context) - Kruskal, the et al. - 1960
29 Term rewriting and equational reasoning (context) - Avenhaus, Madlener - 1990
26 Texts and Monographs in Computer Science (context) - Book, Otto - 1993
24 Informatik-Fachberichte (context) - Drosten - 1989
24 Implementing term rewriting by jungle evaluation - Hoffmann, Plump - 1991
23 Concurrent term rewriting as a model of computation (context) - Goguen, Kirchner et al. - 1987
21 Redex capturing in term graph rewriting (context) - Farmer, Watro - 1990
21 Evaluation of functional expressions by hypergraph rewriting (context) - Plump - 1993
21 Lambda calculus with explicit recursion - Ariola, Klop - 1997
20 Implementing term rewrite languages in Dactl (context) - Kennaway - 1990
19 Equations and rewrite rules (context) - Huet, Oppen - 1980
19 Implementing parallel rewriting (context) - Kirchner, Viry - 1990
18 Hyperedge replacement jungle rewriting for term rewriting sy.. (context) - Corradini, Rossi - 1993
18 Canonical forms and unification (context) - Hullot - 1980
17 Counterexamples to completeness results for basic narrowing (context) - Middeldorp, Hamoen - 1992
16 Properties of a first-order functional language with sharing - Ariola - 1995
16 term graph rewriting is adequate for rational parallel term .. (context) - Corradini, Drewes - 1997
16 Graph rewriting in some categories of partial morphisms - Kennaway
16 the adequacy of graph rewriting for simulating term rewritin.. - Kennaway, Klop et al. - 1994
15 Collapsed tree rewriting: Completeness (context) - Plump - 1993
14 Computation on graph-like expressions (context) - Staples - 1980
12 Critical pairs in term graph rewriting (context) - Plump - 1994
12 Mathematical Structures in Computer Science (context) - Habel, Plump et al. - 1996
12 Context-free hypergraph grammars have the same term-generati.. (context) - Engelfriet, Heyker - 1992
12 Event structures and orthogonal term graph rewriting (context) - Kennaway, Klop et al. - 1993
12 Jungle rewriting: an abstract description of a lazy narrowin.. (context) - Corradini, Wolz - 1994
11 Bisimilarity in term graph rewriting - Ariola, Klop et al.
11 Event structures and nonorthogonal term graph rewriting - Clark, Kennaway - 1996
11 Rational term rewriting - Corradini, Gadducci - 1998
11 A correctness proof for combinator reduction with cycles (context) - Farmer, Ramsdell et al. - 1990
11 Implementing term rewriting by graph reduction: Termination .. (context) - Plump
10 Confluent String Rewriting (context) - Jantzen - 1988
10 Modularity in noncopying term rewriting (context) - Kurihara, Ohuchi - 1995
9 Hans-Jorg Kreowski (context) - Habel - 1991
9 Unlimp: Uniqueness as a leitmotiv for implementation - Kahrs - 1992
9 Hans-Jorg Kreowski (context) - Habel - 1988
9 Analytic variations on the common subexpression problem - Flajolet, Sipala et al. - 1990
8 Admissible graph rewriting and narrowing (context) - Echahed, Janodet - 1998
8 Confluent rewriting of bisimilar term graphs (context) - Ariola, Klop et al. - 1997
8 Springer-Verlag (context) - Avenhaus - 1995
8 and narrowing on term graphs (context) - Habel, Plump et al. - 1995
8 Graph-reducible term rewriting systems (context) - Plump - 1991
8 Term rewriting with sharing and memoization - Hoffmann - 1992
7 Complete strategies for term graph narrowing (context) - Habel, Plump
7 Modular aspects of term graph rewriting (context) - Rao - 1998
7 Term graph rewriting and garbage collection using opfibratio.. (context) - Banach - 1994
7 Relating graph and term rewriting via Bohm models - Ariola - 1996
7 Graph grammars and logic programming (context) - Corradini, Montanari et al. - 1991
7 Dactl: An experimental graph rewriting language - Glauert, Kennaway et al. - 1991
7 Logic programming as hypergraph rewriting (context) - Corradini, Rossi et al. - 1991
6 Graph reducibility of term rewriting systems (context) - Rao - 1995
6 Optimal evaluations of graph-like expressions (context) - Staples - 1980
5 Conditional term graph rewriting - Ohlebusch - 1997
5 Transitive term graph rewriting - Banach - 1996
4 Internally typed second-order term graphs - Kahl - 1998
4 Implementing algebraic specifications by graph transformatio.. (context) - Lowe - 1990
4 Completeness results for basic narrowing in non-copying impl.. (context) - Rao - 1996
4 Speeding up subtree replacement systems (context) - Staples - 1980
4 Simplification orders for term graph rewriting (context) - Plump - 1997
3 Basics of term rewriting (context) - Jantzen - 1997
3 The compaction of acyclic terms (context) - Hains - 1989
3 Commutativity of independent transformations on complex obje.. (context) - Ehrig, Rosen - 1976
3 Modularity of termination in term graph rewriting (context) - Rao - 1996
3 Term graph rewriting (context) - Klop - 1996
2 Fundamental issues and the design of MONSTR (context) - Banach - 1996
2 Modularity of termination for disjoint term graph rewrite sy.. - Ohlebusch - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-bremen.de/~det/papers.html):
Double-Pushout Graph Transformation Revisited - Habel, Müller, Plump (1999) (Correct)
Hierarchical Graph Transformation - Drewes, Hoffmann, Plump (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC