A lambda calculus of objects and method specialization

Author

Mitchell, John C. ; Honsell, Furio ; Fisher, Kathleen

Author_Institution

Dept. of Comput. Sci., Stanford Univ., CA, USA

fYear

1993

fDate

19-23 Jun 1993

Firstpage

26

Lastpage

38

Abstract

An untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages, is presented. A type inference system allows static detection of errors, such as message not understood, while at the same time allowing the type of an inherited method to be specialized to the type of the inheriting object. Type soundness, in the form of a subject-reduction theorem, is proved, and examples illustrating the expressiveness of the pure calculus are presented

Keywords

lambda calculus; object-oriented languages; object-oriented programming; type theory; delegation-based object-oriented languages; inherited method; method specialization; object primitives; subject-reduction theorem; type inference system; type soundness; untyped lambda calculus; Calculus; Computer errors; Computer science; Equations; Object oriented modeling; Object oriented programming; Optimization methods; Scholarships; Springs;

fLanguage

English

Publisher

ieee

Conference_Titel

Logic in Computer Science, 1993. LICS '93., Proceedings of Eighth Annual IEEE Symposium on

Conference_Location

Montreal, Que.

Print_ISBN

0-8186-3140-6

Type

conf

DOI

10.1109/LICS.1993.287603

Filename

287603