MIT/GNU Scheme

This manual documents MIT/GNU Scheme 12.1.

Copyright © 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 Massachusetts Institute of Technology

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts and no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License.”

Acknowledgements
1 Overview
- 1.1 Notational Conventions
- 1.2 Scheme Concepts
- 1.3 Lexical Conventions
- 1.4 Expressions
2 Special Forms
- 2.1 Lambda Expressions
- 2.2 Lexical Binding
- 2.3 Dynamic Binding
  - 2.3.1 Fluid-Let
- 2.4 Definitions
  - 2.4.1 Top-Level Definitions
  - 2.4.2 Internal Definitions
- 2.5 Assignments
- 2.6 Quoting
- 2.7 Conditionals
- 2.8 Sequencing
- 2.9 Iteration
- 2.10 Structure Definitions
- 2.11 Macros
- 2.12 SRFI syntax
3 Equivalence Predicates
4 Numbers
- 4.1 Numerical types
- 4.2 Exactness
- 4.3 Implementation restrictions
- 4.4 Syntax of numerical constants
- 4.5 Numerical operations
- 4.6 Numerical input and output
- 4.7 Bit operations
- 4.8 Fixnum and Flonum Operations
- 4.9 Random Number Generation
5 Characters
- 5.1 Character implementation
- 5.2 Unicode
- 5.3 Character Sets
6 Strings
- 6.1 Searching and Matching Strings
- 6.2 Regular Expressions
  - 6.2.1 Regular S-Expressions
  - 6.2.2 Regsexp Procedures
7 Lists
- 7.1 Pairs
- 7.2 Construction of Lists
- 7.3 Selecting List Components
- 7.4 Cutting and Pasting Lists
- 7.5 Filtering Lists
- 7.6 Searching Lists
- 7.7 Mapping of Lists
- 7.8 Folding of Lists
- 7.9 Miscellaneous List Operations
8 Vectors
- 8.1 Construction of Vectors
- 8.2 Selecting Vector Components
- 8.3 Cutting Vectors
- 8.4 Modifying Vectors
9 Bit Strings
- 9.1 Construction of Bit Strings
- 9.2 Selecting Bit String Components
- 9.3 Cutting and Pasting Bit Strings
- 9.4 Bitwise Operations on Bit Strings
- 9.5 Modification of Bit Strings
- 9.6 Integer Conversions of Bit Strings
10 Miscellaneous Datatypes
- 10.1 Booleans
- 10.2 Symbols
- 10.3 Parameters
  - 10.3.1 Cells
- 10.4 Records
- 10.5 Promises
- 10.6 Streams
- 10.7 Weak References
11 Associations
- 11.1 Association Lists
- 11.2 1D Tables
- 11.3 The Association Table
- 11.4 Hash Tables
- 11.5 Object Hashing
- 11.6 Red-Black Trees
- 11.7 Weight-Balanced Trees
- 11.8 Associative Maps
12 Procedures
- 12.1 Procedure Operations
- 12.2 Arity
- 12.3 Primitive Procedures
- 12.4 Continuations
- 12.5 Application Hooks
13 Environments
- 13.1 Environment Operations
- 13.2 Environment Variables
- 13.3 REPL Environment
- 13.4 Top-level Environments
14 Input/Output
- 14.1 Ports
- 14.2 File Ports
- 14.3 String Ports
- 14.4 Bytevector Ports
- 14.5 Input Procedures
  - 14.5.1 Reader Controls
- 14.6 Output Procedures
- 14.7 Blocking Mode
- 14.8 Terminal Mode
- 14.9 Format
- 14.10 Custom Output
- 14.11 Prompting
- 14.12 Textual Port Primitives
- 14.13 Parser Buffers
- 14.14 Parser Language
- 14.15 XML Support
15 Operating-System Interface
- 15.1 Pathnames
- 15.2 Working Directory
- 15.3 File Manipulation
- 15.4 Directory Reader
- 15.5 Date and Time
- 15.6 Machine Time
- 15.7 Subprocesses
- 15.8 TCP Sockets
- 15.9 Miscellaneous OS Facilities
16 Error System
- 16.1 Condition Signalling
- 16.2 Error Messages
- 16.3 Condition Handling
- 16.4 Restarts
- 16.5 Condition Instances
- 16.6 Condition Types
- 16.7 Condition-Type Taxonomy
17 Graphics
- 17.1 Opening and Closing of Graphics Devices
- 17.2 Coordinates for Graphics
- 17.3 Drawing Graphics
- 17.4 Characteristics of Graphics Output
- 17.5 Buffering of Graphics Output
- 17.6 Clipping of Graphics Output
- 17.7 Custom Graphics Operations
- 17.8 Images
- 17.9 X Graphics
18 Standards Support
- 18.1 Revised⁷ Report on the Algorithmic Language Scheme
- 18.2 SRFI 1: List Library
- 18.3 SRFI 2: and-let*
- 18.4 SRFI 8: receive
- 18.5 SRFI 9: Record Types
- 18.6 SRFI 14: Character-set Library
- 18.7 SRFI 23: Error Reporting Mechanism
- 18.8 SRFI 27: Sources of Random Bits
- 18.9 SRFI 39: Parameter Objects
- 18.10 SRFI 69: Basic Hash Tables
- 18.11 SRFI 112: Environment Inquiry
- 18.12 SRFI 115: Scheme Regular Expressions
- 18.13 SRFI 124: Ephemerons
- 18.14 SRFI 125: Intermediate Hash Tables
- 18.15 SRFI 128: Comparators (reduced)
- 18.16 SRFI 129: Titlecase procedures
- 18.17 SRFI 131: ERRR5RS Record Syntax (reduced)
- 18.18 SRFI 133: Vector Library (R7RS-compatible)
- 18.19 SRFI 140: Immutable Strings
- 18.20 SRFI 143: Fixnums
- 18.21 SRFI 158: Generators and Accumulators
- 18.22 SRFI 162: Comparators sublibrary
- 18.23 SRFI 219: Define higher-order lambda
Appendix A GNU Free Documentation License
- A.1 ADDENDUM: How to use this License for your documents
Appendix B Binding Index
Appendix C Concept Index

MIT/GNU Scheme 12.1

MIT/GNU Scheme

Table of Contents