-
PrefaceScheme was introduced in 1975 by Gerald J. Sussman and Guy L. Steele Jr. [28,29], and was the first dialect of Lisp to f
-
Chapter 1. Introductionimgimg Chapter 1. Introduction Scheme is a general-purpose computer programming language. It is a high-level language,
-
Chapter 2. Getting Startedimgimg Chapter 2. Getting Started This chapter is an introduction to Scheme for programmers who are new to the languag
-
Chapter 3. Going Furtherimgimg Chapter 3. Going Further The preceding chapter prepared you to write Scheme programs using a small set of the m
-
Chapter 4. Procedures and Variable Bindingsimgimg Chapter 4. Procedures and Variable Bindings Procedures and variable bindings are the fundamental building block
-
Chapter 5. Control Operationsimgimg Chapter 5. Control Operations This chapter introduces the syntactic forms and procedures that serve as control
-
Chapter 6. Operations on Objectsimgimg Chapter 6. Operations on Objects This chapter describes the operations on objects, including lists, numbers, ch
-
Chapter 7. Input and Outputimgimg Chapter 7. Input and Output All input and output operations are performed through ports. A port is a pointer in
-
Chapter 8. Syntactic Extensionimgimg Chapter 8. Syntactic Extension Syntactic extensions, or macros, are used to simplify and regularize repeated pa
-
Chapter 9. Recordsimgimg Chapter 9. Records This chapter describes the means by which the programmer may define new data types, or recor
-
Chapter 10. Libraries and Top-Level Programsimgimg Chapter 10. Libraries and Top-Level Programs Libraries and top-level programs are the basic units of portable c
-
Chapter 11. Exceptions and Conditionsimgimg Chapter 11. Exceptions and Conditions Exceptions and conditions provide the means for system and user code to s
-
Chapter 12. Extended Examplesimgimg Chapter 12. Extended Examples This chapter presents a series of programs that perform more complicated tasks th
-
References[1] Michael Adams and R. Kent Dybvig. Efficient nondestructive equality checking for trees and graphs. In Proceedings o
-
Answers to Selected Exercisesa.(+ (* 1.2 (- 2 1/3)) -8.7) b.(/ (+ 2/3 4/9) (- 5/11 4/3)) c.(+ 1 (/ 1 (+ 2 (/ 1 (+ 1 1/2))))) d.(* (* (* (* (* (
-
Formal SyntaxThe formal grammars and accompanying text appearing here describe the written syntax of Scheme data values, or datums. T
-
Summary of FormsThe table that follows summarizes the Scheme syntactic forms and procedures described in Chapters 4 through 11. It shows
-
about this bookThe Scheme Programming Language, 4th Edition Written by R. Kent Dybvig Illustrations by Jean-Pierre Hébert From the back
-
The Scheme Programming Language, 4th Editionimg Fourth Edition Illustrations by Jean-Pierre Hébert Table of Contents