Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
From MaRDI portal
Publication:3000601
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
(15)- A resource aware semantics for a focused intuitionistic calculus
- Non-idempotent intersection types for the lambda-calculus
- Non finitely generated types and λ-terms combinatoric representation cost
- Execution time of λ-terms via denotational semantics and intersection types
- A semantic account of strong normalization in linear logic
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- Non-idempotent intersection types and strong normalisation
- Tight typings and split bounds, fully developed
- Bounding normalization time through intersection types
- Call-by-value non-determinism in a linear logic type discipline
- Essential and relational models
- scientific article; zbMATH DE number 7204443 (Why is no real title available?)
- scientific article; zbMATH DE number 3853055 (Why is no real title available?)
- Strong normalization through intersection types and memory
- scientific article; zbMATH DE number 7155170 (Why is no real title available?)
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)