► |  | Reference: PLT Scheme

1 | Language Model
2 | Syntactic Forms
3 | Datatypes
4 | Structures
5 | Classes and Objects
6 | Units
7 | Contracts
8 | Pattern Matching
9 | Control Flow
10 | Concurrency
11 | Macros
12 | Input and Output
13 | Reflection and Security
14 | Operating System
15 | Memory Management
16 | Unsafe Operations
17 | Running PLT Scheme
| Bibliography
| Index

▼ | 3 | Datatypes

3.1 | Booleans and Equality
3.2 | Numbers
3.3 | Strings
3.4 | Byte Strings
3.5 | Characters
3.6 | Symbols
3.7 | Regular Expressions
3.8 | Keywords
3.9 | Pairs and Lists
3.10 | Mutable Pairs and Lists
3.11 | Vectors
3.12 | Boxes
3.13 | Hash Tables
3.14 | Sequences
3.15 | Dictionaries
3.16 | Procedures
3.17 | Void and Undefined

top← prev up next →

### 3`` Datatypes

Each pre-defined datatype comes with a set of procedures for manipulating instances of the datatype.

3.1 Booleans and Equality
3.2 Numbers
3.3 Strings
3.4 Byte Strings
3.5 Characters
3.6 Symbols
3.7 Regular Expressions
3.8 Keywords
3.9 Pairs and Lists
3.10 Mutable Pairs and Lists
3.11 Vectors
3.12 Boxes
3.13 Hash Tables
3.14 Sequences
3.15 Dictionaries
3.16 Procedures
3.17 Void and Undefined

top← prev up next →