Simply Scheme: Introducing Computer Science

2/e Copyright (C) 1999 MIT

Table of Contents

cover photo
Brian Harvey
University of California, Berkeley
Matthew Wright
University of California, Santa Barbara

Download PDF frontmatter
[no back] chapter thread NEXT
MIT Press web page for Simply Scheme

Below this short table of contents is an expanded table of contents including sections within each chapter. Click on the chapter name to jump down. You can also download the complete text of each chapter in PDF format for elegant printing, or browse the HTML version. Part introductions are included in the PDF of the following chapter. Projects are included in the PDF of the preceding chapter.

Note: This book is still in copyright, and in print. It is posted here for your personal use, not for resale or redistribution. Thanks!




Foreword by Hal Abelson

(frontmatter in PDF) (HTML)

Preface

(HTML)

To the Instructor

(HTML)

Acknowledgements

(HTML)

I. Introduction: Functions

(HTML)

1. Showing Off Scheme

(PDF) (HTML)

2. Functions

(PDF) (HTML)

II. Composition of Functions

(HTML)

3. Expressions

(PDF) (HTML)

4. Defining Your Own Procedures

(PDF) (HTML)

5. Words and Sentences

(PDF) (HTML)

6. True and False

(PDF) (HTML)

7. Variables

(PDF) (HTML)

III. Functions as Data

(HTML)

8. Higher-Order Functions

(PDF) (HTML)

9. Lambda

(PDF) (HTML)

Project: Scoring Bridge Hands

(HTML)

10. Example: Tic-Tac-Toe

(PDF) (HTML)

IV. Recursion

(HTML)

11. Introduction to Recursion

(PDF) (HTML)

12. The Leap of Faith

(PDF) (HTML)

13. How Recursion Works

(PDF) (HTML)

14. Common Patterns in Recursive Procedures

(PDF) (HTML)

Project: Spelling Names of Huge Numbers

(HTML)

15. Advanced Recursion

(PDF) (HTML)

Project: Scoring Poker Hands

(HTML)

16. Example: Pattern Matcher

(PDF) (HTML)

V. Abstraction

(HTML)

17. Lists

(PDF) (HTML)

18. Trees

(PDF) (HTML)

19. Implementing Higher-Order Functions

(PDF) (HTML)

VI. Sequential Programming

(HTML)

20. Input and Output

(PDF) (HTML)

21. Example: The Functions Program

(PDF) (HTML)

22. Files

(PDF) (HTML)

23. Vectors

(PDF) (HTML)

24. Example: A Spreadsheet Program

(PDF) (HTML)

25. Implementing the Spreadsheet Program

(PDF) (HTML)

Project: A Database Program

(HTML)

VII. Conclusion: Computer Science

(HTML)

26. What's Next?

(PDF) (HTML)

Appendices

A. Running Scheme

(backmatter in PDF) (HTML)

B. Common Lisp

(HTML)

C. Scheme Initialization File

(HTML)

D. GNU General Public License

(HTML)

Credits

(HTML)

Alphabetical Table of Scheme Primitives

(HTML)

Glossary

(HTML)

Index of Defined Procedures

(HTML)

General Index

(HTML)

Table of Scheme Primitives by Category

(HTML)




[no back] chapter thread NEXT

Brian Harvey, bh@cs.berkeley.edu