Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On Typability for Rank-2 Intersection Types with Polymorphic Recursion Tachio Terauchi
 

Summary: On Typability for Rank-2 Intersection Types with Polymorphic Recursion
Tachio Terauchi
EECS Department
University of California, Berkeley
Alex Aiken
Computer Science Department
Stanford University
Abstract
We show that typability for a natural form of polymor-
phic recursive typing for rank-2 intersection types is unde-
cidable. Our proof involves characterizing typability as a
context free language (CFL) graph problem, which may be
of independent interest, and reduction from the bounded-
ness problem for Turing machines. We also show a property
of the type system which, in conjunction with the undecid-
ability result, disproves a misconception about the Milner-
Mycroft type system. We also show undecidability of a re-
lated program analysis problem.
1 Introduction
Among the interesting aspects of intersection types is the

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences