The Inhabitation Problem for Rank Two Intersection Types

Details The Inhabitation Problem for Rank Two Intersection Types The Inhabitation Problem for Rank Two Intersection Types

2007-01-05

arxiv.org/abs/cs/0701029v1

Computer Science

Logic in Computer Science

15 pages

Scientific paper

We prove that the inhabitation problem for rank two intersection types is
decidable, but (contrary to common belief) EXPTIME-hard. The exponential time
hardness is shown by reduction from the in-place acceptance problem for
alternating Turing machines.

Affiliated with

Also associated with

No associations

Rating

The Inhabitation Problem for Rank Two Intersection Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Inhabitation Problem for Rank Two Intersection Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Inhabitation Problem for Rank Two Intersection Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16104