V. Litvinov. Constraint-based polymorphism in Cecil. In Proceedings of the conference on Object Oriented Programming Systems Languages and Aplications, volume 33(10), pages 388-411, Vancouver, Canada, October 1998. 17 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Using Kinds to Type Partially-Polymorphic Methods - Bonniot (2002) (Correct)
....We rst consider the problem of typing homogeneous operations. Homogeneous operations are a speci c sort of binary (or n ary) operations, characterized by the shape of their domain. They accept several types as arguments. However, values of di erent types cannot be mixed in the same call [12]. A typical example is the comparison operator less: it can be applied to two strings, two integers, two dates, etc, but it should be ill typed to mix any two of these types in a call. We shall examine how it is possible (or not) to express this requirement in several type systems. Monomorphic ....
....less(Comparable other) Fig. 1. Monomorphic language these cases. F bounded polymorphic type system F bounded polymorphism [8] extends bounded polymorphism by allowing the bound of a variable to refer to the type variable being bound. It o ers a solution to type homogeneous operations [12]. abstract class Comparable T boolean less(T other) class String implements Comparable String boolean less(String other) class Date implements Comparable Date boolean less(Date other) We shall now propose a di erent solution to this typing problem. The ....
[Article contains additional citation context not shown here]
V. Litvinov. Constraint-based polymorphism in Cecil. In Proceedings of the conference on Object Oriented Programming Systems Languages and Aplications, volume 33(10), pages 388-411, Vancouver, Canada, October 1998. 17
Structural Interfaces for ML-sub - Bonniot (2000) (Correct)
....is not possible to give a function a type that matches this requirement. That is why arithmetic operators are treated apart 10 11 . In ML the most intuitive type we may write is: It may not be the case because of multiple inheritance, or for methods with at least two parameters. In Cecil[LC98], it has been proposed to represent this kind of type by such an enumeration. However, it not not satisfactory, since it does not work in an open world, where subclasses can be added after the type of the function has been given. Moreover, this approach leads to a very hish complexity of the type ....
Vassily Litvinov and Craig Chambers. Constraint-based polymorphism in cecil. Technical Report UW-CSE-98-01-01, University of Washington, 1998.
Type-checking multi-methods in ML (A modular approach) - Bonniot (2002) (Correct)
....problem. Furthermore, we de ne a sub language to express classes (constructors) multi methods (operators) and their static and dynamic semantics in a consistent manner, independently of the base language. 1. INTRODUCTION Several propositions have been made to type check multimethods. Cecil [19] has a powerful type system, and the issue of modular type checking has been explored extensively in that framework [20] However, its polymorphic type system is not even known to be decidable. ML [4] is a decidable type system for multi methods for which type checking is known to be tractable. ....
....returns the principal type of any well typed expression, or the error type. While the logicalbased presentation is certainly useful, we believe it is equally important to present type systems in a more compact way and with simple typing rules. Cecil has a polymorphic type system for multi methods [19]. However, this system is not known to be decidable. Chambers and Leavens [9] proposed decidable type checking rules and algorithms for multi methods in Cecil with only monomorphic types. Their system was more complex but also 10 more powerful than ours in that it allowed the separation of ....
V. Litvinov. Constraint-based polymorphism in Cecil. In Proceedings of the conference on Object Oriented Programming Systems Languages and Aplications, pages 388-411, Vancouver, Canada, October 1998.
Constraint-Based Polymorphism in Cecil: Towards a Practical and.. - Litvinov (1998) (7 citations) Self-citation (Litvinov) (Correct)
....Method constraints have been used more often since our experiment. 4 Related Work This section discusses related polymorphic type systems and alternative ways to address the situations described in Section 3. For space reasons, this discussion is concise; a more detailed comparison appears in [Litvinov Chambers 98] As a general comment, we have focused on expressiveness and convenience of our type system, whereas most of the work discussed here includes proofs of soundness and or decidability of typechecking. Analysis of these important properties is one direction of our future work. We start with ....
Vassily Litvinov and Craig Chambers. Constraint-Based Polymorphism in Cecil. Technical Report UWCSE -98-01-01, Department of Computer Science, University of Washington, January 1998. Available from http:// www.cs.washington.edu/research/projects/cecil/www/Papers/papers.html.
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