DOCSLIB.ORG

SBCL History SBCL Present SBCL Future

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
SBCL History SBCL Present SBCL Future Introduction SBCL History SBCL Present SBCL Future 20 more years of bootstrapping SBCL – past, present, future Christophe Rhodes April 1, 2019 . Speaking for myself 1 / 61 Introduction SBCL History SBCL Present SBCL Future Outline Introduction Who am I? What is SBCL? SBCL History Prehistory SBCL SBCL Present 2019 State of the system Issues raised by user survey SBCL Future Roadmap Development Project . Speaking for myself 2 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Contact details Christophe Rhodes <[email protected]> . Speaking for myself 3 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Contact details Christophe Rhodes <[email protected]> . Speaking for myself 4 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Contact details wait, what? . Speaking for myself 5 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Currently Software Engineer, Android Developer Tools . Not speaking for Google 6 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Currently Software Engineer, Android Developer Tools . Not speaking for Google 6 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously Senior Lecturer, Deputy Head of Department, Computing, Goldsmiths . Not speaking for Google 7 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously Senior Lecturer, Deputy Head of Department, Computing, Goldsmiths . Not speaking for Google 7 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously² Chief Scientist, Chairman, Teclo Networks . Not speaking for Google 8 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously² Chief Scientist, Chairman, Teclo Networks . Not speaking for Google 8 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously³ Research Associate, Computer Music . Not speaking for Google 9 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously³ Research Associate, Computer Music . Not speaking for Google 9 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously⁴ PhD student, speculative cosmology . Not speaking for Google 10 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Previously⁴ PhD student, speculative cosmology . Not speaking for Google 10 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Concurrently SBCL developer and maintainer I first patch: April 2001 I (now old enough to vote!) I commit access, March 2002 . Not speaking for Google 11 / 61 Introduction SBCL History SBCL Present SBCL Future Who am I? Concurrently Theme: no-one employs me to write Common Lisp I not likely to change any time soon I not likely to negatively affect my ability to contribute to SBCL either . Not speaking for Google 12 / 61 I … and garbage collector I … and interpreter (or three) I … and developer tools (profiler, stepper, tracer) I … and language extensions I … and contributed modules I … and WARNINGz Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime . Not speaking for Google 13 / 61 I … and interpreter (or three) I … and developer tools (profiler, stepper, tracer) I … and language extensions I … and contributed modules I … and WARNINGz Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime I … and garbage collector . Not speaking for Google 13 / 61 I … and developer tools (profiler, stepper, tracer) I … and language extensions I … and contributed modules I … and WARNINGz Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime I … and garbage collector I … and interpreter (or three) . Not speaking for Google 13 / 61 I … and language extensions I … and contributed modules I … and WARNINGz Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime I … and garbage collector I … and interpreter (or three) I … and developer tools (profiler, stepper, tracer) . Not speaking for Google 13 / 61 I … and contributed modules I … and WARNINGz Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime I … and garbage collector I … and interpreter (or three) I … and developer tools (profiler, stepper, tracer) I … and language extensions . Not speaking for Google 13 / 61 I … and WARNINGz Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime I … and garbage collector I … and interpreter (or three) I … and developer tools (profiler, stepper, tracer) I … and language extensions I … and contributed modules . Not speaking for Google 13 / 61 Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp A somewhat-optimising mostly-portable native code Common Lisp compiler I … and runtime I … and garbage collector I … and interpreter (or three) I … and developer tools (profiler, stepper, tracer) I … and language extensions I … and contributed modules I … and WARNINGz . Not speaking for Google 13 / 61 Introduction SBCL History SBCL Present SBCL Future What is SBCL? Steel Bank Common Lisp . Not speaking for Google 14 / 61 Introduction SBCL History SBCL Present SBCL Future Prehistory Prehistory: Spice Lisp 1980/1-1984/5 (I know very little about this period) . Google didn’t exist then (historical narrative mine) 15 / 61 I [1992] Rob Maclachlan, CMU Common Lisp user’s manual I MIPS/Mach I SPARC/Mach I (external use of CMU CL begins: volunteer port to SPARC/SunOS) I [1994] DARPA funding for CMU CL stops I [1997] Generational mostly-copying conservative garbage collector implementation (Douglas Crosher; see also Scieneer Common Lisp) I [1997ish] Dan Barlow, CMUCL-on-Linux-HOWTO Introduction SBCL History SBCL Present SBCL Future Prehistory Prehistory: Carnegie-Mellon University Common Lisp 1984/5- I [1987] David B. Macdonald, Scott E. Fahlman, Skef Wholey, Internal Design of CMU Common Lisp on the IBM RT PC I RT/Mach . Google didn’t exist then (historical narrative mine) 16 / 61 I (external use of CMU CL begins: volunteer port to SPARC/SunOS) I [1994] DARPA funding for CMU CL stops I [1997] Generational mostly-copying conservative garbage collector implementation (Douglas Crosher; see also Scieneer Common Lisp) I [1997ish] Dan Barlow, CMUCL-on-Linux-HOWTO Introduction SBCL History SBCL Present SBCL Future Prehistory Prehistory: Carnegie-Mellon University Common Lisp 1984/5- I [1987] David B. Macdonald, Scott E. Fahlman, Skef Wholey, Internal Design of CMU Common Lisp on the IBM RT PC I RT/Mach I [1992] Rob Maclachlan, CMU Common Lisp user’s manual I MIPS/Mach I SPARC/Mach . Google didn’t exist then (historical narrative mine) 16 / 61 I [1994] DARPA funding for CMU CL stops I [1997] Generational mostly-copying conservative garbage collector implementation (Douglas Crosher; see also Scieneer Common Lisp) I [1997ish] Dan Barlow, CMUCL-on-Linux-HOWTO Introduction SBCL History SBCL Present SBCL Future Prehistory Prehistory: Carnegie-Mellon University Common Lisp 1984/5- I [1987] David B. Macdonald, Scott E. Fahlman, Skef Wholey, Internal Design of CMU Common Lisp on the IBM RT PC I RT/Mach I [1992] Rob Maclachlan, CMU Common Lisp user’s manual I MIPS/Mach I SPARC/Mach I (external use of CMU CL begins: volunteer port to SPARC/SunOS) . Google didn’t exist then (historical narrative mine) 16 / 61 I [1997ish] Dan Barlow, CMUCL-on-Linux-HOWTO Introduction SBCL History SBCL Present SBCL Future Prehistory Prehistory: Carnegie-Mellon University Common Lisp 1984/5- I [1987] David B. Macdonald, Scott E. Fahlman, Skef Wholey, Internal Design of CMU Common Lisp on the IBM RT PC I RT/Mach I [1992] Rob Maclachlan, CMU Common Lisp user’s manual I MIPS/Mach I SPARC/Mach I (external use of CMU CL begins: volunteer port to SPARC/SunOS) I [1994] DARPA funding for CMU CL stops I [1997] Generational mostly-copying conservative garbage collector implementation (Douglas Crosher; see also Scieneer Common Lisp) . Google didn’t exist then (historical narrative mine) 16 / 61 Introduction SBCL History SBCL Present SBCL Future Prehistory Prehistory: Carnegie-Mellon University Common Lisp 1984/5- I [1987] David B. Macdonald, Scott E. Fahlman, Skef Wholey, Internal Design of CMU Common Lisp on the IBM RT PC I RT/Mach I [1992] Rob Maclachlan, CMU Common Lisp user’s manual I MIPS/Mach I SPARC/Mach I (external use of CMU CL begins: volunteer port to SPARC/SunOS) I [1994] DARPA funding for CMU CL stops I [1997] Generational mostly-copying conservative garbage collector implementation (Douglas Crosher; see also Scieneer Common Lisp) I [1997ish] Dan Barlow, CMUCL-on-Linux-HOWTO . Google didn’t exist then (historical narrative mine) 16 / 61 Introduction SBCL History SBCL Present SBCL Future Prehistory Some hints on building the system which you might find useful 1. if you change the compiler, you will have to recompile all the sources before the change is reflected in the system […] 2. changing the miscops should be done with care […] note that this requires building a new cold core file and a final core file before the change is reflected in the system […] 3. changing sources in the code directory should be fairly straight forward […] if you change something that a lot of files depend on […] you will have to recompile everything and build a new cold core file and a core file 4. if you make a fairly major change, it is a good idea to go through the process of building a core file at least two or three times.
Load more

