This paper describes a type preserving and computationally adequate interpretation of a full-edged object calculus that supports message passing and constructs for object update and extension. The target theory is a higher-order -calculus with records and recursive folds/unfolds, polymorphic and recursive types, and subtyping. The interpretation specializes to calculi of nonextensible objects, and validates the expected subtyping relationship
Abstract. Subtyping in first order object calculi is studied with respect to the logical semantics o...
I present a type-theoretic encoding of objects that interprets method dispatch by self-application (...
We present a simple extension of typed -calculus where functions can be over-loaded by putting diere...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
In this paper we investigate, in the context of functional prototype-based languages, objects which ...
AbstractWe describe an object calculus allowing object extension and structural subtyping. Each obje...
International audienceWe investigate a first-order extension of the Theory of Primitive Objects of [...
We present an interpretation of typed object-oriented concepts in terms of well-understood, purely p...
http://dl.acm.org/citation.cfm?id=2378060.2378061International audienceWe extend the type system for...
We investigate, in the context of functional prototype-based languages, objects which might extend t...
The fi rst part of this thesis consists of two research papers and concerns the fi eld of denotation...
In this paper we formally present a layered calculus for encapsulated modification of objects. Its d...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
Abstract. Subtyping in first order object calculi is studied with respect to the logical semantics o...
I present a type-theoretic encoding of objects that interprets method dispatch by self-application (...
We present a simple extension of typed -calculus where functions can be over-loaded by putting diere...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
International audienceIn this paper we investigate, in the context of functional prototype-based lan...
In this paper we investigate, in the context of functional prototype-based languages, objects which ...
AbstractWe describe an object calculus allowing object extension and structural subtyping. Each obje...
International audienceWe investigate a first-order extension of the Theory of Primitive Objects of [...
We present an interpretation of typed object-oriented concepts in terms of well-understood, purely p...
http://dl.acm.org/citation.cfm?id=2378060.2378061International audienceWe extend the type system for...
We investigate, in the context of functional prototype-based languages, objects which might extend t...
The fi rst part of this thesis consists of two research papers and concerns the fi eld of denotation...
In this paper we formally present a layered calculus for encapsulated modification of objects. Its d...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
Abstract. Subtyping in first order object calculi is studied with respect to the logical semantics o...
I present a type-theoretic encoding of objects that interprets method dispatch by self-application (...
We present a simple extension of typed -calculus where functions can be over-loaded by putting diere...