A | |
| Abstract [Context] | |
| App [] | |
| Apply [] |
evaluation, not affecting function bodies
|
| Arith [] |
Symbols
|
| Arr [] |
Reducing patterns of the form
select(update(a,i,x), j)
according to the equations
select(create(a), j) = a
i = j => select(update(a,i,x), j) = x
i <> j => select(update(a,i,x),j) = select(a,j)
|
| Array [Th] | |
| Assignment [Prop] | |
| Atom [] |
Set of atoms
|
| Atomtbl [Prop] | |
B | |
| Binrel [] | |
| Bitv [] | |
| Bitvector [] |
Creating fresh bitvector variables for solver.
|
| Boolean [] |
Constants
|
| Bvarith [] | |
C | |
| C [] | update x i s updates the constraint map with the constraint x in i
and modifies the use lists accordingly.
|
| Can [Context] | |
| Context [] |
Decision procedure state
|
| Coproduct [] |
Fold iterator
|
D | |
| D [] |
Known disequalities;
x |-> {y,z} is interpreted as x <> y & x <> z.
|
| Dom [] |
Union of two domains
|
E | |
| Equalset [Fact] | |
| Euclid [Arith] | |
| Euclid [] |
Given two rational numbers
a, b, euclid finds
integers , y0 satisfying
a * x0 + b * y0 = (a, b),
where (a, b) denotes the greatest common divisor of a, b.
|
| Exc [] |
Exceptions that are used throughout ICS.
|
F | |
| Fact [] | |
G | |
| Gmp41 [] |
modified by
|
H | |
| H3 [Bitvector] | |
| Hashcons [] | |
| Hashq [Term] | |
| Help [] | |
I | |
| Ics [] |
raise
Sys.Break exception upon
|
| Infixes [Gmp41.Q] | |
| Infixes [Gmp41.Z] | |
| Interval [] |
Accessors
|
| Inttbl [Prop] | |
| Istate [] |
Global state.
|
L | |
| Levels [Trace] | |
| Lexer [] |
A lexer for terms.
|
M | |
| Make [Euclid] | |
| Make [Hashcons] | |
| Map [Term] | |
| Map [Var] | |
| Map [Name] | |
| Mpa [] |
Multi-precision arithmetic using the
gmp library.
|
N | |
| Name [] | |
| Nametbl [Prop] | |
P | |
| Pair [] | cons(car(x), cdr(x)) reduces to x.
|
| Pairtbl [Atom] | |
| Parser [] | |
| Partition [] |
Equalities and disequalities over variables and constraints on variables
|
| Pp [] |
Symbols.
|
| Pretty [] |
Redirecting output.
|
| Process [Context] | |
| Prop [] |
Translations to/from ICSAT propositions
|
Q | |
| Q [Mpa] | |
| Q [Gmp41] | |
R | |
| RNG [Gmp41] | |
| Result [] | |
S | |
| Set [Atom] | |
| Set [Term] | |
| Set [Var] | |
| Set [Name] | |
| Sig [] |
Mapping a term transformer
f over a.
|
| Sign [] |
Constructors
|
| Sl [] |
Fold over the
find structure.
|
| Solution [] |
Fold over the
find structure.
|
| Status [Context] | |
| Status [] | |
| Sym [] |
Function symbols for the theory of S-expressions.
|
| Symtab [] | |
T | |
| Term [] |
Some recognizers.
|
| Th [] |
Classification of function symbols.
|
| Three [] | |
| Tools [] |
Functions to run at exit
|
| Trace [] | |
U | |
| Use [] |
empty use list.
|
V | |
| V [] |
remove the inverse of
x.
|
| Var [] |
Sets and maps of terms
|
Z | |
| Z [Mpa] | |
| Z [Gmp41] | |
| Z2 [Gmp41] |