Guile Reference Manual

Table of Contents

• The Guile Reference Manual
• Preface
  • Contributors to this Manual
  • The Guile License
• 1 Introduction
  • 1.1 Guile and Scheme
  • 1.2 Combining with C Code
  • 1.3 Guile and the GNU Project
  • 1.4 Interactive Programming
  • 1.5 Supporting Multiple Languages
  • 1.6 Obtaining and Installing Guile
  • 1.7 Organisation of this Manual
  • 1.8 Typographical Conventions
• 2 Hello Guile!
  • 2.1 Running Guile Interactively
  • 2.2 Running Guile Scripts
  • 2.3 Linking Guile into Programs
  • 2.4 Writing Guile Extensions
  • 2.5 Using the Guile Module System
    • 2.5.1 Using Modules
    • 2.5.2 Writing new Modules
    • 2.5.3 Putting Extensions into Modules
  • 2.6 Reporting Bugs
• 3 Hello Scheme!
  • 3.1 Data Types, Values and Variables
    • 3.1.1 Latent Typing
    • 3.1.2 Values and Variables
    • 3.1.3 Defining and Setting Variables
  • 3.2 The Representation and Use of Procedures
    • 3.2.1 Procedures as Values
    • 3.2.2 Simple Procedure Invocation
    • 3.2.3 Creating and Using a New Procedure
    • 3.2.4 Lambda Alternatives
  • 3.3 Expressions and Evaluation
    • 3.3.1 Evaluating Expressions and Executing Programs
      • 3.3.1.1 Evaluating Literal Data
      • 3.3.1.2 Evaluating a Variable Reference
      • 3.3.1.3 Evaluating a Procedure Invocation Expression
      • 3.3.1.4 Evaluating Special Syntactic Expressions
    • 3.3.2 Tail calls
    • 3.3.3 Using the Guile REPL
    • 3.3.4 Summary of Common Syntax
  • 3.4 The Concept of Closure
    • 3.4.1 Names, Locations, Values and Environments
    • 3.4.2 Local Variables and Environments
    • 3.4.3 Environment Chaining
    • 3.4.4 Lexical Scope
      • 3.4.4.1 An Example of Non-Lexical Scoping
    • 3.4.5 Closure
    • 3.4.6 Example 1: A Serial Number Generator
    • 3.4.7 Example 2: A Shared Persistent Variable
    • 3.4.8 Example 3: The Callback Closure Problem
    • 3.4.9 Example 4: Object Orientation
  • 3.5 Further Reading
• 4 Programming in Scheme
  • 4.1 Guile's Implementation of Scheme
  • 4.2 Guile Scripting
    • 4.2.1 The Top of a Script File
    • 4.2.2 Invoking Guile
    • 4.2.3 The Meta Switch
    • 4.2.4 Command Line Handling
    • 4.2.5 Scripting Examples
  • 4.3 Using Guile Interactively
    • 4.3.1 Readline
    • 4.3.2 Value History
    • 4.3.3 REPL Commands
      • 4.3.3.1 Help Commands
      • 4.3.3.2 Module Commands
      • 4.3.3.3 Language Commands
      • 4.3.3.4 Compile Commands
      • 4.3.3.5 Profile Commands
      • 4.3.3.6 Debug Commands
      • 4.3.3.7 Inspect Commands
      • 4.3.3.8 System Commands
    • 4.3.4 Error Handling
    • 4.3.5 Interactive Debugging
  • 4.4 Using Guile in Emacs
