Scheme

Revised(3) Report on the Algorithmic Language Scheme

• Summary
• Introduction
• Background
• Acknowledgements
• 1. Overview of Scheme
• 1.1 Semantics
• 1.2 Syntax
• 1.3 Notation and terminology
• 1.3.1 Essential and non-essential features
• 1.3.2 Error situations and unspecified behavior
• 1.3.3 Entry format
• 1.3.4 Evaluation examples
• 2. Lexical conventions
• 2.1 Identifiers
• 2.2 Whitespace and comments
• 2.3 Other notations
• 3. Basic concepts
• 3.1 Variables and regions
• 3.2 True and false
• 3.3 External representations
• 4. Expressions
• 4.1 Primitive expression types
• 4.1.1 Variable references
• 4.1.2 Literal expressions
• 4.1.3 Procedure calls
• 4.1.4 lambda expressions
• 4.1.5 Conditionals
• 4.1.6 Assignments
• 4.2 Derived expression types
• 4.2.1 Conditionals
• 4.2.2 Binding constructs
• 4.2.3 Sequencing
• 4.2.4 Iteration
• 4.2.5 Delayed evaluation
• 4.2.6 Quasiquotation
• 5. Program structure
• 5.1 Programs
• 5.2 Definitions
• 5.2.1 Top level definitions
• 5.2.2 Internal definitions
• 6. Standard procedures
• 6.1 Booleans
• 6.2 Equivalence predicates
• 6.3 Pairs and lists
• 6.4 Symbols
• 6.5 Numbers
• 6.5.1 Numbers
• 6.5.2 Exactness
• 6.5.3 Number syntax
• 6.5.4 Numerical operations
• 6.5.5 Numerical input and output
• 6.5.6 Formats
• 6.5.7 Details of formats
• 6.6 Characters
• 6.7 Strings
• 6.8 Vectors
• 6.9 Control features
• 6.10 Input and output
• 6.10.1 Ports
• 6.10.2 Input
• 6.10.3 Output
• 6.10.4 User interface
• 7. Formal syntax and semantics
• 7.1 Formal syntax
• 7.1.1 Lexical structure
• 7.1.2 External representations
• 7.1.3 Expressions
• 7.1.4 Quasiquotations
• 7.1.5 Programs and definitions
• 7.2 Formal semantics
• 7.3 Derived expression types
• Notes
• Language changes
• Keywords as variable names
• Macros
• Example
• Bibliography
• Alphabetic index of definitions of concepts, keywords, and procedures

This document was generated on December, 22 2007 using texi2html 1.57.