Viviana Bono, Michele Bugliesi, and Luigi Liquori. A lambda calculus of incomplete objects. In Proceedings, Mathematical Foundations of Computer Science, volume 1113 of Lecture Notes in Computer Science, pages 218--229. Springer-Verlag, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in their work. Fisher et al. FHM94] define a modification of the calculus designed to represent objects. They add records with object extension and field replacement, and develop a type theory for their model. They model self as the implicit parameter in every method invocation. Bono et al. [BBL96] [BBDCL97] extended this, looking more closely at the typing of object extension. Liquori and Castagna [LC96] added explicit types in order to clean up the type system. Abadi and Cardelli [AC96b] developed model similar to Fisher et al. s called the calculus in greater depth. They provide ....

Viviana Bono, Michele Bugliesi, and Luigi Liquori. A lambda calculus of incomplete objects. In MFCS, pages 218--229, 1996.

....recent work along this line is [12] Fisher and Mitchell [20] also relate classes to data abstraction. This work assumes a functional setting for objects, but some of the ideas deal with state. Work on specification of stateful objects includes [5, 28, 29, 30] in addressing subtyping issues and [3, 6] in addressing self reference issues. The major developments in the research on Algol like languages are collected in [43] Tennent [58] gives a gentle introduction to the concepts as of 1994. 2 The language IA The language IA is an extension of Idealized Algol with classes. Thus, it is a ....

.... Gamma holds in the state set Q and environment j 2 dom( Gamma] E Q ) References [1] Abadi, M. and Cardelli, L. An imperative object calculus. Theory and Practice of Object Systems 1, 3 (1996) 151 166. 2] Abadi, M. and Cardelli, L. A Theory of Objects. Springer Verlag, 1996. [3] Abadi, M. and Leino, R. M. A logic of object oriented programs. In TAPSOFT 97 and CAAP FASE, vol. 1214 of LNCS. Springer Verlag, 1997, pp. 682 696. 4] Abramsky, S. and McCusker, G. Linearity, sharing and state. In Algol like Languages [43] ch. 20. 5] America, P. Designing an ....

[Article contains additional citation context not shown here]

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In Proceedings, Mathematical Foundations of Computer Science, volume 1113 of Lecture Notes in Computer Science, pages 218--229. Springer-Verlag, 1996.

....the types must match if the object is extended by a new method with the same name as a hidden method. The idea is related to an old idea: Jategaonkar and Mitchell [17] and R emy [25] use types that keep track of which methods must be absent from an object. Bono, Bugliesi, Dezani, and Liquori [4, 3, 2] take a different approach: object types contain a conservative approximation of which methods each method invokes via self. A collection of methods can be forgotten via subsumption if no remaining methods might invoke a member of this collection. This is not useful, however, for the purposes of ....

Viviana Bono, Michele Bugliesi, and Luigi Liquori. A lambda calculus of incomplete objects. In Proceedings, Mathematical Foundations of Computer Science, volume 1113 of Lecture Notes in Computer Science, pages 218--229. Springer-Verlag, 1996.

....typing rules for objects with extension and both deep and width subtyping were roughly drafted without any formal treatment. A similar approach has also been independently proposed by Bono, Liquori and others. Their first related work [6] has later lead to many closely related proposals [8, 7, 4, 18, 17, 19]. Most of these are extensions of the Fisher Honsel calculus of objects [20] The differences between their approach and the one of [3] which is also ours) are not always significant but they make a close comparisson more difficult. Only two of these works [19, 18] are extensions of the ....

Viviana Bono and Michele Bugliesi. A lambda calculus of incomplete objects. In Proceedings of Mathematical Foundations of Computer Science(MFCS), number 1113 in Lecture Notes in Computer Science, pages 218--229, 1996.

....the types must match if the object is extended by a new method with the same name as a hidden method. The idea is related to an old idea: Jategaonkar and Mitchell [15] and Remy [22] use types that keep track of which methods must be absent from an object. Bono, Bugliesi, Dezani, and Liquori [4, 3, 2] take a different approach: object types contain a conservative approximation of which methods each method invokes via self. A collection of methods can be forgotten via subsumption if no remaining methods might invoke a member of this collection. This is not useful, however, for the purposes of ....

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In Proceedings, Mathematical Foundations of Computer Science, volume 1113 of Lecture Notes in Computer Science, pages 218--229. Springer-Verlag, 1996.

