On object extension - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

On object extension


The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell [15], and the Object Calculus of Abadi and Cardelli [2], have focused the attention of the scientific community on object calculi, as a foundation for the more traditional class-based calculi and as an original and safe style of programming. In this paper, we apply four type systems to the functional Lambda Calculus of Objects: (a) the Original type system [15]; (b) the Fisher's Ph.D type system [14]; (c) the Bruce's Matching-based type systems of Bono and Bugliesi [4], and (d) of Liquori [20]. We then compare these type systems with respect to the following points: – small-step versus big-step semantics; – implicit versus explicit polymorphism; – Curry style versus Church style; – static type checking versus run-time type checking; – object extension and/or binary methods versus object subsumption (short account).
Fichier principal
Vignette du fichier
1998-ecoop-98.pdf (317.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01154560 , version 1 (22-05-2015)



Luigi Liquori. On object extension. ECOOP, Jul 1998, Brussels, Belgium. pp.498-522, ⟨10.1007/BFb0054105⟩. ⟨hal-01154560⟩


191 View
91 Download



Gmail Facebook Twitter LinkedIn More