M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and rst-order systems. Information and Computation, 125(2):78-102, Mar. 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....languages. Our proof is based on the observation that reduction carries most of the local structure of the source expression into the result expression, modifying only a few key terms. We illustrate this extensibility by showing the correctness of an analysis for the Abadi Cardelli object calculus [1]. We begin in Sect. 2 by presenting the syntax and semantics of the language we will analyze, the calculus, along with a few syntactic annotations and their properties. In Sect. 3, we present our control ow analysis, following Palsberg s constraint generation system. In Sect. 4, we present our ....

....We made several increasingly baroque attempts to repair the proof, and were eventually led to abandon a formal inductive structure in favor of the at characterization of Lem. 4.6. 5 The Abadi Cardelli Object Calculus We presume the reader is familiar with the Abadi Cardelli Object Calculus [1]. Our syntax is shown in Fig. 7. We have adopted a slightly non standard syntax to facilitate the presentation. Subterms are labelled with superscripts; bound variables of comprehensions are presented as subscripts, e.g. h: i i . We elide the range of the bound variable i, relying on the fact ....

M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and rst-order systems. Information and Computation, 125(2):78-102, Mar. 1996.

....to pick up errors that cannot be detected reliably by a static type checker. The language PolyTOIL is the result of a series of design e orts to build a type safe language based on progress in the theoretical understanding of object oriented languages (see [Car88, CW85, CHC90, CCH 89, PT93, AC94b, AC94a, AC95] for example, for work on modelling objectoriented features) In [Bru93] we introduced a statically typed, functional, object oriented language, TOOPLE. This and subsequent papers [Bru94, BCK94, BCD 93] provided typing rules and both denotational and operational semantics for ....

....in creating types of objects. However, there is a corresponding loss of expressiveness in that methods like the setNext method of NodeClassType in Figure 2, which have parameters of type MyType, may not be written as methods of the class. Abadi and Cardelli have written a series of papers [AC94b, AC94a, AC95] investigating a series of low level object calculi designed to serve as a foundation for higher level object oriented programming languages. The same authors show in their monograph [AC96] that one of these calculi can be used to model TOOPLE and PolyTOIL. Such a foundational object ....

Martin Abadi and Luca Cardelli. A theory of primitive objects: untyped and rstorder systems. In Proc. Theoretical Aspects of Computer Software. Springer-Verlag, 1994. 296-320.

....rst order type systems for their calculus. The simplest one is based on nite types and no subtyping, and the most powerful one has both recursive types and subtyping. The latter can type many intriguing object oriented programs, including objects whose methods return an updated self [2] see also [4, 3, 1]. Open until now is the question of type inference: Given an untyped program a, is a typable If so, annotate it. In the presence of subtyping ithe absence of minimum typings poses practical problems for type inferencej [2] algorithm for each of the four type inference problems and we ....

Mart#n Abadi and Luca Cardelli. A theory of primitive objects: Untyped and rst-order systems. In Proc. TACS'94, Theoretical Aspects of Computing Sofware, pages 296320. Springer-Verlag (LNCS 789), 1994.

....fax: 33 0)4 92 38 79 98 email: gbo sophia.inria.fr 1 the authors conclude that i[method specialization] seems very diOEcult to achieve directly with any calculus of records j. Several other primitive object calculi were developed at about the same time by Abadi and Cardelli (see for instance [1, 2]) to formalize abstractly what can be expected from the typing of objects, while avoiding the diOEculties of discovering adequate encodings in calculi with records. Later on however, these authors, together with R. Viswanathan [3] solved the encoding problem for a delegation based calculus ....

.... n i, where the P i s are functions of the prototype itself (usually in the form of a self parameter) we shall use a function returning a record G = self [ 1 = M 1 self ; n = M n self ] This is an iobject denitionj in Cook s model (see [11, 13] also called iobject generatorj (see [2, 3]) We cannot however use directly this representation with a iself application semanticsj, because of well known typing problems (see for instance [2] nor a irecursive record semanticsj [8] since it has diOEculties in modelling the method update operation. As we said in the introduction, in our ....

[Article contains additional citation context not shown here]

M. Abadi, L. Cardelli, A theory of primitive objects: untyped and rst-order systems, TACS'94, Lecture Notes in Comput. Sci. 789 (1994) 296-320.

....x3.4 proposes a general typology of the uses of calculus. While enough of the calculus is presented below to support the examples used, a full exploration of the formalism would be impossible here and the reader is directed to the literature for a more substantial treatment of the calculus [2, 3, 4, 5]. As far a possible, the notation used in the following examples is consistent with this literature to facilitate the reference. 3.1. Schema development An important feature of any formal method in software development is the ability to capture the results of an analysis in a precise, ....

M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and rst-order systems. Information and Computation, 125(2):78-102, 1996.

....the temporal modalities of the logic CTL [BAMP83] We investigate the connection between the type system Ob 1 : and the mu calculus, providing a translation of types into modal formulae and an ordering on formulae that is sound w.r.t. to the subtype ordering of Ob 1 : 1 Introduction In [AC94a, AC94b, AC94c, AC96] Abadi and Cardelli present and investigate several versions of the calculus, a calculus for describing central features of object oriented programs, with particular emphasis on various type systems. In this paper we present a modal logic for describing dynamic properties of terms in the object ....

....a Curry Howard style result in that it allows us to view calculus terms as realizers of certain mu calculus formulae. 2 The calculus and its reduction semantics There are various versions of the calculus. In this paper we shall consider what is essentially the simple object calculus of [AC94b] with booleans added. The set of object terms, Obj, is dened by the following abstract syntax: a : l i = x i :A i )b i ] i2I objects j x self variables j a:l method activation j a:l ( x:A)b method override j fold(A; a) j unfold(a) recursive fold unfold j if(a; a; a) j true j false ....

[Article contains additional citation context not shown here]

Martin Abadi and Luca Cardelli. A theory of primitive objects untyped and rst-order systems. In Theoretical Aspects of Computer Software, pages 296320. Springer-Verlag, 1994. 18

.... N 3000 Octobre 1996 THE ME 1 An interpretation of Typed Objects into Typed calculus Davide Sangiorgi Th#me 1 R#seaux et syst#mes Projet MEIJE Rapport de recherche n Sigma3000 Octobre 1996 40 pages Abstract: An interpretation of Abadi and Cardelli s rst order functional Object Calculus [AC94b] into a typed calculus is presented. The interpretation validates the subtyping relation and the typing judgements of the Object Calculus, and is computationally adequate. The type language for the calculus is that in [PS93] a development of Milner s sorting discipline [Mil91] with I O ....

.... route des Lucioles, BP 93, 06902 SOPHIA ANTIPOLIS Cedex (France) Telephone : 33) 93 65 77 77 Telecopie : 33) 93 65 77 65 Une interpr#tation des Objets Typ#s dans le calcul R#sum# : Nous pr#sentons une interpr#tation de l Object Calculus fonctionnel de premier ordre d Abadi et Cardelli [AC94b] en calcul typ#. Cette interpr#tation valide le soustypage et le typage de l Object Calculus, et est ad#quat (icomputational adequacyj) Le langage des types pour le calcul est celui d#crit dans [PS93] un d#veloppement de la discipline de sorting de Milner [Mil91] avec annotations I O pour ....

[Article contains additional citation context not shown here]

M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and rst-order systems. In Proc. Theoretical Aspects of Computer Science, volume 789 of Lecture Notes in Computer Science. Springer Verlag, 1994.

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