Pages that link to "Item:Q4943554"
From MaRDI portal
The following pages link to Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554):
Displaying 14 items.
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs (Q2842817) (← links)
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting (Q2846582) (← links)
- Modeling pointer redirection as cyclic term-graph rewriting (Q2867899) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Correct Looping Arrows from Cyclic Terms (Q2900260) (← links)
- A Term-Graph Syntax for Algebras over Multisets (Q3184730) (← links)
- Rewriting in Operads and PROPs (Q3549575) (← 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)
- (Q5018495) (← links)
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs (Q5170278) (← links)
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness (Q6077384) (← links)
