DOCSLIB.ORG

Proceedings.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Proceedings.Pdf Goals and scopes •The goals of the workshop is to create a forum around advances or experience in Smalltalk and to trigger discussions and exchanges of ideas. Participants are invited to submit research articles. We will not enforce any length restriction. However we expect papers of two kinds: –Short position papers describing emerging ideas. –Long research papers with deeper description of experiments and of research results. •We welcome contributions on all aspects, theoretical as well as practical, of Smalltalk related topics such as: –Aspect-oriented programming, –Design patterns, –Experience reports, –Frameworks, –Implementation, –new dialects or languages implemented in Smalltalk, –Interaction with other languages, –Meta-programming and Meta-modeling, –Tools Publication •Both submissions and final papers must be prepared using the ACM SIGPLAN 10 point format. Templates for Word and LaTeX are available at http://www.acm.org/sigs/sigplan/authorInformation.htm •Authors of the best accepted papers will also be invited to submit extended versions for publication in a special issue of Elsevier "Science of Computer Programming: Methods of Software Design: Techniques and Applications" •Please submit your paper through EasyChair on http://www.easychair.org/conferences/?conf=iwst2012 Program Chairs •Loïc Lagadec Lab-STICC, UBO, France •Alain Plantec, Lab-STICC, UBO, France Program Committee •Gabriela Arevalo, Universidad Nacional de Quilmes, Agentina •Alexandre Bergel University of Chile •Andrew P. Black Portland State University, US •Marcus Denker Rmod, INRIA Lille - Nord Europe, France •Luc Fabresse Ecole des Mines de Douai, France, •Tudor Girba CompuGroup Medical Schweiz, Switzerland •Andy Kellens Software Languages Lab, Vrije Universiteit Brussel, Belgium •Mickaël Kerboeuf LabSticc, University of Brest, France •Jannik Laval LaBRI, University of Bordeaux, France •Mariano Martinez Peck Ecole des Mines de Douai, France, •Lukas Renggli Google, Switzerland •Jorge Ressia Software Composition Group, University of Bern, Switzerland •Bastian Steinert HPI, Software Architecture Group, Germany •Hernan Wilkinson 10Pines, IT consultancy, Buenos Aires, Argentina •Roel Wuyts IMEC Leuven, Belgium IWST 2012 Table of Contents Table of Contents Forewords................................................................................. 1 Loic Lagadec and Alain Plantec SESSION 1 On the Integration of Smalltalk and Java . 7 Marcel Hlopko, Jan Kurs, Jan Vrany and Claus Gittinger Refactoring Support For Smalltalk Using Static Type Inference . 19 Martin Unterholzner Smalltalk in a C World. 37 David Chisnall SESSION 2 Tracking Down Software Changes Responsible for Performance Loss . 49 Juan Pablo Sandoval Alcocer Spec A Framework for the Specification and Reuse of UIs and their Models. 56 Benjamin Van Ryseghem, Stephane´ Ducasse and Johan Fabry 4 IWST 2012 Author Index Author Index Chisnall, David 37 Ducasse, Stephane´ 56 Fabry, Johan 56 Gittinger, Claus 7 Hlopko, Marcel 7 Kurs, Jan 7 Lagadec, Loic 1 Plantec, Alain 1 Sandoval Alcocer, Juan Pablo 49 Unterholzner, Martin 19 Van Ryseghem, Benjamin 56 Vrany, Jan 7 5 IWST 2012 Keyword Index Keyword Index Compilation 37 Framework 56 Interoperability 7, 37 Java 7 Language interoperability 7 MVP 56 Objective-C 37 Pharo 56 Profiling 49 Refactoring 19 Smalltalk 7, 19, 37, 56 Software evolution 49 Software execution 49 Static code analysis 19 Type inference 19 UI 56 UIBuilder 56 6 On the Integration of Smalltalk and Java Practical Experience with STX:LIBJAVA Marcel Hlopko Jan Kurš Jan Vraný Czech Technical University in Software Composition Group, Czech Technical University in Prague University of Bern Prague, eXept Software AG marcel.hlopko@fit.cvut.cz [email protected] jan.vrany@fit.cvut.cz Claus Gittinger eXept Software AG [email protected] Abstract Categories and Subject Descriptors H.3.3 [Programming After decades of development in programming languages Languages]: Language Constructs and Features—Language and programming environments, Smalltalk is still one of Interoperability; H.3.4 [Programming Languages]: Pro- few environments that provide advanced features and is still cessors—Interpreters, Virtual Machines widely used in the industry. However, as Java became preva- General Terms Language Interoperability lent, the ability to call Java code from Smalltalk and vice versa becomes important. Traditional approaches to inte- Keywords Language Interoperability, Smalltalk, Java grate the Java and Smalltalk languages are through low-level communication between separate Java and Smalltalk virtual 1. Introduction machines. We are not aware of any attempt to execute Without doubt, the Java programming language has become and integrate the Java language directly in the Smalltalk en- one of the most widely used programming languages today. vironment. A direct integration allows for very tight and A significant amount of code is written in Java, ranging almost seamless integration of the languages and their ob- from small libraries to large-scale application servers and jects within a single environment. Yet integration and lan- business applications. Nevertheless, Smalltalk still provides guage interoperability impose challenging issues related to a number of unique features (such as advanced reflection method naming conventions, method overloading, exception support or expressive exception mechanism) lacking in Java, handling and thread-locking mechanisms. which makes Smalltalk suitable for many kinds of project. In this paper we describe ways to overcome these chal- It is a tempting idea to call Java from Smalltalk and vice lenges and to integrate Java into the Smalltalk environment. versa, as it enables the use of many Java libraries within Using techniques described in this paper, the programmer Smalltalk projects. can call Java code from Smalltalk using standard Smalltalk The idea of Java-Smalltalk integration is not new and has idioms while the semantics of each language remains pre- been explored by others in the past. JavaConnect (Brichau served. We present STX:LIBJAVA — an implementation of and De Roover [1]) and JNIPort (Geidel [4]) use foreign Java virtual machine within Smalltalk/X — as a validation function interfaces to connect to the Java virtual machine of our approach. and to call a Java code. Bridges, such as VisualAge for Java (Deupree and Weitzel [2]) or Expecco Java Interface Li- brary (Expecco [3]), use proxy objects, which intercept and forward function calls and return result values or handles via an interprocess communication channel. Another more versatile approach, is to execute both languages within the same virtual machine and use a common object representa- tion for both. STX:LIBJAVA, which is presented in this paper, is an example of such an approach: it executes Java within [Copyright notice will appear here once ’preprint’ option is removed.] the Smalltalk virtual machine. Another example is Redline 1 2012/8/15 Smalltalk (Ladd [9]), which executes Smalltalk using stan- lems when integrating these languages into a common sys- dard Java virtual machine. tem. Seamless, easy to use integration of two programming languages consists of various parts. First, it must allow one 1. Class access. In Smalltalk classes are identified by name. language to call functions in the other, possibly passing There is only one class with a given name at any time (al- argument objects and getting return values (runtime-level though it may change over time) and it must be present integration). and resolved prior to the code actually beeing executed. Second, it should support programmer-friendly argument The system triggers a runtime error otherwise. The pro- and return value passing between the languages. cess of loading classes into the system is not specified in Third, it should ideally preserve object identity. The use the standard, although some Smalltalk dialects provide of replicas or proxy objects can introduce various problems namespaces and/or a lazy class loading facility. when objects are stored or managed by their identity. This On the other hand Java provides a well-defined, user- also affects any side effects to such objects when calling extensible mechanism called classloaders for lazy-loading functions in the other language. of classes into a running system. Moreover in Java a Finally, it should seamlessly integrate the two languages class is not only identified by its name but by its defining on the syntactic level, which means that (ideally) no addi- classloader as well. In other words two possibly different tional glue or marshalling code should be required to call classes with the same name may coexist in the running the other language (language-level integration). system as long as they have been defined by different In the case of Java and Smalltalk, language-level integra- classloaders. Which classloader is used to load a partic- tion raises a number of challenges, due to their different de- ular class at a particular place in the code is a subject to sign and semantics. In particular these are: complex rules and depends on the runtime context. 2. Selector mismatch. On the bytecode level, a method is • Smalltalk uses keyword message selectors, whereas Java identified by a selector in both languages. However, the uses traditional C-like selectors (virtual function names). syntactic format of selectors differs. Smalltalk uses the • Java supports method overloading based on static types, same selector in bytecode and in a source code. Java en- whereas there is no static type information in Smalltalk.
Load more

