Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
From MaRDI portal
Publication:3000601
DOI10.1007/978-3-642-19805-2_7zbMath1326.68067MaRDI QIDQ3000601
Stéphane Lengrand, Alexis Bernadet
Publication date: 19 May 2011
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_7
Related Items
A resource aware semantics for a focused intuitionistic calculus, Essential and relational models, A semantic account of strong normalization in linear logic, A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization, Strong normalization through intersection types and memory, Call-by-Value Non-determinism in a Linear Logic Type Discipline