San Francisco / Cambridge / London / Austin / San Diego / Petersburg Beach / Paris / /
Country
France / United States / United Kingdom / /
Facility
Alex Aiken Computer Science Department Stanford University / Tachio Terauchi EECS Department University of California / University of California / /
IndustryTerm
finite-range solution / typical constraint-based type inference algorithm / infinite-range solution / finiterank intersection type systems / infiniterange solution / type systems / actual type inference algorithm / finite range solution / conventional type inference algorithms / typability algorithm / /
Organization
Tachio Terauchi EECS Department University / National Science Foundation / MIT / Stanford University / University of California / Berkeley / Alex Aiken Computer Science Department / /
Person
Jim / Alex Aiken / /
Product
Latte W10 Portable Audio Device / /
ProvinceOrState
Texas / Florida / California / /
PublishedMedium
Theoretical Computer Science / /
SportsLeague
Stanford University / /
Technology
Functional Programming / typical constraint-based type inference algorithm / 4 4.1 As in conventional type inference algorithms / Software Technology / actual type inference algorithm / dom / terminating algorithm / terminating typability algorithm / /
On Typability for Rank-2 Intersection Types with Polymorphic Recursion ∗ Tachio Terauchi EECS Department University of California, Berkeley Abstract