Recommended publications
  • An Implementation of Python for Racket
    An Implementation of Python for Racket Pedro Palma Ramos António Menezes Leitão INESC-ID, Instituto Superior Técnico, INESC-ID, Instituto Superior Técnico, Universidade de Lisboa Universidade de Lisboa Rua Alves Redol 9 Rua Alves Redol 9 Lisboa, Portugal Lisboa, Portugal [email protected] [email protected] ABSTRACT Keywords Racket is a descendent of Scheme that is widely used as a Python; Racket; Language implementations; Compilers first language for teaching computer science. To this end, Racket provides DrRacket, a simple but pedagogic IDE. On the other hand, Python is becoming increasingly popular 1. INTRODUCTION in a variety of areas, most notably among novice program- The Racket programming language is a descendent of Scheme, mers. This paper presents an implementation of Python a language that is well-known for its use in introductory for Racket which allows programmers to use DrRacket with programming courses. Racket comes with DrRacket, a ped- Python code, as well as adding Python support for other Dr- agogic IDE [2], used in many schools around the world, as Racket based tools. Our implementation also allows Racket it provides a simple and straightforward interface aimed at programs to take advantage of Python libraries, thus signif- inexperienced programmers. Racket provides different lan- icantly enlarging the number of usable libraries in Racket. guage levels, each one supporting more advanced features, that are used in different phases of the courses, allowing Our proposed solution involves compiling Python code into students to benefit from a smoother learning curve. Fur- semantically equivalent Racket source code. For the run- thermore, Racket and DrRacket support the development of time implementation, we present two different strategies: additional programming languages [13].
    [Show full text]
  • Bringing GNU Emacs to Native Code
    Bringing GNU Emacs to Native Code Andrea Corallo Luca Nassi Nicola Manca [email protected] [email protected] [email protected] CNR-SPIN Genoa, Italy ABSTRACT such a long-standing project. Although this makes it didactic, some Emacs Lisp (Elisp) is the Lisp dialect used by the Emacs text editor limitations prevent the current implementation of Emacs Lisp to family. GNU Emacs can currently execute Elisp code either inter- be appealing for broader use. In this context, performance issues preted or byte-interpreted after it has been compiled to byte-code. represent the main bottleneck, which can be broken down in three In this work we discuss the implementation of an optimizing com- main sub-problems: piler approach for Elisp targeting native code. The native compiler • lack of true multi-threading support, employs the byte-compiler’s internal representation as input and • garbage collection speed, exploits libgccjit to achieve code generation using the GNU Com- • code execution speed. piler Collection (GCC) infrastructure. Generated executables are From now on we will focus on the last of these issues, which con- stored as binary files and can be loaded and unloaded dynamically. stitutes the topic of this work. Most of the functionality of the compiler is written in Elisp itself, The current implementation traditionally approaches the prob- including several optimization passes, paired with a C back-end lem of code execution speed in two ways: to interface with the GNU Emacs core and libgccjit. Though still a work in progress, our implementation is able to bootstrap a func- • Implementing a large number of performance-sensitive prim- tional Emacs and compile all lexically scoped Elisp files, including itive functions (also known as subr) in C.
    [Show full text]
  • Common Lispworks User Guide
    LispWorks® for the Windows® Operating System Common LispWorks User Guide Version 5.1 Copyright and Trademarks Common LispWorks User Guide (Windows version) Version 5.1 February 2008 Copyright © 2008 by LispWorks Ltd. All Rights Reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of LispWorks Ltd. The information in this publication is provided for information only, is subject to change without notice, and should not be construed as a commitment by LispWorks Ltd. LispWorks Ltd assumes no responsibility or liability for any errors or inaccuracies that may appear in this publication. The software described in this book is furnished under license and may only be used or copied in accordance with the terms of that license. LispWorks and KnowledgeWorks are registered trademarks of LispWorks Ltd. Adobe and PostScript are registered trademarks of Adobe Systems Incorporated. Other brand or product names are the registered trade- marks or trademarks of their respective holders. The code for walker.lisp and compute-combination-points is excerpted with permission from PCL, Copyright © 1985, 1986, 1987, 1988 Xerox Corporation. The XP Pretty Printer bears the following copyright notice, which applies to the parts of LispWorks derived therefrom: Copyright © 1989 by the Massachusetts Institute of Technology, Cambridge, Massachusetts. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, pro- vided that this copyright and permission notice appear in all copies and supporting documentation, and that the name of M.I.T.
    [Show full text]
  • IDE User Guide Version 7.1 Copyright and Trademarks Lispworks IDE User Guide (Unix Version) Version 7.1 September 2017 Copyright © 2017 by Lispworks Ltd
    LispWorks® IDE User Guide Version 7.1 Copyright and Trademarks LispWorks IDE User Guide (Unix version) Version 7.1 September 2017 Copyright © 2017 by LispWorks Ltd. All Rights Reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of LispWorks Ltd. The information in this publication is provided for information only, is subject to change without notice, and should not be construed as a commitment by LispWorks Ltd. LispWorks Ltd assumes no responsibility or liability for any errors or inaccuracies that may appear in this publication. The software described in this book is furnished under license and may only be used or copied in accordance with the terms of that license. LispWorks and KnowledgeWorks are registered trademarks of LispWorks Ltd. Adobe and PostScript are registered trademarks of Adobe Systems Incorporated. Other brand or product names are the registered trade- marks or trademarks of their respective holders. The code for walker.lisp and compute-combination-points is excerpted with permission from PCL, Copyright © 1985, 1986, 1987, 1988 Xerox Corporation. The XP Pretty Printer bears the following copyright notice, which applies to the parts of LispWorks derived therefrom: Copyright © 1989 by the Massachusetts Institute of Technology, Cambridge, Massachusetts. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, pro- vided that this copyright and permission notice appear in all copies and supporting documentation, and that the name of M.I.T.
    [Show full text]
  • Omnipresent and Low-Overhead Application Debugging
    Omnipresent and low-overhead application debugging Robert Strandh [email protected] LaBRI, University of Bordeaux Talence, France ABSTRACT application programmers as opposed to system programmers. The state of the art in application debugging in free Common The difference, in the context of this paper, is that the tech- Lisp implementations leaves much to be desired. In many niques that we suggest are not adapted to debugging the cases, only a backtrace inspector is provided, allowing the system itself, such as the compiler. Instead, throughout this application programmer to examine the control stack when paper, we assume that, as far as the application programmer an unhandled error is signaled. Most such implementations do is concerned, the semantics of the code generated by the not allow the programmer to set breakpoints (unconditional compiler corresponds to that of the source code. or conditional), nor to step the program after it has stopped. In this paper, we are mainly concerned with Common Furthermore, even debugging tools such as tracing or man- Lisp [1] implementations distributed as so-called FLOSS, i.e., ually calling break are typically very limited in that they do \Free, Libre, and Open Source Software". While some such not allow the programmer to trace or break in important sys- implementations are excellent in terms of the quality of the tem functions such as make-instance or shared-initialize, code that the compiler generates, most leave much to be simply because these tools impact all callers, including those desired when it comes to debugging tools available to the of the system itself, such as the compiler.
    [Show full text]
  • How Lisp Systems Look Different in Proceedings of European Conference on Software Maintenance and Reengineering (CSMR 2008)
    How Lisp Systems Look Different In Proceedings of European Conference on Software Maintenance and Reengineering (CSMR 2008) Adrian Dozsa Tudor Gˆırba Radu Marinescu Politehnica University of Timis¸oara University of Berne Politehnica University of Timis¸oara Romania Switzerland Romania [email protected] [email protected] [email protected] Abstract rently used in a variety of domains, like bio-informatics (BioBike), data mining (PEPITe), knowledge-based en- Many reverse engineering approaches have been devel- gineering (Cycorp or Genworks), video games (Naughty oped to analyze software systems written in different lan- Dog), flight scheduling (ITA Software), natural language guages like C/C++ or Java. These approaches typically processing (SRI International), CAD (ICAD or OneSpace), rely on a meta-model, that is either specific for the language financial applications (American Express), web program- at hand or language independent (e.g. UML). However, one ming (Yahoo! Store or reddit.com), telecom (AT&T, British language that was hardly addressed is Lisp. While at first Telecom Labs or France Telecom R&D), electronic design sight it can be accommodated by current language inde- automation (AMD or American Microsystems) or planning pendent meta-models, Lisp has some unique features (e.g. systems (NASA’s Mars Pathfinder spacecraft mission) [16]. macros, CLOS entities) that are crucial for reverse engi- neering Lisp systems. In this paper we propose a suite of Why Lisp is Different. In spite of its almost fifty-year new visualizations that reveal the special traits of the Lisp history, and of the fact that other programming languages language and thus help in understanding complex Lisp sys- borrowed concepts from it, Lisp still presents some unique tems.
    [Show full text]
  • The Evolution of Lisp
    1 The Evolution of Lisp Guy L. Steele Jr. Richard P. Gabriel Thinking Machines Corporation Lucid, Inc. 245 First Street 707 Laurel Street Cambridge, Massachusetts 02142 Menlo Park, California 94025 Phone: (617) 234-2860 Phone: (415) 329-8400 FAX: (617) 243-4444 FAX: (415) 329-8480 E-mail: [email protected] E-mail: [email protected] Abstract Lisp is the world’s greatest programming language—or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one-upsmanship, and the glee born of technical cleverness that is characteristic of the “hacker culture” than by sober assessments of technical requirements. Nevertheless this process has eventually produced both an industrial- strength programming language, messy but powerful, and a technically pure dialect, small but powerful, that is suitable for use by programming-language theoreticians. We pick up where McCarthy’s paper in the first HOPL conference left off. We trace the development chronologically from the era of the PDP-6, through the heyday of Interlisp and MacLisp, past the ascension and decline of special purpose Lisp machines, to the present era of standardization activities. We then examine the technical evolution of a few representative language features, including both some notable successes and some notable failures, that illuminate design issues that distinguish Lisp from other programming languages. We also discuss the use of Lisp as a laboratory for designing other programming languages. We conclude with some reflections on the forces that have driven the evolution of Lisp.
    [Show full text]
  • Lisp Tutorial
    Gene Kim 9/9/2016 CSC 2/444 Lisp Tutorial About this Document This document was written to accompany an in-person Lisp tutorial. Therefore, the information on this document alone is not likely to be sufficient to get a good understanding of Lisp. However, the functions and operators that are listed here are a good starting point, so you may look up specifications and examples of usage for those functions in the Common Lisp HyperSpec (CLHS) to get an understanding of their usage. Getting Started Note on Common Lisp Implementations I will use Allegro Common Lisp since it is what is used by Len (and my research). However, for the purposes of this class we won’t be using many (if any) features that are specific to common lisp implementations so you may use any of the common lisp implementations available in the URCS servers. If you are using any libraries that are implementation-specific for assignments in this class, I would strongly urge you to rethink your approach if possible. If we (the TAs) deem any of these features to be solving to much of the assigned problem, you will not receive full credit for the assignment. To see if a function is in the Common Lisp specifications see the Common Lisp HyperSpec (CLHS). Simply google the function followed by “clhs” to see if an entry shows up. Available Common Lisp implementations (as far as I know): - Allegro Common Lisp (acl or alisp will start an Allegro REPL) - CMU Common Lisp (cmucl or lisp will start a CMUCL REPL) - Steel Bank Common Lisp (sbcl will start an SBCL REPL) IDE/Editor It is not important for this class to have an extensive IDE since we will be working on small coding projects.
    [Show full text]
  • Allegro CL User Guide
    Allegro CL User Guide Volume 1 (of 2) version 4.3 March, 1996 Copyright and other notices: This is revision 6 of this manual. This manual has Franz Inc. document number D-U-00-000-01-60320-1-6. Copyright 1985-1996 by Franz Inc. All rights reserved. No part of this pub- lication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means electronic, mechanical, by photocopying or recording, or otherwise, without the prior and explicit written permission of Franz incorpo- rated. Restricted rights legend: Use, duplication, and disclosure by the United States Government are subject to Restricted Rights for Commercial Software devel- oped at private expense as specified in DOD FAR 52.227-7013 (c) (1) (ii). Allegro CL and Allegro Composer are registered trademarks of Franz Inc. Allegro Common Windows, Allegro Presto, Allegro Runtime, and Allegro Matrix are trademarks of Franz inc. Unix is a trademark of AT&T. The Allegro CL software as provided may contain material copyright Xerox Corp. and the Open Systems Foundation. All such material is used and distrib- uted with permission. Other, uncopyrighted material originally developed at MIT and at CMU is also included. Appendix B is a reproduction of chapters 5 and 6 of The Art of the Metaobject Protocol by G. Kiczales, J. des Rivieres, and D. Bobrow. All this material is used with permission and we thank the authors and their publishers for letting us reproduce their material. Contents Volume 1 Preface 1 Introduction 1.1 The language 1-1 1.2 History 1-1 1.3 Format
    [Show full text]
  • ESA: a CLIM Library for Writing Emacs-Style Applications
    ESA: A CLIM Library for Writing Emacs-Style Applications Robert Strandh Troels Henriksen LaBRI, Université Bordeaux 1 DIKU, University of Copenhagen 351, Cours de la Libération Universitetsparken 1, Copenhagen 33405 Talence Cedex [email protected] France [email protected] David Murray Christophe Rhodes ADMurray Associates Goldsmiths, University of London 10 Rue Carrier Belleuse, 75015 Paris New Cross Road, London, SE14 6NW [email protected] [email protected] ABSTRACT style applications. The central distinguishing feature of an We describe ESA (for Emacs-Style Application), a library Emacs-style application, for our purposes, is that it uses for writing applications with an Emacs look-and-feel within short sequences of keystrokes as the default method of in- the Common Lisp Interface Manager. The ESA library voking commands, and only occasionally requires the user to takes advantage of the layered design of CLIM to provide a type the full name of the command in a minibuffer. A spe- command loop that uses Emacs-style multi-keystroke com- cial keystroke (M-x) is used to invoke commands by name. mand invocation. ESA supplies other functionality for writ- This interaction style is substantially different from the one ing such applications such as a minibuffer for invoking ex- provided by CLIM by default, and therefore required us to tended commands and for supplying command arguments, write a different CLIM top level. Fortunately, CLIM was Emacs-style keyboard macros and numeric arguments, file designed to make this not only possible but fairly straight- and buffer management, and more. ESA is currently used forward, as the implementation of a replacement top level in two major CLIM applications: the Climacs text editor can build on the protocol layers beneath, just as the default (and the Drei text gadget integrated with the McCLIM im- top level is built.
    [Show full text]
  • Proceedings of the 8Th European Lisp Symposium Goldsmiths, University of London, April 20-21, 2015 Julian Padget (Ed.) Sponsors
    Proceedings of the 8th European Lisp Symposium Goldsmiths, University of London, April 20-21, 2015 Julian Padget (ed.) Sponsors We gratefully acknowledge the support given to the 8th European Lisp Symposium by the following sponsors: WWWLISPWORKSCOM i Organization Programme Committee Julian Padget – University of Bath, UK (chair) Giuseppe Attardi — University of Pisa, Italy Sacha Chua — Toronto, Canada Stephen Eglen — University of Cambridge, UK Marc Feeley — University of Montreal, Canada Matthew Flatt — University of Utah, USA Rainer Joswig — Hamburg, Germany Nick Levine — RavenPack, Spain Henry Lieberman — MIT, USA Christian Queinnec — University Pierre et Marie Curie, Paris 6, France Robert Strandh — University of Bordeaux, France Edmund Weitz — University of Applied Sciences, Hamburg, Germany Local Organization Christophe Rhodes – Goldsmiths, University of London, UK (chair) Richard Lewis – Goldsmiths, University of London, UK Shivi Hotwani – Goldsmiths, University of London, UK Didier Verna – EPITA Research and Development Laboratory, France ii Contents Acknowledgments i Messages from the chairs v Invited contributions Quicklisp: On Beyond Beta 2 Zach Beane µKanren: Running the Little Things Backwards 3 Bodil Stokke Escaping the Heap 4 Ahmon Dancy Unwanted Memory Retention 5 Martin Cracauer Peer-reviewed papers Efficient Applicative Programming Environments for Computer Vision Applications 7 Benjamin Seppke and Leonie Dreschler-Fischer Keyboard? How quaint. Visual Dataflow Implemented in Lisp 15 Donald Fisk P2R: Implementation of
    [Show full text]
  • Download This Ebook for Free
    lisp #lisp Table of Contents About 1 Chapter 1: Getting started with lisp 2 Remarks 2 Examples 2 Installation or Setup 2 Dialects of Lisp and their implementations 2 Lisp Resources 3 Credits 4 About You can share this PDF with anyone you feel could benefit from it, downloaded the latest version from: lisp It is an unofficial and free lisp ebook created for educational purposes. All the content is extracted from Stack Overflow Documentation, which is written by many hardworking individuals at Stack Overflow. It is neither affiliated with Stack Overflow nor official lisp. The content is released under Creative Commons BY-SA, and the list of contributors to each chapter are provided in the credits section at the end of this book. Images may be copyright of their respective owners unless otherwise specified. All trademarks and registered trademarks are the property of their respective company owners. Use the content presented in this book at your own risk; it is not guaranteed to be correct nor accurate, please send your feedback and corrections to [email protected] https://riptutorial.com/ 1 Chapter 1: Getting started with lisp Remarks This section provides an overview of what lisp is, and why a developer might want to use it. It should also mention any large subjects within lisp, and link out to the related topics. Since the Documentation for lisp is new, you may need to create initial versions of those related topics. Examples Installation or Setup Probably the two most popular free implementations of Common Lisp are Clozure Common Lisp (CCL) and Steel Bank Common Lisp (SBCL).
    [Show full text]