Computers & Technology
Home Computing
Business & Culture
Programming
Software
Web Development
Certification
Networking
Security & Encryption
Computer Science
Operating Systems
Microsoft
Hardware
Databases
Graphic Design
Apple
Digital Music
Digital Photography & Video
Games & Strategy Guides
Project Management
Mobile & Wireless Computing
Education & Reference
Encyclopedias
Test Preparation
Studying & Workbooks
Schools & Teaching
Writing, Research & Publishing Guides
Foreign Language Study & Reference
Atlases & Maps
Dictionaries & Thesauruses
Words, Language & Grammar
College & University
Trivia & Fun Facts
Consumer Guides
Business & Investing
Industries & Professions
Management & Leadership
Organizational Behavior
Personal Finance
Small Business & Entrepreneurship
Popular Economics
Marketing & Sales
Finance
Skills
Business Life
Economics
Job Hunting & Careers
Biography & History
Reference
International
Real Estate
Investing
Women & Business
Science & Math
Mathematics
Technology
Reference
Earth Sciences
Physics
Biological Sciences
Behavioral Sciences
Nature & Ecology
Astronomy & Space Science
History & Philosophy
Experiments, Instruments & Measurement
Agricultural Sciences
Table of content
The Scheme Programming Language
Authors:
Dybvig R. K.
Published year: 2003
Pages: 1/98
Buy this book on amazon.com >>
1
2
Table of Contents
Table of Contents
BackCover
The Scheme Programming Language, Third Edition
Preface
Chapter 1: Introduction
1.1. Scheme Syntax
1.2. Scheme Naming Conventions
1.3. Typographical and Notational Conventions
Chapter 2: Getting Started
2.1. Interacting with Scheme
2.2. Simple Expressions
2.3. Evaluating Scheme Expressions
2.4. Variables and Let Expressions
2.5. Lambda Expressions
2.6. Top-Level Definitions
2.7. Conditional Expressions
2.8. Simple Recursion
2.9. Assignment
Chapter 3: Going Further
3.2. More Recursion
3.3. Continuations
3.4. Continuation Passing Style
3.5. Internal Definitions
Chapter 4: Procedures and Variable Bindings
4.1. Variable References
4.2. Lambda
4.3. Local Binding
4.4. Variable Definitions
4.5. Assignment
Chapter 5: Control Operations
5.2. Sequencing
5.3. Conditionals
5.4. Recursion, Iteration, and Mapping
5.5. Continuations
5.6. Delayed Evaluation
5.7. Multiple Values
5.8. Eval
Chapter 6: Operations on Objects
6.2. Generic Equivalence and Type Predicates
6.3. Lists and Pairs
6.4. Numbers
6.5. Characters
6.6. Strings
6.7. Vectors
6.8. Symbols
Chapter 7: Input and Output
7.1. Input Operations
7.2. Output Operations
7.3. Loading Programs
7.4. Transcript Files
Chapter 8: Syntactic Extension
8.1. Keyword Bindings
8.2. Syntax-Rules Transformers
8.3. Syntax-Case Transformers
8.4. Examples
Chapter 9: Extended Examples
9.1. Matrix and Vector Multiplication
9.2. Sorting
9.3. A Set Constructor
9.4. Word Frequency Counting
9.5. Scheme Printer
9.6. Formatted Output
9.7. A Meta-Circular Interpreter for Scheme
9.8. Defining Abstract Objects
9.9. Fast Fourier Transform
9.10. A Unification Algorithm
9.11. Multitasking with Engines
Bibliography
Answers to Selected Exercises
Formal Syntax of Scheme
Summary of Forms
Index
Index_A
Index_B
Index_C
Index_D
Index_E
Index_F
Index_G
1
2
The Scheme Programming Language
Authors:
Dybvig R. K.
Published year: 2003
Pages: 1/98
Buy this book on amazon.com >>
Book categories
Computers & Technology
Programming
Languages & Tools
Education & Reference