Description |
xxxii, 583 pages : illustrations ; 24 cm |
Contents |
I. Introduction: Functions. 1. Showing Off Scheme. 2. Functions -- II. Composition of Functions. 3. Expressions. 4. Defining Your Own Procedures. 5. Words and Sentences. 6. True and False -- III. Functions as Data. 7. Higher-Order Functions. 8. Lambda -- Project: Scoring Bridge Hands. 9. Example: Tic-Tac-Toe. 10. Variables -- IV. Recursion. 11. Introduction to Recursion. 12. The Leap of Faith. 13. How Recursion Works. 14. Common Patterns in Recursive Procedures -- Project: Spelling Names of Huge Numbers. 15. Advanced Recursion -- Project: Scoring Poker Hands. 16. Example: Pattern Matcher -- V. Abstraction. 17. Lists. 18. Trees. 19. Implementing Higher-Order Functions -- VI. Sequential Programming. 20. Input and Output. 21. Example: The Functions Program. 22. Files. 23. Vectors. 24. Example: A Spreadsheet Program. 25. Implementing the Spreadsheet Program -- Project: A Database Program -- VII. Conclusion: Computer Science. 26. What's Next? -- App. A Running Scheme |
|
App. B Common Lisp -- App. C Scheme Initialization File -- App. D GNU General Public License |
Analysis |
Computers |
Notes |
Includes indexes |
Bibliography |
Includes indexes |
Subject |
Computer science.
|
|
Programming languages (Electronic computers)
|
|
Scheme (Computer program language)
|
Author |
Wright, Matthew, 1979-
|
LC no. |
93034469 |
ISBN |
0262082268 |
|