Pages that link to "Item:Q2848117"
From MaRDI portal
The following pages link to A rewriting calculus for cyclic higher-order term graphs (Q2848117):
Displaying 12 items.
- Infinitary combinatory reduction systems (Q550248) (← links)
- Semantic foundations for generalized rewrite theories (Q2503334) (← links)
- Implementing \(\mathcal{X}\) (Q2848126) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- Modeling pointer redirection as cyclic term-graph rewriting (Q2867899) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Distributive \(\rho\)-calculus (Q2873778) (← links)
- A Higher-Order Graph Calculus for Autonomic Computing (Q3655135) (← links)
- A Port Graph Calculus for Autonomic Computing and Invariant Verification (Q5170279) (← links)
- Graph rewriting for the π-calculus (Q5308095) (← links)
- A Rewriting Calculus for Multigraphs with Ports (Q5415656) (← links)
- Types for Proofs and Programs (Q5712302) (← links)