Peter Møller Neergaard, Harry G. Mairson  Home/Search
Context
Related
| churchproject.org...aiicfp2004.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: churchproject.org/reports/ele... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normalization and type inference. We show how the success of type inference is fundamentally related to the amnesia of the type system: the nonlinearity by which all instances of a variable are constrained to have the same type. (Update)
Active bibliography (related documents): More All
1.2: Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2005) (Correct)
1.2: Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004) (Correct)
1.0: Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (Correct)
Similar documents based on text: More All
0.6: Rank Bounded Intersection: Types, Potency, and Idempotency - Neergaard, Mairson (2003) (Correct)
0.6: Conservation and Uniform Normalization in Lambda Calculi.. - Neergaard, Sørensen (2002) (Correct)
0.3: A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
BibTeX entry: (Update)
@misc{ neergaard-types,
author = "Peter Møller Neergaard and Harry G. Mairson",
title = "Types, Potency, and Idempotency: Why Nonlinearity and Amnesia Make a Type
System Work",
url = "citeseer.ist.psu.edu/neergaard04types.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
430 Structure and Interpretation of Computer Programs (context) - Abelson, Sussman - 1985
160 The principal type scheme of an object in combinatory logic (context) - Hindley - 1969
143 Theorems for free - Wadler - 1989
139 Type systems for programming languages (context) - Mitchell - 1990
118 What are principal typings and what are they good - Jim - 1996
75 The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
70 An algorithm for optimal lambda-calculus reductions (context) - Lamping
69 Curry: Essays on Combinatory Logic (context) - Hindley, Seldin et al. - 1980
63 Optimal reductions in the lambda-calculus (context) - evy
54 Principal type schemes for an extended type theory (context) - Della, Venneri - 1984
50 Principality and type inference for intersection types using.. - Kfoury, Wells - 2004
49 and type-based closure analysis (context) - Banerjee, modular - 1997
47 Principality and decidable type inference for finite-rank in.. - Kfoury, Wells - 1999
45 Intersection Type Disciplines in Lambda Calculus and Applica.. (context) - van Bakel - 1993
42 Linear logic without boxes - Gonthier, Abadi et al. - 1992
38 Deciding ML typability is complete for deterministic exponen.. (context) - Mairson
38 Principal type schemes and unification for intersection type.. (context) - Della - 1988
33 From proof-nets to interaction nets - Lafont - 1993
32 Unification and ML type reconstruction - Kanellakis, Mairson et al. - 1991
31 The structure of multiplicatives (context) - Danos, Regnier - 1989
31 Lambda calcul et r eseaux (context) - Regnier - 1992
25 A calculus with polymorphic and polyvariant flow types - Wells, Dimock et al. - 2002
24 The complexity of type inference for higher-order typed lamb.. - Henglein, Mairson - 1994
23 The Optimal Implementation of Functional Programming Languag.. (context) - Asperti, Guerrini - 1998
22 Inference of polymorphic and conditional strictness properti.. - Jensen - 1998
20 Rank 2 intersection types for local definitions and conditio.. - Damiani - 2003
19 Typability and type checking in System F are equivalent and .. - Wells - 1999
18 Outline of a proof theory of parametricity - Mairson - 1991
16 Relating typability and expressibility in finite-rank inters.. (context) - Kfoury, Mairson et al. - 1999
14 Rank 2 intersection types for modules - Damiani - 2003
13 volume 46 of Cambridge tracts in theoretical computer scienc.. (context) - Amadio, Curien et al. - 1998
13 ML typability is DEXPTIME complete (context) - Kfoury, Tiuryn et al. - 1990
12 Type inference with expansion variables and intersection typ.. - Carlier, Wells - 2004
12 A new presentation of the intersection type discipline throu.. - Sayag, Mauny - 1996
12 Expansion variables for flexible typing with linear and non-.. (context) - Carlier, Polakow et al. - 2004
11 The typed lambda-calculus is not elementary recursive (context) - Statman - 1979
10 Automatic useless-code detection and elimination for HOT fun.. (context) - Damiani, Giannini - 2000
9 and non-standard type inference (context) - Coppo, Damiani et al. - 2002
8 A conjunctive type system for useless-code elimination (context) - Damiani - 2003
7 Implementing compositional analysis using intersection types.. - Kfoury, Washburn et al. - 2002
6 From Hilbert spaces to Dilbert spaces: Context semantics mad.. (context) - Mairson - 2002
6 ACM Symp (context) - Rec, Ann - 1990
3 A linearization of the lambda-calculus (context) - Kfoury - 2000
3 Exact flow analysis - Mossin - 2003
1 ur Mathematishche Logik und Grundlagen der Mathematik (context) - Coppo, Dezani-Ciancaglini et al. - 1981
http://types.bu.edu/modular/compositional/
Documents on the same site (http://www.church-project.org/reports/electronic/): More
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (Correct)
Meta-Programming through Typeful Code Representation - Chen, Xi (2003) (Correct)
Full Integration of Subtyping and If-Expression - Gang Chen Computer (2002) (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