The Inhabitation Problem for Intersection Types

13 years 6 months ago

Download crpit.com

In the system of intersection types, without , the problem as to whether an arbitrary type has an inhabitant, has been shown to be undecidable by Urzyczyn in [10]. For one subsystem of , that lacks the

Martin W. Bunder

Real-time Traffic

Applied Computing | Arbitrary Type | CATS 2008 | Intersection Types |

claim paper

» A completeness result for a realisability semantics for an intersection type system

» On strong normalization and type inference in the intersection type discipline

» A typed lambda calculus with intersection types

» Intersecting Surfaces of Special Types

» On Typability for Rank2 Intersection Types with Polymorphic Recursion

» Intersection Universally Quantified and Reference Types

» Relating Typability and Expressiveness in FiniteRank Intersection Type Systems Extended Ab...

» Perfect matchings with restricted intersection in cubic graphs

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CATS
Authors	Martin W. Bunder

Comments (0)

Sciweavers

The Inhabitation Problem for Intersection Types

Applied Computing | Arbitrary Type | CATS 2008 | Intersection Types |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers