The following pages link to The rewriting calculus. I (Q2720293):
Displaying 19 items.
- 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)
- Typed generic traversal with term rewriting strategies (Q1394988) (← links)
- A higher-order strategy for eliminating common subexpressions (Q1749242) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Nominal rewriting (Q2373703) (← links)
- The simply typed rewriting calculus (Q2703689) (← links)
- The rewriting calculus. II (Q2720294) (← links)
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN (Q2782483) (← links)
- Generic type-preserving traversal strategies (Q2841223) (← links)
- A rewriting calculus for cyclic higher-order term graphs (Q2848117) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q2849855) (← links)
- From Rogue to MicroRogue (Q2849859) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- Distributive \(\rho\)-calculus (Q2873778) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- Types for Proofs and Programs (Q5712302) (← links)
- Theoretical Computer Science (Q5897361) (← links)
- (Q6079229) (← links)