Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01156555
Contributor : Luigi Liquori <>
Submitted on : Wednesday, May 27, 2015 - 3:43:13 PM
Last modification on : Thursday, June 14, 2018 - 10:54:03 AM
Long-term archiving on: : Monday, April 24, 2017 - 3:46:30 PM

File

1996-mfcs-96.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

574

Files downloads

186