The following pages link to The rewriting calculus. II (Q2720294):
Displaying 15 items.
- Expressing combinatory reduction systems derivations in the rewriting calculus (Q857913) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- Theory and practice of second-order rewriting: foundation, evolution, and SOL (Q2039930) (← links)
- Nominal rewriting (Q2373703) (← links)
- Typed path polymorphism (Q2424892) (← links)
- Expression reduction systems with patterns (Q2467565) (← links)
- The rewriting calculus. I (Q2720293) (← links)
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN (Q2782483) (← links)
- An Interaction Net Encoding of Gödel’s System $$\mathcal {T}$$ (Q2798262) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
- A Higher-Order Graph Calculus for Autonomic Computing (Q3655135) (← links)
