An algebraic presentation of term graphs, via gs-monoidal categories

From MaRDI portal
Revision as of 16:38, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (34)

An Institution for Graph TransformationA Term-Graph Syntax for Algebras over MultisetsA basic algebra of stateless connectorsCausal inference via string diagram surgeryA 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 SpecificationsA flexible categorial formalisation of term graphs as directed hypergraphsFrom gs-monoidal to oplax cartesian categories: constructions and functorial completenessTowards ``mouldable code via nested code graph transformationFree gs-monoidal categories and free Markov categoriesA decentralised graphical implementation of mobile ambientsLinear-Ordered Graph Grammars: Applications to Distributed Systems DesignUnnamed ItemPetri nets are dioids: a new algebraic foundation for non-deterministic net theoryTerm-Graph Anti-UnificationA Decentralized Implementation of Mobile AmbientsUpdating Probabilistic Knowledge on Condition/Event Nets using Bayesian NetworksLabelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)GETGRATSCategorical rewriting of term-like structuresLawvere Categories as Composed PROPsRPO semantics for mobile ambientsRecognizability of graph and pattern languagesAn axiomatization of graphsRewriting on cyclic structures: Equivalence between the operational and the categorical descriptionOn GS-Monoidal Theories for Graphs with NestingSynthesising CCS bisimulation using graph rewritingGS·Λ TheoriesThe algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semanticsNormal 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 concurrencyComparing logics for rewriting: Rewriting logic, action calculi and tile logic







This page was built for publication: An algebraic presentation of term graphs, via gs-monoidal categories