• 5 Programming in C
  • 5.1 Linking Programs With Guile
    • 5.1.1 Guile Initialization Functions
    • 5.1.2 A Sample Guile Main Program
  • 5.2 Linking Guile with Libraries
    • 5.2.1 A Sample Guile Extension
  • 5.3 General concepts for using libguile
    • 5.3.1 Dynamic Types
    • 5.3.2 Garbage Collection
    • 5.3.3 Control Flow
    • 5.3.4 Asynchronous Signals
    • 5.3.5 Multi-Threading
  • 5.4 Defining New Types (Smobs)
    • 5.4.1 Describing a New Type
    • 5.4.2 Creating Smob Instances
    • 5.4.3 Type checking
    • 5.4.4 Garbage Collecting Smobs
    • 5.4.5 Garbage Collecting Simple Smobs
    • 5.4.6 Remembering During Operations
    • 5.4.7 Double Smobs
    • 5.4.8 The Complete Example
  • 5.5 Function Snarfing
  • 5.6 An Overview of Guile Programming
    • 5.6.1 How One Might Extend Dia Using Guile
      • 5.6.1.1 Deciding Why You Want to Add Guile
      • 5.6.1.2 Four Steps Required to Add Guile
      • 5.6.1.3 How to Represent Dia Data in Scheme
      • 5.6.1.4 Writing Guile Primitives for Dia
      • 5.6.1.5 Providing a Hook for the Evaluation of Scheme Code
      • 5.6.1.6 Top-level Structure of Guile-enabled Dia
      • 5.6.1.7 Going Further with Dia and Guile
    • 5.6.2 Why Scheme is More Hackable Than C
    • 5.6.3 Example: Using Guile for an Application Testbed
    • 5.6.4 A Choice of Programming Options
      • 5.6.4.1 What Functionality is Already Available?
      • 5.6.4.2 Functional and Performance Constraints
      • 5.6.4.3 Your Preferred Programming Style
      • 5.6.4.4 What Controls Program Execution?
    • 5.6.5 How About Application Users?
