Pages that link to "Item:Q1971974"

The following pages link to An algebraic presentation of term graphs, via gs-monoidal categories (Q1971974):

Displaying 34 items.

• Towards ``mouldable code'' via nested code graph transformation (Q406453) (← links)
• A decentralised graphical implementation of mobile ambients (Q624388) (← links)
• An axiomatization of graphs (Q707454) (← links)
• A basic algebra of stateless connectors (Q860881) (← links)
• Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
• Dynamic connectors for concurrency (Q1603689) (← links)
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
• Petri nets are dioids: a new algebraic foundation for non-deterministic net theory (Q1713413) (← links)
• Normal forms for algebras of connections. (Q1853455) (← links)
• A functorial semantics for multi-algebras and partial algebras, with applications to syntax. (Q1853456) (← links)
• Tile formats for located and mobile systems. (Q1854326) (← links)
• A flexible categorial formalisation of term graphs as directed hypergraphs (Q2185888) (← links)
• Recognizability of graph and pattern languages (Q2491214) (← links)
• GS·Λ Theories (Q2842817) (← links)
• An Institution for Graph Transformation (Q2890329) (← links)
• Discretionary Information Flow Control for Interaction-Oriented Specifications (Q2945719) (← links)
• On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
• A Term-Graph Syntax for Algebras over Multisets (Q3184730) (← links)
• Linear-Ordered Graph Grammars: Applications to Distributed Systems Design (Q3507361) (← links)
• A Decentralized Implementation of Mobile Ambients (Q3540392) (← links)
• 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 (Q4917051) (← links)
• GETGRATS (Q4923529) (← links)
• Categorical rewriting of term-like structures (Q4923533) (← links)
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
• Term-Graph Anti-Unification (Q4993335) (← links)
• Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks (Q5009443) (← links)
• (Q5018495) (← links)
• Causal inference via string diagram surgery (Q5076389) (← links)
• Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) (Q5170667) (← links)
• Lawvere Categories as Composed PROPs (Q5739447) (← links)
• RPO semantics for mobile ambients (Q5740373) (← links)
• From gs-monoidal to oplax cartesian categories: constructions and functorial completeness (Q6077384) (← links)
• Free gs-monoidal categories and free Markov categories (Q6102159) (← links)