Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. In ACM Symposium on Principles of Programming Languages, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the opening of polymorphic values fully implicit. Actually, these works rely on unification mechanisms and do not consider subtyping; extending them in this direction 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 polymorphic data types described in the current paper in the Flow Caml system, our prototype information flow analyzer for the Caml language. We here give a taste of ....

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3):41--53, March 2001.

....but explicitly typed language, say F : and perform a sufficient amount of type inference, so that simple programs ideally including all ML programs 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 fail to type all ML programs. Moreover, they also fail to provide an intuitive and simple specification of where type annotations are mandatory. In this work, ....

....second order terms is unification under a mixed prefix [18] However, our notion of prefix and its role in abstracting polytypes is quite different. Actually, none of the above works did consider subtyping at all. This is a significant difference with proposals based on local type inference [2, 24, 21] where subtyping is a prerequisite. The addition of subtyping to our framework remains to be explored. Furthermore, beyond its treatment of subtyping, local type inference also brings the idea that explicit type annotations can be propagated up and down the source tree according to fixed ....

M. Odersky, C. Zenger, and M. Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3):41--53, Mar. 2001.

....the opening of polymorphic value fully implicit. Actually, these works rely on uni cation mechanisms and do not consider subtyping; extending them in this direction 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 ow analysis We plan to integrate the mechanism of abstract and polymorphic data types described in the current paper in the Flow Caml system, our prototype information ow analysis for the Caml language. We here give a taste of ....

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3):41-53, March 2001.

....the opening of polymorphic value fully implicit. Actually, these works rely on uni cation mechanisms and do not consider subtyping; extending them in this direction 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 ow analysis We plan to integrate the mechanism of abstract and polymorphic data types described in the current paper in the Flow Caml system, our prototype information ow analysis for the Caml language. We here give a taste of ....

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3), 2001.

....but explicitly typed language, say F : and perform a sufficient amount of type inference, so that simple programs ideally including all ML programs would not need any type annotation at all. This lead to local type inference [PT98] recently improved to colored local type inference [OZZ01] These solutions are quite impressive. In particular, they include subtyping in combination with higher order polymorphism. However, they fail to type all ML programs. Moreover, they also fail to provide an intuitive and simple specification of where type annotations are mandatory. In this ....

....is unification under a mixed prefix [Mil92] However, the notion of prefix in their work is rather different and does not express sharing . Actually, none of the above works did consider subtyping at all. This is a significant difference with proposals based on local type inference [Car93, PT98, OZZ01] where subtyping is a prerequisite. The addition of subtyping to our framework remains to be explored. Furthermore, beyond its treatment of subtyping, local type inference also brings the idea that explicit type annotations can be propagated up and down the source tree according to fixed ....

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3):41--53, March 2001.

....Our extension of Odersky and L aufer s system can be seen as a natural generalisation of the existing type inference algorithm to arbitrary ranked polymorphism. Another possibility would have been to abandon Hindley Damas Milnerstyle type inference in preference for local type inference [15, 14]. However, we felt that would have been too great a change for Haskell. Thirdly, we examined Russo s semantics for ML signatures and structures [17] in order to understand how the dot notation of ML modules interacts with ordinary existential and universal polymorphism. As a result, we re ned ....

M. Odersky, C. Zenger, and M. Zenger. Colored local type inference. In Proceedings of the 28th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'01), London, England, pages 41-53. ACM Press, Jan. 2001.

....(as reported in [Nor98] although their algorithm switches between strict phases of inference and checking, which ours does not. A recent proposal for colored local type inference, that allows propagation of partial type information in a top down manner, is closer to our work in this respect [OZZ01] Cardelli s implementation of F# [Car93] contains a partial type inference algorithm that, like ours, uses unification to solve constraints involving unbound type variables. However, this greedy algorithm solves all constraints, including those on variables in the assumption environment, at ....

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored Local Type Inference. In ACM Symposium on Principles of Programming Languages, January 2001.

....types. Instead, we split a colored type into a prototype that contains the information which is propagated down the tree, and a type, which represents the completely computed You are holding a colored version of the paper. If your medium does not support colors you should refer to the original [OZZ01] type of a term. Missing information in the prototype is expressed by the special symbol . We have shown that the algorithm is sound and complete with respect to the type system. The type system is presented here with second order lambda calculus as the source language, but its ideas have ....

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.

....where the function type constructor is inherited, its argument type T is synthesized, and its result type U is arbitrary. The inherited and synthesized parts of a type can alternatively and more concisely be characterized by coloring them. A second version of this paper intended for color output [OZZ00] uses a red font for inherited parts of a type and a blue font for synthesized parts. Black color is reserved for types with arbitrary inherited or synthesized parts. In the rest of this paper we develop these ideas in a type system for second order lambda calculus with records and subtyping. We ....

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. http://lampwww.epfl.ch/papers/clti-color.ps.gz, 2000.

....and present a new notation since we wanted to support both functions and objects in a way which was as simple as possible. The notation used here is statically typed. Its type theoretic foundation can be developed along the lines of system F 2 with subtyping [CMMS94] Local type inference [PT98, OZZ00] is used to reduce the amount of type annotations which needs to be given explicitly. Details of the type system are not covered in these notes. The rest of this paper is structured as follows. Section 1 introduces a purely functional subset of functional nets. Section 2 presents the full ....

Martin Odersky, Matthias Zenger, and Christoph Zenger. Colored local type inference. submitted for publication, available from http://lampwww.epfl.ch/papers/clti/clti-colored.ps.gz, July 2000.

....a polymorphic type system with F bounded quantification[CCH 89] As a first approximation, it can be understood as a variant of system F # # , extended with (nominal) records and mutable variables. We often elide redundant type information, assuming that a local type inference system [PT98, OZZ01] is available to supply the omitted annotations. A record type definition introduces a new record with given supertypes, type components and value components. Here is an example: type R = S type t = Int val f: t # t val z: t This definition introduces the type R as a subtype of type ....

Martin Odersky, Matthias Zenger, and Christoph Zenger. Colored local type inference. In Proc. ACM Symposium on Principles of Programming Languages, 2001.

....types. Instead, we split a colored type into a prototype that contains the information which is propagated down the tree, and a type, which represents the completely computed 1 You are holding a colored version of the paper. If your medium does not support colors you should refer to the original [OZZ01] 2 type of a term. Missing information in the prototype is expressed by the special symbol . We have shown that the algorithm is sound and complete with respect to the type system. The type system is presented here with second order lambda calculus as the source language, but its ideas ....

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.

No context found.

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. In ACM Symposium on Principles of Programming Languages, 2001.

No context found.

Martin Odersky, Matthias Zenger, and Christoph Zenger. Colored local type inference. In 28th ACM Symposium London, January 2001. ACM.

No context found.

Martin Odersky, Christoph Zenger, and Matthias Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3):41--53, March 2001.

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