In this paper we investigate, in the context of functional prototype-based languages, objects which might extend themselves upon receiving a message. The possibility for an object of extending its own "self", referred to by Cardelli, as a self-inflicted operation, is novel in the context of typed object-based languages. We present a sound type system for this calculus which guarantees that evaluating a well-typed expression will never yield a message-not-found runtime error. We give several examples which illustrate the increased expressive power of our system with respect to existing calculi of objects. The new type system allows also for a flexible width-subtyping, still permitting sound method override, and a limited form of object exten...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
This paper describes a type preserving and computationally adequate interpretation of a full-edged o...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
We investigate, in the context of functional prototype-based languages, objects which might extend t...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
International audienceWe investigate, in the context of functional prototype-based languages , a cal...
This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incompl...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
International audienceThe last few years have seen the development of statically typed object based ...
Many calculi exist for modelling various features of object-oriented languages. Many of them are bas...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
We present a simple extension of typed lambda-calculus where functions can be overloaded by putting ...
. This paper presents an imperative object calculus designed to support class-based programming via ...
International audienceThis paper extends the Lambda Calculus of Objects as proposed in [5] with a ne...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
This paper describes a type preserving and computationally adequate interpretation of a full-edged o...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
We investigate, in the context of functional prototype-based languages, objects which might extend t...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
International audienceWe investigate, in the context of functional prototype-based languages , a cal...
This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incompl...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
International audienceThe last few years have seen the development of statically typed object based ...
Many calculi exist for modelling various features of object-oriented languages. Many of them are bas...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
We present a simple extension of typed lambda-calculus where functions can be overloaded by putting ...
. This paper presents an imperative object calculus designed to support class-based programming via ...
International audienceThis paper extends the Lambda Calculus of Objects as proposed in [5] with a ne...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
This paper describes a type preserving and computationally adequate interpretation of a full-edged o...