Rank 2 Type Systems and Recursive Definitions

Rank 2 Type Systems and Recursive Definitions (1995)

by Trevor Jim

Citations:

24 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Rank 2 Type Systems and Recursive Definitions	user correction - Legacy Corrections
AUTHOR NAME	Trevor Jim	SVM HeaderParse 0.1
AUTHOR AFFIL	; Laboratory for Computer Science; Massachusetts Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	; 545 Technology Square, Cambridge, MA 02139,;. Supported	SVM HeaderParse 0.1
ABSTRACT	We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence is that typability in the rank 2 intersection system is DEXPTIME-complete. We introduce a rank 2 system combining intersections and polymorphism, and prove that it types exactly the same terms as the other rank 2 systems. The combined system suggests a new rule for typing recursive definitions. The result is a rank 2 type system with decidable type inference that can type some interesting examples of polymorphic recursion. Finally,we discuss some applications of the type system in data representation optimizations such as unboxing and overloading.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	35 found	ParsCit 1.0