J. B. Wells  Home/Search
Context Related
| cee.hw.ac.uk/~jbw/...cidableAPAL.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: cee.hw.ac.uk/~jbw/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Girard and Reynolds independently invented System F (a.k.a. the second-order polymorphically typed lambda calculus) to handle problems in logic and computer programming language design, respectively. Viewing F in the Curry style, which associates types with untyped lambda terms, raises the questions of typability and type checking . Typability asks for a term whether there exists some type it can be given. Type checking asks, for a particular term and type, whether the term can be given that... (Update)
Cited by: More
The Essence of Principal Typings - Wells (2002) (Correct)
Using, Understanding, and Unraveling - The OCaml Language - From.. - Remy (Correct)
Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004) (Correct)
Similar documents (at the sentence level):
23.6%: Typability and Type Checking in the Second-Order lambda-Calculus.. - Wells (1996) (Correct)
Active bibliography (related documents): More All
5.0: Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (Correct)
1.5: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.9: Type Checking in System . . . - Raffalli (Correct)
Similar documents based on text: More All
0.4: A Direct Algorithm for Type Inference in the Rank 2 Fragment.. - Kfoury, Wells (1994) (Correct)
0.4: Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
0.4: Typability is Undecidable for F+Eta - Wells (1996) (Correct)
Related documents from co-citation: More All
14: What are principal typings and what are they good - Jim - 1996
10: A direct algorithm for type inference in the rank-2 fragment of the second-order.. - Kfoury, Wells - 1993
10: Type reconstruction in F (context) - Urzyczyn
BibTeX entry: (Update)
J. B. Wells. Typability and type checking in System F are equivalent and undecidable. Ann. Pure & Appl. Logic, 199X. To appear. Supersedes [Wel94]. http://citeseer.ist.psu.edu/article/wells98typability.html More
@article{ wells99typability,
author = "J. B. Wells",
title = "Typability and Type Checking in System F are Equivalent and Undecidable",
journal = "Annals of Pure and Applied Logic",
volume = "98",
number = "1-3",
pages = "111-156",
year = "1999",
url = "citeseer.ist.psu.edu/article/wells98typability.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
382 Lambda calculi with types - Barendregt - 1992
325 Towards a theory of type structure (context) - Reynolds - 1974
258 Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
191 Polymorphic type inference (context) - Leivant - 1983
160 The principal type scheme of an object in combinatory logic (context) - Hindley - 1969
150 Report on the functional programming language Haskell (context) - Hudak, Wadler - 1988
103 The Denition of Standard ML (context) - Milner, Tofte et al. - 1990
96 Polymorphic type inference and containment (context) - Mitchell - 1988
82 Typeful programming - Cardelli - 1991
67 A direct algorithm for type inference in the rank-2 fragment.. - Kfoury, Wells - 1994
43 Recursive unsolvability of Post's problem of `tag' and other.. (context) - Minsky - 1961
26 Type reconstruction in F (context) - Urzyczyn - 1993
26 Type reconstruction in F (context) - Urzyczyn - 1997
24 The undecidability of the Turing machine immortality problem (context) - Hooper - 1966
24 The complexity of type inference for higherorder typed lambd.. - Henglein, Mairson - 1991
24 The complexity of type inference for higher-order typed lamb.. - Henglein, Mairson - 1994
24 Characterization of typings in polymorphic type discipline (context) - Giannini, Della - 1988
24 The typechecking of programs with implicit type structure (context) - McCracken - 1984
23 Undecidability of the second-order unication problem (context) - Goldfarb - 1981
22 LEAP: a language with eval and polymorphism (context) - Pfenning, Lee - 1989
19 The subtyping problem for second-order types is undecidable (context) - Tiuryn, Urzyczyn - 1996
19 The subtyping problem for second-order types is undecidable (context) - Tiuryn, Urzyczyn - 1995
18 the undecidability of partial polymorphic type reconstructio.. - Pfenning - 1993
17 Partial polymorphic type inference is undecidable (context) - Boehm - 1985
14 The undecidability of the semiuni cation problem (context) - Kfoury, Tiuryn et al. - 1993
14 Type inference: Some results (context) - Giannini, Honsell et al. - 1993
9 The emptiness problem for intersection types (context) - Urzyczyn
9 The emptiness problem for intersection types (context) - Urzyczyn - 1993
7 Type inference in polymorphic type discipline (context) - Giannini, Della - 1991
7 The undecidability of Mitchell's subtyping relation - Wells - 1995
6 Number 7 in Cambridge Tracts in Theor (context) - Girard, Lafont et al. - 1989
6 Number 3 in Stockholm Studies in Philosophy (context) - Prawitz, Study - 1965
6 Type Inference for System F with and without the Eta Rule (context) - Wells - 1996
5 Type reconstruction in nite-rank fragments of the second-ord.. (context) - Kfoury, Tiuryn - 1992
5 Typability and type checking in the second-order -calculus .. (context) - Wells
4 Finitely stratied polymorphism (context) - Leivant - 1991
4 Typability is undecidable for F+eta - Wells - 1996
4 etation Fonctionnelle et Elimination des Coupures de l'Arith.. (context) - Girard - 1972
3 Type inference in System F plus subtyping (context) - Jim - 1995
3 A strongly normalizable term having no type in the System F (context) - Giannini, Honsell et al. - 1987
3 Second-order unication and type inference for Church-style p.. (context) - Schubert - 1998
2 a unication problem related to Kreisel's conjecture (context) - Pudl, On - 1988
2 Logic in Computer Sci (context) - th, Symp - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cee.hw.ac.uk/~jbw/papers/): More
The Undecidability of Mitchell's Subtyping Relationship - Wells (1995) (Correct)
New Notions of Reduction and Non-Semantic Proofs of Strong.. - Kfoury, Wells (1995) (Correct)
Compiling with Polymorphic and Polyvariant Flow Types - Turbak, Dimock, Muller, Wells (1997) (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