Collapsing non-idempotent intersection types
From MaRDI portal
Recommendations
- The Scott model of linear logic is the extensional collapse of its relational model
- Non-idempotent intersection types and strong normalisation
- Intersection types for the resource control lambda calculi
- Linearization of the lambda-calculus and its relation with intersection type systems
- Quantitative types for the linear substitution calculus
Cited in
(21)- The Scott model of linear logic is the extensional collapse of its relational model
- Tight typings and split bounds, fully developed
- scientific article; zbMATH DE number 7526055 (Why is no real title available?)
- scientific article; zbMATH DE number 7204443 (Why is no real title available?)
- Essential and relational models
- On reduction and normalization in the computational core
- The spirit of node replication
- Taylor expansion, finiteness and strategies
- Strong call-by-value and multi types
- A Fresh Look at the λ-Calculus
- The bang calculus and the two Girard's translations
- The bang calculus revisited
- Node Replication: Theory And Practice
- scientific article; zbMATH DE number 7226008 (Why is no real title available?)
- Quantitative global memory
- Light genericity
- The bang calculus revisited
- scientific article; zbMATH DE number 7155170 (Why is no real title available?)
- The Inhabitation Problem for Non-idempotent Intersection Types
- Relational graph models at work
- scientific article; zbMATH DE number 7756108 (Why is no real title available?)
This page was built for publication: Collapsing non-idempotent intersection types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649551)
