DeepAI AI Chat
Log In Sign Up

A prototype-based approach to object reclassification

by   Ciaffaglione Alberto, et al.

We investigate, in the context of functional prototype-based lan- guages, a calculus of objects which might extend themselves upon receiving a message, a capability 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 checking with the flexibility normally found in dynamically typed languages.


page 1

page 2

page 3

page 4


Formalizing φ-calculus: a purely object-oriented calculus of decorated objects

Many calculi exist for modelling various features of object-oriented lan...

Type-Preserving Compilation of Class-Based Languages

The Dependent Object Type (DOT) calculus was designed to put Scala on a ...

A Well-typed Lightweight Situation Calculus

Situation calculus has been widely applied in Artificial Intelligence re...

System F^μ_ω with Context-free Session Types

We study increasingly expressive type systems, from F^μ – an extension o...

A Typed Slicing Compilation of the Polymorphic RPC Calculus

The polymorphic RPC calculus allows programmers to write succinct multit...

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...

Undecidability of D_<: and Its Decidable Fragments

Dependent Object Types (DOT) is a calculus with path dependent types, in...