....weak overriding operator. Anyway, no possibility of overriding is considered (no virtual components) the main aim is to introduce in SML modules the possibility that recursive definitions span module boundaries. The proposal turns out to be very specific and tied to the features of SML. Finally, [12] presents a lambda calculus of incomplete objects, i.e. objects (records of methods) which may be typed even though they contain references to methods that are yet to be added; it is easy to recognize that these incomplete objects are mixins. The work of Bracha has been by far the most important ....

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In W.Penczek and A. Sza/las, editors, Mathematical Foundations of Computer Science 1996, number 1113 in Lecture Notes in Computer Science, pages 218--229, Berlin, 1996. Springer Verlag.

No context found.

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS, volume 1113 of Lecture Notes in Computer Science, pages 218{

....typing rules for objects. In Section 4.3 we first prove the subject reduction property and then use it to show type soundness. We conclude in Section 4.4 with some final remarks. A preliminary version of this calculus, studied in collaboration with Michele Bugliesi and Luigi Liquori, appeared in [BBL96]. The syntax of the untyped calculus is as for LCO. An expression can be any of the following: forms are as in LCO, namely: he 1 m=e 2 i replaces e 1 s method body for m with e 2 . The expression he 1 m=e 2 i is defined only when e 1 denotes an object that enforced statically by the ....

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS'96, volume 1113 of LNCS, pages 218--229. Springer-Verlag, 1996.

....and mixins may be coded in this calculus, prove a type soundness theorem (via a subject reduction property) and give a sound and complete typing algorithm. 1 Introduction Many theoretical studies have addressed the problem of modeling object oriented languages via primitive operations [2,18,17,6,28,30]. Most of these approaches have centered on object based calculi, where objects, not classes, are seen as the primitive building blocks. However, statically typed, class based languages like Simula [5] Ei#el [26] C [16,31] and Java [4] are the most common form of object oriented language. ....

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In Proc. MFCS '96, pages 218--229. Springer LNCS 1113, 1996. 462

....a treatment of incomplete objects. The main novelties over previous work are the use of subtype bounded quanti cation to capture a new and more direct rendering of MyType polymorphism, and a uniform treatment for other features that were accounted for via di erent systems in subsequent extensions [7, 6] of [16] The new system provides for (i) appropriate type specialization of inherited methods, ii) static detection of errors, iii) width subtyping compatible with object extension, and (iv) sound typing for partially speci ed objects. Keywords: Objects, Type System, Subtyping, Type ....

....objects are created from existing objects used as prototypes, and inheritance occurs at the object level. Despite this di erence, the research on object based languages has greatly bene ted from the experience gained on class based languages. For instance, the typing of extensible objects in [16, 7, 17, 6, 24, 21] relies essentially on the same notion of row variable introduced by [26] to type extensible records. Similarly, the notion of recursive recordtypes, introduced to provide functional models of class based languages [12, 9, 14, 13] has then been re ned into that of Self types in type systems for ....

[Article contains additional citation context not shown here]

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In MFCS'96, LNCS 1113, 218-229, Springer-Verlag, 1996.

.... Obj has spurred an intense research in type assignment systems for object calculi. Several calculi inspired by Obj, which accommodate various extra features such as incomplete objects, subtyping, encapsulation, imperative features, have appeared in the literature in recent years (see e.g. [18, 7, 15, 5, 4, 19, 6]) Independently, Abadi and Cardelli have introduced, with the same foundational spirit, the Object Calculus [1] This is a calculus of typed objects and allows for a natural treatment of subtyping and hence of code reuse. The essential di erences between Obj and the Object Calculus of Abadi ....

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS, volume 1113 of Lecture Notes in Computer Science, pages 218{ 229. Springer-Verlag, 1996.

....extension are given in Section 5. Section 6 considers an interesting encoding of classes as objects that share a lot of similarities with the object oriented language Smalltalk 80 [15] The last section is devoted to the comparison with the Lambda Calculus of Objects of [12] and related papers [14, 10, 21, 9, 18, 8, 7]) Baby Modula 3 of [1] and contains also open problems and the conclusions. We assume that the reader is familiar with some object oriented concepts such as delegation based object calculi, type and subtype systems, self types. Some knowledge of the seminal papers [12, 5] and the above cited ....

