Simply Scheme - 2nd Edition: Introducing Computer Science

✍ Scribed by Brian Harvey, Matthew Wright

• Publisher: The MIT Press
• Year: 1999
• Tongue: English
• Leaves: 613
• Edition: 2nd
• Category: Library

✦ Synopsis

This lively introduction to computer science and computer programming in Scheme is for non-computer science majors with a strong interest in the subject and for computer science majors who lack prior programming experience. The text allows the student to experience the computer as a tool for expressing ideas, not as a frustrating set of mathematical obstacles. This goal is supported by the use of Scheme, a modern dialect of Lisp, designed to emphasize symbolic programming.

✦ Table of Contents

Cover......Page p0001.djvu
Simply Scheme: Introducing Computer Science......Page p0004.djvu
Contents......Page p0006.djvu
Foreword......Page p0016.djvu
Preface......Page p0018.djvu
To the Instructor......Page p0026.djvu
Acknowledgments......Page p0032.djvu
Simply Scheme......Page p0034.djvu
Part I Introduction: Functions......Page p0035.djvu
1 Showing Off Scheme......Page p0038.djvu
2 Functions......Page p0050.djvu
Part II Composition of Functions......Page p0059.djvu
3 Expressions......Page p0062.djvu
4 Defining Your Own Procedures......Page p0074.djvu
5 Words and Sentences......Page p0090.djvu
6 True and False......Page p0104.djvu
7 Variables......Page p0122.djvu
Part III Functions as Data......Page p0133.djvu
8 Higher-Order Functions......Page p0136.djvu
9 Lambda......Page p0160.djvu
Project: Scoring Bridge Hands......Page p0174.djvu
10 Example: Tic-Tac-Toe......Page p0180.djvu
Part IV Recursion......Page p0203.djvu
11 Introduction to Recursion......Page p0206.djvu
12 The Leap of Faith......Page p0222.djvu
13 How Recursion Works......Page p0240.djvu
14 Common Patterns in Recursive Procedures......Page p0250.djvu
Project: Spelling Names of Huge Numbers......Page p0266.djvu
15 Advanced Recursion......Page p0268.djvu
Project: Scoring Poker Hands......Page p0278.djvu
16 Example: Pattern Matcher......Page p0282.djvu
Part V Abstraction......Page p0311.djvu
17 Lists......Page p0314.djvu
18 Trees......Page p0338.djvu
19 Implementing Higher-Order Functions......Page p0360.djvu
Part VI Sequential Programming......Page p0373.djvu
20 Input and Output......Page p0376.djvu
21 Example: The Functions Program......Page p0400.djvu
22 Files......Page p0420.djvu
23 Vectors......Page p0438.djvu
24 Example: A Spreadsheet Program......Page p0458.djvu
25 Implementing the Spreadsheet Program......Page p0472.djvu
Project: A Database Program......Page p0510.djvu
Part VII Conclusion: Computer Science......Page p0531.djvu
26 What’s Next?......Page p0534.djvu
Appendices......Page p0539.djvu
A Running Scheme......Page p0540.djvu
B Common Lisp......Page p0548.djvu
C Scheme Initialization File......Page p0558.djvu
D GNU General Public License......Page p0580.djvu
Credits......Page p0584.djvu
Alphabetical Table of Scheme Primitives......Page p0586.djvu
Glossary......Page p0590.djvu
Index of Defined Procedures......Page p0600.djvu
General Index......Page p0606.djvu