- Introduction
- Creating Sequences
- The Formal Sequence Constructor
- The Enumerated Sequence Constructor
- [ ] : Null -> ESeqEnum
- [ U | ] : Str -> SeqEnum
- [ e1, e2, ..., en ] : Elt, ..., Elt -> SeqEnum
- [ U | e1, e2, ..., em ] : Str, Elt, ..., Elt -> SeqEnum
- [ e(x) : x in E | P(x) ]
- [ U | e(x) : x in E | P(x) ]
- [ e(x1,...,xk) : x1 in E1, ..., xkin Ek | P(x1, ..., xk) ]
- [ U | e(x1,...,xk) : x1 in E1, ...,xk in Ek | P(x1, ..., xk) ]
- The Arithmetic Progression Constructors
- Literal Sequences
- Power Sequences
- Operators on Sequences
- Access Functions
- Selection Operators on Enumerated Sequences
- Modifying Enumerated Sequences
- Append(~S, x) : SeqEnum, Elt ->
- Exclude(~S, x) : SeqEnum, Elt ->
- Include(~S, x) : SeqEnum, Elt ->
- Insert(~S, i, x) : SeqEnum, RngIntElt, Elt ->
- Insert(~S, k, m, T) : SeqEnum, RngIntElt, RngIntElt, SeqEnum ->
- Prune(~S) : SeqEnum ->
- Remove(~S, i) : SeqEnum, RngIntElt ->
- Reverse(~S) : SeqEnum ->
- Rotate(~S, p) : SeqEnum, RngIntElt ->
- Sort(~S) : SeqEnum ->
- Sort(~S, C) : SeqEnum, UserProgram ->
- ParallelSort(~S, ~T) : SeqEnum, SeqEnum ->
- Undefine(~S, i) : SeqEnum, RngIntElt ->
- ChangeUniverse(S, V) : SeqEnum, Str ->
- CanChangeUniverse(S, V) : SeqEnum, Str -> Bool, SeqEnum
- Example Seq_Farey (H11E3)
- Creating New Enumerated Sequences from Existing Ones
- Predicates on Sequences
- Recursion, Reduction, and Iteration
- Bibliography
V2.28, 13 July 2023