• 6 API Reference
  • 6.1 Overview of the Guile API
  • 6.2 Deprecation
  • 6.3 The SCM Type
  • 6.4 Initializing Guile
  • 6.5 Snarfing Macros
  • 6.6 Simple Generic Data Types
    • 6.6.1 Booleans
    • 6.6.2 Numerical data types
      • 6.6.2.1 Scheme's Numerical “Tower”
      • 6.6.2.2 Integers
      • 6.6.2.3 Real and Rational Numbers
      • 6.6.2.4 Complex Numbers
      • 6.6.2.5 Exact and Inexact Numbers
      • 6.6.2.6 Read Syntax for Numerical Data
      • 6.6.2.7 Operations on Integer Values
      • 6.6.2.8 Comparison Predicates
      • 6.6.2.9 Converting Numbers To and From Strings
      • 6.6.2.10 Complex Number Operations
      • 6.6.2.11 Arithmetic Functions
      • 6.6.2.12 Scientific Functions
      • 6.6.2.13 Bitwise Operations
      • 6.6.2.14 Random Number Generation
    • 6.6.3 Characters
    • 6.6.4 Character Sets
      • 6.6.4.1 Character Set Predicates/Comparison
      • 6.6.4.2 Iterating Over Character Sets
      • 6.6.4.3 Creating Character Sets
      • 6.6.4.4 Querying Character Sets
      • 6.6.4.5 Character-Set Algebra
      • 6.6.4.6 Standard Character Sets
    • 6.6.5 Strings
      • 6.6.5.1 String Read Syntax
      • 6.6.5.2 String Predicates
      • 6.6.5.3 String Constructors
      • 6.6.5.4 List/String conversion
      • 6.6.5.5 String Selection
      • 6.6.5.6 String Modification
      • 6.6.5.7 String Comparison
      • 6.6.5.8 String Searching
      • 6.6.5.9 Alphabetic Case Mapping
      • 6.6.5.10 Reversing and Appending Strings
      • 6.6.5.11 Mapping, Folding, and Unfolding
      • 6.6.5.12 Miscellaneous String Operations
      • 6.6.5.13 Conversion to/from C
      • 6.6.5.14 String Internals
    • 6.6.6 Bytevectors
      • 6.6.6.1 Endianness
      • 6.6.6.2 Manipulating Bytevectors
      • 6.6.6.3 Interpreting Bytevector Contents as Integers
      • 6.6.6.4 Converting Bytevectors to/from Integer Lists
      • 6.6.6.5 Interpreting Bytevector Contents as Floating Point Numbers
      • 6.6.6.6 Interpreting Bytevector Contents as Unicode Strings
      • 6.6.6.7 Accessing Bytevectors with the Generalized Vector API
      • 6.6.6.8 Accessing Bytevectors with the SRFI-4 API
    • 6.6.7 Symbols
      • 6.6.7.1 Symbols as Discrete Data
      • 6.6.7.2 Symbols as Lookup Keys
      • 6.6.7.3 Symbols as Denoting Variables
      • 6.6.7.4 Operations Related to Symbols
      • 6.6.7.5 Function Slots and Property Lists
      • 6.6.7.6 Extended Read Syntax for Symbols
      • 6.6.7.7 Uninterned Symbols
    • 6.6.8 Keywords
      • 6.6.8.1 Why Use Keywords?
      • 6.6.8.2 Coding With Keywords
      • 6.6.8.3 Keyword Read Syntax
      • 6.6.8.4 Keyword Procedures
    • 6.6.9 “Functionality-Centric” Data Types
  • 6.7 Compound Data Types
    • 6.7.1 Pairs
    • 6.7.2 Lists
      • 6.7.2.1 List Read Syntax
      • 6.7.2.2 List Predicates
      • 6.7.2.3 List Constructors
      • 6.7.2.4 List Selection
      • 6.7.2.5 Append and Reverse
      • 6.7.2.6 List Modification
      • 6.7.2.7 List Searching
      • 6.7.2.8 List Mapping
    • 6.7.3 Vectors
      • 6.7.3.1 Read Syntax for Vectors
      • 6.7.3.2 Dynamic Vector Creation and Validation
      • 6.7.3.3 Accessing and Modifying Vector Contents
      • 6.7.3.4 Vector Accessing from C
      • 6.7.3.5 Uniform Numeric Vectors
    • 6.7.4 Bit Vectors
    • 6.7.5 Generalized Vectors
    • 6.7.6 Arrays
      • 6.7.6.1 Array Syntax
      • 6.7.6.2 Array Procedures
      • 6.7.6.3 Shared Arrays
      • 6.7.6.4 Accessing Arrays from C
    • 6.7.7 VLists
    • 6.7.8 Records
    • 6.7.9 Structures
      • 6.7.9.1 Vtables
      • 6.7.9.2 Structure Basics
      • 6.7.9.3 Vtable Contents
      • 6.7.9.4 Vtable Vtables
    • 6.7.10 Dictionary Types
    • 6.7.11 Association Lists
      • 6.7.11.1 Alist Key Equality
      • 6.7.11.2 Adding or Setting Alist Entries
      • 6.7.11.3 Retrieving Alist Entries
      • 6.7.11.4 Removing Alist Entries
      • 6.7.11.5 Sloppy Alist Functions
      • 6.7.11.6 Alist Example
    • 6.7.12 VList-Based Hash Lists or “VHashes”
    • 6.7.13 Hash Tables
      • 6.7.13.1 Hash Table Examples
      • 6.7.13.2 Hash Table Reference
  • 6.8 Smobs
  • 6.9 Procedures
    • 6.9.1 Lambda: Basic Procedure Creation
    • 6.9.2 Primitive Procedures
    • 6.9.3 Compiled Procedures
    • 6.9.4 Optional Arguments
      • 6.9.4.1 lambda* and define*.
      • 6.9.4.2 (ice-9 optargs)
    • 6.9.5 Case-lambda
    • 6.9.6 Higher-Order Functions
    • 6.9.7 Procedure Properties and Meta-information
    • 6.9.8 Procedures with Setters
  • 6.10 Macros
    • 6.10.1 Defining Macros
    • 6.10.2 Syntax-rules Macros
      • 6.10.2.1 Patterns
      • 6.10.2.2 Hygiene
      • 6.10.2.3 Further Information
    • 6.10.3 Support for the syntax-case System
      • 6.10.3.1 Why syntax-case?
    • 6.10.4 Lisp-style Macro Definitions
    • 6.10.5 Identifier Macros
    • 6.10.6 Eval-when
    • 6.10.7 Internal Macros
  • 6.11 General Utility Functions
    • 6.11.1 Equality
    • 6.11.2 Object Properties
      • 6.11.2.1 Low Level Property Implementation.
      • 6.11.2.2 An Older Approach to Properties
    • 6.11.3 Sorting
    • 6.11.4 Copying Deep Structures
    • 6.11.5 General String Conversion
    • 6.11.6 Hooks
      • 6.11.6.1 Hook Usage by Example
      • 6.11.6.2 Hook Reference
      • 6.11.6.3 Handling Scheme-level hooks from C code
      • 6.11.6.4 Hooks For C Code.
      • 6.11.6.5 Hooks for Garbage Collection
      • 6.11.6.6 Hooks into the Guile REPL
  • 6.12 Definitions and Variable Bindings
    • 6.12.1 Top Level Variable Definitions
    • 6.12.2 Local Variable Bindings
    • 6.12.3 Internal definitions
    • 6.12.4 Querying variable bindings
  • 6.13 Controlling the Flow of Program Execution
    • 6.13.1 Evaluating a Sequence of Expressions
    • 6.13.2 Simple Conditional Evaluation
    • 6.13.3 Conditional Evaluation of a Sequence of Expressions
    • 6.13.4 Iteration mechanisms
    • 6.13.5 Prompts
    • 6.13.6 Continuations
    • 6.13.7 Returning and Accepting Multiple Values
    • 6.13.8 Exceptions
      • 6.13.8.1 Exception Terminology
      • 6.13.8.2 Catching Exceptions
      • 6.13.8.3 Throw Handlers
      • 6.13.8.4 Throwing Exceptions
      • 6.13.8.5 How Guile Implements Exceptions
    • 6.13.9 Procedures for Signaling Errors
    • 6.13.10 Dynamic Wind
    • 6.13.11 How to Handle Errors
      • 6.13.11.1 C Support
      • 6.13.11.2 Signalling Type Errors
    • 6.13.12 Continuation Barriers
  • 6.14 Input and Output
    • 6.14.1 Ports
    • 6.14.2 Reading
    • 6.14.3 Writing
    • 6.14.4 Closing
    • 6.14.5 Random Access
    • 6.14.6 Line Oriented and Delimited Text
    • 6.14.7 Block reading and writing
    • 6.14.8 Default Ports for Input, Output and Errors
    • 6.14.9 Types of Port
      • 6.14.9.1 File Ports
      • 6.14.9.2 String Ports
      • 6.14.9.3 Soft Ports
      • 6.14.9.4 Void Ports
    • 6.14.10 R6RS I/O Ports
      • 6.14.10.1 The End-of-File Object
      • 6.14.10.2 Port Manipulation
      • 6.14.10.3 Binary Input
      • 6.14.10.4 Binary Output
    • 6.14.11 Using and Extending Ports in C
      • 6.14.11.1 C Port Interface
      • 6.14.11.2 Port Implementation
  • 6.15 Regular Expressions
    • 6.15.1 Regexp Functions
    • 6.15.2 Match Structures
    • 6.15.3 Backslash Escapes
  • 6.16 LALR(1) Parsing
  • 6.17 Reading and Evaluating Scheme Code
    • 6.17.1 Scheme Syntax: Standard and Guile Extensions
      • 6.17.1.1 Expression Syntax
      • 6.17.1.2 Comments
      • 6.17.1.3 Block Comments
      • 6.17.1.4 Case Sensitivity
      • 6.17.1.5 Keyword Syntax
      • 6.17.1.6 Reader Extensions
    • 6.17.2 Reading Scheme Code
    • 6.17.3 Writing Scheme Values
    • 6.17.4 Procedures for On the Fly Evaluation
    • 6.17.5 Compiling Scheme Code
    • 6.17.6 Loading Scheme Code from File
    • 6.17.7 Character Encoding of Source Files
    • 6.17.8 Delayed Evaluation
  • 6.18 Memory Management and Garbage Collection
    • 6.18.1 Function related to Garbage Collection
    • 6.18.2 Memory Blocks
      • 6.18.2.1 Upgrading from scm_must_malloc et al.
    • 6.18.3 Weak References
      • 6.18.3.1 Weak hash tables
      • 6.18.3.2 Weak vectors
    • 6.18.4 Guardians
  • 6.19 Modules
    • 6.19.1 General Information about Modules
    • 6.19.2 Using Guile Modules
    • 6.19.3 Creating Guile Modules
    • 6.19.4 Module System Reflection
    • 6.19.5 Included Guile Modules
    • 6.19.6 R6RS Version References
    • 6.19.7 R6RS Libraries
    • 6.19.8 Accessing Modules from C
    • 6.19.9 Variables
    • 6.19.10 provide and require
    • 6.19.11 Environments
  • 6.20 Foreign Function Interface
    • 6.20.1 Foreign Libraries
    • 6.20.2 Foreign Functions
    • 6.20.3 C Extensions
    • 6.20.4 Modules and Extensions
    • 6.20.5 Foreign Pointers
      • 6.20.5.1 Foreign Types
      • 6.20.5.2 Foreign Variables
      • 6.20.5.3 Void Pointers and Byte Access
      • 6.20.5.4 Foreign Structs
    • 6.20.6 Dynamic FFI
  • 6.21 Threads, Mutexes, Asyncs and Dynamic Roots
    • 6.21.1 Arbiters
    • 6.21.2 Asyncs
      • 6.21.2.1 System asyncs
      • 6.21.2.2 User asyncs
    • 6.21.3 Threads
    • 6.21.4 Mutexes and Condition Variables
    • 6.21.5 Blocking in Guile Mode
    • 6.21.6 Critical Sections
    • 6.21.7 Fluids and Dynamic States
    • 6.21.8 Futures
    • 6.21.9 Parallel forms
  • 6.22 Configuration, Features and Runtime Options
    • 6.22.1 Configuration, Build and Installation
    • 6.22.2 Feature Tracking
      • 6.22.2.1 Feature Manipulation
      • 6.22.2.2 Common Feature Symbols
    • 6.22.3 Runtime Options
      • 6.22.3.1 Examples of option use
  • 6.23 Support for Other Languages
    • 6.23.1 Using Other Languages
    • 6.23.2 Emacs Lisp
      • 6.23.2.1 Nil
      • 6.23.2.2 Equality
      • 6.23.2.3 Dynamic Binding
      • 6.23.2.4 Other Elisp Features
    • 6.23.3 ECMAScript
  • 6.24 Support for Internationalization
    • 6.24.1 Internationalization with Guile
    • 6.24.2 Text Collation
    • 6.24.3 Character Case Mapping
    • 6.24.4 Number Input and Output
    • 6.24.5 Accessing Locale Information
    • 6.24.6 Gettext Support
  • 6.25 Debugging Infrastructure
    • 6.25.1 Evaluation and the Scheme Stack
      • 6.25.1.1 Stack Capture
      • 6.25.1.2 Stacks
      • 6.25.1.3 Frames
    • 6.25.2 Source Properties
    • 6.25.3 Programmatic Error Handling
      • 6.25.3.1 Catching Exceptions
      • 6.25.3.2 Capturing the full error stack
      • 6.25.3.3 Pre-Unwind Debugging
      • 6.25.3.4 Debug options
    • 6.25.4 Traps
      • 6.25.4.1 VM Hooks
      • 6.25.4.2 Trap Interface
      • 6.25.4.3 Low-Level Traps
      • 6.25.4.4 Tracing Traps
      • 6.25.4.5 Trap States
      • 6.25.4.6 High-Level Traps
  • 6.26 Code Coverage Reports
