Labeled types and a new relation between types are added to the lambda calculus of objects as described in [5]. This relation is a trade-off between the possibility of having a restricted form of width subtyping and the features of the delegation-based language itself. The original type inference system allows both specialization of the type of an inherited method to the type of the inheriting object and static detection of errors, such as `message-not-understood'. The resulting calculus is an extension of the original one
This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incompl...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
International audienceThe last few years have seen the development of statically typed object based ...
International audienceLabeled types and a new relation between types are added to the lambda calculu...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
http://dl.acm.org/citation.cfm?id=2378060.2378061International audienceWe extend the type system for...
International audienceWe extend the type system for the Lambda Calculus of Objects [14] to account f...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
Subtyping appears in a variety of programming languages, in the form of the "automatic coercion...
We present a simple extension of typed lambda-calculus where functions can be overloaded by putting ...
Abstract. We investigate how to add coercive structural subtyping to a type system for simply-typed ...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
Existing type systems for object calculi [2] are based on invariant subtyping. Subtyping invariance ...
We show how type inference for object oriented programming languages with state can be performed wit...
This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incompl...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
International audienceThe last few years have seen the development of statically typed object based ...
International audienceLabeled types and a new relation between types are added to the lambda calculu...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
http://dl.acm.org/citation.cfm?id=2378060.2378061International audienceWe extend the type system for...
International audienceWe extend the type system for the Lambda Calculus of Objects [14] to account f...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
Subtyping appears in a variety of programming languages, in the form of the "automatic coercion...
We present a simple extension of typed lambda-calculus where functions can be overloaded by putting ...
Abstract. We investigate how to add coercive structural subtyping to a type system for simply-typed ...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
Existing type systems for object calculi [2] are based on invariant subtyping. Subtyping invariance ...
We show how type inference for object oriented programming languages with state can be performed wit...
This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incompl...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
International audienceThe last few years have seen the development of statically typed object based ...