Scheme

Revised(4) Report on the Algorithmic Language Scheme

• Summary
• Introduction
  • Background
  • Acknowledgements
• Overview of Scheme
  • Semantics
  • Syntax
  • Notation and terminology
    • Essential and non-essential features
    • Error situations and unspecified behavior
    • Entry format
    • Evaluation examples
    • Naming conventions
• Lexical conventions
  • Identifiers
  • Whitespace and comments
  • Other notations
• Basic concepts
  • Variables and regions
  • True and false
  • External representations
  • Disjointness of types
  • Storage model
• Expressions
  • Primitive expression types
    • Variable references
    • Literal expressions
    • Procedure calls
    • lambda expressions
    • Conditionals
    • Assignments
  • Derived expression types
    • Conditionals
    • Binding constructs
    • Sequencing
    • Iteration
    • Delayed evaluation
    • Quasiquotation
• Program structure
  • Programs
  • Definitions
    • Top level definitions
    • Internal definitions
• Standard procedures
  • Booleans
  • Equivalence predicates
  • Pairs and lists
  • Symbols
  • Numbers
    • Numerical types
    • Exactness
    • Implementation restrictions
    • Syntax of numerical constants
    • Numerical operations
    • Numerical input and output
  • Characters
  • Strings
  • Vectors
  • Control features
  • Input and output
    • Ports
    • Input
    • Output
    • System interface
• Formal syntax and semantics
  • Formal syntax
    • Lexical structure
    • External representations
    • Expressions
    • Quasiquotations
    • Programs and definitions
  • Formal semantics
  • Derived expression types
• Notes
  • Language changes
• Example
• Appendix: Macros
  • Binding syntactic keywords
  • Pattern language
  • A compatible low-level macro facility
  • Acknowledgements
• Bibliography
• Alphabetic index of definitions of concepts, keywords, and procedures
  • Concepts
  • Procedures

This document was generated on 21 April 1998 using the texi2html translator version 1.52.