Recommended publications
  • Latent GOLD, Polca, and MCLUST
    JOBNAME: tast 63#1 2009 PAGE: 1 OUTPUT: Thursday January 15 07:45:17 2009 asa/tast/164303/SR3 Review of Three Latent Class Cluster Analysis Packages: Latent GOLD, poLCA, and MCLUST Dominique HAUGHTON, Pascal LEGRAND, and Sam WOOLFORD McCutcheon (2002). Because LCA is based upon a statistical model, maximum likelihood estimates can be used to classify This article reviews three software packages that can be used cases based upon what is referred to as their posterior proba- to perform latent class cluster analysis, namely, Latent GOLDÒ, bility of class membership. In addition, various diagnostics are MCLUST, and poLCA. Latent GOLDÒ is a product of Statistical available to assist in the determination of the optimal number Innovations whereas MCLUST and poLCA are packages of clusters. written in R and are available through the web site http:// LCA has been used in a broad range of contexts including www.r-project.org. We use a single dataset and apply each sociology, psychology, economics, and marketing. LCA is software package to develop a latent class cluster analysis for presented as a segmentation tool for marketing research and the data. This allows us to compare the features and the tactical brand decision in Finkbeiner and Waters (2008). Other resulting clusters from each software package. Each software applications in market segmentation are given in Cooil, package has its strengths and weaknesses and we compare the Keiningham, Askoy, and Hsu (2007), Malhotra, Person, and software from the perspectives of usability, cost, data charac- Bardi Kleiser (1999), Bodapati (2008), and Pancras and Sudhir teristics, and performance.
    [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]
  • 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]
  • 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]
  • 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]
  • A Tour of the Squeak Object Engine
    A Tour of the Squeak Object Engine A Tour of the Squeak Object Engine Tim Rowledge, [email protected] Introduction This chapter is intended to explain some basics of how a Virtual Machine (VM) works, why a VM is useful, what it does for the Squeak programmer and user, and how the Squeak VM might develop in the future. What is a Virtual Machine and why do we need one? A Virtual Machine provides us with a pretense of being a machine other than the actual hardware in use. Using one allows systems that behave differently than the host hardware to run as if on hardware designed for them. The term Object Engine is less commonly used but is a useful concept that includes the lowest system areas of the langauge environment running on the VM. Since there is often some flux in the definition of which components are within the actual VM and which are part of the supported environment, Object Engine is useful as a more inclusive term. The term Virtual Machine is used in several ways. When IBM refer to VM/CMS they are referring to a way of making a mainframe behave as if it is many machines, so that programs can assume they have total control even though they do not. Intel provide a somewhat similar facility in the x86 architecture(?), referred to as Virtual Mode. This sort of VM is a complete hardware simulation, often supported at the lowest level by the hardware. Another sort of VM is the emulator - SoftWindows for the Mac, Acorn's !PC, Linux's WINE are good examples - where another machine and/or OS is simulated to allow a Mac user to run Windows programs, an Acorn RiscPC or a Linux machine to run Windows98 programs and so on.
    [Show full text]
  • Sindarin: a Versatile Scripting API for the Pharo Debugger
    Sindarin: A Versatile Scripting API for the Pharo Debugger Thomas Dupriez Guillermo Polito Steven Costiou Univ. Lille, CNRS, Centrale Lille, CNRS - UMR 9189 - CRIStAL, Univ. Inria, Univ. Lille, CNRS, Centrale Inria, UMR 9189 - CRIStAL Lille, Centrale Lille, Inria Lille, UMR 9189 - CRIStAL France France France [email protected] [email protected] [email protected] Vincent Aranega Stéphane Ducasse Univ. Lille, CNRS, Centrale Lille, Inria, Univ. Lille, CNRS, Centrale Inria, UMR 9189 - CRIStAL Lille, UMR 9189 - CRIStAL France France [email protected] [email protected] Abstract Studies and work on debugging acknowledge that main- Debugging is one of the most important and time consuming stream debuggers are not well adapted to several debugging activities in software maintenance, yet mainstream debuggers scenarios [3, 27, 31]. This has led to the appearance of new de- are not well-adapted to several debugging scenarios. This bugging techniques proposing to augment traditional interac- has led to the research of new techniques covering specific tive debuggers with, e.g., stateful breakpoints [4], control-flow families of complex bugs. Notably, recent research proposes aware breakpoints [5], object-centric breakpoints [10, 34], the to empower developers with scripting DSLs, plugin-based and automatic insertion of breakpoints based on dynamic execu- moldable debuggers. However, these solutions are tailored to tions [45], or declarative statements from the developer [21]. specific use-cases, or too costly for one-time-use scenarios. A line of research has also started to study scripting APIs to In this paper we argue that exposing a debugging scripting empower developers to implement debugging scripts adapted interface in mainstream debuggers helps in solving many chal- to their needs.
    [Show full text]
  • Smalltalk Language Mapping Specification
    Smalltalk Language Mapping Specification New Edition: June 1999 Copyright 1995, 1996 BNR Europe Ltd. Copyright 1998, Borland International Copyright 1991, 1992, 1995, 1996 Digital Equipment Corporation Copyright 1995, 1996 Expersoft Corporation Copyright 1996, 1997 FUJITSU LIMITED Copyright 1996 Genesis Development Corporation Copyright 1989, 1990, 1991, 1992, 1995, 1996 Hewlett-Packard Company Copyright 1991, 1992, 1995, 1996 HyperDesk Corporation Copyright 1998 Inprise Corporation Copyright 1996, 1997 International Business Machines Corporation Copyright 1995, 1996 ICL, plc Copyright 1995, 1996 IONA Technologies, Ltd. Copyright 1996, 1997 Micro Focus Limited Copyright 1991, 1992, 1995, 1996 NCR Corporation Copyright 1995, 1996 Novell USG Copyright 1991,1992, 1995, 1996 by Object Design, Inc. Copyright 1991, 1992, 1995, 1996 Object Management Group, Inc. Copyright 1996 Siemens Nixdorf Informationssysteme AG Copyright 1991, 1992, 1995, 1996 Sun Microsystems, Inc. Copyright 1995, 1996 SunSoft, Inc. Copyright 1996 Sybase, Inc. Copyright 1998 Telefónica Investigación y Desarrollo S.A. Unipersonal Copyright 1996 Visual Edge Software, Ltd. The companies listed above have granted to the Object Management Group, Inc. (OMG) a nonexclusive, royalty-free, paid up, worldwide license to copy and distribute this document and to modify this document and distribute copies of the modified ver- sion. Each of the copyright holders listed above has agreed that no person shall be deemed to have infringed the copyright in the included material of any such copyright holder by reason of having used the specification set forth herein or having con- formed any computer software to the specification. PATENT The attention of adopters is directed to the possibility that compliance with or adoption of OMG specifications may require use of an invention covered by patent rights.
    [Show full text]
  • CS 535 Object-Oriented Programming & Design Fall Semester, 2008 Doc
    CS 535 Object-Oriented Programming & Design Fall Semester, 2008 Doc 4 Starting VisualWorks Sept 9 2008 Copyright ©, All rights reserved. 2008 SDSU & Roger Whitney, 5500 Campanile Drive, San Diego, CA 92182-7700 USA. OpenContent (http:// www.opencontent.org/openpub/) license defines the copyright on this document. Reference VisualWorks Application Developer’s Guide, doc/AppDevGuide.pdf in the VisualWorks installation. Chapter 1 The VisualWorks Environment. Reading VisualWorks Application Developer’s Guide, doc/AppDevGuide.pdf in the VisualWorks installation. Chapter 1 The VisualWorks Environment. Chapter 2 Programming in VisualWorks (minus the sections Loading Code Libraries & Paintng a GUI) 2 Learning Smalltalk Smalltalk language syntax Smalltalk Programming Environment Smalltalk Class Library Object-oriented thinking This is the hardest part Smalltalk culture 3 Versions of Smalltalk VisualWorks VisualAge for Smalltalk Squeak Dolphin Smalltalk X Smallscript (.NET Smalltalk) 4 Bytecode & VMs Smalltalk is compiled to a bytecode for a virtual machine VisualWorks has VM's for: Windows Macintosh Unix/Linux VisualWork’s virtual machine (VM) uses a JIT to compile bytecodes 5 Parts of VisualWorks Executable Virtual Machine (visual, visual.exe) This is the VM that interprets Smalltalk bytecode visual.sou Source code for most of class library visual.cha Source code for changes & new classes Does not exist until after you first use VisualWorks visual.im Bytecode of sources that are executed At first the image will appear to be an IDE for Smalltalk 6 Before Starting VisualWorks Make a copy of visual.im You will need it later 7 Starting VisualWorks on Windows Method 1 Drag and drop the image file on the Visual application or visual.exe Method 2 Double click on the image file The first time you do this you may get a dialog asking for the application to run the image.
    [Show full text]
  • Pharo by Example
    Pharo by Example Andrew P. Black Stéphane Ducasse Oscar Nierstrasz Damien Pollet with Damien Cassou and Marcus Denker Version of 2009-10-11 ii This book is available as a free download from http://PharoByExample.org. Copyright © 2007, 2008, 2009 by Andrew P. Black, Stéphane Ducasse, Oscar Nierstrasz and Damien Pollet. The contents of this book are protected under Creative Commons Attribution-ShareAlike 3.0 Unported license. You are free: to Share — to copy, distribute and transmit the work to Remix — to adapt the work Under the following conditions: Attribution. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). Share Alike. If you alter, transform, or build upon this work, you may distribute the resulting work only under the same, similar or a compatible license. • For any reuse or distribution, you must make clear to others the license terms of this work. The best way to do this is with a link to this web page: creativecommons.org/licenses/by-sa/3.0/ • Any of the above conditions can be waived if you get permission from the copyright holder. • Nothing in this license impairs or restricts the author’s moral rights. Your fair dealing and other rights are in no way affected by the above. This is a human-readable summary of the Legal Code (the full license): creativecommons.org/licenses/by-sa/3.0/legalcode Published by Square Bracket Associates, Switzerland. http://SquareBracketAssociates.org ISBN 978-3-9523341-4-0 First Edition, October, 2009.
    [Show full text]
  • R Pass by Reference
    R Pass By Reference Unlidded Sherlock verjuices or imbibe some pancake ingenuously, however littery Winifield denitrifies detestably or jellified. Prasun rhubarbs simperingly while overnice Stanleigh witch thru or rent immemorially. Acescent and unprejudiced Tanney stints her distillations damming or jitterbugging luxuriously. Doing so any task in the argument and reference by value of the use it and data have no problems become hard to have been deactivated Thanks for sharing it. Modernization can operate much faster, simpler, and safer when supported with analysis tools and even code transformation tools. But by appending an element, they created a new hardware which, of course, did you update the reference. Joe, this is indeed excellent tutorial in your Java kitty. However, this section focuses on wade is afraid to template implementation. What are someone different types of Classes in Java? To insure goods are released, we need to begin able to decrement their reference counts once we no longer made them. You should contact the package authors for that. Limit the loop variable visibility to the except of cord loop. Protected member function can be simply fine. If she is a default constructor, compare those assignments to the initializations in the default constructor. Left clear Right sides of an assignment statement. What began the basic Structure of a Java Program? This can experience nasty bugs that are extremely hard to debug. Warn the two consecutive parameters share is same type. How can Convert Char To stuff In Java? Please lift the information below before signing in. NOTHING but pass by reference in Java.
    [Show full text]