Recommendations
- Inhabitation in Intersection and Union Type Assignment Systems
- Intersection types and computational rules
- A classification of intersection type systems
- scientific article; zbMATH DE number 1354138
- Intersection type assignment systems with higher-order algebraic rewriting
- Intersection types and computational effects
- scientific article; zbMATH DE number 1929308
- Intersection types and termination properties
- Applicative intersection types
- Intersection and union types
Cites work
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3880074 (Why is no real title available?)
- scientific article; zbMATH DE number 3811535 (Why is no real title available?)
- scientific article; zbMATH DE number 3596799 (Why is no real title available?)
- scientific article; zbMATH DE number 1354138 (Why is no real title available?)
- scientific article; zbMATH DE number 512791 (Why is no real title available?)
- scientific article; zbMATH DE number 1479634 (Why is no real title available?)
- scientific article; zbMATH DE number 1479641 (Why is no real title available?)
- scientific article; zbMATH DE number 883895 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- A characterization of F-complete type assignments
- A filter lambda model and the completeness of type assignment
- A theory of type polymorphism in programming
- Algebras and combinators
- An extension of basic functionality theory for -calculus
- Complete restrictions of the intersection type discipline
- Filter models with polymorphic types
- Functional Characters of Solvable Terms
- Functionality in Combinatory Logic
- Intensional interpretations of functionals of finite type I
- Lambda‐Calculus Models and Extensionality
- Polymorphic type inference and containment
- Principal Type Schemes for the Strict Type Assignment System
- Principal Typing in a ∀Λ-Discipline
- Principal type schemes for an extended type theory
- The Principal Type-Scheme of an Object in Combinatory Logic
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The completeness theorem for typing lambda-terms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
Cited in
(27)- Cut-elimination in the strict intersection type assignment system is strongly normalizing
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- scientific article; zbMATH DE number 7559299 (Why is no real title available?)
- The heart of intersection type assignment: Normalisation proofs revisited
- Essential and relational models
- Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
- Normalization, approximation, and semantics for combinator systems
- scientific article; zbMATH DE number 4087626 (Why is no real title available?)
- Intersection types for \(\lambda\)-trees
- Inhabitation in Intersection and Union Type Assignment Systems
- Nominal essential intersection types
- Logical equivalence for subtyping object and recursive types
- Functional type assignment for Featherweight Java. To Rinus Plasmeijer, in honour of his 61st birthday
- Type Inference for Rank 2 Gradual Intersection Types
- scientific article; zbMATH DE number 7526056 (Why is no real title available?)
- Intersection types for explicit substitutions
- On sets of terms having a given intersection type
- Disjoint intersection types
- Strongly normalising cut-elimination with strict intersection types
- A typed lambda calculus with intersection types
- On strong normalization and type inference in the intersection type discipline
- Types with intersection: An introduction
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Normalization results for typeable rewrite systems
- Semantic types and approximation for Featherweight Java
- Linearity and iterator types for Gödel's system \(\mathcal T\)
- Functional programs as compressed data
This page was built for publication: Intersection type assignment systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350344)
