DOCSLIB.ORG

Approximation Theorems for Intersection Type Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Approximation Theorems for Intersection Type Systems Approximation Theorems for Intersection Type Systems MARIANGIOLA DEZANI-CIANCAGLINI, Dipartimento di Informatica, Universita` di Torino, Corso Svizzera 185, 10149 Torino, Italy. E-Mail: [email protected] FURIO HONSELL, Dipartimento di Matematica ed Informatica, Universita` di Udine, Via delle Scienze 208, 33100 Udine, Italy. E-Mail: [email protected] YOKO MOTOHAMA, Dipartimento di Informatica, Universita` di Torino, Corso Svizzera 185, 10149 Torino, Italy. E-Mail: [email protected] Abstract In this paper we prove that many intersection type theories of interest (including those which induce as filter models, D Scott’s and Park’s ½ models, the models studied in Barendregt Coppo Dezani, Abramsky Ong, and Honsell Ronchi) satisfy an Approximation Theorem with respect to a suitable notion of approximant. This theorem implies that a -term has a type if and only if there exists an approximant of that term which has that type. We prove this result uniformly for all the intersection type theories under consideration using a Kripke version of stable sets where bases correspond to worlds. Keywords: -calculus, intersection types, approximation theorem, set-theoretical semantics of types. 1 Introduction Intersection types were introduced in the late 1970s by Dezani and Coppo [8, 9, 6], to over- come the limitations of Curry’s type discipline. They are a very expressive type language which allows one to describe and capture various properties of -terms. For instance, they have been used in [27] to give the first type theoretic characterization of strongly normaliz- able terms and in [10] to capture persistently normalizing terms and normalizing terms.See [13] for a more complete account of this line of research concerning intersection types. Intersection types have also a very significant realizability semantics with respect to ap- plicative structures. This is a generalization of Scott’s natural semantics [31] of simple types. According to this interpretation, types denote subsets of the applicative structure, arrow types ! B A A denoting the sets of terms which map all terms belonging to the interpretation of A \ B into terms belonging to the interpretation of B , and intersection types denoting the B intersections of the interpretation of A and the interpretation of . Building on this, intersec- tion types have been used in [6] to give a proof of the completeness of the natural semantics of Curry’s simple type assignment system in applicative structures, introduced in [31]. See [12] for a more complete treatment of the completeness problem of intersection type assignment systems. J. Logic Computat., Vol. 11 No. 3, pp. 395–417 2001 ­c Oxford University Press 396 Approximation Theorems for Intersection Type Systems But intersection types have also an alternative semantics, based on duality, which is related to Abramsky’s ‘domain theory in logical form’ [1]. This semantics amounts to the application of that paradigm to the special case of ! -algebraic complete lattice models of pure lambda calculus, [11]. Namely, types correspond to compact elements: the type ª denoting the least element, intersections denoting joins of compact elements, and arrow types denoting step functions of compact elements. According to this semantics, a typing judgment can be interpreted as saying that a given term belongs to a pointed compact open set in a ! - algebraic complete lattice model of -calculus. Hence, by duality, type theories give rise to filter -models. Intersection type assignment systems can then be viewed as finitary logical definitions of the interpretation of -terms in such models, hence the meaning of a -term is the set of types which are deducible for it. This duality lies at the heart of the success of intersection types as a powerful tool both for the analysis and the synthesis of -models [2, 6, 11, 10, 3, 15, 19, 14, 26, 18, 28]. As proved in [3, 11, 4] there is a very large class of ! -algebraic models which have natural D readings as filter models. This class includes for example all the ½ inverse limit models, such as Scott’s [31] and Park’s models [23], the model in [2] which has been studied in connection with the lazy -calculus, and the model [6] which realizes equality of B¨ohm trees [29]. It is often the case that the very nature of the syntactical properties of -terms that one is interested in might suggest a particular intersection types theory, which induces a filter model D which captures semantically such properties. Important examples in this respect are the ½ Á limit models characterizing normalizing terms [10] and terms reducible to - -calculus [19], respectively. ! A crucial result in the study of the fine structure, and hence the -theory, of -algebraic -models is the, so called, approximation theorem, [33, 21, 7, 30, 19]. An approximation theorem allows one to express the interpretation of any -term, even a non terminating one, as the supremum of the interpretations of suitable normal forms, called the approximants of the term, in an appropriate extended language. Approximation theorems are very useful in proving, for instance, computational adequacy of models with respect to operational se- mantics [7, 19]. There are other possible methods of showing computational adequacy, both semantical and syntactical [2, 33, 19, 24], but the method based on approximation theorems is usually the most straightforward. However, proving an approximation theorem for a given model theory is usually rather difficult. Most of the proofs in the literature are based on the technique of indexed reduction [33, 19]. However, when the model in question is a filter model, by applying duality, the approxi- mation theorem can be rephrased as follows: the types of a given term are all and only the types of its approximants. This change in perspective opens the way to proving approxima- tion theorems using the syntactical machinery of proof theory, such as logical predicates and computability techniques. The aim of the present paper is to show in a uniform way that all the type assignment systems which induce filter models isomorphic to the models in [2, 6, 30, 19, 10] satisfy the Approximation Theorem. To this end we use a technique which can be construed as a version of stable sets over a Kripke applicative structure [22]. The present paper is organized as follows. In Section 2 we present type assignment sys- tems for intersection types and we prove some meta-theoretic properties including a genera- tion theorem and subject conversion. In Section 3 we introduce approximants and we prove the approximation theorem using a Kripke interpretation of intersection types in which the Approximation Theorems for Intersection Type Systems 397 bases play the role of worlds. In Section 4 we give some applications of the approximation theorems. Finally we mention directions for future work. 2 Intersection type theories and type assignment systems Intersection types are syntactical objects built inductively by closing a given set C of type atoms (constants) under the function type constructor ! and the intersection type constructor ª C \. We always assume that the universal type is a member of . DEFINITION 2.1 (Intersection type languages) Ì = Ì´Cµ The intersection type language over C, denoted by , is defined by the following abstract syntax: Ì = C j Ì!Ì j Ì \ Ì: NOTATION 2.2 Upper case Roman letters, i.e. A; B ; : : : , will denote arbitrary types. In writing intersection- types we shall use the following convention: the constructor \ takes precedence over Ò A ! B the constructor ! and both associate to the right. Moreover abbreviates ! B !¡¡¡!A A . ßÞ } | Ò Much of the expressive power of intersection type disciplines comes from the fact that types can be endowed with a preorder relation , which induces the structure of a meet ª semi-lattice with respect to \, the top element being . DEFINITION 2.3 (Intersection type preorder) = Ì´Cµ Ì Let Ì be an intersection type language. An intersection type preorder over is a ¼ Ì 5 binary relation on satisfying the following set (‘nabla-zero’) of axioms and rules: A A A \ A (refl) A (idem) A \ B A A \ B B Ê (inclÄ ) (incl ) ¼ ¼ A B B A B B C (mon) A (trans) ¼ ¼ A \ B A \ B A C A ª ! \ ´A! B µ \ ´A! C µ A!B \ C ( ª) ( - ) ¼ ¼ A A B B ( ) ¼ ¼ A!B A !B NOTATION 2.4 B A B B A We will write A for and . Notice that associativity and commutativity of \ (modulo ) follow easily from the above axioms and rules. NOTATION 2.5 Ì \ A \ ::: \ A A ½ Ò Being commutative and associative, we will write i for . Similarly iÒ Ì Á; Â;à A we will write i . We convene that etc., when referred to as sets of indexes for i¾Á types, always denote finite non-empty sets. The meaning of the above axioms and rules can be grasped if we take types to denote ! subsets of a domain of discourse and we view \ as set-theoretic intersection and as the 398 Approximation Theorems for Intersection Type Systems ª ª!ª ( ª- ) A!B ª!ª ( ª-lazy) ª!! ! ( ! -Scott) ! !! ! ( ! -Park) ´!³µ ! ³ ´³! ! µ ³!! ! ´! !³µ ! !³ ³ ´Á µ ´³!³µ \ ´! !! µ ³ FIGURE 1. Some special purpose axioms concerning !B function space constructor in the light of Curry–Scott semantics [32]. Thus the type A B denotes the set of total functions which map each element of A into an element of . \ The intended interpretation of arrow types motivates axiom (!- ), which implies that if a B A C function maps A into , and the same function maps also into , then, actually, it maps B C B \ C the whole A into the intersection between and (i.e. into ), see [6]. µ Rule ´ is also very natural in view of the set-theoretic interpretation. It implies that the arrow constructor is contravariant in the first argument and covariant in the second one.
Load more

Recommended publications
  • First Class Overloading Via Insersection Type Parameters⋆
    First Class Overloading via Insersection Type Parameters? Elton Cardoso2, Carlos Camar~ao1, and Lucilia Figueiredo2 1 Universidade Federal de Minas Gerais, [email protected] 2 Universidade Federal de Ouro Preto [email protected], [email protected] Abstract The Hindley-Milner type system imposes the restriction that function parameters must have monomorphic types. Lifting this restric- tion and providing system F “first class" polymorphism is clearly desir- able, but comes with the difficulty that inference of types for system F is undecidable. More practical type systems incorporating types of higher- rank have recently been proposed, that rely on system F but require type annotations for the definition of functions with polymorphic type parameters. However, these type annotations inevitably disallow some possible uses of higher-rank functions. To avoid this problem and to pro- mote code reuse, we explore using intersection types for specifying the types of function parameters that are used polymorphically inside the function body, allowing a flexible use of such functions, on applications to both polymorphic or overloaded arguments. 1 Introduction The Hindley-Milner type system [9] (HM) has been successfuly used as the basis for type systems of modern functional programming languages, such as Haskell [23] and ML [20]. This is due to its remarkable properties that a compiler can in- fer the principal type for any language expression, without any help from the programmer, and the type inference algorithm [5] is relatively simple. This is achieved, however, by imposing some restrictions, a major one being that func- tion parameters must have monomorphic types. For example, the following definition is not allowed in the HM type system: foo g = (g [True,False], g ['a','b','c']) Since parameter g is used with distinct types in the function's body (being applied to both a list of booleans and a list of characters), its type cannot be monomorphic, and this definition of foo cannot thus be typed in HM.
    [Show full text]
  • Disjoint Polymorphism
    Disjoint Polymorphism João Alpuim, Bruno C. d. S. Oliveira, and Zhiyuan Shi The University of Hong Kong {alpuim,bruno,zyshi}@cs.hku.hk Abstract. The combination of intersection types, a merge operator and parametric polymorphism enables important applications for program- ming. However, such combination makes it hard to achieve the desirable property of a coherent semantics: all valid reductions for the same expres- sion should have the same value. Recent work proposed disjoint inter- sections types as a means to ensure coherence in a simply typed setting. However, the addition of parametric polymorphism was not studied. This paper presents Fi: a calculus with disjoint intersection types, a vari- ant of parametric polymorphism and a merge operator. Fi is both type- safe and coherent. The key difficulty in adding polymorphism is that, when a type variable occurs in an intersection type, it is not statically known whether the instantiated type will be disjoint to other compo- nents of the intersection. To address this problem we propose disjoint polymorphism: a constrained form of parametric polymorphism, which allows disjointness constraints for type variables. With disjoint polymor- phism the calculus remains very flexible in terms of programs that can be written, while retaining coherence. 1 Introduction Intersection types [20,43] are a popular language feature for modern languages, such as Microsoft’s TypeScript [4], Redhat’s Ceylon [1], Facebook’s Flow [3] and Scala [37]. In those languages a typical use of intersection types, which has been known for a long time [19], is to model the subtyping aspects of OO-style multiple inheritance.
    [Show full text]
  • Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and -Rule Extended Abstract
    Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and -rule Extended Abstract Steffen van Bakel , Franco Barbanera , and Maribel Fernandez´ Department of Computing, Imperial College, 180 Queen’s Gate, London SW7 2BZ. [email protected] Dipartimento di Matematica, Universita` degli Studi di Catania, Viale A. Doria 6, 95125 Catania, Italia. [email protected] LIENS (CNRS URA 8548), Ecole Normale Superieure,´ 45, rue d’Ulm, 75005 Paris, France. [email protected] Abstract. We define two type assignment systems for first-order rewriting ex- tended with application, -abstraction, and -reduction (TRS ). The types used in these systems are a combination of ( -free) intersection and polymorphic types. The first system is the general one, for which we prove a subject reduction theorem and show that all typeable terms are strongly normalisable. The second is a decidable subsystem of the first, by restricting types to Rank 2. For this sys- tem we define, using an extended notion of unification, a notion of principal type, and show that type assignment is decidable. Introduction The combination of -calculus (LC) and term rewriting systems (TRS) has attracted attention not only from the area of programming language design, but also from the rapidly evolving field of theorem provers. It is well-known by now that type disciplines provide an environment in which rewrite rules and -reduction can be combined with- out loss of their useful properties. This is supported by a number of results for a broad range of type systems [11, 12, 20, 7, 8, 5]. In this paper we study the combination of LC and TRS as a basis for the design of a programming language.
    [Show full text]
  • Rank 2 Type Systems and Recursive De Nitions
    Rank 2 typ e systems and recursive de nitions Technical Memorandum MIT/LCS/TM{531 Trevor Jim Lab oratory for Computer Science Massachusetts Institute of Technology August 1995; revised Novemb er 1995 Abstract We demonstrate an equivalence b etween the rank 2 fragments of the p olymorphic lamb da calculus System F and the intersection typ e dis- cipline: exactly the same terms are typable in each system. An imme- diate consequence is that typability in the rank 2 intersection system is DEXPTIME-complete. Weintro duce a rank 2 system combining intersections and p olymorphism, and prove that it typ es exactly the same terms as the other rank 2 systems. The combined system sug- gests a new rule for typing recursive de nitions. The result is a rank 2 typ e system with decidable typ e inference that can typ e some inter- esting examples of p olymorphic recursion. Finally,we discuss some applications of the typ e system in data representation optimizations suchasunboxing and overloading. Keywords: Rank 2 typ es, intersection typ es, p olymorphic recursion, boxing/unboxing, overloading. 1 Intro duction In the past decade, Milner's typ e inference algorithm for ML has b ecome phenomenally successful. As the basis of p opular programming languages like Standard ML and Haskell, Milner's algorithm is the preferred metho d of typ e inference among language implementors. And in the theoretical 545 Technology Square, Cambridge, MA 02139, [email protected]. Supp orted by NSF grants CCR{9113196 and CCR{9417382, and ONR Contract N00014{92{J{1310.
    [Show full text]
  • A Facet-Oriented Modelling
    A Facet-oriented modelling JUAN DE LARA, Universidad Autónoma de Madrid (Spain) ESTHER GUERRA, Universidad Autónoma de Madrid (Spain) JÖRG KIENZLE, McGill University (Canada) Models are the central assets in model-driven engineering (MDE), as they are actively used in all phases of software development. Models are built using metamodel-based languages, and so, objects in models are typed by a metamodel class. This typing is static, established at creation time, and cannot be changed later. Therefore, objects in MDE are closed and fixed with respect to the class they conform to, the fields they have, and the wellformedness constraints they must comply with. This hampers many MDE activities, like the reuse of model-related artefacts such as transformations, the opportunistic or dynamic combination of metamodels, or the dynamic reconfiguration of models. To alleviate this rigidity, we propose making model objects open so that they can acquire or drop so-called facets. These contribute with a type, fields and constraints to the objects holding them. Facets are defined by regular metamodels, hence being a lightweight extension of standard metamodelling. Facet metamodels may declare usage interfaces, as well as laws that govern the assignment of facets to objects (or classes). This paper describes our proposal, reporting on a theory, analysis techniques and an implementation. The benefits of the approach are validated on the basis of five case studies dealing with annotation models, transformation reuse, multi-view modelling, multi-level modelling and language product lines. Categories and Subject Descriptors: [Software and its engineering]: Model-driven software engineering; Domain specific languages; Design languages; Software design engineering Additional Key Words and Phrases: Metamodelling, Flexible Modelling, Role-Based Modelling, METADEPTH ACM Reference Format: Juan de Lara, Esther Guerra, Jörg Kienzle.
    [Show full text]
  • Approximations, Fibrations and Intersection Type Systems
    Approximations, Fibrations and Intersection Type Systems Damiano Mazza*, Luc Pellissier† & Pierre Vial‡ June 16, 2017 Introduction The discovery of linear logic [7] has introduced the notionof linearity in computer science and proof theory. A remarkable fact of linear logic lies in its approximation theorem, stating that an arbitrary proof (not necessarily linear, that is, using its premisses any number of times) can be approximated arbitrarily well by a linear proof. This notion of approximation has then been explored in different directions [4, 10,14]. Approximations are known to be related to relational models, which in turn are related to intersection types [2, 12, 13]. In this work, we investigate approximations in the “type-systems as functors” perspective pioneered by [11]. After recasting fundamental properties of type systems, such as subject reduction and expansion in this framework, we give an intersection type system framework for linear logic, whose derivations are simply-typed approximations. Any calculus that translates meaningfully to linear logic is then endowed by a intersection type system, computed by pulling back one of these intersection type systems for linear logic, and which inherit its properties. All standard intersection type systems (idempotent, such as in [6, 1] or not, such as in [3]) for call-by-name and call-by-value λ-calculus, characterizing weak, strong, and head normalization, fit in this picture, thus justifying the equation: Simply-typed approximations = intersection types derivations. We moreover obtain new type systems, by considering other translations and reductions. 1 What is a type system? The starting point of this research is the work of [11].
    [Show full text]
  • Deconfined Intersection Types in Java
    Deconfined Intersection Types in Java Dedicated to Maurizio Gabbrielli on the Occasion of His 60th Birthday Mariangiola Dezani-Ciancaglini Computer Science Department, University of Torino, Italy [email protected] Paola Giannini Department of Advanced Science and Technology, University of Eastern Piedmont, Alessandria, Italy [email protected] Betti Venneri Department of Statistics, Computer Science, Applications, University of Firenze, Italy betti.venneri@unifi.it Abstract We show how Java intersection types can be freed from their confinement in type casts, in such a way that the proposed Java extension is safe and fully compatible with the current language. To this aim, we exploit two calculi which formalise the simple Java core and the extended language, respectively. Namely, the second calculus extends the first one by allowing an intersection type to be used anywhere in place of a nominal type. We define a translation algorithm, compiling programs of the extended language into programs of the former calculus. The key point is the interaction between λ-expressions and intersection types, that adds safe expressiveness while being the crucial matter in the translation. We prove that the translation preserves typing and semantics. Thus, typed programs in the proposed extension are translated to typed Java programs. Moreover, semantics of translated programs coincides with the one of the source programs. 2012 ACM Subject Classification Theory of computation → Type structures; Theory of computation → Semantics and reasoning Keywords and phrases Intersection Types, Featherweight Java, Lambda Expressions Digital Object Identifier 10.4230/OASIcs.Gabbrielli.2020.3 Acknowledgements We are very pleased to dedicate this work to Maurizio, whose notable contri- butions to the theory of programming languages are well known and appreciated by the scientific community.
    [Show full text]
  • Declared Type Vs Object Type
    Declared Type Vs Object Type andEnforceable patronising and Silvio keeperless fimbriate Sax her laths evangelizations so essentially apotheosise that Jameson matrimonially rebroadcasts or hischants skatings. filthily, Flaggy is Lyle irrigationCytherean? treble Homomorphic shudderingly. Judas delaminating apishly and contingently, she demagnetized her Interface type attributes to type declared vs object They are building blocks for declaring types. Multiple constructors can be defined in a class. This use of patterns encourages consistency and reduces complexity for servers and clients. Object classes facilitate rapid development because they lessen the semantic gap between the code and the users. None along with checking that it has the right type. This answer has been undeleted. Useful in special relativity. Generic methods are methods that introduce their own type parameters. The package is not complete and contains no explicit imports. In short, link to only your code and be specific about what you want feedback on. Embedded reports whether the variable is an embedded field. Type for the results of type inference. Functions belong to the object type. Examples of instances of this type. Press J to jump to the feed. These are usually field types and names that will be associated with state variables at program run time; these state variables either belong to the class or specific instances of the class. The rational is similar to the justification for allowing multiple superclasses, that the Internet is so dynamic and flexible that dynamic changes to the hierarchy are required to manage this volatility. What is the output of the following program? Error: You must enter a valid Integer without commas.
    [Show full text]
  • Typing the Numeric Tower
    Typing the Numeric Tower Vincent St-Amour1, Sam Tobin-Hochstadt1, Matthew Flatt2, and Matthias Felleisen1 1 Northeastern University {stamourv,samth,matthias}@ccs.neu.edu 2 University of Utah [email protected] Abstract. In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically typed relatives support the straightforward ex- pression via a rich numeric tower, existing statically typed languages force pro- grammers to pollute textbook formulas with explicit coercions or unwieldy nota- tion. In this paper, we demonstrate how the type system of Typed Racket accom- modates both a textbook programming style and expressive static checking. The type system provides a hierarchy of numeric types that can be freely mixed as well as precise specifications of sign, representation, and range information—all while supporting generic operations. In addition, the type system provides infor- mation to the compiler so that it can perform standard numeric optimizations. 1 Designing the Numeric Tower From the classic two-line factorial program to financial applications to scientific com- putation to graphics software, programs rely on numbers and numeric computations. Because of this spectrum of numeric applications, programmers wish to use a wide vari- ety of numbers: the inductively defined natural numbers, fixed-width integers, floating- point numbers, complex numbers, etc. Supporting this variety demands careful attention to the design of programming languages that manipulate numbers. Most languages have taken one of two approaches to numbers. Many untyped lan- guages, drawing on the tradition of Lisp and Smalltalk, provide a hierarchy of numbers whose various levels can be freely used together, known as the numeric tower.
    [Show full text]
  • Object-Oriented Dynamic GIS for Transportation Planning Reginald
    Object-Oriented Dynamic GIS for Transportation Planning Reginald G Gotledge Working Paper UCTC No 3 37 The University of Califorma Trans portatlon Center Umve~-slty of Cahforma Berkeley, CA94720 The University of California Transportation Center The Umverslty of Cahforma Center actaVltles Researchers TransportaUon Center (UCTC) at other umversmes w~thmthe as one of ten regional umts regmn also have opportunmes mandated by Congress and to collaborate wxth UCfaculty established m FaII 1988 to on selected studms support research, educatmn, and trramng m surface trans- UCTC’seducauonal and portatmn The UC Center research programs are focused serves federal RegmnIX and on strategm planning for ~s supported by matching improwng metropol~tan grants from the U S Depart- accessibility, wath emphas~s ment of Transportatmn the on the specml condmons in Calfforma Department of Region IX Partacular attentmn Transportation (Caltrans), and as directed to strategms for the Umversaty using transportatmn as an instrument of economic Based on the Berkeley development, whale also ac- Campus, UCTCdraws upon commodating to the regmn s existing capabdatms and persastent expansmn and resources of the Insututes of whale mmntammgand enhanc- Transportatmn Studies at ing the quahty of hfe there Berkeley, Davas, Irvme, and Los Angeles, the Insutute of The Center dxstnbutes reports Urban and Regional Develop- on ~ts research m working ment at Berkeley, and several papers, monographs, and in academac departments at the reprints of pubhshedarticles Berkeley, Davas,
    [Show full text]
  • Disjoint Intersection Types: Theory and Practice
    Disjoint Intersection Types: Theory and Practice by Xuan Bi (毕旋) A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at The University of Hong Kong December 2018 Abstract of thesis entitled “Disjoint Intersection Types: Theory and Practice” Submitted by Xuan Bi for the degree of Doctor of Philosophy at The University of Hong Kong in December 2018 Programs are hard to write. It was so 50 years ago at the time of the so-called software crisis; it still remains so nowadays. Over the years, we have learned—the hard way—that software should be constructed in a modular way, i.e., as a network of smaller and loosely connected modules. To facilitate writing modular code, researchers and software practitioners have developed new methodologies; new programming paradigms; stronger type systems; as well as better tooling support. Still, this is not enough to cope with today’s needs. Several reasons have been raised for the lack of satisfactory solutions, but one that is constantly pointed out is the inadequacy of existing programming languages for the construction of modular software. This thesis investigates disjoint intersection types, a variant of intersection types. Disjoint intersections types have great potential to serve as a foundation for powerful, flexible and yet type-safe and easy to reason OO languages, suitable for writing modular software. On the theoretical side, this thesis shows how to significantly increase the expressiveness of disjoint intersection types by adding support for nested composition, along with parametric polymor- phism. Nested composition extends inheritance to work on a whole family of classes, en- abling high degrees of modularity and code reuse.
    [Show full text]
  • The Grace Programming Language Draft Specification Version 0.5. 2025" (2015)
    Portland State University PDXScholar Computer Science Faculty Publications and Presentations Computer Science 2015 The Grace Programming Language Draft Specification ersionV 0.5. 2025 Andrew P. Black Portland State University, [email protected] Kim B. Bruce James Noble Follow this and additional works at: https://pdxscholar.library.pdx.edu/compsci_fac Part of the Programming Languages and Compilers Commons Let us know how access to this document benefits ou.y Citation Details Black, Andrew P.; Bruce, Kim B.; and Noble, James, "The Grace Programming Language Draft Specification Version 0.5. 2025" (2015). Computer Science Faculty Publications and Presentations. 140. https://pdxscholar.library.pdx.edu/compsci_fac/140 This Working Paper is brought to you for free and open access. It has been accepted for inclusion in Computer Science Faculty Publications and Presentations by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. The Grace Programming Language Draft Specification Version 0.5.2025 Andrew P. Black Kim B. Bruce James Noble April 2, 2015 1 Introduction This is a specification of the Grace Programming Language. This specifica- tion is notably incomplete, and everything is subject to change. In particular, this version does not address: • James IWE MUST COMMIT TO CLASS SYNTAX!J • the library, especially collections and collection literals • static type system (although we’ve made a start) • module system James Ishould write up from DYLA paperJ • dialects • the abstract top-level method, as a marker for abstract methods, • identifier resolution rule. • metadata (Java’s @annotations, C] attributes, final, abstract etc) James Ishould add this tooJ Kim INeed to add syntax, but not necessarily details of which attributes are in language (yet)J • immutable data and pure methods.
    [Show full text]