Charles Lamb Gordon Landis Jack Orenstein Dan Weinreb

Total Page:16

File Type:pdf, Size:1020Kb

Charles Lamb Gordon Landis Jack Orenstein Dan Weinreb Charles Lamb Gordon Landis Jack Orenstein Dan Weinreb SO October 1991/%1.34, No.10/COMMUNICATIONS OF THE ACM bjectStore is an object-oriented database management system (OODBMS) that provides a tightly integrated language interface to the traditional DBMS features of persistent storage, transaction management (concurrency control and recovery), distributed data access, and associative queries. ObjectStore was designed to provide a unified programmatic interface to both persistently allocated data (i.e., data that lives beyond the execution of an applica- tion program) and transiently allocated data (i.e., data that does not survive beyond an application's execution), with object-access speed for persistent data usually equal to that of an in-memory dereference of a pointer to transient data.~-_- ......... - ................. - ....... - ......... - These goals were derived from tain pointers, use C++ virtual to write code that translates be- the requirements of ObjectStore's functions and multiple inheritance, tween the disk-resident representa- target applications, which are typi- etc). In particular, there is no need tion of data, and the representation cally data-intensive programs that to inherit from a special "persistent used during execution. For exam- perform complex manipulations on object" base class. Different objects ple, to store a C+ + object into a re- large databases of objects with intri- of the same type may be persistent lational database, the programmer cate structure, e.g., CAD, CAE, or transient within the same pro- must construct a mapping between CAP, CASE, and geographic infor- gram. the two, and write code that picks mation systems (GIS). This struc- There are several motivations for fields out of tuples and copies them tural complexity is generally real- our goal of making ObjectStore into data members of objects. (This ized by inter-object references, e.g., closely integrated with the pro- is part of the problem that has been pointers from one object to an- gramming language. These in- called the "impedance mismatch" other. Objects are located, possibly clude: between a programming language with the intent to update them, by and a database access language [2, traversing these references and by Ease of learning: It was intention- 13].) With ObjectStore, no translat- associative queries. ally designed so that a C+ + user ing and no copying is needed. Per- We selected C + + as the primary would only have to learn a little bit sistent data is just like ordinary language through which Ob- more in order to try out Ob- heap-allocated (transient) data: jectStore is accessed because it is jectStore and start to use it effec- once a pointer is obtained to it, the becoming a very popular language tively. After that, a user can learn user can just use it in the ordinary among the developers of Ob- more, and take advantage of more way. ObjectStore automatically jectStore's target applications. Ob- of the capabilities the database of- takes care of locking, and keeps jectStore can also be used from C fers. In particular, there is no need track of what has been modified. programs--providing access from to learn a new type system or a new C is easy because the data model of way to define objects. The declara- Expressive power: We wanted the C is a subset of that of C+ +. Use of tive and procedural parts of the interface to persistently allocated ObjectStore from other program- language are used for both kinds of objects to support all of the power ming languages is discussed later. objects. By providing a gradual of the host programming language. The key to ObjectStore's integra- learning path and making it easy This contrasts with the traditional tion with C+ + is that persistence is for users to get started, we hope to data manipulation capabilities of not part of the type of an object. make ObjectStore accessible to a languages such as SQL, which are Objects of any C++ data type wider range of developers, and much less powerful than a general- whatsoever can be allocated tran- help ease the transition into the use purpose programming language. siently (on the ordinary heap) or of object-oriented database tech- persistently (in a database), from nology. Reusability: We wanted to promote built-in types such as integers and reusability of code, by allowing the character strings, to arbitrary user- No translation code: We wanted to same code to operate on either per- defined structures (which may con- save the programmer from having sistent or transient data, and to COMMUNICATIONSOF THE ACM/October 1991/Vol.34, No.10 Sl allow libraries that were developed mance, the target applications are make the speed of dereferencing of for manipulating transient data to very different from traditional pointers to persistent objects be as work on persistent data without database applications such as pay- close as possible to that of transient change. For example, if a program- roll programs and on-line transac- objects, namely the speed of a sin- mer has a library routine that takes tion processing systems, in several gle load instruction. an array of floating-point numbers ways, as we found from interview- ObjectStore also has some of the and computes the fast Fourier ing developers of such applications. same performance goals as ordi- transforra, he or she can pass it an nary relational DBMSs, and it gen- Temporal locality: When many ObjectStore persistent array, and it erally accomplishes these using will work. Usually, if a library does users access a shared database, very familiar techniques such as indexes, often the next user of a data item not need to do any persistent allo- query optimization, log-based re- cation of its own, the library can be will be the same as the previous covery, and so on. The implemen- applied to persistent data without user. In other words, while concur- tation section explains how we ap- even being recompiled. rent access must be allowed and proached all of these performance must work correctly, many data goals, focusing on the aspects of Conversion: Many programmers items will be used 'mostly' by one ObjectStore that differ from con- who are interested in using object- user over a short span of time. ventional techniques. oriented DBMSs would like to add Spatial locality: Often an applica- Another goal of ObjectStore is to persistence to existing applications tion will use only a portion of a provide several features that are that deal with transient objects, database, and that portion will be missing from C++ and from most rather than build new applications (or can be arranged to be) in a small DBMSs: a collection facility (sets, from scratch. We wanted to make it section of the database that is con- lists, and so on), a way to express as easy as possible to convert an ex- tiguous, or mostly so. bidirectional relationships, and isting application to use persistent support for groupware based on objects throughout. In particular, Fine interleaving: Applications versioned data. this means that basic data opera- often interleave small database op- tions such as dereferencing point- erations (i.e., go from one object to Application Interface ers and getting and setting data a reference object) with small In addition to the data definition members should be syntactically the amounts of computation. That is, and manipulation facilities pro- same for persistent and transient there are many very small database vided by the host languages, C and objects, and that variables should operations rather than relatively C++, ObjectStore provides sup- not have 1:o have their type declara- few large ones. If every database port for accessing persistent data tions changed when persistent ob- operation required a significant inside transactions, a library of col- jects are used. per-operation overhead cost (such lection types, bidirectional relation- as the cost of sending a network ships, an optimizing query facility, Type checking: We wanted the message), overhead costs would and a version facility to support col- compile-time type-checking of become prohibitive. laborative work. Tools supporting C+ + to apply to persistent data as Developers told us that it is im- database schema design, database well as transient data, with the en- perative that ordinary data manip- browsing, database administration, tire application using a single type ulation be as fast as possible. For and application compilation and system. The compiler's type check- example, an ECAD circuit simula- debugging, are also provided. ing applies to objects in the data- tion is CPU-intensive, traversing a There are three programming base. For example, a variable refer- network of objects representing a interfaces supported, a C library ring to an object of class employee circuit, carrying out computations interface, a C++ library interface, would have type 'employee *'. Such on the way. These simulations are and an extended C+ + which pro- a variable could refer to a persistent quite expensive. Any approach to vides a tighter language integration employee or a transient employee, data management that penalizes to the query and relationship facili- at different times during program the running time of such an appli- ties. This interface is accessible only execution. A function that takes a cation is impractical. This means through ObjectStore's C++ com- reference to an employee as an ar- that one critical operation must be piler, while the two library inter- gument can therefore operate on a as fast as possible: the operation of faces are accessible through other persistent or a transient employee. obtaining data from an object, third-party C or C++ compilers, The second goal of ObjectStore given a pointer or reference to the thus providing maximum portabil- is to provide a very high perfor- object. This operation might be ity.
Recommended publications
  • Genera Workbook Using This Book Preface This Is the Document To
    Genera Workbook Using This Book Preface This is the document to read when you’re ready to sit down at your Symbol- ics computer. It teaches you the initial skills you need to use the Genera system effectively. We present concepts you need to know, as well as providing exercises andactivitiesthatturnthoseconceptsintopracticalskills. The material covered in the first group of chapters in this workbook is a pre- requisite for all Symbolics Education Services Courses. However, you can com plete the second and third sections after taking your first course. Practicing the material helpsyou learn it faster. Bring this workbook to all courses you take with Symbolics. We expect that you have used a computer before; we do not expect that you have used a Symbolics computer before. You need to learn this material whether or not you are a programmer. This is not a programming textbook. We make no assumptions about your programming background or future; this work bookisforbothprogrammersandnonprogrammers. Every time we use a term for the first time, we put it in italics. If you see a term you don’t recognize, be sure to check the glossary at the end of the work book. This workbook uses Symbolics documentation conventions and a few of its own. If you see a word or phrase enclosed in brackets, like [Help], it is a menu item.We use two different conventions withrespect to Symbolics keyboard keys: in text,thekeylabelledHELPlookslikethis: HELP butinexamplesitlookslikethis: <HELP> todifferentiateitasasinglekeystrokefromthetextaroundit. It is very important to have a Symbolics computer available so that you can work through the hands-on activities, called walk-throughs.
    [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]
  • Symbolics Architecture
    Symbolics Architecture David A. Moon Symbolics, Inc. W hat is an architecture? In com- languages, user interface, and operating This architecture puter systems, an architecture system. System architecture defines the rapid is a specification of an inter- product that people actually use; the other enables face. To be dignified by the name architec- levels of architecture define the mecha- development and ture, an interface should be designed for a nism underneath that implements it. Sys- long lifespan and should connect system tem architecture is implemented by soft- efficient execution of components maintained by different orga- ware; hardware only sets bounds on what large, ambitious nizations. Often an architecture is part ofa is possible. System architecture defines the product definition and defines character- motivation for most of the design choices applications. An istics on which purchasers of that product at the other levels ofarchitecture. This sec- rely, but this is not true of everything that tion is an overview of Symbolics system unconventional design is called an architecture. An architecture is architecture. avoids trading off more formal than an internal interface be- The Symbolics system presents itself to tween closely-related system components, the user through a high-resolution bitmap safety for speed. and has farther-reaching effects on system display. In addition to text and graphics, characteristics and performance. the display contains presentations of ob- A computer system typically contains jects. The user operates on the objects by many levels and types ofarchitecture. This manipulating the presentations with a article discusses three architectures de- mouse. The display includes a continuous- fined in Symbolics computers: ly updated reminder of the mouse com- (1) System architecture-defines how mands applicable to the current context.
    [Show full text]
  • Free As in Freedom (2.0): Richard Stallman and the Free Software Revolution
    Free as in Freedom (2.0): Richard Stallman and the Free Software Revolution Sam Williams Second edition revisions by Richard M. Stallman i This is Free as in Freedom 2.0: Richard Stallman and the Free Soft- ware Revolution, a revision of Free as in Freedom: Richard Stallman's Crusade for Free Software. Copyright c 2002, 2010 Sam Williams Copyright c 2010 Richard M. Stallman Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License." Published by the Free Software Foundation 51 Franklin St., Fifth Floor Boston, MA 02110-1335 USA ISBN: 9780983159216 The cover photograph of Richard Stallman is by Peter Hinely. The PDP-10 photograph in Chapter 7 is by Rodney Brooks. The photo- graph of St. IGNUcius in Chapter 8 is by Stian Eikeland. Contents Foreword by Richard M. Stallmanv Preface by Sam Williams vii 1 For Want of a Printer1 2 2001: A Hacker's Odyssey 13 3 A Portrait of the Hacker as a Young Man 25 4 Impeach God 37 5 Puddle of Freedom 59 6 The Emacs Commune 77 7 A Stark Moral Choice 89 8 St. Ignucius 109 9 The GNU General Public License 123 10 GNU/Linux 145 iii iv CONTENTS 11 Open Source 159 12 A Brief Journey through Hacker Hell 175 13 Continuing the Fight 181 Epilogue from Sam Williams: Crushing Loneliness 193 Appendix A { Hack, Hackers, and Hacking 209 Appendix B { GNU Free Documentation License 217 Foreword by Richard M.
    [Show full text]
  • A Lisp Oriented Architecture by John W.F
    A Lisp Oriented Architecture by John W.F. McClain Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degrees of Master of Science in Electrical Engineering and Computer Science and Bachelor of Science in Electrical Engineering at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 1994 © John W.F. McClain, 1994 The author hereby grants to MIT permission to reproduce and to distribute copies of this thesis document in whole or in part. Signature of Author ...... ;......................... .............. Department of Electrical Engineering and Computer Science August 5th, 1994 Certified by....... ......... ... ...... Th nas F. Knight Jr. Principal Research Scientist 1,,IA £ . Thesis Supervisor Accepted by ....................... 3Frederic R. Morgenthaler Chairman, Depattee, on Graduate Students J 'FROM e ;; "N MfLIT oARIES ..- A Lisp Oriented Architecture by John W.F. McClain Submitted to the Department of Electrical Engineering and Computer Science on August 5th, 1994, in partial fulfillment of the requirements for the degrees of Master of Science in Electrical Engineering and Computer Science and Bachelor of Science in Electrical Engineering Abstract In this thesis I describe LOOP, a new architecture for the efficient execution of pro- grams written in Lisp like languages. LOOP allows Lisp programs to run at high speed without sacrificing safety or ease of programming. LOOP is a 64 bit, long in- struction word architecture with support for generic arithmetic, 64 bit tagged IEEE floats, low cost fine grained read and write barriers, and fast traps. I make estimates for how much these Lisp specific features cost and how much they may speed up the execution of programs written in Lisp.
    [Show full text]
  • CLX — Common LISP X Interface
    CLX Common LISP X Interface 1988, 1989 Texas Instruments Incorporated Permission is granted to any individual or institution to use, copy, modify and distribute this document, provided that this complete copyright and permission notice is maintained, intact, in all copies and supporting documentation. Texas Instruments Incorporated makes no representations about the suitability of this document or the software described herein for any purpose. It is provided ”as is” without express or implied warranty. CLX Programmer’s Reference i ACKNOWLEDGMENTS Primary Interface Author: Robert W. Scheifler MIT Laboratory for Computer Science 545 Technology Square, Room 418 Cambridge, MA 02139 [email protected] Primary Implementation Author: LaMott Oren Texas Instruments PO Box 655474, MS 238 Dallas, TX 75265 [email protected] Design Contributors: Dan Cerys, BBN Scott Fahlman, CMU Kerry Kimbrough, Texas Instruments Chris Lindblad, MIT Rob MacLachlan, CMU Mike McMahon, Symbolics David Moon, Symbolics LaMott Oren, Texas Instruments Daniel Weinreb, Symbolics John Wroclawski, MIT Richard Zippel, Symbolics Documentation Contributors: Keith Cessna, Texas Instruments Kerry Kimbrough, Texas Instruments Mike Myjak LaMott Oren, Texas Instruments Dan Stenger, Texas Instruments The X Window System is a trademark of MIT. UNIX is a trademark of AT&T Bell Laboratories. ULTRIX, ULTRIX–32, ULTRIX–32m, ULTRIX–32w, and VAX/VMS are trademarks of Digital Equipment Corporation. ii CLX Programmer’s Reference CONTENTS Section Title 1 INTRODUCTION TO CLX 2 DISPLAYS 3 SCREENS 4 WINDOWS AND PIXMAPS 5 GRAPHICS CONTEXTS 6 GRAPHIC OPERATIONS 7 IMAGES 8 FONTS AND CHARACTERS 9 COLORS 10 CURSORS 11 ATOMS, PROPERTIES, AND SELECTIONS 12 EVENTS AND INPUT 13 RESOURCES 14 CONTROL FUNCTIONS 15 EXTENSIONS 16 ERRORS A PROTOCOL VS.
    [Show full text]
  • Genera User's Guide Overview of Symbolics Computers
    Genera User’s Guide Overview of Symbolics Computers Documentation Notation Conventions Modifier Key Conventions Modifier keys are designed to be held down while pressing other keys. They do not themselves transmit characters. A combined keystroke like META-X is pronounced "meta x" and written as m-X.This notation means thatyou press the META key and, whileholdingitdown,presstheXkey. Modifierkeysareabbreviatedasfollows: CONTROL c- META m- SUPER s- HYPER h- SHIFT sh- SYMBOL sy- Modifier keys can be used in combination, as well as singly.Forexample, the nota tion c-m-Y indicates that you should hold down both the CONTROL and the META keyswhilepressingY. Modifier keys can also be used, both singly and in combination, to modify mouse commands. For example, the notation sh-Left means hold down the SHIFT key while clicking Left on the mouse and c-m-Middle means hold down CONTROL and METAwhileclickingMiddle. The keys with white lettering (like X or SELECT) all transmit characters. Combina tions of these keys should be pressed in sequence, one after the other (for exam ple, SELECT L). This notation means that you press the SELECT key, release it, and thenpresstheLkey. LOCAL is an exception to this rule. Despite its white lettering, you must hold it down while pressing another key, or it has no effect. For example, to brighten the imageonyourmonitor,youwouldholddown LOCALwhilepressingB. Page 2736 Documentation Conventions Thisdocumentationusesthefollowingnotationconventions: cond,zl:hostat PrintedrepresentationofLispobjectsinrunningtext. RETURN,ABORT,c-F keysontheSymbolicsKeyboard. SPACE Spacebar. login Literaltypein. (make-symbol "foo") Lispcodeexamples. (function-name arg1 &optionalarg2) Syntaxdescriptionoftheinvocationoffunction-name. arg1 Argument to the function function-name, usually ex pressed as a word that reflects the type of argument (forexample,string).
    [Show full text]
  • Genera Concepts Genera the Best Software Environment Available
    Genera Concepts Genera The Best Software Environment Available To allournewusers:Welcome. This conceptual introduction explains what your Symbolics computer is all about. We urge you to at least skim it before you start daily work with the system. We try here to summarize some of the "big picture" concepts in your new software environment; knowing about this framework will help you in learning its details moreefficiently. Most new users of Symbolics machines have worked on traditional timesharing systems, such as VAX/VMS, or on microcomputers or conventional UNIX worksta tions. ("Genera Comparison Charts" shows some equivalents between these systems and Genera.) If you feel somewhat uneasy about learning how to use the most ad vancedsoftwareenvironmentaround,relax! You don’t have to learn everything at once in order to do anything look at this as a longterm, incrementallearning project. You don’t have to learn everything by yourself.OurdocumentationandGeneraitselfareheretohelpyou. Genera and Symbolics Common Lisp dramatically increase your productivity and efficiency by providing many builtin software facilities (similar to library routines) that you would otherwise have to write yourself. Our editcompiledebug cycle hap pens so fast that you are virtually editing, compiling, and debugging simultaneous ly. The editor, compiler and debugger are all resident utilities, available anytime, anywhere. Lisp Your Editor Mail Listener Application Figure173.YourviewofGenera’scommandlevel. Page 2926 "command levels" or separate "commandenvironments;" you can get Genera has no there from here. You can move directly from any application to any other applica tion, usually with just two keystrokes. You do not have to close one application to enteranother.(SeeFigure173.) Many different activities, such as the editor and electronic mail, run at the same time in separate processes.
    [Show full text]
  • Common Lisp Object System
    Common Lisp Object System by Linda G. DeMichiel and Richard P. Gabriel Lucid, Inc. 707 Laurel Street Menlo Park, California 94025 (415)329-8400 [email protected] [email protected] with Major Contributions by Daniel Bobrow, Gregor Kiczales, and David Moon Abstract The Common Lisp Object System is an object-oriented system that is based on the concepts of generic functions, multiple inheritance, and method combination. All objects in the Object System are instances of classes that form an extension to the Common Lisp type system. The Common Lisp Object System is based on a meta-object protocol that renders it possible to alter the fundamental structure of the Object System itself. The Common Lisp Object System has been proposed as a standard for ANSI Common Lisp and has been tentatively endorsed by X3J13. Common Lisp Object System by Linda G. DeMichiel and Richard P. Gabriel with Major Contributions by Daniel Bobrow, Gregor Kiczales, and David Moon 1. History of the Common Lisp Object System The Common Lisp Object System is an object-oriented programming paradigm de- signed for Common Lisp. Over a period of eight months a group of five people, one from Symbolics and two each from Lucid and Xerox, took the best ideas from CommonLoops and Flavors, and combined them into a new object-oriented paradigm for Common Lisp. This combination is not simply a union: It is a new paradigm that is similar in its outward appearances to CommonLoops and Flavors, and it has been given a firmer underlying semantic basis. The Common Lisp Object System has been proposed as a standard for ANSI Common Lisp and has been tentatively endorsed by X3J13.
    [Show full text]
  • Selected Essays of Richard M. Stallman
    Free Software, Free Society: Selected Essays of Richard M. Stallman Introduction by Lawrence Lessig Edited by Joshua Gay GNU Press www.gnupress.org Free Software Foundation Boston, MA USA First printing, first edition. Copyright © 2002 Free Software Foundation, Inc. ISBN 1-882114-98-1 Published by the Free Software Foundation 59 Temple Place Boston, MA Tel: 1-617-542-5942 Fax: 1-617-542-2652 Email: [email protected] Web: www.gnu.org GNU Press is an imprint of the FSF. Email: [email protected] Web: www.gnupress.org Please contact the GNU Press for information regarding bulk purchases for class- room or user group use, reselling, or any other questions or comments. Original artwork by Etienne Suvasa. Cover design by Jonathan Richard. Permission is granted to make and distribute verbatim copies of this book provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute translations of this book into another language, from the original English, with respect to the conditions on distribution of modified versions above, provided that it has been approved by the Free Software Foundation. i Short Contents Editor’s Note................................................ 1 A Note on Software .......................................... 3 Topic Guide ................................................ 7 Introduction ............................................... 11 Section One ............................................... 15 1 The GNU Project ....................................... 17 2 The GNU Manifesto ..................................... 33 3 Free Software Definition ................................. 43 4 Why Software Should Not Have Owners ..................... 47 5 What’s in a Name? ...................................... 53 6 Why “Free Software” is Better than “Open Source” ............ 57 7 Releasing Free Software if You Work at a University ........... 63 8 Selling Free Software ...................................
    [Show full text]
  • The Symbolics Virtual Lisp Machine Or Using the Dec Alpha As a Programmable Micro-Engine1
    THE SYMBOLICS VIRTUAL LISP MACHINE OR USING THE DEC ALPHA AS A PROGRAMMABLE MICRO-ENGINE 1 (EXTENDED ABSTRACT) P.T. Withington, Scott McKay, Gary Palter 2 Symbolics Inc. 6 Concord Farms Concord, MA 01742-2727, U.S.A. [email protected] 1+ 508 287 1000 Paul Robertson 2 Dynamic Object Language Group 2 Parsonage Hill Haverhill, MA 01832, U.S.A. specifically to execute the Lisp language. INTRODUCTION12 Because of the limited market, this custom hardware has never been able to take advantage Symbolics’ Genera system represents the accu- of cutting-edge technology such as is available mulation of nearly three and a half decades of in commodity, RISC-based workstations. At the software engineering tools, written in several same time, non-standard hardwares such as the dialects of the Lisp language and several object- Lisp Machine have fallen into economic oriented extensions to Lisp. Traditionally, disfavor. Nonetheless, Lisp’s (and the Lisp Genera has run on a “Lisp Machine”, a line of Machine’s) capability in prototyping, evolu- custom hardware workstations designed tionary problem solving, and super-complex problems has retained a small but dedicated market. 1Symbolics® and Genera® are registered trademarks and Virtual Lisp Machine™ and VLM™ are trademarks of In response to market pressure to provide Symbolics, Inc. DEC® is a registered trademark and Genera’s capabilities on commodity hardware, Alpha™ and AXP™ are trademarks of Digital Equipment Corporation. Symbolics chose to implement an “emulator” that would execute the Lisp Machine instruction 2Author’s electronic mail addresses are ptw@Riverside. set on a standard platform, rather than to port the SCRC.Symbolics.COM, [email protected].
    [Show full text]
  • Object Oriented Programming (OOP) Imperative Programming
    Object Oriented Programming (OOP) IIIA o New programming paradigm o Actions Æ Objects o Objects Å Actions o Object-oriented = Objects + Classes + Inheritance TAPIA 2005-2006 Imperative programming IIIA o OOP (Object-Oriented Programming) related o Local state, delegation, inheritance o History (Norvig,465): Algol 60 Æ SIMULA o Lisp extensions: o Smalltalk (69) o Flavors (79) o New Flavors (81) o Common Loops (88) o CLOS (91): standard TAPIA 2005-2006 History IIIA Dahl 1966 Algol60 Simula Classes single inheritance Nygaard LISP world Kay 1969 Smalltalk Goldberg Ingalls Steele 1976 LAMBDA Cannon 1979 Flavors multiple inheritance method combination Weinreb Symbolics 1981 New Flavors generic functions Xerox 1982 CommonLoops multimethods AT&T 1986 C++ Bell labs Meyer 1988 Oaklisp Eiffel Lang 1988 Perlmutter CLOS Steele 1991 JAVA TAPIA 2005-2006 AOP vs. OOP (Shoham) IIIA OOP AOP Basic unit Object (passive) Agent (active) State without restriction belief, commitment, competence, preferences, … Computation Message passing, methods Message passing, methods Type of messages without restriction Inform, request, offer, promise, reject, … Message no Honesty, consistency, rationality, restrictions … TAPIA 2005-2006 Nomenclature IIIA o Object: encapsulated local state and behavior o Class: describes similar objects with the same behavior and structure. o Instance: object belonging to a class. o Class Variable: variable shared by all the members of a class. o Instance Variable: encapsulated variable of an object. o Generic Function: its behavior depends on the types or classes of the arguments. TAPIA 2005-2006 Nomenclature IIIA o Message: Action name. Equivalent to a generic function. o Method: Specialization of a generic function. o Delegation: an object passes a task to another object.
    [Show full text]