D | |
| descr [Bdd] |
internal private type for nodes
|
F | |
| formatter [Common] |
short-hand for user-defined formatter
|
| formula [Bdd] |
symbolic Boolean formulas
|
G | |
| gstring [Common] | |
| gstring_ [Common] |
unterminated guarded strings (for counter-examples)
|
H | |
| hset [Common] | |
| hval [Common] |
hash-consed values, ans sets of such values
|
I | |
| int_set [Common] | |
K | |
| key [Bdd] |
type of variables
|
M | |
| mem [Bdd] |
memories for BDDs nodes (required to ensure unicity)
|
N | |
| node [Bdd] |
Multi-Terminal BDD nodes with leaves in
'a and decision nodes labelled with 'k (keys)
|
S | |
| sdfa [Automata] | |
| senfa [Automata] | |
| set [Common] | |
| snfa [Automata] | |
| span [Common] | |
T | |
| t [Automata.SENFA] | |
| t [Automata.SNFA] |
reindex and memoise an NFA
|
| t [Automata.SDFA] |
print an automaton using the module
Trace, possibly excluding
the specified node
|
| t [Stats] | |
| t [Common.QUEUE] | |
| t [Common.Span] | empty z is the constant to z map
|
| t [Common.Set] | |
| t [Sets.T] | |
U | |
| unifier [Bdd] |
BDD unifying functions
|