Rewriting on cyclic structures: Equivalence between the operational and the categorical description
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185716 (Why is no real title available?)
- scientific article; zbMATH DE number 4157896 (Why is no real title available?)
- scientific article; zbMATH DE number 4085643 (Why is no real title available?)
- scientific article; zbMATH DE number 1189296 (Why is no real title available?)
- scientific article; zbMATH DE number 3731311 (Why is no real title available?)
- scientific article; zbMATH DE number 3751225 (Why is no real title available?)
- scientific article; zbMATH DE number 108369 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 1231589 (Why is no real title available?)
- scientific article; zbMATH DE number 1086713 (Why is no real title available?)
- scientific article; zbMATH DE number 3438414 (Why is no real title available?)
- scientific article; zbMATH DE number 919844 (Why is no real title available?)
- scientific article; zbMATH DE number 922680 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
- A new implementation technique for applicative languages
- Algebraic semantics
- An algebraic presentation of term graphs, via gs-monoidal categories
- Axiomatizing schemes and their behaviors
- Computation on graph-like expressions
- Conditional rewriting logic as a unified model of concurrency
- Contextual nets
- Equational properties of iteration in algebraically complete categories
- FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
- Group axioms for iteration
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Implementing term rewriting by jungle evaluation
- Initial Algebra Semantics and Continuous Algebras
- LEAN: An intermediate language based on graph rewriting
- Minimal and Optimal Computations of Recursive Programs
- On ``On graph rewritings
- On flowchart theories. II: The nondeterministic case
- On the algebraic structure of rooted trees
- Optimal evaluations of graph-like expressions
- Petri nets are monoids
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Regular trees and the free iterative theory
- Speeding up subtree replacement systems
- Structured Programming With and Without go to Statements
- The equational logic of fixed points
- Traced monoidal categories
Cited in
(18)- Modeling pointer redirection as cyclic term-graph rewriting
- Rewriting in Operads and PROPs
- On term-graph rewrite strategies
- Correct Looping Arrows from Cyclic Terms
- scientific article; zbMATH DE number 7450012 (Why is no real title available?)
- A Term-Graph Syntax for Algebras over Multisets
- Adjunction for Garbage Collection with Application to Graph Rewriting
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Categorical rewriting of term-like structures
- scientific article; zbMATH DE number 1393359 (Why is no real title available?)
- Sharing in the graph rewriting calculus
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness
- Towards a sharing strategy for the graph rewriting calculus
- On graph rewriting, reduction, and evaluation in the presence of cycles
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
- 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).
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)
