(Enter summary)
Abstract: We present a type system for a language based on F# , which
allows certain type annotations to be elided in actual programs.
Local type inference determines types by a combination
of type propagation and local constraint solving,
rather than by global constraint solving. We refine the previously
existing local type inference system of Pierce and
Turner[PT98] by allowing partial type information to be
propagated. This is expressed by coloring types to indicate
propagation directions. Propagating ... (Update)
Context of citations to this paper: More
...would not need any type annotation at all. This lead to local type inference [24] recently improved to colored local type inference [21]. These solutions are quite impressive. In particular, they include subtyping in combination with higher order polymorphism. However, they...
...remains to be explored. Other proposals try to combine subtyping in combination with higher order polymorphism and type inference [Car93, PT00, OZZ01]; however, they fail to type all ML programs. 6.2 On information flow analysis We plan to integrate the mechanism of abstract and...
Cited by: More
Using, Understanding, and Unraveling - The OCaml Language - From.. - Remy
(Correct)
Wobbly Types: Type Inference for Generalised Algebraic Data .. - Jones, Washburn, Weirich (2004)
(Correct)
ML^F - Raising ML to the Power of System F - Le Botlan, Rémy
(Correct)
Active bibliography (related documents): More All
1.9: Colored Local Type Inference - Martin Odersky Christoph (2001)
(Correct)
0.8: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.4: Polymorphic Subtyping in O'Haskell - Nordlander (2001)
(Correct)
Similar documents based on text: More All
0.5: A Functional View of Join - Odersky, Zenger, Zenger, Chen (1999)
(Correct)
0.4: How Good is Local Type Inference? - Hosoya, Pierce (1999)
(Correct)
0.4: Local Type Inference - Pierce, Turner (1998)
(Correct)
Related documents from co-citation: More All
12: Local type inference
- Pierce, Turner - 1998
11: Putting type annotations to work
- Odersky, Laufer - 1996
7: Extending ML with semi-explicit higher-order polymorphism
- Garrigue, R'emy - 1997
BibTeX entry: (Update)
Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. In Proceedings of the 28th Symposium on Principles of Programming Languages (POPL'01). ACM Press, January 2001. http://citeseer.ist.psu.edu/odersky01colored.html More
@article{ odersky01colored,
author = "Martin Odersky and Christoph Zenger and Matthias Zenger",
title = "Colored local type inference",
journal = "ACM SIG{\-}PLAN Notices",
volume = "36",
number = "3",
pages = "41--53",
year = "2001",
url = "citeseer.ist.psu.edu/odersky01colored.html" }
Citations (may not include all citations):
554
Design Patterns : Elements of Reusable Object-Oriented Softw.. (context) - Gamma, Helm et al. - 1994
461
Programming Language (context) - Stroustrup - 1991
245
Semantics of context-free languages (context) - Knuth - 1968
238
Pizza into Java: Translating theory into practice
- Odersky, Wadler - 1997
197
Dependent types in practical programming
- Xi, Pfenning - 1999
187
Type inclusion constraints and type inference
- Aiken, Wimmers - 1993
178
Making the future safe for the past: Adding genericity to th..
- Bracha, Odersky et al. - 1998
156
First-class polymorphism with type inference
- Jones - 1997
143
Theorems for free
- Wadler - 1989
88
Typechecking records and variants in a natural extension of .. (context) - Remy - 1989
76
Type inference for recursively constrained types and its app..
- Eifrig, Smith et al. - 1995
76
DEC Systems Research Center (context) - Cardelli, of et al. - 1993
68
Object Oriented Series (context) - Meyer, el et al. - 1992
61
Local type inference
- Pierce, Turner - 1998
54
Partial polymorphic type inference and higher-order unificat.. (context) - Pfenning - 1988
52
Simplifying subtyping constraints
- Pottier - 1996
45
Putting type annotations to work
- Odersky, Laufer - 1996
44
Typability and type checking in the second order #-calculus .. (context) - Wells - 1994
39
The reflexive chemical abstract machine and the join-calculu.. (context) - Fournet, Gonthier - 1996
25
Modula3 language definition (context) - Cardelli, Donahue et al. - 1992
17
Functional nets
- Odersky - 2000
17
A framework for type inference with subtyping
- Pottier - 1998
15
Colored local type inference
- Odersky, Zenger et al. - 2001
14
Pragmatic subtyping in polymorphic languages
- Nordlander - 1998
9
Reactive objects in a functional language - an escape from t..
- Nordlander, Carlsson - 1997
8
Simple usage polymorphism
- Wansbrough, Jones - 2000
7
specification and rationale (context) - Chambers, Team et al. - 1998
7
Constraint-based polymorphism in Cecil: Towards a practical ..
- Litvinov - 1998
4
Semi-explicit first-class polymorphism for ML
- Garrigue, Remy - 1999
3
Subtyping constraint types (context) - Trifonov, Smith - 1996
3
Principles and preliminary design for ML (context) - Appel, Cardelli et al. - 2000
1
Type inference with constrained types (context) - Odersky, Sulzmann et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://lampwww.epfl.ch/~zenger/research2.html): More
Colored Local Type Inference - Martin Odersky Christoph (2001)
(Correct)
Type-Safe Prototype-Based Component Evolution - Zenger (2002)
(Correct)
A Functional View of Join - Odersky, Zenger, Zenger, Chen (1999)
(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