An algebraic presentation of term graphs, via gs-monoidal categories
From MaRDI portal
Publication:1971974
DOI10.1023/A:1008647417502zbMath0949.68121OpenAlexW1542911159MaRDI QIDQ1971974
Andrea Corradini, Fabio Gadducci
Publication date: 23 March 2000
Published in: Applied Categorical Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008647417502
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10)
Related Items
An Institution for Graph Transformation, A Term-Graph Syntax for Algebras over Multisets, A basic algebra of stateless connectors, Causal inference via string diagram surgery, 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)., Discretionary Information Flow Control for Interaction-Oriented Specifications, A flexible categorial formalisation of term graphs as directed hypergraphs, From gs-monoidal to oplax cartesian categories: constructions and functorial completeness, Towards ``mouldable code via nested code graph transformation, Free gs-monoidal categories and free Markov categories, A decentralised graphical implementation of mobile ambients, Linear-Ordered Graph Grammars: Applications to Distributed Systems Design, Unnamed Item, Petri nets are dioids: a new algebraic foundation for non-deterministic net theory, Term-Graph Anti-Unification, A Decentralized Implementation of Mobile Ambients, Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks, Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding), GETGRATS, Categorical rewriting of term-like structures, Lawvere Categories as Composed PROPs, RPO semantics for mobile ambients, Recognizability of graph and pattern languages, An axiomatization of graphs, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, On GS-Monoidal Theories for Graphs with Nesting, Synthesising CCS bisimulation using graph rewriting, GS·Λ Theories, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, Normal forms for algebras of connections., A functorial semantics for multi-algebras and partial algebras, with applications to syntax., Tile formats for located and mobile systems., Dynamic connectors for concurrency, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
