DOCSLIB.ORG

Programming Languages As Operating Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Programming Languages As Operating Systems Programming Languages as Op erating Systems (or Revenge of the Son of the Lisp Machine) Matthew Flatt Rob ert Bruce Findler Shriram Krishnamurthi Matthias Felleisen Department of Computer Science Rice University Houston, Texas 77005-1892 reclaim the program's resources|even though the program Abstract and DrScheme share a single virtual machine. The MrEd virtual machine serves b oth as the implementa- To address this problem, MrEd provides a small set of tion platform for the DrScheme programming environment, new language constructs. These constructs allow a program- and as the underlying Scheme engine for executing expres- running program, suchasDrScheme, to run nested programs sions and programs entered into DrScheme's read-eval-print directly on the MrEd virtual machine without sacri cing lo op. We describ e the key elements of the MrEd virtual control over the nested programs. As a result, DrScheme machine for building a programming environment, and we can execute a copyofDrScheme that is executing its own step through the implementation of a miniature version of copy of DrScheme (see Figure 1). The inner and middle DrScheme in MrEd. More generally,weshowhow MrEd de- DrSchemes cannot interfere with the op eration of the outer nes a high-level op erating system for graphical programs. DrScheme, and the middle DrScheme cannot interfere with the outer DrScheme's control over the inner DrScheme. In this pap er, we describ e the key elements of the MrEd 1 MrEd: A Scheme Machine virtual machine, and we step through the implementation of a miniature version of DrScheme in MrEd. More gen- The DrScheme programming environment [10] provides stu- erally,weshowhow MrEd de nes a high-level op erating dents and programmers with a user-friendly environment system (OS) for graphical programs. As in other high-level for developing Scheme programs. Tomake programming OSes, safety and securityinMrEdderive from prop erties of accessible and attractivetonovices, DrScheme provides a the underlying programming language. Mere safety,how- thoroughly graphical environment and runs under several ever, provides neither the level of protection b etween ap- ma jor windowing systems (Windows, MacOS, and Unix/X). plications nor the kind of pro cess control that conventional More than 60 universities and high scho ols currently employ OSes provide. Such protection and control is crucial for im- DrScheme in their computing curriculum, and new scho ols plementing many kinds of programs, includin g programming adopt DrScheme every semester. environments and scripting engines. By describing howwe We implemented DrScheme by rst building MrEd [15], implemented DrScheme in MrEd, we demonstrate howto a p ortable Scheme [23] implementation with a graphical user obtain key OS facilities through small extensions to a high- interface (GUI) to olb ox. MrEd serves b oth as the implemen- level programming language. tation platform for DrScheme, and as the underlying Scheme The remainder of the pap er is organized as follows. Sec- engine for executing expressions and programs entered into tion 2 sketches a miniature DrScheme, called SchemeEsq, DrScheme's read-eval-printloop(repl). This strategy fol- and explains in more detail the implementation challenges lows a long tradition of meta-circular implementation that is for creating a graphical programming environment. Sec- virtually synonymous with Lisp, and generally understo o d tion 3 provides a brief overview of MrEd. Section 4 steps for high-level languages as a whole [20, 25 , 28 ]. through the implementation of SchemeEsq as a MrEd pro- Since DrScheme exp oses MrEd's language constructs di- gram. Section 5 explains how MrEd functions as a high-level rectly to the repl,DrScheme can easily execute programs OS. Section 6 discusses some problems for future work, and that use the full MrEd language, includin g its GUI to ol- Section 7 compares MrEd to related systems. box. At the same time, DrScheme must protect its GUI against interference from the programs it executes, and it must b e able to halt a program that has gone awry and 2 SchemeEsq: The Challenge This researchwas partially supp orted by a Lo dieska Sto ckbridge SchemeEsq, depicted in Figure 2, is a simple programming Vaughan Fellowship, NSF grants CCR-9619756, CDA-9713032,and shell that captures the essential prop erties of DrScheme as CCR-9708957, and a Texas ATP grant. a program-running program. Roughly,SchemeEsq imple- ments a read-eval-printloop(repl) that consumes expres- sions and evaluates them: (define (repl) (print (eval (read))) To app ear: Intl. Conf. on Functional Programming (repl)) (ICFP) { Sept. 27-29 1999, Paris, France 1 DrScheme DrScheme DrScheme 4 4 4 > (run-drscheme) > (run-drscheme) > r r r / . / . / . outer inner middle Figure 1: DrScheme in DrScheme in DrScheme same wayasitwould execute within its own MrEd virtual machine. The crucial requirement for SchemeEsq is that it must run any program securely, in the sense that the program can- 1 not interfere with SchemeEsq's op eration. Indeed, since SchemeEsq is itself a MrEd program, SchemeEsq must b e able to run copies of itself anynumb er of times and to any nesting depth. No matter how manySchemeEsqs are running and how deeply they are nested, each instance of SchemeEsq must b e free from interference from its children. At the same time, a single clicktoReset in the outermost SchemeEsq must terminate all of the other instances. 3 MrEd Overview Figure 2: SchemeEsq MrEd acts as a high-level OS to service the GUI, security, and scalabili ty needs of SchemeEsq. In the same waythata current pro duction OS (e.g., Unix/X, Microsoft Windows) de nes a GUI API, a pro cess mo del, and a library-li nki ng This rough repl sketch relies on extensive underlying ma- mechanism, MrEd de nes constructs within Scheme for cre- chinery to implement each of the read, eval,and print steps. ating GUIs, securely executing untrusted co de, and linking SchemeEsq mo dels DrScheme in more detail, showing how together co de mo dules: read gets characters from the user, where print sends its out- put, etc. Furthermore, unlike the repl function, SchemeEsq GUI construction | MrEd provides GUI elements via demonstrates howtocatch errors in the user's program and built-in classes that a programmer can instantiate or how to stop a program's execution. extend. Event dispatching is automatic and normally SchemeEsq's repl accepts expressions, evaluates them, synchronous, but MrEd also p ermits controlled, asyn- and displays the results, all within a GUI text edi- chronous (i.e., parallel) event handling. In addition, tor. For simplicity,we assume that the user submits a MrEd provides sp ecial supp ort for multimedia editor complete Scheme expression for evaluation by hitting applicati ons (hence the Ed in MrEd ), suchasword the Enter key.Ifarepl expression signals an error, pro cessors and drawing programs. SchemeEsq prints the error message and creates a new Emb edding and security | MrEd provides multiple input prompt. At all times, the text preceding the threads of execution, thread-sp eci c con guration, and current prompt is lo cked so the user cannot mo dify it. resource control. These constructs supp ort the secure In addition to standard Scheme, SchemeEsq's repl emb edding of programs within other programs that provides access to the entire MrEd to olb ox, p ermit- control the emb edded execution environment and re- ting the user's program to create threads and GUI ob- source consumption. jects. User-created GUI elements must not interfere Mo dularity and extensibil ity | MrEd's mo dule and with SchemeEsq's own GUI. For example, the user's class constructs enable the construction of reusable program might create a mo dal dialog that disables all comp onents. These comp onent constructs naturally of the user's other windows, but it must not disable complement MrEd's ob ject-oriented GUI to olb ox, al- the SchemeEsq window. lowing a programmer to implement reusable and com- SchemeEsq's Reset button stops the currentevalua- p osable extensions of GUI elements. tion, reclaiming all resources currently in use bythe The following sections provide an overview of MrEd's con- user's program. All active threads and GUI elements structs. Section 3.1 describ es a few details of MrEd's GUI created by the program must b e destroyed. to olb ox, whichweprovide for the sake of de ning a concrete Although SchemeEsq redirects printed output from the implementation of SchemeEsq. Section 3.2 describ es MrEd's user's program to its repl window, the program must 1 Except by running out of memory; see Section 6. otherwise execute within SchemeEsq in exactly the 2 constructs for program emb edding and security. The ideas MrEd's GUI classes also handle the graphical layout of underlying these constructs form the main contribution of windows. Our example frame demonstrates a simple layout; the pap er. Finally, Section 3.3 describ es MrEd's supp ort for the frame's elements are lined up top-to-b ottom. In general, mo dular and ob ject-oriented programming, whichisintegral a programmer sp eci es the layout of a windowby assigning to our mo del of programs and pro cesses. each GUI element to a parent container.Avertical con- tainer, such as a frame, arranges its children in a column, Recommendation: Skip the Exp erience and Rationale boxes for a and a horizontal container arranges its children in a row. A rst reading. container can b e a child of another container; for example, to place two buttons side-by-side in a frame, a programmer 3.1 GUI Construction creates a horizontal panel for the buttons: MrEd provides the basic building blo cks of GUI programs| (define panel (make-object horizontal-panel% frame)) such as frames (top-level windows), mo dal dialogs, menus, (make-object button% \Left" panel ...) buttons, checkboxes, and text elds|via built-in classes (make-object button% \Right" panel ...) that the programmer can instantiate or extend.
Load more

