International audienceWe investigate, in the context of functional prototype-based languages , a calculus of objects which might extend themselves upon receiving a message, a possibility referred to by Cardelli as a self-inflicted operation. 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. The resulting calculus is an attempt towards the definition of a language combining the safety advantage of static type check with the flexibility normally found in dynamically typed languages
Abstract. Static and dynamic type systems have well-known strengths and weaknesses. In previous work...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
Prototype-based languages are currently proposed as a substitute to class-based languages for a high...
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...
In this paper we investigate, in the context of functional prototype-based languages, objects which ...
The demands of developing modern, highly dynamic applications have led to an increasing interest in ...
International audienceWe investigate a first-order extension of the Theory of Primitive Objects of [...
International audienceThis paper extends the Lambda Calculus of Objects as proposed in [5] with a ne...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
International audienceThe last few years have seen the development of statically typed object based ...
This paper provides a sound foundation for autonomous objects communicating by remote method invo- c...
International audienceThis paper provides a sound foundation for autonomous objects communicating by...
Object-based languages with dynamic type systems are popular because they accelerate the development...
We have designed and implemented a type inference algorithm for the full SELF language. The algorit...
Abstract. Static and dynamic type systems have well-known strengths and weaknesses. In previous work...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
Prototype-based languages are currently proposed as a substitute to class-based languages for a high...
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...
In this paper we investigate, in the context of functional prototype-based languages, objects which ...
The demands of developing modern, highly dynamic applications have led to an increasing interest in ...
International audienceWe investigate a first-order extension of the Theory of Primitive Objects of [...
International audienceThis paper extends the Lambda Calculus of Objects as proposed in [5] with a ne...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
International audienceThe last few years have seen the development of statically typed object based ...
This paper provides a sound foundation for autonomous objects communicating by remote method invo- c...
International audienceThis paper provides a sound foundation for autonomous objects communicating by...
Object-based languages with dynamic type systems are popular because they accelerate the development...
We have designed and implemented a type inference algorithm for the full SELF language. The algorit...
Abstract. Static and dynamic type systems have well-known strengths and weaknesses. In previous work...
The present paper introduces an implicitly typed object calculus intended to capture intrinsic aspec...
Prototype-based languages are currently proposed as a substitute to class-based languages for a high...