The First Report on Scheme Revisited

  title={The First Report on Scheme Revisited},
  author={Gerald J. Sussman and Guy L. Steele},
  journal={Higher-Order and Symbolic Computation},
  • G. Sussman, G. Steele
  • Published 1 December 1998
  • Computer Science
  • Higher-Order and Symbolic Computation
Designs and standards tend to go in cycles. After a specific new design or standard becomes established, it is incrementally " improved " —usually by the accretion of features, until it becomes unwieldy. Then it is time to step back and reassess the situation. Sometimes a judicious designer can sort through the accumulated set of ideas, discard the less important ones, and produce a new design that is small and clean. Pascal and Modula-2 were produced in this way. Scheme wasn't like that at all… 
Distributed Software Transactional Memory
An implementation of a distributed software transactional memory (DSTM) system in PLT Scheme that reduces the emphasis on messaging protocols typically found in distributed robotics software, while providing even greater flexibility in terms of how data is mixed and matched as it moves over the network.
Optimizing record data structures in Racket
This paper analyzes how records are used in different applications in the Scheme dialect Racket and suggests the application of existing optimization techniques for records and a new one for immutable boolean fields to apply to Pycket, an implementation of Racket.
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a series of reasoning
Model-Based Application Development for Massively Parallel Embedded Systems
This thesis proposes an integral design methodology, named IRIS, for the development of firmware for many-core architectures, illustrated by three cases: a colour image processing pipeline for a printer, stochastic image quantisation, and data mining of dynamic document spaces.
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines
  • O. Danvy
  • Computer Science
    Semantics and Algebraic Specification
  • 2009
We derive two big-step abstract machines, a natural semantics, and the valuation function of a denotational semantics based on the small-step abstract machine for Core Scheme presented by Clinger at
Analytical Approach to Programs as Data Objects
This essay accompanies a selection of 32 articles (referred to in bold face in the text and marginally marked in the bibliographic references) submitted to Aarhus University towards a Doctor
Numbers and Computers
This chapter takes a look at number bases focusing on those most frequently used in association with computers, and how to construct numbers in these bases as well as how to move numbers between different bases.