Pages that link to "Item:Q2844065"
From MaRDI portal
The following pages link to Rewrite strategies in the rewriting calculus (Q2844065):
Displaying 15 items.
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- The proof monad (Q974136) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- A logic for rewriting strategies (Q2841238) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
- A Higher-Order Graph Calculus for Autonomic Computing (Q3655135) (← links)
- (Q4222985) (← links)
- (Q4847002) (← links)
- Pullback rewriting and applications (Q4923531) (← links)
- A Port Graph Calculus for Autonomic Computing and Invariant Verification (Q5170279) (← links)
- A Rewriting Semantics for Maude Strategies (Q5179141) (← links)
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS (Q5249248) (← links)
- A Rewriting Calculus for Multigraphs with Ports (Q5415656) (← links)