Strong normalization through intersection types and memory
From MaRDI portal
Publication:1744407
Recommendations
- Strong normalization and typability with intersection types
- An elementary proof of strong normalization for intersection types
- scientific article; zbMATH DE number 2061702
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- Characterising strongly normalising intuitionistic terms
Cites work
- A filter lambda model and the completeness of type assignment
- A resource aware computational interpretation for Herbelin's syntax
- A semantics for lambda calculi with resources
- An elementary proof of strong normalization for intersection types
- An equivalence between lambda- terms
- An extension of basic functionality theory for -calculus
- Bounding normalization time through intersection types
- Complete restrictions of the intersection type discipline
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- Functional Characters of Solvable Terms
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 482822 (Why is no real title available?)
- scientific article; zbMATH DE number 2086682 (Why is no real title available?)
- Intensional interpretations of functionals of finite type I
- Linearization of the lambda-calculus and its relation with intersection type systems
- Non-idempotent intersection types and strong normalisation
- Not Enough Points Is Enough
- Principal type scheme and unification for intersection type discipline
- Principality and type inference for intersection types using expansion variables
- Quantitative types for the linear substitution calculus
- Strict intersection types for the lambda calculus
- The emptiness problem for intersection types
- The Inhabitation Problem for Non-idempotent Intersection Types
- The lambda calculus. Its syntax and semantics. Rev. ed.
- THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
Cited in
(9)- An elementary proof of strong normalization for intersection types
- Strong normalization and typability with intersection types
- Non-idempotent intersection types and strong normalisation
- scientific article; zbMATH DE number 2061702 (Why is no real title available?)
- Strong normalization in the \(\pi \)-calculus with intersection and union types
- Bounding normalization time through intersection types
- scientific article; zbMATH DE number 7204443 (Why is no real title available?)
- THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
- Strong normalization through idempotent intersection types: a new syntactical approach
This page was built for publication: Strong normalization through intersection types and memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744407)
