Intersection types via finite-set declarations
From MaRDI portal
Cites work
- A calculus with polymorphic and polyvariant flow types
- A typed lambda calculus with intersection types
- An extension of basic functionality theory for -calculus
- Elaborating intersection and union types
- scientific article; zbMATH DE number 445157 (Why is no real title available?)
- scientific article; zbMATH DE number 954811 (Why is no real title available?)
- scientific article; zbMATH DE number 3657760 (Why is no real title available?)
- scientific article; zbMATH DE number 1499107 (Why is no real title available?)
- scientific article; zbMATH DE number 2087541 (Why is no real title available?)
- scientific article; zbMATH DE number 1841834 (Why is no real title available?)
- Hyperformulae, parallel deductions and intersection types
- Intersection typed -calculus
- Intersection Types as Logical Formulae
- Intersection-types à la Church
- The Barendregt cube with definitions and generalised reduction
- Type reconstruction in Fω
This page was built for publication: Intersection types via finite-set declarations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034652)