IEEE Std 1178-1990 IEEE Standard for the Scheme Programming Language -Description

Abstract: The form and meaning of programs written in the Scheme programming language in particular, their syntax, the semantic rules for interpreting them, and the representation of data to be input or output by them, are specified. The fundamental ideas of the language and the notational conventions used for describing and writing programs in the language are presented. The syntax and semantics of expressions, programs, and definitions are specified. Scheme's built-in procedures, which include all of the language's data manipulation and input/output primitives, are described, and a formal syntax for Scheme written in extended Backus-Naur form is provided. A formal denotational semantics for Schemes and some issues in the implementation of Scheme's arithmetic are covered in the appendixes.

Keywords: Lisp, Scheme, Scheme programming language

Content

• Introduction
• Objectives
• Scope
• Future Directions
• Compliance
• Organization of the Document
• Definitions of Terms
• Examples
• Base Document
• References
• Description of the Language
• 1. Overview of Scheme
• • 1.1 Semantics
  • 1.2 Syntax
  • 1.3 Notation and Terminology
  • • 1.3.1 Error Situations and Unspecified Behavior
    • 1.3.2 Entry Format
    • 1.3.3 Evaluation Examples
    • 1.3.4 Naming Conventions
• 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
  • 3.4 Disjointness of Types
  • 3.5 Storage Model
• 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 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 Numerical Types
    • 6.5.2 Exactness
    • 6.5.3 Implementation Restrictions
    • 6.5.4 Syntax of numerical constants
    • 6.5.5 Numerical Operations
    • 6.5.6 Numerical Input and Output
  • 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
• 7. Formal Syntax
• • 7.1 Lexical Structure
  • 7.2 External Representations
  • 7.3 Expressions
  • 7.4 Quasiquotations
  • 7.5 Programs and Definitions
  • 7.6 Derived Expression Types
• Bibliography
• Annex A Formal Semantics
• • A.1 Abstract syntax
  • A.2 Domain Equations
  • A.3 Semantic Functions
  • A.4 Auxiliary Functions
• Annex B Number System Subsets
• • B.1 Minimal Subset
  • B.2 Exact Arithmetic
  • B.3 Inexact Arithmetic
• Annex C Implementation of Numeric Datatypes
• • C.1 Exactness
  • C.2 Transitivity of Order Predicates
  • C.3 External Representations
  • C.4 Rationalize

links: [Standard Status] - [Purchase] - [PDF^*] - [Bus Architecture Collection - Description]

available for Standards Online Bus Architecture Collection subscribers only