Wyvern: a Simple, Typed, and Pure Object-Oriented Language

Total Page:16

File Type:pdf, Size:1020Kb

Wyvern: a Simple, Typed, and Pure Object-Oriented Language Wyvern: A Simple, Typed, and Pure Object-Oriented Language Ligia Nistor, Darya Kurilova, Stephanie Balzer, Benjamin Chung, Alex Potanin1, and Jonathan Aldrich Carnegie Mellon University flnistor, darya, balzers, bwchung, [email protected], [email protected] Abstract Smalltalk are notable for the following characteristics, many of which are shared by more recent object-oriented languages, such The simplest and purest practical object-oriented language designs as Python, Ruby, Lua, and JavaScript: today are seen in dynamically-typed languages, such as Smalltalk and Self. Static types, however, have potential benefits for produc- • A high-level, pure object-oriented model, in which clients tivity, security, and reasoning about programs. In this paper, we de- can interact with objects only by sending them messages. This scribe the design of Wyvern, a statically typed, pure object-oriented model of interaction enforces Meyer’s uniform access principle language that attempts to retain much of the simplicity and expres- [16], a principle stating that an object’s services should only be siveness of these iconic designs. available through a uniform notation (the object’s methods in Our goals lead us to combine pure object-oriented and func- this case). tional abstractions in a simple, typed setting. We present a foun- • An interactive, value-based language model, which means that dational object-based language that we believe to be as close as everything significant in the language is a first-class value, one can get to simple typed lambda calculus while keeping object- either an object or a function. This contributes to a system that orientation. We show how this foundational language can be trans- is “directly manipulable” in the sense of Smith and Ungar [20]. lated to the typed lambda calculus via standard encodings. We then For example, classes in Smalltalk are not special declarations, define a simple extension to this language that introduces classes but live objects that respond to messages. and show that classes are no more than sugar for the foundational object-based language. Our future intention is to demonstrate that • A high degree of simplicity, with a few constructs sufficing to modules and other object-oriented features can be added to our lan- provide great expressiveness. guage as not more than such syntactical extensions while keeping • Good support for functional programming via blocks or the object-oriented core as pure as possible. lambda expressions and closures. The design of Wyvern closely follows both historical and mod- ern ideas about the essence of object-orientation, suggesting a new Interestingly, both Smalltalk and Self, as well as many lan- way to think about a minimal, practical, typed core language for guages that share some of the characteristics above, are dynam- objects. ically typed. Statically-typed object-oriented languages exist, but many are less pure (e.g., Java classes can expose fields), or less Categories and Subject Descriptors D.3.3 [Programming Lan- interactive (e.g., classes are typically not first-class), or may be guages]: Language Constructs and Features—Classes and objects; considerably more complex (C++ and Scala, despite their many D.3.1 [Programming Languages]: Formal Definitions and Theory virtues, come to mind). General Terms Languages Static types are a potentially interesting addition to the set of features above for a number of reasons. In object-oriented lan- Keywords Object-oriented, first-class classes, static type check- guages, types can eliminate message-not-understood errors [12, 24] ing and be used to optimize programs [10] and to create practical refac- toring tools [22]. Preliminary evidence suggests that, in some cir- 1. Introduction cumstances, static types can enhance productivity as well [15]. Our interest in this question comes from Wyvern, a language we The language designs of Smalltalk [11] and Self [20] are iconic are designing for secure mobile and web programming. To compare in their elegance, their simplicity, and the success with which they with programming languages in this domain, Wyvern must be a capture the essence of object-oriented programming. Although they simple, value-based, pure object-oriented language with good sup- are not among the most common languages used today, their de- port for functional programming—much like the languages men- sign has been an inspiration for many modern languages. Self and tioned above. However, we also want to provide strong reason- ing about security properties. Reasoning is facilitated by a simple, high-level language, but, in addition, we want to use type-based ap- proaches to ensure certain security properties (e.g., using inference Permission to make digital or hard copies of all or part of this work for personal or rules developed for type checking to also check object ownership classroom use is granted without fee provided that copies are not made or distributed and state). Thus, combining static types with a language having the for profit or commercial advantage and that copies bear this notice and the full citation characteristics above is important to meeting this set of goals. on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This paper therefore explores the design of an object-oriented MASPEGHI’13, July 01 2013, Montpellier, France language that is pure, value-based, simple, statically type-safe, and Copyright c 2013 ACM 978-1-4503-2046-7/13/07. $15.00 supports functional programming. We explore variants with and without classes, our motivation being to show that, while classes are 1.2 Mechanisms for Code Reuse convenient, they are not fundamental to the object-oriented model. No discussion of a pure object-oriented programming model would 1.1 What Makes an Object-Oriented Model Pure? be complete without discussion of code reuse mechanisms, such as inheritance. We have not yet investigated adding inheritance or Most of the criteria above are fairly clear. The exception involves delegation to Wyvern. However, Wyvern does support specializa- the purity of the object model. What does it mean, especially in the tion and generalization of types, along with a pure object-oriented context of types, for a language to be purely object-oriented? model that supports reuse via composition mechanisms. Questions To answer the question, we consider both history and theory. of interest to us as we continue the development of Wyvern are: With respect to history, Alan Kay, a pioneer of the object-oriented programming who developed Smalltalk, describes an “objects as • How far can a pure object-oriented model without inheritance server” metaphor in which each “object would be a server offer- go in supporting code reuse? ing services” that clients can use by sending messages to the ob- • What reuse mechanisms would fit most naturally into a system ject [13]. In fact, Kay writes that, in his opinion, “the big idea [of with Wyvern’s design goals? object-oriented programming] is messaging.”1 With respect to theory, in his essay on the nature of objects, We are considering a reuse model for Wyvern based on delega- William Cook defines objects as “a value exporting a [sic] proce- tion, possibly, with slightly simpler semantics compared to delega- dural interface to data or behavior” [9]. The notion of a procedural tion in Self [20]. interface reflects Kay’s focus on messaging: the only way to inter- act with an object is to invoke its methods. This is also consistent 1.3 Contributions with Meyer’s uniform access principle. Cook argues that a key benefit of objects, arising from their pro- This paper makes the following contributions: cedural interface, is that different implementations of an interface can interoperate. For example, in a pure object-oriented model, we • Section 2 presents the design of a simple, typed, value-based, can take the union of a set implemented as a list with a set imple- pure object-oriented language. We closely follow the lambda mented as a hash table. Moreover, different implementations of an calculus, a simple, foundational model of computation, while interface can be treated uniformly: for example, we can store in- enforcing the uniform access principle, supporting object inter- stances of two different implementations of a set within the same operability, and encapsulating state. data structure. These benefits are used in many object-oriented sys- • Section 2 also provides the semantics of this language by trans- tems [5], and we consider them to be critical goals of our language lation into the typed lambda calculus. design. These ideas can also be considered in a comparison between ob- • Section 3 describes a “purely object-oriented” first-class class jects and module systems, particularly, with respect to encapsulat- construct and its definition in terms of pure objects by transla- ing state. Concerning the development of object-oriented program- tion into the language described in the previous section. ming, Kay writes of his motivations, “The large scale one was to find a better module scheme for complex systems involving hiding The design of Wyvern is ongoing. While we believe the design of details, and the small scale one was to find a more flexible ver- described here captures our initial goals well, the design is subject sion of assignment, and then to try to eliminate it altogether” [13]. to change and needs to be extended in many ways. In the conclu- Hiding assignment behind a method interface—via the uniform ac- sion, we discuss areas for future work, including specific potential cess principle—provides a more flexible version of assignment, and extensions of Wyvern. one can go further in using that method interface more abstractly to “replace bindings and assignment with goals” [13]. The procedural 2. The Object-Oriented Core of Wyvern interface of objects also makes them act like first-class modules.2 From these sources, we extract three key requirements that we In this section, we present the syntax and semantics of the object- wish to satisfy in coming up with a typed, pure object-oriented oriented core of Wyvern, which we call Featherweight Wyvern model: (FW).
Recommended publications
  • Application-Level Virtual Memory for Object-Oriented Systems Mariano Martinez Peck
    Application-Level Virtual Memory for Object-Oriented Systems Mariano Martinez Peck To cite this version: Mariano Martinez Peck. Application-Level Virtual Memory for Object-Oriented Systems. Program- ming Languages [cs.PL]. Université des Sciences et Technologie de Lille - Lille I, 2012. English. tel-00764991 HAL Id: tel-00764991 https://tel.archives-ouvertes.fr/tel-00764991 Submitted on 26 Dec 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. N° d’ordre : 40886 THESE présentée en vue d’obtenir le grade de DOCTEUR en Spécialité : informatique par Mariano MARTINEZ PECK DOCTORAT DELIVRE CONJOINTEMENT PAR MINES DOUAI ET L’UNIVERSITE DE LILLE 1 Titre de la thèse : Application-Level Virtual Memory for Object-Oriented Systems Soutenue le 29/10/2012 à 10h devant le jury d’examen : Président Jean-Bernard STEFANI (Directeur de recherche – INRIA Grenoble- Rhône-Alpes) Directeur de thèse Stéphane DUCASSE (Directeur de recherche – INRIA Lille) Rapporteur Robert HIRSCHFELD (Professeur – Hasso-Plattner-Institut, Universität Potsdam, Allemagne) Rapporteur Christophe DONY (Professeur – Université Montpellier 2) Examinateur Roel WUYTS (Professeur – IMEC & Katholieke Universiteit Leuven, Belgique) co-Encadrant Noury BOURAQADI (Maître-Assistant – Mines de Douai) co-Encadrant Marcus DENKER (Chargé de recherche – INRIA Lille) co-Encadrant Luc FABRESSE (Maître-Assistant – Mines de Douai) Laboratoire(s) d’accueil : Dépt.
    [Show full text]
  • Visualage for Smalltalk Handbook Volume 2: Features
    SG24-2219-00 VisualAge for Smalltalk Handbook Volume 2: Features September 1997 SG24-2219-00 International Technical Support Organization VisualAge for Smalltalk Handbook Volume 2: Features September 1997 IBM Take Note! Before using this information and the product it supports, be sure to read the general information in Appendix A, “Special Notices.” First Edition (September 1997) This edition applies to VisualAge for Smalltalk, Versions 2, 3, and 4, for use with OS/2, AIX, and Microsoft Windows 95/NT. Comments may be addressed to: IBM Corporation, International Technical Support Organization Dept. QXXE Building 80-E2 650 Harry Road San Jose, California 95120-6099 When you send information to IBM, you grant IBM a non-exclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. Copyright International Business Machines Corporation 1997. All rights reserved. Note to U.S. Government Users — Documentation related to restricted rights — Use, duplication or disclosure is subject to restrictions set forth in GSA ADP Schedule Contract with IBM Corp. Contents Preface . xiii How This Redbook Is Organized ....................... xiv ITSO on the Internet ................................ xv VisualAge Support on CompuServe ..................... xvii About the Authors ................................ xvii Acknowledgments . xviii Comments Welcome . xix Chapter 1. AS/400 Connection . 1 Multiple Programs with a Single Remote Procedure Call ......... 1 RPC Part Sets Commit Boundary ........................ 1 Connection Problem with V3R1 ......................... 2 AS/400 Communication Error .......................... 2 Strange Characters on Log-on Window .................... 3 Quick Form from AS/400 Record Classes ................... 3 Communication . 4 Read Next/Previous . 4 SQL Statements . 5 Data Queues and Records ............................ 6 ODBC Requirements .
    [Show full text]
  • Liste Von Programmiersprachen
    www.sf-ag.com Liste von Programmiersprachen A (1) A (21) AMOS BASIC (2) A# (22) AMPL (3) A+ (23) Angel Script (4) ABAP (24) ANSYS Parametric Design Language (5) Action (25) APL (6) Action Script (26) App Inventor (7) Action Oberon (27) Applied Type System (8) ACUCOBOL (28) Apple Script (9) Ada (29) Arden-Syntax (10) ADbasic (30) ARLA (11) Adenine (31) ASIC (12) Agilent VEE (32) Atlas Transformatikon Language (13) AIMMS (33) Autocoder (14) Aldor (34) Auto Hotkey (15) Alef (35) Autolt (16) Aleph (36) AutoLISP (17) ALGOL (ALGOL 60, ALGOL W, ALGOL 68) (37) Automatically Programmed Tools (APT) (18) Alice (38) Avenue (19) AML (39) awk (awk, gawk, mawk, nawk) (20) Amiga BASIC B (1) B (9) Bean Shell (2) B-0 (10) Befunge (3) BANCStar (11) Beta (Programmiersprache) (4) BASIC, siehe auch Liste der BASIC-Dialekte (12) BLISS (Programmiersprache) (5) Basic Calculator (13) Blitz Basic (6) Batch (14) Boo (7) Bash (15) Brainfuck, Branfuck2D (8) Basic Combined Programming Language (BCPL) Stichworte: Hochsprachenliste Letzte Änderung: 27.07.2016 / TS C:\Users\Goose\Downloads\Softwareentwicklung\Hochsprachenliste.doc Seite 1 von 7 www.sf-ag.com C (1) C (20) Cluster (2) C++ (21) Co-array Fortran (3) C-- (22) COBOL (4) C# (23) Cobra (5) C/AL (24) Coffee Script (6) Caml, siehe Objective CAML (25) COMAL (7) Ceylon (26) Cω (8) C for graphics (27) COMIT (9) Chef (28) Common Lisp (10) CHILL (29) Component Pascal (11) Chuck (Programmiersprache) (30) Comskee (12) CL (31) CONZEPT 16 (13) Clarion (32) CPL (14) Clean (33) CURL (15) Clipper (34) Curry (16) CLIPS (35)
    [Show full text]
  • Gemstone/S Programming Guide
    GemStone® GemStone/S Programming Guide December 2001 GemStone/S Version 6.0 GemStone Programming Guide IMPORTANT NOTICE This manual and the information contained in it are furnished for informational use only and are subject to change without notice. GemStone Systems, Inc. assumes no responsibility or liability for any errors or inaccuracies that may appear in this manual or in the information contained in it. The manual, or any part of it, may not be reproduced, displayed, photocopied, transmitted or otherwise copied in any form or by any means now known or later developed, such as electronic, optical or mechanical means, without written authorization from GemStone Systems, Inc. Any unauthorized copying may be a violation of law. The software installed in accordance with this manual is copyrighted and licensed by GemStone Systems, Inc. under separate license agreement. This software may only be used pursuant to the terms and conditions of such license agreement. Any other use may be a violation of law. Limitations The software described in this manual is a customer-supported product. Due to the customer’s ability to change any part of a Smalltalk image, GemStone Systems, Inc. cannot guarantee that the GemStone programming environment will function with all Smalltalk images. 1988–2001 by GemStone Systems, Inc. All rights reserved. Use, duplication, or disclosure by the Government is subject to restrictions set forth in subparagraph (c)(1)(ii) of the Rights in Technical Data and Computer Software clause at DFARS 252.227-7013. Trademarks GemStone, GemBuilder, GemConnect, GemEnterprise, andGemORB are registered trademark of GemStone Systems, Inc. The GemStone logo is a registered trademark of GemStone Systems, Inc.
    [Show full text]
  • A Metacircular Architecture for Runtime Optimisation Persistence Clément Béra
    Sista: a Metacircular Architecture for Runtime Optimisation Persistence Clément Béra To cite this version: Clément Béra. Sista: a Metacircular Architecture for Runtime Optimisation Persistence. Program- ming Languages [cs.PL]. Université de Lille 1, 2017. English. tel-01634137 HAL Id: tel-01634137 https://hal.inria.fr/tel-01634137 Submitted on 13 Nov 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Universit´edes Sciences et Technologies de Lille { Lille 1 D´epartement de formation doctorale en informatique Ecole´ doctorale SPI Lille UFR IEEA Sista: a Metacircular Architecture for Runtime Optimisation Persistence THESE` pr´esent´eeet soutenue publiquement le 15 Septembre 2017 pour l'obtention du Doctorat de l'Universit´edes Sciences et Technologies de Lille (sp´ecialit´einformatique) par Cl´ement B´era Composition du jury Pr´esident: Theo D'Hondt Rapporteur : Ga¨elThomas, Laurence Tratt Examinateur : Elisa Gonzalez Boix Directeur de th`ese: St´ephaneDucasse Co-Encadreur de th`ese: Marcus Denker Laboratoire d'Informatique Fondamentale de Lille | UMR USTL/CNRS 8022 INRIA Lille - Nord Europe Numero´ d’ordre: XXXXX i Acknowledgments I would like to thank my thesis supervisors Stéphane Ducasse and Marcus Denker for allowing me to do a Ph.D at the RMoD group, as well as helping and supporting me during the three years of my Ph.D.
    [Show full text]
  • The Future: the Story of Squeak, a Practical Smalltalk Written in Itself
    Back to the future: the story of Squeak, a practical Smalltalk written in itself Dan Ingalls, Ted Kaehler, John Maloney, Scott Wallace, and Alan Kay [Also published in OOPSLA ’97: Proc. of the 12th ACM SIGPLAN Conference on Object-oriented Programming, 1997, pp. 318-326.] VPRI Technical Report TR-1997-001 Viewpoints Research Institute, 1209 Grand Central Avenue, Glendale, CA 91201 t: (818) 332-3001 f: (818) 244-9761 Back to the Future The Story of Squeak, A Practical Smalltalk Written in Itself by Dan Ingalls Ted Kaehler John Maloney Scott Wallace Alan Kay at Apple Computer while doing this work, now at Walt Disney Imagineering 1401 Flower Street P.O. Box 25020 Glendale, CA 91221 [email protected] Abstract Squeak is an open, highly-portable Smalltalk implementation whose virtual machine is written entirely in Smalltalk, making it easy to debug, analyze, and change. To achieve practical performance, a translator produces an equivalent C program whose performance is comparable to commercial Smalltalks. Other noteworthy aspects of Squeak include: a compact object format that typically requires only a single word of overhead per object; a simple yet efficient incremental garbage collector for 32-bit direct pointers; efficient bulk- mutation of objects; extensions of BitBlt to handle color of any depth and anti-aliased image rotation and scaling; and real-time sound and music synthesis written entirely in Smalltalk. Overview Squeak is a modern implementation of Smalltalk-80 that is available for free via the Internet, at http://www.research.apple.com/research/proj/learning_concepts/squeak/ and other sites. It includes platform-independent support for color, sound, and image processing.
    [Show full text]
  • AIDA/Scribo a Powerful CMS at Your Fingertips!
    AIDA/Scribo a powerful CMS at your fingertips! Nicolas Petton Contents Why another CMS? Architecture History Scribo at work Future Demo Contents Why another CMS? Architecture History Scribo at work Future Demo What is a CMS? Content Management System Web application (Web CMS or WCMS) Used for creating and managing HTML content : HTML pages Associated documents (images, attached files, etc) Why another CMS? Leveraging Smalltalk strengths Leveraging Aida/Web strengths CMS framework for different CMS apps For developers and end users Leveraging AIDA/Web strengths RESTFull and nice looking URLs User, group, role support Security (Access control) Components Ajax integration Contents Why another CMS? Architecture History Scribo at work Future Demo Architecture Architecture Document Attachments Versioning Access rights Lifecycle Locking Workflow Multilingual Subdocuments support References Persistence Other Document Versioning Many versions Url always points to the released version Access to all versions (http://www.site.org/article.html? version=4) Document Lifecycle States during document's life : #pending, #released, #obsolete, ... Can be extended and tailored Document Workflow Managing flow of work through document lifecycle From editing, multiperson approvals, to releasing Who when what needs to do some task Email requesting for some task Email notifications of task done Document Subdocument Vertical hierarchy of documents Folder is a subclass of Document Folder can contain documents or other folders Document can have Chapters (again subclass
    [Show full text]
  • Using Gemstone
    Chapter 17: Using GemStone Let’s get started using GemStone. 1. First we will quickly create a ‘Hello World’ application in GemStone. a. Start GemStone and the Seaside gems using the instructions from Chapter 16 (if it is not running) and launch GemTools. b. In the GemTools launcher, select Seaside, and click the ‘Login’ button. Enter your name if requested. c. Once logged in, click the ‘Tools…’ button and select 'System Browser'. d. This will open an OB System Browser showing GemStone code. Click in the first column to get a class creation template and enter the following in the text area: WAComponent subclass: 'HelloWorld' instVarNames: #() classVars: #() classInstVars: #() poolDictionaries: #[] inDictionary: '' category: 'GLASS' 14-Feb-11 Copyright © 2011 by VMware, Inc. 1 Chapter 17: Using GemStone e. This should update your System Browser to show the new class. f. Click in the third column to change the text area from a class definition to a method template. Enter and save the render method. renderContentOn: html html heading: 'Hello World!'. 14-Feb-11 Copyright © 2011 by VMware, Inc. 2 Chapter 17: Using GemStone g. Register the component as an application. Select the GemTools Launcher, click in the text area below the buttons and enter the expression to register the application. Press <Ctrl>+<D> (for ‘do-it’) to evaluate the expression. WAAdmin register: HelloWorld asApplicationAt: 'hello'. h. Open a web browser on http://glass/browse and note that ‘hello’ is listed. i. Click on the ‘hello’ link to get the application. 14-Feb-11 Copyright © 2011 by VMware, Inc. 3 Chapter 17: Using GemStone 2.
    [Show full text]
  • Towards Gradual Typing for Generics
    Towards Gradual Typing for Generics Lintaro Ina and Atsushi Igarashi Graduate School of Informatics, Kyoto University {ina,igarashi}@kuis.kyoto-u.ac.jp Abstract. Gradual typing, proposed by Siek and Taha, is a framework to combine the benefits of static and dynamic typing. Under gradual typing, some parts of the program are type-checked at compile time, and the other parts are type-checked at run time. The main advantage of gradual typing is that a programmer can write a program rapidly without static type annotations in the beginning of development, then add type annotations as the development progresses and end up with a fully statically typed program; and all these development steps are carried out in a single language. This paper reports work in progress on the introduction of gradual typing into class-based object-oriented programming languages with generics. In previous work, we have developed a gradual typing system for Feather- weight Java and proved that statically typed parts do not go wrong. After reviewing the previous work, we discuss issues raised when generics are introduced, and sketch a formalization of our solutions. 1 Introduction Siek and Taha have coined the term “gradual typing” [1] for a linguistic sup- port of the evolution from dynamically typed code, which is suitable for rapid prototyping, to fully statically typed code, which enjoys type safety properties, in a single programming language. The main technical challenge is to ensure some safety property even for partially typed programs, in which some part is statically typed and the rest is dynamically typed. The framework of gradual typing consists of two languages: the surface lan- guage in which programmers write programs and the intermediate language into which the surface language translates.
    [Show full text]
  • Safe, Fast and Easy: Towards Scalable Scripting Languages
    Safe, Fast and Easy: Towards Scalable Scripting Languages by Pottayil Harisanker Menon A dissertation submitted to The Johns Hopkins University in conformity with the requirements for the degree of Doctor of Philosophy. Baltimore, Maryland Feb, 2017 ⃝c Pottayil Harisanker Menon 2017 All rights reserved Abstract Scripting languages are immensely popular in many domains. They are char- acterized by a number of features that make it easy to develop small applications quickly - flexible data structures, simple syntax and intuitive semantics. However they are less attractive at scale: scripting languages are harder to debug, difficult to refactor and suffers performance penalties. Many research projects have tackled the issue of safety and performance for existing scripting languages with mixed results: the considerable flexibility offered by their semantics also makes them significantly harder to analyze and optimize. Previous research from our lab has led to the design of a typed scripting language built specifically to be flexible without losing static analyzability. Inthis dissertation, we present a framework to exploit this analyzability, with the aim of producing a more efficient implementation Our approach centers around the concept of adaptive tags: specialized tags attached to values that represent how it is used in the current program. Our frame- work abstractly tracks the flow of deep structural types in the program, and thuscan ii ABSTRACT efficiently tag them at runtime. Adaptive tags allow us to tackle key issuesatthe heart of performance problems of scripting languages: the framework is capable of performing efficient dispatch in the presence of flexible structures. iii Acknowledgments At the very outset, I would like to express my gratitude and appreciation to my advisor Prof.
    [Show full text]
  • Strongtalk Plan Prezentacji
    Elżbieta Bajkowska Strongtalk Plan prezentacji Czym jest Strongtalk Historia Strongtalk System typów w Strongtalk Podsumowanie Źródła Czym jest Strongtalk Składnia i semantyka Smalltalk’a-80 plus: Większa wydajność – najszybsza implementacja Smalltalk System typów – opcjonalny i przyrostowy; silny, statyczny system typów działający niezależnie od metody kompilacji (nie typowany kod Smalltalka wykonuje się równie szybko) Typowana biblioteka klas według Smalltalk Blue Book Historia Strongtalk Dwa równoległe i niezależne wątki rozwoju przyszłego systemu Strongtalk Zachodnie wybrzeże – prace grupy związanej z językiem Self nad innowacyjną maszyną wirtualną Wschodnie wybrzeże – prace nad systemem typów dla języka Smalltalk Historia Strongtalk Zachód – maszyna wirtualna Cel – poprawienie wydajności czysto obiektowego języka Self Satysfakcjonujące odśmiecanie Problem efektywnej kompilacji dla dynamicznie typowanego języka, używającego konstrukcji bloku gdzie wszystkie dane są obiektami (analogia do Smalltalk’a) - Urs Hoelzle Historia Strongtalk Wschód – system typów Dave Griswold i Gilad Bracha opracowują Strongtalk - (nazwa systemu wywodzi się od systemu typów) – konferencja OOPSLA ’93 Baza – biblioteki ParcPlace Smalltalk, nie odzwierciedlające w pełni hierarchii typów Strongtalka Zainteresowanie technologią grupy pracującej nad kompilatorem Self dla poprawienia wydajności Historia Strongtalk Połączenie technologii Animorphic Systems - Dave Griswold zaczyna współpracę z Urs’em Hoelzle (reszta grupy: Lars Bak, Gilad Bracha,
    [Show full text]
  • Type Feedback for Bytecode Interpreters Position Paper ICOOOLPS 2007
    Type Feedback for Bytecode Interpreters Position Paper ICOOOLPS 2007 Michael Haupt1, Robert Hirschfeld1, and Marcus Denker2 1 Software Architecture Group Hasso-Plattner-Institut University of Potsdam, Germany 2 Software Composition Group Institute of Computer Science and Applied Mathematics University of Berne, Switzerland michael.haupt,hirschfeld @hpi.uni-potsdam.de, [email protected] { } Abstract. This position paper proposes the exploitation of type feed- back mechanisms, or more precisely, polymorphic inline caches, for purely interpreting implementations of object-oriented programming languages. Using Squeak’s virtual machine as an example, polymorphic inline caches are discussed as an alternative to global caching. An implementation proposal for polymorphic inline caches in the Squeak virtual machine is presented, and possible future applications for online optimization are outlined. 1 Introduction Bytecode interpreters are small in size and comparatively easy to implement, but generally execute programs much less efficiently than just-in-time (JIT) compilers. Techniques like threaded interpretation [9, 11, 2] focus on speeding up bytecode interpretation itself, and caching [4, 5, 1] improves the performance of message sends—the most common operation in object-oriented software [7]. It is interesting to observe that, while threading mechanisms are used natu- rally to a varying degree in bytecode interpreter implementations, such systems usually employ only global caching to speed up dynamic method dispatch. A global cache is clearly beneficial with respect to overall performance. Still, it does not provide optimal support for polymorphic message send sites, and it does not allow for exploiting type information (we provide details on these issues in the following section). In our opinion, the employment of polymorphic inline caches (PICs) [5] instead can provide means for achieving significant speedups in bytecode interpreters while exhibiting only a moderate increase in memory footprint and implementation complexity.
    [Show full text]