| GenAutomata | Mark Bickford's development of General Automata Theory (partial). |
| mb automata 4 | |
| mb automata 3 | |
| mb automata 2 | |
| mb hybrid | |
| mb automata 1 | |
| mb structures | |
| mb list 2 | More list stuff. |
| mb state machine | General transition systems and operations such as intersection and renaming. |
| mb events | |
| mb record | Definitions of records and the dual sigma types and their properties. |
| mb declaration | Declarations are assignments of types to labels. |
| mb label | Labels are patterns without variables in them, ie ground patterns. |
| mb list 1 | Filter, initial-segment, list-member, interleaving, etc. Lemmas related to map, append, cons, select. |
| num thy 1 | Elementary divisibility theory over the integers. Gcd function and relation introduced. Chinese remainder theorem proven. |
| union | Non canonical functions (isl, outl, outr) for union type. |
| mb nat | |
| mb basic | Generally useful devices. |
| rel 1 | Common properties of binary relations. |
| mb tree | Binary Trees. |
| prog 1 | |
| sqequal 1 | |
| mb collection | Collections as properties of objects. |
| list 1 | |
| int 2 | |
| bool 1 | |
| int 1 | |
| well fnd | |
| fun 1 | |
| core | Some basic concepts defined type-theoretically. |