A Lambda Calculus of incomplete objects - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

A Lambda Calculus of incomplete objects

Abstract

This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incomplete objects. Incomplete objects behave operationally as " standard " objects; their typing, instead, is different, as they may be typed even though they contain references to methods that are yet to be added. As a byproduct, incomplete objects may be typed independently of the order of their methods and, consequently, the operational semantics of the untyped calculus may be soundly defined relying on a permutation rule that treats objects as sets of methods. The new type system is a conservative extension of the system of [5] that retains the mytype specialization property for inherited methods peculiar to [5], as well as the ability to statically detect run-time errors such as message not understood.
Fichier principal
Vignette du fichier
1996-mfcs-96.pdf (285.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01156555 , version 1 (27-05-2015)

Identifiers

Cite

Viviana Bono, Michele Bugliesi, Luigi Liquori. A Lambda Calculus of incomplete objects. Mathematical Foundations of Computer Science 1996. 21st International Symposium, MFCS'96 Cracow, Poland, September 2–6, 1996 Proceedings, Sep 1996, Cracow, Poland. pp.218-229, ⟨10.1007/3-540-61550-4_150⟩. ⟨hal-01156555⟩

Collections

INRIA INRIA2
485 View
75 Download

Altmetric

Share

Gmail Facebook X LinkedIn More