Practical type inference for arbitrary-rank types

Practical type inference for arbitrary-rank types (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dimitrios Vytiniotis , Stephanie Weirich , Simon Peyton-jones

Venue:	Journal of Functional Programming
Citations:	78 - 18 self

BibTeX

@ARTICLE{Vytiniotis05practicaltype,
    author = {Dimitrios Vytiniotis and Stephanie Weirich and Simon Peyton-jones},
    title = {Practical type inference for arbitrary-rank types},
    journal = {Journal of Functional Programming},
    year = {2005},
    volume = {17}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Note: This document accompanies the paper “Practical type inference for arbitrary-rank types ” [6]. Prior reading of the main paper is required. 1 Contents

Citations

874	A theory of type polymorphism in programming - Milner - 1978
579	Types and Programming Languages - Pierce - 2002
323	Principal type-schemes for functional programs - Damas, Milner - 1982
219	TIL: A TypeDirected Optimizing Compiler for ML - Tarditi, Morrisett, et al. - 1996
173	A short cut to deforestation - Gill, Launchbury, et al. - 1993
150	Local type inference - Pierce, Turner
109	Unification under a mixed prefix - Miller - 1992
97	Compiling with Types - Morrisett - 1995
96	Polymorphic type inference and containment - MITCHELL - 1988
92	Type Assignment in Programming Languages - Damas - 1984
91	Putting type annotations to work - Odersky, Läufer - 1996
88	Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell,” in Engineering theories of software construction - Jones
86	An overview of the FLINT/ML compiler - Shao - 1997
84	A new approach to generic functional programming - Hinze - 2000
76	A transformation-based optimiser for Haskell. Science of Computer Programming - Jones, Santos - 1998
73	Basic polymorphic typechecking - Cardelli - 1987
70	A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus - Kfoury, Wells - 1994
66	Basic Simple Type Theory - Hindley - 1997
62	De Bruijn notation as a nested datatype - Bird, Paterson - 1999
53	Typing dynamic typing - Baars, Swierstra - 2002
53	Colored local type inference - Odersky, Zenger, et al. - 2001
52	Scrap your boilerplate: a practical approach to generic programming - Lämmel, Jones - 2003
51	Typability and type checking in system F are equivalent and undecidable. Annals of Pure and Applied Logic - Wells - 1999
49	Proofs about a folklore let-polymorphic type inference algorithm - Lee, Yi - 1998
37	Type error slicing in implicitly typed higher-order languages - Haack, Wells - 2004
27	Scripting the Type Inference Process - Heeren, Hage, et al. - 2003
27	From fast exponentiation to square matrices: an adventure in types - Okasaki - 1999
22	Compositional explanation of types and algorithmic debugging of type errors - Chitil - 2001
22	Manufacturing datatypes - Hinze - 2001
19	Qualified types for MLF - Leijen, Löh - 2005
18	Semi-explicit first-class polymorphism for ML - Garrigue, Remy - 1999
17	Type reconstruction in finite rank fragments of second-order lambda calculus - Kfoury, Tiuryn - 1992
11	MLF: Raising ML to the power of System F - BOTLAN, RÉMY - 2003
11	Advanced Topics in Types and Programming Languages - PIERCE - 2004
9	A simple applicative language - Clement, Despeyroux, et al. - 1986
9	Lexically scoped type variables - Jones, Shields - 2004
9	Lexically scoped type variables. Microsoft Research. Available at http://research.microsoft.com/Users/simonpj/papers/scoped-tyvars - Shields, Jones, et al. - 2002
9	A sequent calculus for subtyping polymorphic types - Tiuryn - 2001
8	Principality and decidable type inference for intersection types - Kfoury, Wells - 1999
4	Simple, partial type inference for System F, based on type containment - Rémy - 2005
4	The subtyping problem for second order types is undecidable - Tiuryn, Urzyczyn - 1996
3	Type reconstruction in rank fragments of secondorder lambda calculus - Kfoury - 1992
2	A type checker. Pages 163–182 of: Peyton Jones, SL (ed), The implementation of functional programming languages - Hancock - 1987
2	Typing Haskell in Haskell. Meijer, Erik (ed - Jones - 1999
2	The essence of principal typings. Pages 913–925 of: Proc. 29th int’l coll. automata, languages, and programming - Wells - 2002
2	ISBN 0-89791-595-X. type inference for arbitrary-rank types 81 - Press - 1990
2	Higher order unification 30 years later. 15th international workshop on higher order logic theorem proving and its applications (IWHOLTP’02). LNCS - Huet - 2002
2	MLF: raising ML to the power - LeBotlan, &Rémy - 2003
2	A logic of subtyping (extended abstract). Pages 292–299 of: \|lics95 - Longo, Milsted, et al. - 1995
1	The system F of variable types: years later. Huet, G (ed), Logical foundations of functional programming - Girard - 1990