Recommended publications
  • An Optimized R5RS Macro Expander
    An Optimized R5RS Macro Expander Sean Reque A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for the degree of Master of Science Jay McCarthy, Chair Eric Mercer Quinn Snell Department of Computer Science Brigham Young University February 2013 Copyright c 2013 Sean Reque All Rights Reserved ABSTRACT An Optimized R5RS Macro Expander Sean Reque Department of Computer Science, BYU Master of Science Macro systems allow programmers abstractions over the syntax of a programming language. This gives the programmer some of the same power posessed by a programming language designer, namely, the ability to extend the programming language to fit the needs of the programmer. The value of such systems has been demonstrated by their continued adoption in more languages and platforms. However, several barriers to widespread adoption of macro systems still exist. The language Racket [6] defines a small core of primitive language constructs, including a powerful macro system, upon which all other features are built. Because of this design, many features of other programming languages can be implemented through libraries, keeping the core language simple without sacrificing power or flexibility. However, slow macro expansion remains a lingering problem in the language's primary implementation, and in fact macro expansion currently dominates compile times for Racket modules and programs. Besides the typical problems associated with slow compile times, such as slower testing feedback, increased mental disruption during the programming process, and unscalable build times for large projects, slow macro expansion carries its own unique problems, such as poorer performance for IDEs and other software analysis tools.
    [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]
  • Structured Foreign Types
    Ftypes: Structured foreign types Andrew W. Keep R. Kent Dybvig Indiana University fakeep,[email protected] Abstract When accessing scalar elements within an ftype, the value of the High-level programming languages, like Scheme, typically repre- scalar is automatically marshaled into the equivalent Scheme rep- sent data in ways that differ from the host platform to support resentation. When setting scalar elements, the Scheme value is consistent behavior across platforms and automatic storage man- checked to ensure compatibility with the specified foreign type, and agement, i.e., garbage collection. While crucial to the program- then marshaled into the equivalent foreign representation. Ftypes ming model, differences in data representation can complicate in- are well integrated into the system, with compiler support for ef- teraction with foreign programs and libraries that employ machine- ficient access to foreign data and debugger support for convenient dependent data structures that do not readily support garbage col- inspection of foreign data. lection. To bridge this gap, many high-level languages feature for- The ftype syntax is convenient and flexible. While it is similar in eign function interfaces that include some ability to interact with some ways to foreign data declarations in other Scheme implemen- foreign data, though they often do not provide complete control tations, and language design is largely a matter of taste, we believe over the structure of foreign data, are not always fully integrated our syntax is cleaner and more intuitive than most. Our system also into the language and run-time system, and are often not as effi- has a more complete set of features, covering all C data types along cient as possible.
    [Show full text]
  • Chez Scheme Version 5 Release Notes Copyright C 1994 Cadence Research Systems All Rights Reserved October 1994 Overview 1. Funct
    Chez Scheme Version 5 Release Notes Copyright c 1994 Cadence Research Systems All Rights Reserved October 1994 Overview This document outlines the changes made to Chez Scheme for Version 5 since Version 4. New items include support for syntax-case and revised report high-level lexical macros, support for multiple values, support for guardians and weak pairs, support for generic ports, improved trace output, support for shared incremental heaps, support for passing single floats to and returning single floats from foreign procedures, support for passing structures to and returning structures from foreign procedures on MIPS-based computers, and various performance enhancements, including a dramatic improvement in the time it takes to load Scheme source and object files on DEC Ultrix MIPS-based computers. Overall performance of generated code has increased by an average of 15–50 percent over Version 4 depending upon optimize level and programming style. Programs that make extensive use of locally-defined procedures will benefit more than programs that rely heavily on globally-defined procedures, and programs compiled at higher optimize levels will improve more than programs compiled at lower optimize levels. Compile time is approximately 25 percent faster. Refer to the Chez Scheme System Manual, Revision 2.5 for detailed descriptions of the new or modified procedures and syntactic forms mentioned in these notes. Version 5 is available for the following platforms: • Sun Sparc SunOS 4.X & Solaris 2.X • DEC Alpha AXP OSF/1 V2.X • Silicon Graphics IRIX 5.X • Intel 80x86 NeXT Mach 3.2 • Motorola Delta MC88000 SVR3 & SVR4 • Decstation/Decsystem Ultrix 4.3A • Intel 80x86 BSDI BSD/386 1.1 • Intel 80x86 Linux This document contains four sections describing (1) functionality enhancements, (2) performance enhance- ments, (3) bugs fixed, and (4) compatibility issues.
    [Show full text]
  • Drscheme: a Pedagogic Programming Environment for Scheme
    DrScheme A Pedagogic Programming Environment for Scheme Rob ert Bruce Findler Cormac Flanagan Matthew Flatt Shriram Krishnamurthi and Matthias Felleisen Department of Computer Science Rice University Houston Texas Abstract Teaching intro ductory computing courses with Scheme el evates the intellectual level of the course and thus makes the sub ject more app ealing to students with scientic interests Unfortunatelythe p o or quality of the available programming environments negates many of the p edagogic advantages Toovercome this problem wehavedevel op ed DrScheme a comprehensive programming environmentforScheme It fully integrates a graphicsenriched editor a multilingua l parser that can pro cess a hierarchyofsyntactically restrictivevariants of Scheme a functional readevalprint lo op and an algebraical ly sensible printer The environment catches the typical syntactic mistakes of b eginners and pinp oints the exact source lo cation of runtime exceptions DrScheme also provides an algebraic stepp er a syntax checker and a static debugger The rst reduces Scheme programs including programs with assignment and control eects to values and eects The to ol is useful for explainin g the semantics of linguistic facilities and for studying the b ehavior of small programs The syntax c hecker annotates programs with fontandcolorchanges based on the syntactic structure of the pro gram It also draws arrows on demand that p oint from b ound to binding o ccurrences of identiers The static debugger roughly sp eaking pro vides a typ e inference system
    [Show full text]
  • Supplementary Material Forrebuilding Racket on Chez Scheme
    Supplementary Material for Rebuilding Racket on Chez Scheme (Experience Report) MATTHEW FLATT, University of Utah, USA CANER DERICI, Indiana University, USA R. KENT DYBVIG, Cisco Systems, Inc., USA ANDREW W. KEEP, Cisco Systems, Inc., USA GUSTAVO E. MASSACCESI, Universidad de Buenos Aires, Argentina SARAH SPALL, Indiana University, USA SAM TOBIN-HOCHSTADT, Indiana University, USA JON ZEPPIERI, independent researcher, USA All benchmark measurements were performed on an Intel Core i7-2600 3.4GHz processor running 64-bit Linux. Except as specifically noted, we used Chez Scheme 9.5.3 commit 7df2fb2e77 at github:cicso/ChezScheme, modified as commit 6d05b70e86 at github:racket/ChezScheme, and Racket 7.3.0.3 as commit ff95f1860a at github:racket/racket. 1 TRADITIONAL SCHEME BENCHMARKS The traditional Scheme benchmarks in figure1 are based on a suite of small programs that have been widely used to compare Scheme implementations. The benchmark sources are in the "common" directory of the racket-benchmarks package in the Racket GitHub repository. The results are in two groups, where the group starting with scheme-c uses mutable pairs, so they are run in Racket as #lang r5rs programs; for Racket CS we expect overhead due to the use of a record datatype for mutable pairs, instead of Chez Scheme’s built-in pairs. The groups are sorted by the ratio of times for Chez Scheme and the current Racket imple- mentation. Note that the break-even point is near the end of the first group. The racket collatz benchmark turns out to mostly measure the performance of the built-in division operator for rational numbers, while fft and nucleic benefit from flonum unboxing.
    [Show full text]
  • 23 Things I Know About Modules for Scheme
    23 things I know about modules for Scheme Christian Queinnec Université Paris 6 — Pierre et Marie Curie LIP6, 4 place Jussieu, 75252 Paris Cedex — France [email protected] ABSTRACT difficult to deliver (or even rebuild) stand-alone systems. The benefits of modularization are well known. However, Interfaces as collection of names — If modules are about shar- modules are not standard in Scheme. This paper accompanies ing, what should be shared ? Values, locations (that is an invited talk at the Scheme Workshop 2002 on the current variables), types, classes (and their cortege` of accessors, state of modules for Scheme. Implementation is not addressed, constructors and predicates) ? only linguistic features are covered. Cave lector, this paper only reflects my own and instanta- The usual answer in Scheme is to share locations with neous biases! (quite often) two additional properties: (i) these loca- tions can only be mutated from the body of their defin- ing modules (this favors block compilation), (ii) they 1. MODULES should hold functions (and this should be statically (and The benefits of modularization within conventional languages easily) discoverable). This restricts linking with other are well known. Modules dissociate interfaces and implemen- (foreign) languages that may export locations holding tations; they allow separate compilation (or at least indepen- non-functional data (the errno location for instance). dent compilation a` la C). Modules tend to favor re-usability, This is not a big restriction since modern interfaces (Corba common libraries and cross language linkage. for example) tend to exclusively use functions (or meth- Modules discipline name spaces with explicit names expo- ods).
    [Show full text]
  • Dissertation
    HOWTOGENERATEACTIONABLE ADVICEABOUTPERFORMANCE PROBLEMS Vincent St-Amour Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy College of Computer and Information Science Northeastern University Boston, Massachusetts April 2015 Vincent St-Amour: How to Generate Actionable Advice about Performance Problems, Doctor of Philosophy, Northeastern University, Boston, Massachusetts © April 2015 ABSTRACT Performance engineering is an important activity regardless of ap- plication domain, as critical for server software as for mobile appli- cations. This activity, however, demands advanced, specialized skills that require a significant time investment to acquire, and are therefore absent from most programmers’ toolboxes. My thesis is that tool support can make performance engineering both accessible and time-efficient for non-expert programmers. To support this claim, this dissertation introduces two novel families of performance tools that are designed specifically to provide actionable information to programmers: optimization coaches and feature-specific profilers. This dissertation presents blueprints for building tools in these families, and provides examples from tools that I have built. v ACKNOWLEDGMENTS I would like to thank first and foremost my advisor Matthias Felleisen, who has taught me most of what I know today about the craft of research, writing, and design. He is the best advisor and ally I could have wished for, and I am incredibly grateful for of all the help and guidance he has provided me over the years. This work would not have been possible without the help of my collaborators, with whom I have worked on the projects described in these pages and others along the way: Leif Andersen, Eric Dob- son, Matthias Felleisen, Robby Findler, Matthew Flatt, Shu-yu Guo, Asumu Takikawa, Sam Tobin-Hochstadt, and Neil Toronto.
    [Show full text]
  • Bugloo: a Source Level Debugger for Scheme Programs Compiled Into JVM Bytecode
    Bugloo: A Source Level Debugger for Scheme Programs Compiled into JVM Bytecode Damien Ciabrini Manuel Serrano INRIA Sophia Antipolis INRIA Sophia Antipolis 2004 route des Lucioles - BP 93 2004 route des Lucioles - BP 93 F-06902 Sophia Antipolis, Cedex F-06902 Sophia Antipolis, Cedex [email protected] [email protected] ABSTRACT strated by a static debugger. Our work focuses on the dy- namic debugging approach and on the Scheme [20] program- This paper presents Bugloo, a source level debugger for ming language. Scheme programs. It enables debugging of programs com- piled into JVM bytecode by the Bigloo compiler. It aims 1.1 Motivation of Our Work at being easy to use because it provides a user interface. It In practice, programmers hardly use debuggers. Obviously, aims at being practical to use because it is easy to deploy they prefer ad hoc debugging techniques such as inserting and because it is efficient enough to debug large programs prints in the source code. We think that the reason of such as the Bigloo compiler itself. this disinterest is twofold: (i) many debuggers are not ef- ficient enough to debug large programs, (ii), features of- The JVM platform provides two standard APIs for imple- fered by many debuggers are unsufficient for the type of bug menting debuggers and profilers: JVMDI and JVMPI. One programmers have to correct. In consequence, they often of the motivations for providing the Bigloo compiler with a conclude that “prints are simpler and quicker”. In other JVM back-end was to benefit from these two APIs to imple- words, the overall benefits of debuggers might not be worth ment a debugger for Scheme.
    [Show full text]
  • Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
    USENIX Association Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference Monterey, California, USA June 10-15, 2002 THE ADVANCED COMPUTING SYSTEMS ASSOCIATION © 2002 by The USENIX Association All Rights Reserved For more information about the USENIX Association: Phone: 1 510 528 8649 FAX: 1 510 548 5738 Email: [email protected] WWW: http://www.usenix.org Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. Biglook: a Widget Library for the Scheme Programming Language Erick Gallesio Manuel Serrano Universite´ de Nice – Sophia Antipolis Inria Sophia Antipolis 950 route des Colles, B.P. 145 2004 route des Lucioles – B.P. 93 F-06903 Sophia Antipolis, Cedex F-06902 Sophia-Antipolis, Cedex EÖickºGaÐÐe×iÓ@ÙÒiceºfÖ ÅaÒÙeкËeÖÖaÒÓ@iÒÖiaºfÖ Abstract Biglook is an Object Oriented Scheme library for constructing GUIs. It uses classes of a CLOS- like object layer to represent widgets and Scheme closures to handle events. Combining functional and object-oriented programming styles yields an original application programming interface that advocates a strict separation between the implementation of the graphical interfaces and the user-associated commands, enabling compact source code. The Biglook implementation separates the Scheme programming interface and the na- Figure 1: Two Biglook applications: a code tive back-end. This permits different ports browser on the left, “dock” applications on the for Biglook. The current version uses GTK· right and Swing graphical toolkits, while the pre- vious release used Tk.
    [Show full text]
  • Gene Finding
    Programming Languages Rhys Price Jones Class home page is linked from: http://www.seas.gwu.edu/~rhyspj Friday, December 31, 2010 CSCI 3221 Programming Languages Rhys Price Jones Class home page is linked from: http://www.seas.gwu.edu/~rhyspj Friday, December 31, 2010 Textbooks: Little Schemer absolutely essential to read and write (!) this book this week SICP Structure and Interpretation of Computer Programs a timeless classic buy the paper book, or use the online free version 2 Friday, December 31, 2010 Software - free downloads: Petite chez scheme http://www.scheme.com emacs www.gnu.org/software/emacs You can plug in stuff to Eclipse so it supports scheme but my class presentations and materials will be emacs based 3 Friday, December 31, 2010 Platform specifics Windows nice to have cygwin www.cygwin.com Mac all set to go BUT do not use the Emacs that comes with mac os. Linux ... 4 Friday, December 31, 2010 Exams etc One midterm One final more or less weekly quizzes reading assignments lab assignments 5 Friday, December 31, 2010 Overview of course Learn Scheme Use Scheme Ignore Scheme and concentrate on principles of computation Implement Scheme Modify Scheme Implement other languages and experiment with language features 6 Friday, December 31, 2010 Reading assignment linked from class home page This first week. Little Schemer Chapter 1 Chapter 2 Chapter 3 Chapter 4 Chapter 5 7 Friday, December 31, 2010 This week’s lab play with scheme What is Scheme? a dialect of Lisp What is Lisp? ... 8
    [Show full text]
  • January, 2010 Volume 36
    Volume 36 January, 2010 Behind The Scenes: A Chat With Hootiegibbon Book Worms Unite: An E-Book Explosion Game Zone: Modern Warfare 2 Gadgets & Gear: Official PCLinuxOS Store Sproggy's Glass Panel Tutorial 2009: A Look Back Command Line Interface Intro: Part 4 Forum Foibles: New Year's Resolutions 1 And more inside! TTaabbllee OOff CCoonntteennttss Welcome From The Editor Page 3 2009: A Look Back Page 4 ms_meme's Nook: What A Year It Has Been Page 6 Behind The Scenes: A Chat With Hootiegibbon Page 7 Screenshot Showcase Page 9 Game Zone: Modern Warfare 2 Page 10 Computer Languages A to Z: Guile Page 14 Testimonial: Satisfied Customer Page 16 Screenshot Showcase Page 17 Double Take & Mark's Gimp Tip Page 18 You Can Have Your Cake & Eat It Too Page 19 Screenshot Showcase Page 22 Gadgets & Gear: Official PCLinuxOS Store Opens Page 23 Book Worms Unite: An E­Book Explosion Page 24 Screenshot Showcase Page 30 Sproggy's Glass Panel Tutorial Page 31 Screenshot Showcase Page 34 Forum Foibles: New Year's Resolutions Page 35 Command Line Interface Intro: Part 4 Page 37 Screenshot Showcase Page 44 Archiving Movies With dvd::rip ­ An Update Page 45 Testimonial: Easy Printer Setup Page 47 Disclaimer Page 47 More Screenshot Showcase Page 48 2 WWeellccoommee FFrroomm TThhee CChhiieeff EEddiittoorr by Paul Arnote (parnote) the market run on Linux, in the Book Worms Unite: An E­Book Explosion. You may be surprised at just The holidays have finally come and gone, the how much free e­book content you can find out in packages have all been unwrapped, the Christmas the digital realm, if you just look for it.
    [Show full text]