Characterising strongly normalising intuitionistic terms
From MaRDI portal
Publication:4903715
Recommendations
- Characterising Strongly Normalising Intuitionistic Sequent Terms
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- An elementary proof of strong normalization for intersection types
- Characterising strong normalisation for explicit substitutions
- Strong normalization and typability with intersection types
Cited in
(14)- An elementary proof of strong normalization for intersection types
- Nominal essential intersection types
- Strong normalization through intersection types and memory
- Strong normalization and typability with intersection types
- A new type assignment for strongly normalizable terms
- Intersection types for the resource control lambda calculi
- Characterising Strongly Normalising Intuitionistic Sequent Terms
- Intersection types for λGtz-calculus
- A term assignment for polarized bi-intuitionistic logic and its strong normalization
- Normalization of S-terms is decidable
- A resource aware semantics for a focused intuitionistic calculus
- Characterisation of normalisation properties for using strict negated intersection types
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
This page was built for publication: Characterising strongly normalising intuitionistic terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903715)