X. R. S. : Explicit reduction systems -- A first-order calculus for higher-order calculi
From MaRDI portal
Recommendations
- Expressing combinatory reduction systems derivations in the rewriting calculus
- The Rewriting Calculus as a Combinatory Reduction System
- Rewriting calculus with fixpoints: Untyped and first-order systems
- Reduction system for extensional lambda-mu calculus
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Reduction rules for intuitionistic -calculus
- Closed reductions in the -calculus. (Extended abstract)
- Reducibility Proofs in the λ-Calculus
- Combinatory reduction systems: Introduction and survey
Cited in
(3)
This page was built for publication: X. R. S. : Explicit reduction systems -- A first-order calculus for higher-order calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249892)