Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
From MaRDI portal
Publication:3000601
DOI10.1007/978-3-642-19805-2_7zbMATH Open1326.68067OpenAlexW191576729MaRDI QIDQ3000601FDOQ3000601
Authors: Alexis Bernadet, Stéphane Lengrand 
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
Recommendations
- Non-idempotent intersection types and strong normalisation
- Non-idempotent intersection types for the lambda-calculus
- scientific article; zbMATH DE number 2061702
- On strong normalization and type inference in the intersection type discipline
- scientific article; zbMATH DE number 1499092
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Strong normalization in the \(\pi \)-calculus with intersection and union types
- scientific article; zbMATH DE number 3853055
- Compositional characterisations of \(\lambda\)-terms using intersection types
- scientific article; zbMATH DE number 1759417
Cited In (12)
- Execution time of λ-terms via denotational semantics and intersection types
- Tight typings and split bounds, fully developed
- Title not available (Why is that?)
- A semantic account of strong normalization in linear logic
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- Essential and relational models
- Strong normalization through intersection types and memory
- Non finitely generated types and λ-terms combinatoric representation cost
- Call-by-Value Non-determinism in a Linear Logic Type Discipline
- Title not available (Why is that?)
- Title not available (Why is that?)
- A resource aware semantics for a focused intuitionistic calculus
This page was built for publication: Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000601)
