Three | |
Gmp41 |
modified by
|
Mpa |
Multi-precision arithmetic using the
gmp library.
|
Binrel | |
Hashcons | |
Tools |
Functions to run at exit
|
Status | |
Pretty |
Redirecting output.
|
Trace | |
Exc |
Exceptions that are used throughout ICS.
|
Bitv | |
Dom |
Union of two domains
|
Interval |
Accessors
|
Name | |
Var |
Sets and maps of terms
|
Sym |
Function symbols for the theory of S-expressions.
|
Term |
Some recognizers.
|
Sign |
Constructors
|
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 .
|
Fact | |
Arith |
Symbols
|
Pair | cons(car(x), cdr(x)) reduces to x .
|
Coproduct |
Fold iterator
|
Bitvector |
Creating fresh bitvector variables for solver.
|
Boolean |
Constants
|
Pp |
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)
|
Bvarith | |
Sig |
Mapping a term transformer
f over a .
|
Apply |
evaluation, not affecting function bodies
|
App | |
Th |
Classification of function symbols.
|
Atom |
Set of atoms
|
Use |
empty use list.
|
D |
Known disequalities;
x |-> {y,z} is interpreted as x <> y & x <> z .
|
V |
remove the inverse of
x .
|
C | update x i s updates the constraint map with the constraint x in i
and modifies the use lists accordingly.
|
Partition |
Equalities and disequalities over variables and constraints on variables
|
Solution |
Fold over the
find structure.
|
Sl |
Fold over the
find structure.
|
Context |
Decision procedure state
|
Prop |
Translations to/from ICSAT propositions
|
Symtab | |
Istate |
Global state.
|
Help | |
Result | |
Parser | |
Lexer |
A lexer for terms.
|
Ics |
raise
Sys.Break exception upon
|