Book ChapterDOI
Jungle Evaluation for Efficient Term Rewriting
Berthold Hoffmann,Detlef Plump +1 more
- pp 191-203
TLDR
Jungles are acyclic hypergraphs that represent sets of terms over a signature so that equal subterms can be shared.Abstract:
Jungles are acyclic hypergraphs that represent sets of terms over a signature so that equal subterms can be shared.read more
Citations
More filters
Journal ArticleDOI
Algebraic approach to single-pushout graph transformation
TL;DR: The whole theory for double-pushout transformations including sequential composition, parallel composition, and amalgamation can be reformulated and generalized in the new framework.
Book
A Categorical Manifesto
TL;DR: This paper tries to explain why and how category theory is useful in computing science, by giving guidelines for applying seven basic categorical concepts: category, functor, natural transformation, limit, adjoint, colimit and comma category.
Journal ArticleDOI
Graph transformation for specification and programming
Marc Andries,Gregor Engels,Annegret Habel,Berthold Hoffmann,Hans-Jörg Kreowski,Sabine Kuske,Detlef Plump,Andy Schürr,Gabriele Taentzer +8 more
TL;DR: The concept of a transformation unit is presented, which allows systematic and structured specification and programming based on graph transformation, and a selection of applications are discussed, including the evaluation of functional expressions and the specification of an interactive graphical tool.
Journal ArticleDOI
Equational term graph rewriting
Zena M. Ariola,Jan Willem Klop +1 more
TL;DR: In this paper, an equational framework for term graph rewriting with cycles is presented, where the usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory.
Journal ArticleDOI
On the adequacy of graph rewriting for simulating term rewriting
TL;DR: In this paper, the authors formalize the close correspondence between finitary cyclic graph rewriting and a restricted form of infinitary term rewriting, called rational term rewriting and show that the correspondence breaks down for general ininitary rewriting.
References
More filters
Book
The implementation of functional programming languages
Peyton Jones,L Simon +1 more
TL;DR: My 1987 book is now out of print, but it is available here in its entirety in PDF form, in one of two formats: single-page portrait double-page landscape and fully searchable, thanks to OCR and Norman Ramsey.
Book
Fundamentals of Algebraic Specification 1: Equations and Initial Semantics
Hartmut Ehrig,Bernd Mahr +1 more
TL;DR: The aim of this book is to present fundamentals of algebraic specifications with respect to the following three aspects: fundamentals in the sense of a carefully motivated introduction togebraic specifications, which is easy to understand for computer scientists and mathematicians.
Book ChapterDOI
Equations and rewrite rules: a survey
Gérard Huet,Derek C. Oppen +1 more
TL;DR: The problem of "solving" equations, the problem of proving termination of sets of rewrite rules, and the decidability and complexity of word problems and of combinations of equational theories are discussed.
Proceedings ArticleDOI
Principles of OBJ2
TL;DR: Four clsssrs of design principles for 01352 ate discussed briefly in this inttoduct, and then in mote detail brlnw: motlulntizntion and patnmcteriantion; (2) subsorts; (3) implcmcntnt; and (4) inlrtaction and flexibility.
Book ChapterDOI
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
TL;DR: The aim of this survey is to motivate and introduce the basic constructions and results which have been developed in the algebraic theory of graph grammars up to now, as well as applications to a "very small data base system", where consistent states are represented as graphs.