• 7 Guile Modules
  • 7.1 SLIB
    • 7.1.1 SLIB installation
    • 7.1.2 JACAL
  • 7.2 POSIX System Calls and Networking
    • 7.2.1 POSIX Interface Conventions
    • 7.2.2 Ports and File Descriptors
    • 7.2.3 File System
    • 7.2.4 User Information
    • 7.2.5 Time
    • 7.2.6 Runtime Environment
    • 7.2.7 Processes
    • 7.2.8 Signals
    • 7.2.9 Terminals and Ptys
    • 7.2.10 Pipes
    • 7.2.11 Networking
      • 7.2.11.1 Network Address Conversion
      • 7.2.11.2 Network Databases
      • 7.2.11.3 Network Socket Address
      • 7.2.11.4 Network Sockets and Communication
      • 7.2.11.5 Network Socket Examples
    • 7.2.12 System Identification
    • 7.2.13 Locales
    • 7.2.14 Encryption
  • 7.3 HTTP, the Web, and All That
    • 7.3.1 Universal Resource Identifiers
    • 7.3.2 The Hyper-Text Transfer Protocol
    • 7.3.3 HTTP Headers
      • 7.3.3.1 General Headers
      • 7.3.3.2 Entity Headers
      • 7.3.3.3 Request Headers
      • 7.3.3.4 Response Headers
    • 7.3.4 HTTP Requests
    • 7.3.5 HTTP Responses
    • 7.3.6 Web Server
    • 7.3.7 Web Examples
      • 7.3.7.1 Hello, World!
      • 7.3.7.2 Inspecting the Request
      • 7.3.7.3 Higher-Level Interfaces
      • 7.3.7.4 Conclusion
  • 7.4 The (ice-9 getopt-long) Module
    • 7.4.1 A Short getopt-long Example
    • 7.4.2 How to Write an Option Specification
    • 7.4.3 Expected Command Line Format
    • 7.4.4 Reference Documentation for getopt-long
    • 7.4.5 Reference Documentation for option-ref
  • 7.5 SRFI Support Modules
    • 7.5.1 About SRFI Usage
    • 7.5.2 SRFI-0 - cond-expand
    • 7.5.3 SRFI-1 - List library
      • 7.5.3.1 Constructors
      • 7.5.3.2 Predicates
      • 7.5.3.3 Selectors
      • 7.5.3.4 Length, Append, Concatenate, etc.
      • 7.5.3.5 Fold, Unfold & Map
      • 7.5.3.6 Filtering and Partitioning
      • 7.5.3.7 Searching
      • 7.5.3.8 Deleting
      • 7.5.3.9 Association Lists
      • 7.5.3.10 Set Operations on Lists
    • 7.5.4 SRFI-2 - and-let*
    • 7.5.5 SRFI-4 - Homogeneous numeric vector datatypes
      • 7.5.5.1 SRFI-4 - Overview
      • 7.5.5.2 SRFI-4 - API
      • 7.5.5.3 SRFI-4 - Generic operations
      • 7.5.5.4 SRFI-4 - Relation to bytevectors
      • 7.5.5.5 SRFI-4 - Guile extensions
    • 7.5.6 SRFI-6 - Basic String Ports
    • 7.5.7 SRFI-8 - receive
    • 7.5.8 SRFI-9 - define-record-type
      • Custom Printers
    • 7.5.9 SRFI-10 - Hash-Comma Reader Extension
    • 7.5.10 SRFI-11 - let-values
    • 7.5.11 SRFI-13 - String Library
    • 7.5.12 SRFI-14 - Character-set Library
    • 7.5.13 SRFI-16 - case-lambda
    • 7.5.14 SRFI-17 - Generalized set!
    • 7.5.15 SRFI-18 - Multithreading support
      • 7.5.15.1 SRFI-18 Threads
      • 7.5.15.2 SRFI-18 Mutexes
      • 7.5.15.3 SRFI-18 Condition variables
      • 7.5.15.4 SRFI-18 Time
      • 7.5.15.5 SRFI-18 Exceptions
    • 7.5.16 SRFI-19 - Time/Date Library
      • 7.5.16.1 SRFI-19 Introduction
      • 7.5.16.2 SRFI-19 Time
      • 7.5.16.3 SRFI-19 Date
      • 7.5.16.4 SRFI-19 Time/Date conversions
      • 7.5.16.5 SRFI-19 Date to string
      • 7.5.16.6 SRFI-19 String to date
    • 7.5.17 SRFI-26 - specializing parameters
    • 7.5.18 SRFI-27 - Sources of Random Bits
      • 7.5.18.1 The Default Random Source
      • 7.5.18.2 Random Sources
      • 7.5.18.3 Obtaining random number generator procedures
    • 7.5.19 SRFI-30 - Nested Multi-line Comments
    • 7.5.20 SRFI-31 - A special form `rec' for recursive evaluation
    • 7.5.21 SRFI-34 - Exception handling for programs
    • 7.5.22 SRFI-35 - Conditions
    • 7.5.23 SRFI-37 - args-fold
    • 7.5.24 SRFI-38 - External Representation for Data With Shared Structure
    • 7.5.25 SRFI-39 - Parameters
    • 7.5.26 SRFI-42 - Eager Comprehensions
    • 7.5.27 SRFI-45 - Primitives for Expressing Iterative Lazy Algorithms
    • 7.5.28 SRFI-55 - Requiring Features
    • 7.5.29 SRFI-60 - Integers as Bits
    • 7.5.30 SRFI-61 - A more general cond clause
    • 7.5.31 SRFI-67 - Compare procedures
    • 7.5.32 SRFI-69 - Basic hash tables
      • 7.5.32.1 Creating hash tables
      • 7.5.32.2 Accessing table items
      • 7.5.32.3 Table properties
      • 7.5.32.4 Hash table algorithms
    • 7.5.33 SRFI-88 Keyword Objects
    • 7.5.34 SRFI-98 Accessing environment variables.
  • 7.6 R6RS Support
    • 7.6.1 Incompatibilities with the R6RS
    • 7.6.2 R6RS Standard Libraries
      • 7.6.2.1 Library Usage
      • 7.6.2.2 rnrs base
      • 7.6.2.3 rnrs unicode
      • 7.6.2.4 rnrs bytevectors
      • 7.6.2.5 rnrs lists
      • 7.6.2.6 rnrs sorting
      • 7.6.2.7 rnrs control
      • 7.6.2.8 R6RS Records
      • 7.6.2.9 rnrs records syntactic
      • 7.6.2.10 rnrs records procedural
      • 7.6.2.11 rnrs records inspection
      • 7.6.2.12 rnrs exceptions
      • 7.6.2.13 rnrs conditions
      • 7.6.2.14 I/O Conditions
      • 7.6.2.15 rnrs io ports
      • 7.6.2.16 rnrs io simple
      • 7.6.2.17 rnrs files
      • 7.6.2.18 rnrs programs
      • 7.6.2.19 rnrs arithmetic fixnums
      • 7.6.2.20 rnrs arithmetic flonums
      • 7.6.2.21 rnrs arithmetic bitwise
      • 7.6.2.22 rnrs syntax-case
      • 7.6.2.23 rnrs hashtables
      • 7.6.2.24 rnrs enums
      • 7.6.2.25 rnrs
      • 7.6.2.26 rnrs eval
      • 7.6.2.27 rnrs mutable-pairs
      • 7.6.2.28 rnrs mutable-strings
      • 7.6.2.29 rnrs r5rs
  • 7.7 Pattern Matching
  • 7.8 Readline Support
    • 7.8.1 Loading Readline Support
    • 7.8.2 Readline Options
    • 7.8.3 Readline Functions
      • 7.8.3.1 Readline Port
      • 7.8.3.2 Completion
  • 7.9 Pretty Printing
  • 7.10 Formatted Output
  • 7.11 File Tree Walk
  • 7.12 Queues
  • 7.13 Streams
  • 7.14 Buffered Input
  • 7.15 Expect
  • 7.16 sxml-match: Pattern Matching of SXML
    • Syntax
    • Matching XML Elements
    • Ellipses in Patterns
    • Ellipses in Quasiquote'd Output
    • Matching Nodesets
    • Matching the “Rest” of a Nodeset
    • Matching the Unmatched Attributes
    • Default Values in Attribute Patterns
    • Guards in Patterns
    • Catamorphisms
    • Named-Catamorphisms
    • sxml-match-let and sxml-match-let*
  • 7.17 The Scheme shell (scsh)
• 8 Standard Library
  • 8.1 (statprof)
    • 8.1.1 Overview
    • 8.1.2 Implementation notes
    • 8.1.3 Usage
  • 8.2 (sxml apply-templates)
    • 8.2.1 Overview
    • 8.2.2 Usage
  • 8.3 (sxml fold)
    • 8.3.1 Overview
    • 8.3.2 Usage
  • 8.4 (sxml simple)
    • 8.4.1 Overview
    • 8.4.2 Usage
  • 8.5 (sxml ssax)
    • 8.5.1 Overview
    • 8.5.2 Usage
  • 8.6 (sxml ssax input-parse)
    • 8.6.1 Overview
    • 8.6.2 Usage
  • 8.7 (sxml transform)
    • 8.7.1 Overview
    • 8.7.2 Usage
  • 8.8 (sxml xpath)
    • 8.8.1 Overview
    • 8.8.2 Usage
  • 8.9 (texinfo)
    • 8.9.1 Overview
    • 8.9.2 Usage
  • 8.10 (texinfo docbook)
    • 8.10.1 Overview
    • 8.10.2 Usage
  • 8.11 (texinfo html)
    • 8.11.1 Overview
    • 8.11.2 Usage
  • 8.12 (texinfo indexing)
    • 8.12.1 Overview
    • 8.12.2 Usage
  • 8.13 (texinfo string-utils)
    • 8.13.1 Overview
    • 8.13.2 Usage
  • 8.14 (texinfo plain-text)
    • 8.14.1 Overview
    • 8.14.2 Usage
  • 8.15 (texinfo serialize)
    • 8.15.1 Overview
    • 8.15.2 Usage
  • 8.16 (texinfo reflection)
    • 8.16.1 Overview
    • 8.16.2 Usage
• 9 GOOPS
  • 9.1 Copyright Notice
  • 9.2 Class Definition
  • 9.3 Instance Creation and Slot Access
  • 9.4 Slot Options
  • 9.5 Illustrating Slot Description
  • 9.6 Methods and Generic Functions
    • 9.6.1 Generic functions and methods
    • 9.6.2 Next-method
    • 9.6.3 Example
  • 9.7 Inheritance
    • 9.7.1 Class precedence list
  • 9.8 Class Options
  • 9.9 Accessing Slots
    • 9.9.1 Instance Slots
    • 9.9.2 Class Slots
    • 9.9.3 Handling Slot Access Errors
  • 9.10 Generic Functions and Accessors
    • 9.10.1 Extending Primitives
    • 9.10.2 Merging Generics
  • 9.11 Adding Methods to Generic Functions
  • 9.12 Invoking Generic Functions
    • 9.12.1 Determining Which Methods to Apply
    • 9.12.2 Handling Invocation Errors
  • 9.13 Redefining a Class
    • 9.13.1 Default Class Redefinition Behaviour
    • 9.13.2 Customizing Class Redefinition
  • 9.14 Changing the Class of an Instance
  • 9.15 Introspection
    • 9.15.1 Classes
    • 9.15.2 Slots
    • 9.15.3 Instances
    • 9.15.4 Built-in classes
    • 9.15.5 Generic Functions
    • 9.15.6 Generic Function Methods
  • 9.16 Error Handling
  • 9.17 Object Comparisons
  • 9.18 Cloning Objects
  • 9.19 Write and Display
  • 9.20 The Metaobject Protocol
    • 9.20.1 Metaobjects and the Metaobject Protocol
    • 9.20.2 Terminology
    • 9.20.3 MOP Specification
    • 9.20.4 Class Definition Internals
    • 9.20.5 Customizing Class Definition
    • 9.20.6 Customizing Instance Creation
    • 9.20.7 Class Redefinition
    • 9.20.8 Method Definition
    • 9.20.9 Method Definition Internals
    • 9.20.10 Generic Function Internals
    • 9.20.11 Generic Function Invocation
• 10 Guile Implementation
  • 10.1 A Brief History of Guile
    • 10.1.1 The Emacs Thesis
    • 10.1.2 Early Days
    • 10.1.3 A Scheme of Many Maintainers
    • 10.1.4 A Timeline of Selected Guile Releases
    • 10.1.5 Status, or: Your Help Needed
  • 10.2 Data Representation
    • 10.2.1 A Simple Representation
    • 10.2.2 Faster Integers
    • 10.2.3 Cheaper Pairs
    • 10.2.4 Conservative Garbage Collection
    • 10.2.5 The SCM Type in Guile
      • 10.2.5.1 Relationship between SCM and scm_t_bits
      • 10.2.5.2 Immediate objects
      • 10.2.5.3 Non-immediate objects
      • 10.2.5.4 Allocating Cells
      • 10.2.5.5 Heap Cell Type Information
      • 10.2.5.6 Accessing Cell Entries
  • 10.3 A Virtual Machine for Guile
    • 10.3.1 Why a VM?
    • 10.3.2 VM Concepts
    • 10.3.3 Stack Layout
    • 10.3.4 Variables and the VM
    • 10.3.5 Compiled Procedures are VM Programs
    • 10.3.6 Instruction Set
      • 10.3.6.1 Lexical Environment Instructions
      • 10.3.6.2 Top-Level Environment Instructions
      • 10.3.6.3 Procedure Call and Return Instructions
      • 10.3.6.4 Function Prologue Instructions
      • 10.3.6.5 Trampoline Instructions
      • 10.3.6.6 Branch Instructions
      • 10.3.6.7 Data Constructor Instructions
      • 10.3.6.8 Loading Instructions
      • 10.3.6.9 Dynamic Environment Instructions
      • 10.3.6.10 Miscellaneous Instructions
      • 10.3.6.11 Inlined Scheme Instructions
      • 10.3.6.12 Inlined Mathematical Instructions
      • 10.3.6.13 Inlined Bytevector Instructions
  • 10.4 Compiling to the Virtual Machine
    • 10.4.1 Compiler Tower
    • 10.4.2 The Scheme Compiler
    • 10.4.3 Tree-IL
    • 10.4.4 GLIL
    • 10.4.5 Assembly
    • 10.4.6 Bytecode and Objcode
    • 10.4.7 Writing New High-Level Languages
    • 10.4.8 Extending the Compiler
• 11 Autoconf Support
  • 11.1 Autoconf Background
  • 11.2 Autoconf Macros
  • 11.3 Using Autoconf Macros
  • 11.4 Autofrisk
  • 11.5 Using Autofrisk
• Appendix A GNU Free Documentation License
• Concept Index
• Procedure Index
• Variable Index
• Type Index
• R5RS Index