Strong normalization through intersection types and memory
From MaRDI portal
Publication:1744407
DOI10.1016/J.ENTCS.2016.06.006zbMath1394.03023OpenAlexW2464954612WikidataQ113317683 ScholiaQ113317683MaRDI QIDQ1744407
Delia Kesner, Antonio Bucciarelli, Daniel Lima Ventura
Publication date: 23 April 2018
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.06.006
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Principal type scheme and unification for intersection type discipline
- An extension of basic functionality theory for \(\lambda\)-calculus
- Complete restrictions of the intersection type discipline
- An equivalence between lambda- terms
- An elementary proof of strong normalization for intersection types
- Principality and type inference for intersection types using expansion variables
- A Resource Aware Computational Interpretation for Herbelin’s Syntax
- Non-idempotent intersection types and strong normalisation
- Strict intersection types for the Lambda Calculus
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- Quantitative Types for the Linear Substitution Calculus
- The Inhabitation Problem for Non-idempotent Intersection Types
- A filter lambda model and the completeness of type assignment
- Not Enough Points Is Enough
- Functional Characters of Solvable Terms
- A semantics for lambda calculi with resources
- The emptiness problem for intersection types
- Intensional interpretations of functionals of finite type I
- Linearization of the lambda-calculus and its relation with intersection type systems
- THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
This page was built for publication: Strong normalization through intersection types and memory
