The emptiness problem for intersection types

DOI10.2307/2586625MaRDI QIDQ4934035zbMATH OpenOpenAlexFDO

Authors Paweł Urzyczyn

Publication date 17 January 2000

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2586625

zbMATH Keywords

lambda calculusprovabilityemptiness problemintersection type assignmentlogic of strong conjunction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Inhabitation for non-idempotent intersection types
• Inhabitation of Low-Rank Intersection Types
• The Inhabitation Problem for Non-idempotent Intersection Types
• scientific article; zbMATH DE number 2185668
• Inhabitation in Intersection and Union Type Assignment Systems

Cites work

• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 47007 (Why is no real title available?)
• A filter lambda model and the completeness of type assignment
• A theory of type polymorphism in programming
• An extension of basic functionality theory for -calculus
• Functional Characters of Solvable Terms
• Intersection Types as Logical Formulae
• Intuitionistic propositional logic is polynomial-space complete
• Semantical investigations in Heyting's intuitionistic logic
• The completeness of provable realizability

Cited in

(27)

• Recognizability in the Simply Typed Lambda-Calculus
• A type assignment for -calculus complete both for FPTIME and strong normalization
• Inhabitation for non-idempotent intersection types
• Pre-grammars and inhabitation for a subset of rank 2 intersection types
• Tight typings and split bounds, fully developed
• The intersection type unification problem
• scientific article; zbMATH DE number 7204443 (Why is no real title available?)
• scientific article; zbMATH DE number 7559294 (Why is no real title available?)
• Decidability of several concepts of finiteness for simple types
• Essential and relational models
• Strong normalization through intersection types and memory
• Checking Emptiness of Non-Deterministic Regular Types with Set Operators
• Simple subtypes of intersection types
• Finite combinatory logic with intersection types
• Typability and type checking in System F are equivalent and undecidable
• Inhabitation of Low-Rank Intersection Types
• The algebraic intersection type unification problem
• Solvability = typability + inhabitation
• Undecidability of intersection type inhabitation at rank 3 and its formalization
• Pregrammars and intersection types
• scientific article; zbMATH DE number 1479641 (Why is no real title available?)
• On sets of terms having a given intersection type
• Meaningfulness and genericity in a subsuming framework (invited talk)
• scientific article; zbMATH DE number 7155170 (Why is no real title available?)
• The Inhabitation Problem for Non-idempotent Intersection Types
• A resource aware semantics for a focused intuitionistic calculus
• Intersection type matching with subtyping

This page was built for publication: The emptiness problem for intersection types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934035)