Strong normalization of second order symmetric lambda-mu calculus
From MaRDI portal
Recommendations
- Strong normalization of the second-order symmetric \(\lambda \mu\)-calculus
- Strong normalization of second order symmetric -calculus
- Strong normalization of a symmetric lambda calculus for second-order classical logic
- Strong normalisation for applied lambda calculi
- Arithmetical proofs of strong normalization results for the symmetric -calculus
- Foundations of Software Science and Computation Structures
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
- scientific article; zbMATH DE number 6287623
- Strong normalization in a non-deterministic typed lambda-calculus
- A formalization of strong normalization for simply-typed lambda-calculus and System F
Cited in
(8)- Strong normalization property for second order linear logic
- Strong normalization of the second-order symmetric \(\lambda \mu\)-calculus
- Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus
- Why the usual candidates of reducibility do not work for the symmetric -calculus
- Strong normalization of second order symmetric -calculus
- Arithmetical proofs of strong normalization results for the symmetric -calculus
- Strong normalization proofs by CPS-translations
- Reduction rules for intuitionistic -calculus
This page was built for publication: Strong normalization of second order symmetric lambda-mu calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714454)