Categorical rewriting of term-like structures

DOI10.1016/S1571-0661(04)80195-6zbMath1263.68070OpenAlexW1996752588MaRDI QIDQ4923533

Andrea Corradini, Fabio Gadducci

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80195-6

zbMATH Keywords

iteration theoriesalgebraic2-theoriesterm graph rewritingterm graphsrational terms\(\mu \)-termsgs-monoidaltraced monoidal

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (4)

Two Lax categorifications of Kalman algebras and the category of minimization heuristics ⋮ A Term-Graph Syntax for Algebras over Multisets ⋮ Unnamed Item ⋮ GETGRATS

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
• Petri nets are monoids
• On ``On graph rewritings
• Equational properties of iteration in algebraically complete categories
• 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
• An algebraic semantics for structured transition systems and its application to logic programs
• A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
• Transfinite reductions in orthogonal term rewriting systems
• An algebraic presentation of term graphs, via gs-monoidal categories
• REDEX CAPTURING IN TERM GRAPH REWRITING
• The basic algebraic structures in categories of derivations
• Initial Algebra Semantics and Continuous Algebras
• Traced monoidal categories
• 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).
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• An abstract formulation for rewrite systems
• CPO models for infinite term rewriting
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

This page was built for publication: Categorical rewriting of term-like structures