Trevor Jim  Home/Search
Context Related
Links: ACM | mit.edu/publicatio...LCSTM531b.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/publications/pubs/ps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Strongly Typed Flow-Directed Representation Transformations - Dimock, Muller, Turbak.. (1997) (Correct)
Rank-2 Intersection and Polymorphic Recursion - Damiani (2005) (Correct)
Rank 2 Intersection Types for Local Definitions and Conditional.. - Damiani (2003) (Correct)
Similar documents (at the sentence level):
58.0%: Rank 2 Type Systems and Recursive Definitions - Jim (1995) (Correct)
48.1%: Rank 2 Type Systems and Recursive Denitions - Jim (1995) (Correct)
Active bibliography (related documents): More All
0.3: The complete list of RTA open problems - Date April Summary (Correct)
0.3: Type Inference with Polymorphic Recursion - Henglein (1991) (Correct)
0.2: What Are Principal Typings and What Are They Good for? - Jim (1995) (Correct)
Similar documents based on text: More All
0.8: What Are Principal Typings and What Are They Good For? - Jim (1995) (Correct)
0.4: Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
0.4: Relating Typability and Expressiveness in Finite-Rank.. - Kfoury, Mairson (1999) (Correct)
Related documents from co-citation: More All
15: What are principal typings and what are they good - Jim - 1996
10: Polymorphic type inference (context) - Leivant - 1983
10: A direct algorithm for type inference in the rank-2 fragment of the second-order.. - Kfoury, Wells - 1993
BibTeX entry: (Update)
Trevor Jim. Rank-2 type systems and recursive definitions. Technical Report MIT/LCS/TM-531, Massachusetts Institute of Technology, November 1995. http://citeseer.ist.psu.edu/article/jim95rank.html More
@techreport{ jim95rank,
author = "T. Jim",
title = "Rank 2 Type Systems and Recursive Definitions",
number = "MIT/LCS/TM-531",
pages = "57",
year = "1995",
url = "citeseer.ist.psu.edu/article/jim95rank.html" }
Citations (may not include all citations):384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
325 Towards a theory of type structure (context) - Reynolds - 1974 ACM DBLP
267 A note on inductive generalization (context) - Plotkin - 1970
166 Unification revisited (context) - Lassez, Maher et al. - 1988 ACM DBLP
134 Unification theory - Baader, Siekmann - 1994 ACM DBLP
126 Type inference with polymorphic recursion - Henglein - 1993 ACM DBLP
87 Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1988
79 Polymorphic type schemes and recursive definitions (context) - Mycroft - 1984 ACM DBLP
68 Unification: A multidisciplinary survey (context) - Knight - 1989 ACM DBLP
67 A direct algorithm for type inference in the rank 2 fragment.. - Kfoury, Wells - 1993 ACM
67 A direct algorithm for type inference in the rank 2 fragment.. - Kfoury, Wells - 1994 ACM
63 Transformational systems and the algebraic structure of atom.. (context) - Reynolds - 1970
59 An analysis of ML typability (context) - Kfoury, Tiuryn et al. - 1994 ACM DBLP
54 Type reconstruction in the presence of polymorphic recursion (context) - Kfoury, Tiuryn et al. - 1993 ACM DBLP
45 Intersection Type Disciplines in Lambda Calculus and Applica.. (context) - van Bakel - 1993
44 Typability and type checking in the second-order -calculus a.. (context) - Wells - 1993
40 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
39 A simple applicative language: Mini-ML (context) - Clement, Despeyroux et al. - 1986 ACM DBLP
38 de l'interpretation de Godel `a l'analyse, et son applicatio.. (context) - Girard - 1971
38 Deciding ML typability is complete for deterministic exponen.. (context) - Mairson - 1990 ACM DBLP
27 Type reconstruction in finite rank fragments of the second-o.. (context) - Kfoury, Tiuryn - 1992
24 The typechecking of programs with implicit type structure (context) - McCracken - 1984 DBLP
21 New notions of reduction and non-semantic proofs of strong f.. - Kfoury, Wells - 1995
19 Designing unification procedures using transformations: A su.. (context) - Gallier, Snyder - 1992
16 Symbolic Computation (context) - Siekmann - 1989 ACM
14 Une extension de la theorie des types en -calcul (context) - Sall'e - 1978
12 A proper extension of ML with an effective type-assignment (context) - Kfoury, Tiuryn et al. - 1988 ACM DBLP
11 A new type-assignment for lambda terms (context) - Coppo, Dezani - 1978
9 volume 11 of Progress in Computer Science and Applied Logic (context) - Snyder, Theory et al. - 1991
8 Unboxing using specialisation - Hall, Jones et al. - 1994
8 Embedding a second-order type system into an intersection ty.. (context) - Yokouchi - 1995 ACM
7 Minimal typing derivations - Bjrner - 1994
7 Polymorphic type inference (context) - Leivant - 1983 ACM DBLP
6 Solving equations in abstract algebras: A rule-based survey .. (context) - Jouannaud, Kirchner - 1991 DBLP
6 Type reconstruction in finite-rank fragments of the polymorp.. (context) - Kfoury, Tiuryn - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/ps/): More
Maps: A Compiler-Managed Memory System for Raw Machines - Barua, Lee, Amarasinghe.. (1998) (Correct)
A Technique for Constructing Highly-Available Services - Ladin, Liskov, Shrira (1987) (Correct)
Design and Verification of Speculative Processors - Shen, Arvind (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC