Characterising strongly normalising intuitionistic terms
From MaRDI portal
Publication:4903715
DOI10.3233/FI-2012-772zbMATH Open1277.03003MaRDI QIDQ4903715FDOQ4903715
Authors: José Espírito Santo, Jelena Ivetić, Silvia Likavec 
Publication date: 24 January 2013
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)
Cited In (14)
- An elementary proof of strong normalization for intersection types
- A new type assignment for strongly normalizable terms
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- Strong normalization through intersection types and memory
- A term assignment for polarized bi-intuitionistic logic and its strong normalization
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
- Characterising Strongly Normalising Intuitionistic Sequent Terms
- Nominal essential intersection types
- Intersection types for the resource control lambda calculi
- Intersection types for λGtz-calculus
- Characterisation of normalisation properties for \(\lambda\mu\) using strict negated intersection types
- Strong normalization and typability with intersection types
- Title not available (Why is that?)
- A resource aware semantics for a focused intuitionistic calculus
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)
