Rewriting on cyclic structures: Equivalence between the operational and the categorical description

DOI10.1051/ita:1999128zbMath0940.18002OpenAlexW2092142168MaRDI QIDQ4943554

Fabio Gadducci, Andrea Corradini

Publication date: 11 May 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222074

zbMATH Keywords

term graph rewritingalgebraic 2-theoriesautomatic garbage collectioncircular redexescyclic term graphsfolding/unfoldingsharing/unsharing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (11)

Sharing in the Graph Rewriting Calculus ⋮ A Term-Graph Syntax for Algebras over Multisets ⋮ A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). ⋮ From gs-monoidal to oplax cartesian categories: constructions and functorial completeness ⋮ Unnamed Item ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ GETGRATS ⋮ Categorical rewriting of term-like structures ⋮ GS·Λ Theories ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting ⋮ Towards a Sharing Strategy for the Graph Rewriting Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Petri nets are monoids
• On ``On graph rewritings
• On flowchart theories. II: The nondeterministic case
• Equational properties of iteration in algebraically complete categories
• Computation on graph-like expressions
• Optimal evaluations of graph-like expressions
• Speeding up subtree replacement systems
• Algebraic semantics
• Regular trees and the free iterative theory
• Conditional rewriting logic as a unified model of concurrency
• A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
• On the algebraic structure of rooted trees
• Group axioms for iteration
• The equational logic of fixed points
• Axiomatizing schemes and their behaviors
• LEAN: An intermediate language based on graph rewriting
• Contextual nets
• An algebraic presentation of term graphs, via gs-monoidal categories
• REDEX CAPTURING IN TERM GRAPH REWRITING
• Implementing term rewriting by jungle evaluation
• FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
• Structured Programming With and Without go to Statements
• Initial Algebra Semantics and Continuous Algebras
• A new implementation technique for applicative languages
• Minimal and Optimal Computations of Recursive Programs
• Traced monoidal categories

This page was built for publication: Rewriting on cyclic structures: Equivalence between the operational and the categorical description