Pages that link to "Item:Q2848122"
From MaRDI portal
The following pages link to Sharing implementations of graph rewriting systems (Q2848122):
Displaying 10 items.
- Comparison of two graph-rewrite systems (Q1111401) (← links)
- Introducing symmetry to graph rewriting systems with process abstraction (Q2292965) (← links)
- An abstract concept of optimal implementation (Q2844072) (← links)
- Implementing \(\mathcal{X}\) (Q2848126) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Optimal reductions in interaction systems (Q5044756) (← links)
- Paths, computations and labels in the λ-calculus (Q5055792) (← links)
- Relating graph and term rewriting via Böhm models (Q5055794) (← links)
- Extending graph rewriting with copying (Q5096274) (← links)
- Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)