Rewriting on cyclic structures: Equivalence between the operational and the categorical description
DOI10.1051/ITA:1999128zbMATH Open0940.18002OpenAlexW2092142168MaRDI QIDQ4943554FDOQ4943554
Authors: Andrea Corradini, Fabio Gadducci 
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
Recommendations
term graph rewritingalgebraic 2-theoriesautomatic garbage collectioncircular redexescyclic term graphsfolding/unfoldingsharing/unsharing
Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10)
Cites Work
- Equational properties of iteration in algebraically complete categories
- Group axioms for iteration
- The equational logic of fixed points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Initial Algebra Semantics and Continuous Algebras
- Traced monoidal categories
- On the algebraic structure of rooted trees
- Title not available (Why is that?)
- LEAN: An intermediate language based on graph rewriting
- Regular trees and the free iterative theory
- Conditional rewriting logic as a unified model of concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic presentation of term graphs, via gs-monoidal categories
- Implementing term rewriting by jungle evaluation
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Petri nets are monoids
- Title not available (Why is that?)
- Contextual nets
- Minimal and Optimal Computations of Recursive Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new implementation technique for applicative languages
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Title not available (Why is that?)
- Algebraic semantics
- On ``On graph rewritings
- Title not available (Why is that?)
- FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
- Title not available (Why is that?)
- Structured Programming With and Without go to Statements
- Axiomatizing schemes and their behaviors
- Title not available (Why is that?)
- Computation on graph-like expressions
- On flowchart theories. II: The nondeterministic case
- Optimal evaluations of graph-like expressions
- Speeding up subtree replacement systems
- Title not available (Why is that?)
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- Adjunction for Garbage Collection with Application to Graph Rewriting
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
- Title not available (Why is that?)
- Correct Looping Arrows from Cyclic Terms
- Sharing in the graph rewriting calculus
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Title not available (Why is that?)
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness
- 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).
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
- On term-graph rewrite strategies
- Rewriting in Operads and PROPs
- A Term-Graph Syntax for Algebras over Multisets
- Modeling pointer redirection as cyclic term-graph rewriting
- Towards a sharing strategy for the graph rewriting calculus
- Categorical rewriting of term-like structures
This page was built for publication: Rewriting on cyclic structures: Equivalence between the operational and the categorical description
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943554)
