Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells  Home/Search
Context
Related
| cee.hw.ac.uk/~jbw/...ms:ICFP1999.ps.gz brandeis.edu/~mairson/Paper...ICFP99.ps 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: cee.hw.ac.uk/~fairouz/...TYREprog (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate finite-rank intersection type systems, analyzing the complexity of their type inference problems and their relation to the problem of recognizing semantically equivalent terms. Intersection types allow something of type 1 2 to be used in some places at type 1 and in other places at type 2 . A finite-rank intersection type system bounds how deeply the can appear in type expressions. Such type systems enjoy strong normalization, subject reduction, and computable type inference, and ... (Update)
Similar documents (at the sentence level):
63.4%: Relating Typability and Expressiveness in Finite-Rank.. - Kfoury, Mairson (1999) (Correct)
Active bibliography (related documents): More All
0.6: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.3: The Soundness of Explicit Substitution with Nameless Variables - Kamareddine (Correct)
0.2: LAL Is Square: Representation and Expressiveness in Light.. - Neergaard, Mairson (2002) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (Correct)
0.5: A Calculus for Link-time Compilation - Machkasova, Turbak (2000) (Correct)
0.4: Type Inference with Recursive Types at Different Ranks - Pericas-Geertsen (1994) (Correct)
BibTeX entry: (Update)
@inproceedings{ kfoury99relating,
author = "A. J. Kfoury and Harry G. Mairson and Franklyn A. Turbak and J. B. Wells",
title = "Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)",
booktitle = "International Conference on Functional Programming",
pages = "90-101",
year = "1999",
url = "citeseer.ist.psu.edu/article/kfoury99relating.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
229 Foundations for Programming Languages (context) - Mitchell - 1996
191 Polymorphic type inference (context) - Leivant - 1983
118 What are principal typings and what are they good - Jim - 1996
67 A direct algorithm for type inference in the rank-2 fragment.. - Kfoury, Wells - 1994
63 Principal type schemes and -calculus semantics (context) - Coppo, Dezani-Ciancaglini et al. - 1980
54 Principal type schemes for an extended type theory (context) - Della, Venneri - 1984
47 Principality and decidable type inference for finite-rank in.. - Kfoury, Wells - 1999
38 Deciding ML typability is complete for deterministic exponen.. (context) - Mairson - 1990
35 New notions of reduction and non-semantic proofs of fi-stron.. (context) - Kfoury, Wells - 1995
30 A typed intermediate language for flow-directed compilation - Wells, Dimock et al. - 1997
27 Type reconstruction in finite-rank fragments of the second-o.. (context) - Kfoury, Tiuryn - 1992
25 A calculus with polymorphic and polyvariant flow types - Wells, Dimock et al.
24 The complexity of type inference for higher-order typed lamb.. - Henglein, Mairson - 1994
21 A simple proof of a theorem of Statman - Mairson - 1992
18 The inherent computational complexity of theories of ordered.. (context) - Meyer - 1974
18 Intersection Type Disciplines in Lambda Calculus and Applica.. (context) - van Bakel - 1993
11 The typed lambda-calculus is not elementary recursive (context) - Statman - 1979
10 A reduction relation for which postponement of k-contraction.. - Kamareddine - 1996
9 Parallel beta reduction is not elementary recursive - Asperti, Mairson - 1998
5 An analysis of the Core-ML language: Expressive power and ty.. - Kanellakis, Hillebrand et al. - 1994
3 Calculi of generalised fi-reduction and explicit substitutio.. (context) - Kamareddine, R'ios et al. - 1998
2 Zeitschrift fur Mathematishche Logik und Grundlagen der Math.. (context) - Coppo, Dezani-Ciancaglini et al. - 1981
Documents on the same site (http://www.cee.hw.ac.uk/~fairouz/projects/TYREprog.html): More
Strategies for Simply-Typed Higher Order Unification .. -.. (Correct)
Postponement, Conservation and Preservation of Strong.. - Kamareddine (Correct)
A Correspondence between Martin-Löf Type Theory, the.. - Kamareddine, Laan (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