Berthold Hoffmann, Detlef Plump  Home/Search
Context Related
| tzi.de/~hof/research/p...RAIRO:91.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: tzi.de/~hof/research/publicati... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle evaluation rules which implement parallel term rewriting steps. By using additional hypergraph rules which "fold" equal subterms, even non-left-linear term rewriting systems can be implemented. As a side effect, these folding rules can speed up the evaluation process considerably. It is shown that terminating term rewriting systems result in... (Update)
Context of citations to this paper: More
.... acyclic graphs, and of modeling term rewriting via graph rewriting (among the many contributions to this theory, we mention [28, 2, 13, 10, 1]; see also the book [27] and the references therein) The main advantage of using graphs is that the sharing of common subterms can...
.... algorithms for optimal implementation of orthogonal rewriting systems, such as Term Graph Rewriting [KKSV93] Jungle Rewriting [HoPl91], DAG (Directed Acyclic Graph) Rewriting [Mar91] and many others (in particular, covering cyclic graph reduction as well) inspired by...
Cited by: More
Term Rewriting as Interaction Nets Plus Hyperedge Replacement - Lohrey (1997) (Correct)
Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (Correct)
Rewriting On Cyclic Structures: Equivalence Between The.. - Corradini, Gadducci (1999) (Correct)
Active bibliography (related documents): More All
0.5: Discretization of Surfaces and Integrable Systems - Bobenko, Pinkall (1998) (Correct)
0.3: A Rewriting Logic for Declarative Programming - González-Moreno.. (1996) (Correct)
0.2: Asynchronous Mobile Processes and Graph Rewriting - Glauert (1992) (Correct)
Similar documents based on text: More All
0.6: Term Rewriting with Sharing and Memoïzation - Hoffmann (1992) (Correct)
0.4: Memoïzation for Term (Hypergraph) Rewriting (Extended.. - Hoffmann (Correct)
0.4: Driving in the Jungle - Secher (Correct)
Related documents from co-citation: More All
17: Graph Grammars and Their Application to Computer Science and Biology (context) - Claus, Ehrig et al. - 1979
14: Hyperedge replacement jungle rewriting for term-rewriting systems and logic prog.. (context) - Corradini, Rossi - 1993
12: Introduction to the algebraic theory of graph grammars (context) - Ehrig
BibTeX entry: (Update)
B. Hoffmann and D. Plump. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications, 25 (5):445--472, 1991. http://citeseer.ist.psu.edu/hoffmann91implementing.html More
@article{ hoffmann91implementing,
author = "Hoffmann and Plump",
title = "Implementing Term Rewriting by Jungle Evaluation",
journal = "RAIRO: R. A. I. R. O. Informatique Theorique et Applications/Theoretical Informatics and Applications",
volume = "25",
year = "1991",
url = "citeseer.ist.psu.edu/hoffmann91implementing.html" }
Citations (may not include all citations):121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud et al. - 1990
4 Sleep: Term Graph Rewriting (context) - Barendregt, van Eekelen et al. - 1987
4 Journal of the ACM (context) - Huet, Reductions et al. - 1980
3 Manna: Proving Termination with Multiset Orderings (context) - Dershowitz - 1979
2 Theoretical Comp (context) - Padawitz, Grammars et al. - 1982
2 TU Berlin (context) - Hoffmann, Generation et al. - 1983
2 Theoretical Comp (context) - Raoult, Rewritings - 1984
1 Lecture Notes in Comp (context) - Klop, Systems et al. - 1990
1 Rosen: Commutativity of Independent Transformations on Compl.. (context) - Ehrig - 1976
1 Wilharm: Is Parallelism Already Concurrency (context) - Kreowski - 1987
1 Fifth Workshop on Specification of Abstract Data Types (context) - Habel, Kreowski et al. - 1988
1 st Graph Grammar Workshop (context) - Ehrig, the et al. - 1979
1 nd Graph Grammar Workshop (context) - Ehrig, Concurrency et al. - 1983
1 Fachbereich Mathematik/Informatik (context) - Plump, Dschungel et al. - 1986
1 Plump: Jungle Evaluation for Efficient Term Rewriting (context) - Hoffmann - 1988
1 th Graph Grammar Workshop (context) - Plump, Rewriting et al. - 1990
1 Mahr: Fundamentals of Algebraic Specification 1 -- Equations.. (context) - Ehrig - 1985
1 Theoretical Comp (context) - Staples, Graph-like - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.tzi.de/~hof/research/publications/): More
Graph Transformation for Specification and Programming - Marc Andries, Gregor.. (1996) (Correct)
Reiko's Simple Modules for GRACE - Heckel, Hoffmann, Kuske (1997) (Correct)
Term Rewriting with Sharing and Memoïzation - Hoffmann (1992) (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