Abstracting models of strong normalization for classical calculi
From MaRDI portal
Recommendations
- Uniform strong normalization for multi-discipline calculi
- Call-by-value, call-by-name, and strong normalization for the classical sequent calculus
- Strong normalisation for applied lambda calculi
- Foundations of Software Science and Computation Structures
- Strong normalization proofs by CPS-translations
Cites work
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 1479631 (Why is no real title available?)
- A call-by-name lambda-calculus machine
- A syntactic approach to type soundness
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-value is dual to call-by-name
- Classical \(F_{\omega}\), orthogonality and symmetric candidates
- Classical call-by-need and duality
- Focalisation and Classical Realisability
- Intensional interpretations of functionals of finite type I
- Linear logic
- Parametric polymorphism and operational equivalence
- Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control
- Structures for structural recursion
- The Duality of Construction
- The duality of computation
- The duality of computation under focus
- The parametric lambda calculus. A metamodel for computation.
- Uniform strong normalization for multi-discipline calculi
- Why the usual candidates of reducibility do not work for the symmetric \(\lambda\mu\)-calculus
Cited in
(5)
This page was built for publication: Abstracting models of strong normalization for classical calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291828)