....dynamic typing . This calculus has a sound and decidable type system, width subtyping on labeled object types, and it allows for first class method bodies that can be passed as function arguments. This increase the expressiveness of the language, since it allows to write portable methods . In [9], a more flexible typing system for the Lambda Calculus of Objects is given, by allowing objects to be typed independently from the order of their method additions. This extension also gives provision for method invocation when the receiver of the message is an incomplete object, i.e. an object ....

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS-96, volume 1113 of LNCS, pages 218--229. Springer-Verlag, 1996.

No context found.

V. Bono, M. Bugliesi and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS '96, International Symposium of Mathematical Foundation of Computer Science, 1996, Cracovie, Pologne, Lecture Notes in Computer Science 1113, pages 218-229, Springer-Verlag, 1996.

No context found.

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In Proc. MFCS '96, pages 218--229. Springer LNCS 1113, 1996.

....treatment of incomplete objects. The main novelties over previous work are the use of subtype bounded quantification to capture a new and more direct rendering of MyType polymorphism, and a uniform treatment for other features that were accounted for via different systems in subsequent extensions [7, 6] of [16] The new system provides for (i) appropriate type specialization of inherited methods, ii) static detection of errors, iii) width subtyping compatible with object extension, and (iv) sound typing for partially specified objects. Keywords: Objects, Type System, Subtyping, Type ....

....objects are created from existing objects used as prototypes, and inheritance occurs at the object level. Despite this difference, the research on object based languages has greatly benefited from the experience gained on class based languages. For instance, the typing of extensible objects in [16, 7, 17, 6, 24, 21] relies essentially on the same notion of row variable introduced by [26] to type extensible records. Similarly, the notion of recursive recordtypes, introduced to provide functional models of class based languages [12, 9, 14, 13] has then been refined into that of Self types in type systems for ....

[Article contains additional citation context not shown here]

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In MFCS'96, LNCS 1113, 218--229. Springer-Verlag, 1996.

....may be coded in this calculus, prove a soundness theorem (via a subject reduction property) and give a sound and complete typing algorithm. 1 Introduction In the past few years, many theoretical studies have addressed the problem of modeling object oriented languages via primitive operations [AC96b, FHM94, Fis96, BBL96, PT94, RS98]. Most of these approaches have centered on object based calculi, where objects, not classes, are seen as the primitive building blocks. However, statically typed, class based languages like Simula [BDMN73] Eiffel [Mey92] C [ES90, Str94] and Java [AG96] are the most common form of ....

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In Proc. MFCS '96, pages 218--229. Springer LNCS 1113, 1996.

....calculus Obj has spurred an intense research in type assignment systems for object calculi. Several calculi inspired by Obj, which accommodate various extra features such as incomplete objects, subtyping, encapsulation, imperative features, have appeared in the literature in recent years (see e.g. [18, 7, 15, 5, 4, 19, 6]) Independently, Abadi and Cardelli have introduced, with the same foundational spirit, the Object Calculus [1] This is a calculus of typed objects and allows for a natural treatment of subtyping and hence of code reuse. The essential differences between Obj and the Object Calculus of Abadi and ....

V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS, volume 1113 of Lecture Notes in Computer Science, pages 218-- 229. Springer-Verlag, 1996.

No context found.

Viviana Bono, Michele Bugliesi, and Luigi Liquori. A lambda calculus of incomplete objects. In Proceedings, Mathematical Foundations of Computer Science, volume 1113 of Lecture Notes in Computer Science, pages 218--229. Springer-Verlag, 1996.

No context found.

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In Proceedings, Mathematical Foundations of Computer Science, volume 1113 of Lecture Notes in Computer Science, pages 218--229. Springer-Verlag, 1996.

No context found.

V. Bono, M. Bugliesi, and L. Liquori. A lambda calculus of incomplete objects. In W.Penczek and A. Sza/las, editors, Mathematical Foundations of Computer Science 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC