Object Model Features Matrix

Total Page:16

File Type:pdf, Size:1020Kb

Object Model Features Matrix Doc. No.: X3H7-93-007v12b Doc. Date: May 25, 1997 Reply to: Frank Manola (Editor) Object Services and Consulting, Inc. 151 Tremont Street #22R Boston, MA 02111 USA (617) 426-9287 [email protected] National Committee for Information Technology Standards Technical Committee H7 Object Model Features Matrix Disclaimers: This Features Matrix is primarily intended for H7 use in analyzing object model interoperability issues. The Features Matrix is not intended to be an exhaustive description of all important object models. Rather, it is intended to be a representative sample of the design space of object models illustrating key (but not necessarily all) variations in important object model characteristics. Thus, inclusion of an object model in the matrix is not necessarily an indication of the object model's "importance"; it may simply incorporate a specific design choice of interest to H7. Similarly, exclusion of an object model is not necessarily an indication of an object model's "lack of importance". Although the committee has attempted to be accurate in its descriptions of the various models, these descriptions have not necessarily been verified or endorsed by those responsible for the development of those models. In addition, the descriptions of individual models have not necessarily been updated to track changes which may have been made in those models since the entries were compiled (although in some cases they have). The descriptions are intended to be consistent with the references cited for them. Changes since last version: The following are the changes made since version 10 was approved. version 11: deletion of information on projected entries miscellaneous editorial corrections versions 12, 12a, and 12b: revised version of Analysis and Design Methods entry revised version of SQL3 entry added definition of “object model” 1 miscellaneous editorial corrections I. Introduction The H7 Object Model Features Matrix is organized by rows denoting various object models (or object-oriented languages/systems), and columns denoting specified object model features. The intent is to describe each object model (language/system) with respect to the specified features (an entry is intended to be text describing the model's support for the feature, not "yes" or "no"). The presentation of the matrix is in column order; that is, each column is defined, and the entries for each row for that column follow. This is to facilitate comparing models according to a given feature. 1.1 What is an Object Model? The term object model, as used throughout this document, refers to the collection of concepts used to describe objects in a particular object-oriented language, specification, or analysis and design methodology, and corresponds closely to the use of the term data model in “the relational data model”. Thus, we speak of “the Smalltalk object model” or “the OMG object model”. This is in contrast to the use of object model to describe the collection of objects created to model a particular system or application, as in “the Automated Teller Machine object model” or “the object model of a windowing system” [RBPE+91]. From our point of view, [RBPE+91] defines a particular object model (our sense), which includes concepts like object, inheritance, attribute, and so on, and uses it to define the object models (second sense) of various applications. This dual usage is unfortunate, but is common in the literature. I.1 Rows (Object Models) The "rows" of the matrix are given below. For each row, the name of the submitter is given. Object Model Submitter OODBTG Reference Model Craig Thompson OMG Core Object Model Bill Kent, updated by Frank Manola OMG CORBA IDL Don Belisle ODMG Gail Mitchell EXPRESS Steve Clark and Elizabeth Fong Open Distributed Processing Ed Stull, updated by Haim Kilov (ISO/IEC JTC1/SC21/WG7) Management Information Model Laura Redmann (ISO/IEC JTC1/SC21/WG4) SQL3 (X3H2) Frank Manola and Jeff Sutherland 2 Matisse Jeff Sutherland C++ (X3J16) Frank Manola OO COBOL (X3J4) Frank Manola Smalltalk (X3J20) Glenn Hollowell Eiffel NICE (Eiffel Consortium) Emerald Frank Manola Cecil Frank Manola SELF Frank Manola System Object Model (SOM) Don Belisle OLE Component Object Model Frank Manola Analysis and Design Methods Joaquin Miller The final row includes information on the object models used in various object analysis and design methods (hence this row itself contains entries for multiple models). The descriptions of these models are based on the descriptions of the methods as published in books. It is important to realize that the object model described here is not necessarily the object model of the author(s); it is the result of an attempt to capture the object model described in the book. The book may have been misinterpreted; the book may have used only a part of the author(s) complete object model; that model may have changed since the publication of the book. Some authors have published more than one book. Sometimes these books separately cover analysis and design. Sometimes different sections of one book are devoted to analysis and to design. In any case, it is informative to note the elements of the object model used in analysis, and new or different elements used in design. Accordingly, the matrix entries sometimes distinguish the analysis model from the design model. In the cases of some authors, subsequent books in some sense replace an earlier book or books. In these cases, the model described is that of the book or books mentioned in 14. Background and References. When an author elaborates a concept of the model under the heading of construction, this is sometimes also indicated. Where possible, the definitions of terms used by the author(s) have been quoted. The matter in “double quotes” is quoted directly from the books. Terms under discussion are enclosed in ‘single quotes’ when the term is mentioned, as opposed to a referent of the term. Matter in [square brackets] was inserted by the row submitter. The analysis and design models included, and their identifications, are: D: Booch Design CA: Coad et al. Analysis CD: Coad et al. Design EA: Embly et al. Analysis FA: Coleman et al Analysis FD: Coleman et al Design 3 FC: Coleman et al Construction HA: Henderson-Sellers et al. Analysis and Design JA: Jacobson et al. Analysis JD: Jacobson et al. Design MD: Meyer Design MC: Meyer Construction NA: Waldén et al. Analysis and Design OA: Odell et al. Analysis RA: Rumbaugh et al. Analysis RD: Rumbaugh et al. Design SA: Shlaer et al. Analysis SD: Shlaer et al. Design WD: Wirfs-Brock et al. Design I.2 Columns (Features) The "columns" (features) currently used in the features matrix are given below. 0. Intended Use 1. Basic Concepts 2. Objects 2.1 operations 2.2 requests 2.3 messages 2.4 specification of behavioral semantics 2.5 methods (including multimethods and method combinations) 2.6 state 2.7 object lifetime 2.8 behavior/state grouping 2.9 communication model 2.10 events 2.11 transition rules 3. Binding 4. Polymorphism 5. Encapsulation e.g., how are object boundaries defined?; how many object boundaries or interfaces are there (do subclasses or "friends" get special access to objects)? what are their characteristics? 6. Identity, Equality, Copy e.g., what things have identity: objects, or interfaces? 7. Types and Classes 8. Inheritance and Delegation 4 9. Noteworthy Objects 9.1 relationships 9.2 attributes 9.3 literals 9.4 containment 9.5 aggregates 9.6 other 10. Extensibility 10.1 Dynamic ability to add new methods, classes, change attributes, change types; can you freeze (prevent extensions)? 10.2 Metaclasses/Metaobject Protocol how extensible is the class system? can new semantics be added? 10.3 Introspection definitional aspects of instances; access to definitions (e.g., type/class objects) at run time) 11. Object Languages 12. Semantics of Base Classes (+ type constructors) 13. Background and References Sources of matrix entries, and other relevant material. The initial features list was developed at the July 1992 X3H7 meeting, and the features list has been amended several times since then. For most features, the OODBTG Reference Model matrix entry serves to define (or at least describe) the feature, and in some cases related features. This is because the features themselves were largely taken from the OODBTG final report. I.3 Layout As noted above, the presentation of the matrix is in column (feature) order; that is, each column (feature) is defined, and the entries for each row (object model) corresponding to that column follow. In the matrix itself, features (column headings) are written in boldface. Object models (or their sources) are underlined. Numbers appearing in plain text are paragraph or other numbers from source documents. Editor's Notes are written in italics. Citations refer to sources associated with the particular object model under discussion (see the entry for that object model under 13. Background and References), and are not necessarily unique within the entire Features Matrix. 5 0. Intended Use II. Features Matrix Entries 0. Intended Use The intended use of an object model describes such things as the application(s) of the object model, the context(s) or part(s) of the development lifecycle in which the object model is intended to be used, the level of abstraction of the objects defined using the model, and the purpose of object-orientation in the intended application. One reason for describing intended use is to explain the presence or absence of specific object model features in terms of application requirements. ODMG The ODMG Object Model is intended to allow portability of applications among object database products. It provides a common model for these products by defining extensions to the OMG object model that support object database requirements. In particular, the ODMG model extends the OMG core to provide for persistent objects, object properties, more specific object types, queries and transactions.
Recommended publications
  • JHDF5 (HDF5 for Java) 19.04
    JHDF5 (HDF5 for Java) 19.04 Introduction HDF5 is an efficient, well-documented, non-proprietary binary data format and library developed and maintained by the HDF Group. The library provided by the HDF Group is written in C and available under a liberal BSD-style Open Source software license. It has over 600 API calls and is very powerful and configurable, but it is not trivial to use. SIS (formerly CISD) has developed an easy-to-use high-level API for HDF5 written in Java and available under the Apache License 2.0 called JHDF5. The API works on top of the low-level API provided by the HDF Group and the files created with the SIS API are fully compatible with HDF5 1.6/1.8/1.10 (as you choose). Table of Content Introduction ................................................................................................................................ 1 Table of Content ...................................................................................................................... 1 Simple Use Case .......................................................................................................................... 2 Overview of the library ............................................................................................................... 2 Numeric Data Types .................................................................................................................... 3 Compound Data Types ................................................................................................................ 4 System
    [Show full text]
  • Sun 64-Bit Binary Alignment Proposal
    1 KMIP 64-bit Binary Alignment Proposal 2 3 To: OASIS KMIP Technical Committee 4 From: Matt Ball, Sun Microsystems, Inc. 5 Date: May 1, 2009 6 Version: 1 7 Purpose: To propose a change to the binary encoding such that each part is aligned to an 8-byte 8 boundary 9 10 Revision History 11 Version 1, 2009-05-01: Initial version 12 Introduction 13 The binary encoding as defined in the 1.0 version of the KMIP draft does not maintain alignment to 8-byte 14 boundaries within the message structure. This causes problems on hard-aligned processors, such as the 15 ARM, that are not able to easily access memory on addresses that are not aligned to 4 bytes. 16 Additionally, it reduces performance on modern 64-bit processors. For hard-aligned processors, when 17 unaligned memory contents are requested, either the compiler has to add extra instructions to perform 18 two aligned memory accesses and reassemble the data, or the processor has to take a „trap‟ (i.e., an 19 interrupt generated on unaligned memory accesses) to correctly assemble the memory contents. Either 20 of these options results in reduced performance. On soft-aligned processors, the hardware has to make 21 two memory accesses instead of one when the contents are not properly aligned. 22 This proposal suggests ways to improve the performance on hard-aligned processors by aligning all data 23 structures to 8-byte boundaries. 24 Summary of Proposed Changes 25 This proposal includes the following changes to the KMIP 0.98 draft submission to the OASIS KMIP TC: 26 Change the alignment of the KMIP binary encoding such that each part is aligned to an 8-byte 27 boundary.
    [Show full text]
  • Making Classes Provable Through Contracts, Models and Frames
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CiteSeerX DISS. ETH NO. 17610 Making classes provable through contracts, models and frames A dissertation submitted to the SWISS FEDERAL INSTITUTE OF TECHNOLOGY ZURICH (ETH Zurich)¨ for the degree of Doctor of Sciences presented by Bernd Schoeller Diplom-Informatiker, TU Berlin born April 5th, 1974 citizen of Federal Republic of Germany accepted on the recommendation of Prof. Dr. Bertrand Meyer, examiner Prof. Dr. Martin Odersky, co-examiner Prof. Dr. Jonathan S. Ostroff, co-examiner 2007 ABSTRACT Software correctness is a relation between code and a specification of the expected behavior of the software component. Without proper specifica- tions, correct software cannot be defined. The Design by Contract methodology is a way to tightly integrate spec- ifications into software development. It has proved to be a light-weight and at the same time powerful description technique that is accepted by software developers. In its more than 20 years of existence, it has demon- strated many uses: documentation, understanding object-oriented inheri- tance, runtime assertion checking, or fully automated testing. This thesis approaches the formal verification of contracted code. It conducts an analysis of Eiffel and how contracts are expressed in the lan- guage as it is now. It formalizes the programming language providing an operational semantics and a formal list of correctness conditions in terms of this operational semantics. It introduces the concept of axiomatic classes and provides a full library of axiomatic classes, called the mathematical model library to overcome prob- lems of contracts on unbounded data structures.
    [Show full text]
  • Multithreaded Programming Guide
    Multithreaded Programming Guide Sun Microsystems, Inc. 4150 Network Circle Santa Clara, CA 95054 U.S.A. Part No: 816–5137–10 January 2005 Copyright 2005 Sun Microsystems, Inc. 4150 Network Circle, Santa Clara, CA 95054 U.S.A. All rights reserved. This product or document is protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation. No part of this product or document may be reproduced in any form by any means without prior written authorization of Sun and its licensors, if any. Third-party software, including font technology, is copyrighted and licensed from Sun suppliers. Parts of the product may be derived from Berkeley BSD systems, licensed from the University of California. UNIX is a registered trademark in the U.S. and other countries, exclusively licensed through X/Open Company, Ltd. Sun, Sun Microsystems, the Sun logo, docs.sun.com, AnswerBook, AnswerBook2, and Solaris are trademarks or registered trademarks of Sun Microsystems, Inc. in the U.S. and other countries. All SPARC trademarks are used under license and are trademarks or registered trademarks of SPARC International, Inc. in the U.S. and other countries. Products bearing SPARC trademarks are based upon an architecture developed by Sun Microsystems, Inc. The OPEN LOOK and Sun™ Graphical User Interface was developed by Sun Microsystems, Inc. for its users and licensees. Sun acknowledges the pioneering efforts of Xerox in researching and developing the concept of visual or graphical user interfaces for the computer industry. Sun holds a non-exclusive license from Xerox to the Xerox Graphical User Interface, which license also covers Sun’s licensees who implement OPEN LOOK GUIs and otherwise comply with Sun’s written license agreements.
    [Show full text]
  • IBM Informix Glossary
    IBM Informix Version 11.70 IBM Informix Glossary SC27-3531-00 IBM Informix Version 11.70 IBM Informix Glossary SC27-3531-00 Note Before using this information and the product it supports, read the information in “Notices” on page B-1. This document contains proprietary information of IBM. It is provided under a license agreement and is protected by copyright law. The information contained in this publication does not include any product warranties, and any statements provided in this manual should not be interpreted as such. When you send information to IBM, you grant IBM a nonexclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. © Copyright IBM Corporation 1996, 2010. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Glossary ..................................1-1 Numerics ....................................1-1 A......................................1-1 B ......................................1-3 C......................................1-4 D......................................1-8 E......................................1-13 F......................................1-15 G......................................1-16 H......................................1-17 I......................................1-17 J......................................1-19 K......................................1-19 L......................................1-19 M......................................1-21 N......................................1-22
    [Show full text]
  • High Dynamic Range Video
    High Dynamic Range Video Karol Myszkowski, Rafał Mantiuk, Grzegorz Krawczyk Contents 1 Introduction 5 1.1 Low vs. High Dynamic Range Imaging . 5 1.2 Device- and Scene-referred Image Representations . ...... 7 1.3 HDRRevolution ............................ 9 1.4 OrganizationoftheBook . 10 1.4.1 WhyHDRVideo? ....................... 11 1.4.2 ChapterOverview ....................... 12 2 Representation of an HDR Image 13 2.1 Light................................... 13 2.2 Color .................................. 15 2.3 DynamicRange............................. 18 3 HDR Image and Video Acquisition 21 3.1 Capture Techniques Capable of HDR . 21 3.1.1 Temporal Exposure Change . 22 3.1.2 Spatial Exposure Change . 23 3.1.3 MultipleSensorswithBeamSplitters . 24 3.1.4 SolidStateSensors . 24 3.2 Photometric Calibration of HDR Cameras . 25 3.2.1 Camera Response to Light . 25 3.2.2 Mathematical Framework for Response Estimation . 26 3.2.3 Procedure for Photometric Calibration . 29 3.2.4 Example Calibration of HDR Video Cameras . 30 3.2.5 Quality of Luminance Measurement . 33 3.2.6 Alternative Response Estimation Methods . 33 3.2.7 Discussion ........................... 34 4 HDR Image Quality 39 4.1 VisualMetricClassification. 39 4.2 A Visual Difference Predictor for HDR Images . 41 4.2.1 Implementation......................... 43 5 HDR Image, Video and Texture Compression 45 1 2 CONTENTS 5.1 HDR Pixel Formats and Color Spaces . 46 5.1.1 Minifloat: 16-bit Floating Point Numbers . 47 5.1.2 RGBE: Common Exponent . 47 5.1.3 LogLuv: Logarithmic encoding . 48 5.1.4 RGB Scale: low-complexity RGBE coding . 49 5.1.5 LogYuv: low-complexity LogLuv . 50 5.1.6 JND steps: Perceptually uniform encoding .
    [Show full text]
  • National Technical University of Athens School of Electrical and Computer Engineering Division of Computer Science
    National Technical University of Athens School of Electrical and Computer Engineering Division of Computer Science Detection Of Opaque Type Violations in Erlang Using Static Analysis Diploma Thesis by Manouk-Vartan Manoukian Supervisors: N.T.U.A Associate Prof. Konstantinos Sagonas Software Laboratory Athens, September 2009 National Technical University of Athens School of Electrical and Computer Engineering Division of Computer Science Software Laboratory Detection Of Opaque Type Violations in Erlang Using Static Analysis Diploma Thesis by Manouk-Vartan Manoukian Supervisors: N.T.U.A Associate Prof. Konstantinos Sagonas This thesis was approved by the examining committee on the 16th of September, 2009. (Signature) (Signature) (Signature) ........................ ........................ ........................ Kostas Kontogiannis Nikolaos Papaspyrou Konstantinos Sagonas N.T.U.A Associate Prof. N.T.U.A Assistant Prof. N.T.U.A Associate Prof. i (Signature) ........................ Manouk-Vartan Manoukian Graduate Electrical and Computer Engineer, N.T.U.A. c 2009 { All rights reserved] ii National Technical University of Athens School of Electrical and Computer Engineering Division of Computer Science Software Laboratory Copyright c All rights reserved Manouk-Vartan Manoukian, 2009 Publication and distribution of this thesis is allowed for non-commercial use only with ap- propriate acknowledgement of the author. For commercial use, permission can be obtained by contacting the author at [email protected]. iii iv Abstract Erlang is a general-purpose programming language designed at the Ericsson Computer Science Laboratory. Erlang has extensive dynamic libraries in which a plethora of abstract data types are defined. However, programming in Erlang suffers from the lack of opaque types. Opaque types are especially necessary in a production environment since they provide solid contractual guarantees.
    [Show full text]
  • IBM Informix User-Defined Routines and Data Types Developer.S Guide
    DB2 ® IBM Informix Version 10.0 IBM Informix User-Defined Routines and Data Types Developer’s Guide G251-2301-00 DB2 ® IBM Informix Version 10.0 IBM Informix User-Defined Routines and Data Types Developer’s Guide G251-2301-00 Note! Before using this information and the product it supports, read the information in “Notices” on page B-1. First Edition (December 2004) This document contains proprietary information of IBM. It is provided under a license agreement and is protected by copyright law. The information contained in this publication does not include any product warranties, and any statements provided in this manual should not be interpreted as such. When you send information to IBM, you grant IBM a nonexclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. © Copyright International Business Machines Corporation 1996, 2004. All rights reserved. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Introduction . .ix About This Manual . .ix Types of Users . .x Software Dependencies . .x Assumptions About Your Locale . .x Demonstration Databases . .x New Features . .xi Version 10.0 Enhancements . .xi Version 9.4 Enhancements . xii Documentation Conventions . xii Typographical Conventions . xii Feature, Product, and Platform . xiii Syntax Diagrams . xiv Example Code Conventions . xvii Additional Documentation . xviii Installation Guides . xviii Online Notes . xviii Informix Error Messages . .xx Manuals . xxi Online Help . xxi Accessibility . xxi IBM Informix Dynamic Server Version 10.0 and CSDK Version 2.90 Documentation Set . xxi Compliance with Industry Standards . xxiv IBM Welcomes Your Comments .
    [Show full text]
  • Proposal to Allocate Ranges to P1619.3
    1 From: Matt Ball, Sun Microsystems 2 To: OASIS KMIP TC 3 Date: June 25, 2009 4 Subject: Proposal to reserve values for IEEE P1619.3 5 Overview 6 This proposal requests allocating ranges of values within the binary encoding to IEEE P1619.3 so that 7 P1619.3 can make extensions without colliding with future KMIP versions or with vendor-specific or 8 proprietary extensions. 9 See changes below (with changebars) 10 9 Message Encoding 11 To support different transport protocols and different client capabilities, a number of message-encoding 12 mechanisms are supported. 13 9.1 TTLV Encoding 14 In order to minimize the resource impact on potentially low-function clients, one encoding 15 mechanism to be used for protocol messages is a simplified TTLV (Tag, Type, Length, Value) 16 scheme. 17 The scheme is designed to minimize the CPU cycle and memory requirements of clients that 18 must encode or decode protocol messages, and to provide optimal alignment for both 32-bit and 19 64-bit processors. Minimizing bandwidth over the transport mechanism is considered to be of 20 lesser importance. 21 9.1.1 TTLV Encoding Fields 22 Every Data object encoded by the TTLV scheme consists of 4 items, in order: 23 9.1.1.1 Item Tag 24 An Item Tag is a 3-byte binary unsigned integer, transmitted big endian, which contains a 25 number that designates the specific Protocol Field or Object that the TTLV object 26 represents. To ease debugging, and to ensure that malformed messages are detected 27 more easily, all tags must contain either the value 42 in hex or the value 54 in hex as the 28 high order (first) byte.
    [Show full text]
  • AN5092, FIR Filtering Using the Lightweight Signal Processor on MPC5777M
    Freescale Semiconductor, Inc. Document Number: AN5092 Application note Rev. 1 , 05/2015 FIR Filtering Using the Lightweight Signal Processor on MPC5777M by: Andrew Turner and Ian Howie 1 Introduction The Lightweight Signal Processing (LSP) auxiliary Contents processing unit (APU) is designed to accelerate processing applications normally suited to digital signal 1 Introduction .............................................................................. 1 processing (DSP) operations. The LSP-APU is 2 LSP comparison with SPE and SPE2 ....................................... 2 embedded in the e200z425n3 I/O processor found on 3 LSP –APU Programming basics .............................................. 2 3.1 GPR Registers .................................................................. 2 the Freescale’s MPC5777M device. The LSP-APU can 3.2 GPR Register pairings ..................................................... 3 be used to accelerate signal processing routines such as 3.3 Instruction Overview ....................................................... 3 finite impulse response (FIR) and infinite impulse 3.4 Example instructions ....................................................... 3 3.5 LSP-APU Data formats ................................................... 4 response (IIR) filters. This is accomplished using the 3.6 Fractional arithmetic and its benefits to signal processing5 standard 32-bit general purpose registers (GPRs), and 4 FIR Filter Introduction ............................................................. 6 supports vector
    [Show full text]
  • Fundamental Data Structures Contents
    Fundamental Data Structures Contents 1 Introduction 1 1.1 Abstract data type ........................................... 1 1.1.1 Examples ........................................... 1 1.1.2 Introduction .......................................... 2 1.1.3 Defining an abstract data type ................................. 2 1.1.4 Advantages of abstract data typing .............................. 4 1.1.5 Typical operations ...................................... 4 1.1.6 Examples ........................................... 5 1.1.7 Implementation ........................................ 5 1.1.8 See also ............................................ 6 1.1.9 Notes ............................................. 6 1.1.10 References .......................................... 6 1.1.11 Further ............................................ 7 1.1.12 External links ......................................... 7 1.2 Data structure ............................................. 7 1.2.1 Overview ........................................... 7 1.2.2 Examples ........................................... 7 1.2.3 Language support ....................................... 8 1.2.4 See also ............................................ 8 1.2.5 References .......................................... 8 1.2.6 Further reading ........................................ 8 1.2.7 External links ......................................... 9 1.3 Analysis of algorithms ......................................... 9 1.3.1 Cost models ......................................... 9 1.3.2 Run-time analysis
    [Show full text]
  • Essentials of Programming Languages Third Edition Daniel P
    computer science/programming languages PROGRAMMING LANGUAGES ESSENTIALS OF Essentials of Programming Languages third edition Daniel P. Friedman and Mitchell Wand ESSENTIALS OF This book provides students with a deep, working understanding of the essential concepts of program- ming languages. Most of these essentials relate to the semantics, or meaning, of program elements, and the text uses interpreters (short programs that directly analyze an abstract representation of the THIRD EDITION program text) to express the semantics of many essential language elements in a way that is both clear PROGRAMMING and executable. The approach is both analytical and hands-on. The book provides views of program- ming languages using widely varying levels of abstraction, maintaining a clear connection between the high-level and low-level views. Exercises are a vital part of the text and are scattered throughout; the text explains the key concepts, and the exercises explore alternative designs and other issues. The complete LANGUAGES Scheme code for all the interpreters and analyzers in the book can be found online through The MIT Press website. For this new edition, each chapter has been revised and many new exercises have been added. Significant additions have been made to the text, including completely new chapters on modules and continuation-passing style. Essentials of Programming Languages can be used for both graduate and un- dergraduate courses, and for continuing education courses for programmers. Daniel P. Friedman is Professor of Computer Science at Indiana University and is the author of many books published by The MIT Press, including The Little Schemer (fourth edition, 1995), The Seasoned Schemer (1995), A Little Java, A Few Patterns (1997), each of these coauthored with Matthias Felleisen, and The Reasoned Schemer (2005), coauthored with William E.
    [Show full text]