ACM Home Page
Please provide us with feedback. Feedback
A lambda calculus of objects with self-inflicted extension
Full text PdfPdf (1.36 MB)
Source Conference on Object Oriented Programming Systems Languages and Applications archive
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications table of contents
Vancouver, British Columbia, Canada
Pages: 166 - 178  
Year of Publication: 1998
ISBN:1-58113-005-8
Also published in ...
Authors
Pietro Di Gianantonio  Dip. di Matematica ed Informatica Università di Udine I-33100 Udine, Italy
Furio Honsell  Dip. di Matematica ed Informatica Università di Udine I-33100 Udine, Italy
Luigi Liquori  Dip. di Matematica ed Informatica Università di Udine I-33100 Udine, Italy
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/286936.286955
What is a DOI?

ABSTRACT

In this paper we investigate, in the context of functional prototype-based languages, objects which might extend themselves upon receiving a message. The possibility for an object of extending its own "self", referred to by Cardelli, as a self-inflicted operation, is novel in the context of typed object-based languages. We present a sound type system for this calculus which guarantees that evaluating a well-typed expression will never yield a message-not-found run-time error. We give several examples which illustrate the increased expressive power of our system with respect to existing calculi of objects. The new type system allows also for a flexible width-subtyping, still permitting sound method override, and a limited form of object extension. The resulting calculus appears to be a good starting point for a rigorous mathematical analysis of class-based languages.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
G. Bell~. Some Remarks on Lambda Calculus of Objects. Technical report, Dipartimento di Matematica ed Informatica, Universit~ di Udine, 1994.
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
K. Bruce, L. Petersen, and A. Fiech. Subtyping Is Not a Good "Match" for Object-Oriented Languages. In Proc. of ECOOP, volume 1241 of Lecture Notes in Computer Science, pages 104-127. Springer-Verlag, 1997.
 
11
K.B. Bruce. A Paradigmatic Object-Oriented Programming Language: Design, Static Typing and Semantics. Journal of Functional Programming, 4(2):127- 206, 1994.
 
12
L. Cardelli. A Language with Distributed Scope. Computing System, 8(1):27-59, 1995.
13
 
14
 
15
 
16
 
17
 
18
 
19
 
20
L. Liquori. An Extended Theory of Primitive Objects: First Order System. In Proc. of ECOOP, volume 1241 of Lecture Notes in Computer Science, pages 146-169. Springer-Verlag, 1997.
 
21
P. Paladin. Teoremi di Congruenza per Lambda-Calcoli Orientati agli Oggetti. Master's thesis, Dipartimento di Matematica ed Informatica, Universit~ di Udine, 1993. In Italian.
 
22
Gordon Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, 1981.
 
23
 
24
J.G. Riecke and C. Stone. Privacy via Subsumption. In Electronic proceedings of FOOL-98, 1998.
 
25
M. Wand. Complete Type inference for Simple Objects. In Proc. of LICS, pages 37-44. IEEE Press, 1987.


Collaborative Colleagues:
Pietro Di Gianantonio: colleagues
Furio Honsell: colleagues
Luigi Liquori: colleagues