The Inhabitation Problem for Rank Two Intersection Types
| dc.creator | Kusmierek, Dariusz | |
| dc.date | 2007-01-05 | |
| dc.date.accessioned | 2026-07-07T07:38:46Z | |
| dc.date.available | 2026-07-07T07:38:46Z | |
| dc.description | 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. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0701029 | |
| dc.identifier | http://arxiv.org/abs/cs/0701029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/121214 | |
| dc.subject | Logic in Computer Science | |
| dc.title | The Inhabitation Problem for Rank Two Intersection Types | |
| dc.type | text |