Calculemus.Lib Namespace
Basic library for the global implementation.
Contents
- Functions over predicates and functions
- Collections (lists and sets)
- Sort and search algorithms
- Strings
- Finite partial functions and equivalence classes
- Lexer, parser and prettyprinter
- Diagnostics
Functions over predicates and functions
| Modules | Description |
Functions over predicates and functions. |
Collections (lists and sets)
| Modules | Description |
|
Handy functions for list manipulation. |
|
|
Set represented as ordered lists and related operations. |
Sort and search algorithms
| Modules | Description |
|
Searching functions. |
|
|
Sorting functions. |
Strings
| Modules | Description |
|
Explosion and implosion of strings. |
Finite partial functions and equivalence classes
| Modules | Description |
|
Polymorphic Finite Partial functions via Patricia Trees. |
|
|
Equivalence relations (or partitions, equivalence classes) on finite sets. |
Lexer, parser and prettyprinter
| Modules | Description |
|
Lexical analysis. |
|
|
Generic functions for parsing. |
Diagnostics
| Modules | Description |
|
Timing: useful for documentation but not logically necessary. |