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 run-time error. The resulting calculus appears to be also a good starting point for a rigorous mathematical analysis of class-based languages. Ou
In previous work on the language Fickle and its extension Fickle_II Dezani and us introduced languag...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
This paper describes a type preserving and computationally adequate interpretation of a full-edged o...
In this paper we investigate, in the context of functional prototype-based languages, objects which ...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
International audienceWe investigate, in the context of functional prototype-based languages , a cal...
The demands of developing modern, highly dynamic applications have led to an increasing interest in ...
. We have designed and implemented a type inference algorithm for the full Self language. The algori...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
Object-based languages with dynamic type systems are popular because they accelerate the development...
Reclassification changes the class membership of an object at run-time while retaining its identity....
We present an interpretation of typed object-oriented concepts in terms of well-understood, purely p...
Abstract. Static and dynamic type systems have well-known strengths and weaknesses. In previous work...
We have designed and implemented a type inference algorithm for the full Self language. The algorith...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
In previous work on the language Fickle and its extension Fickle_II Dezani and us introduced languag...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
This paper describes a type preserving and computationally adequate interpretation of a full-edged o...
In this paper we investigate, in the context of functional prototype-based languages, objects which ...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
International audienceWe investigate, in the context of functional prototype-based languages , a cal...
The demands of developing modern, highly dynamic applications have led to an increasing interest in ...
. We have designed and implemented a type inference algorithm for the full Self language. The algori...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
Object-based languages with dynamic type systems are popular because they accelerate the development...
Reclassification changes the class membership of an object at run-time while retaining its identity....
We present an interpretation of typed object-oriented concepts in terms of well-understood, purely p...
Abstract. Static and dynamic type systems have well-known strengths and weaknesses. In previous work...
We have designed and implemented a type inference algorithm for the full Self language. The algorith...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
In previous work on the language Fickle and its extension Fickle_II Dezani and us introduced languag...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
This paper describes a type preserving and computationally adequate interpretation of a full-edged o...