loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
Seattle, Washington
August 12-August 15
ISBN: 0-7695-2631-4
ASCII Text
x 
 
Tachio Terauchi, Alex Aiken, "On Typability for Rank-2 Intersection Types with Polymorphic Recursion," Logic in Computer Science, Symposium on, pp. 111-122, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2006.41,
author = {Tachio Terauchi and Alex Aiken},
title = {On Typability for Rank-2 Intersection Types with Polymorphic Recursion},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2006},
issn = {1043-6871},
pages = {111-122},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2006.41},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - On Typability for Rank-2 Intersection Types with Polymorphic Recursion
SN - 1043-6871
SP111
EP122
A1 - Tachio Terauchi,
A1 - Alex Aiken,
PY - 2006
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Tachio Terauchi, University of California, Berkeley, USA
Alex Aiken, Stanford University, USA
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context free language (CFL) graph problem, which may be of independent interest, and reduction from the boundedness problem for Turing machines. We also show a property of the type system which, in conjunction with the undecidability result, disproves a misconception about the Milner- Mycroft type system. We also show undecidability of a related program analysis problem.
Citation:
Tachio Terauchi, Alex Aiken, "On Typability for Rank-2 Intersection Types with Polymorphic Recursion," lics, pp.111-122, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.