Simon Cruanes
|
24e79df776
|
wip: refactor base
|
2022-08-05 21:56:17 -04:00 |
|
Simon Cruanes
|
f3f0628261
|
large refactor with signature splitting, events, etc.
|
2022-07-18 23:20:07 -04:00 |
|
Simon Cruanes
|
a1bc186d2e
|
use ocamlformat
|
2022-07-14 22:09:13 -04:00 |
|
Simon Cruanes
|
3c41ab2484
|
refactor: new term representation for LIA/LRA
|
2022-01-31 15:13:25 -05:00 |
|
Simon Cruanes
|
8410a57f1a
|
wip: feat(LIA): LIA solver, will rely on LRA solver
we want to reuse the simplex, but do branch and bound + cutting planes
|
2022-01-11 14:00:04 -05:00 |
|
Simon Cruanes
|
4a30a06f87
|
wip: reconstruct quip proof from binary proof-trace
|
2021-10-26 21:57:17 -04:00 |
|
Simon Cruanes
|
84f7a39423
|
fix doc test
|
2021-10-21 20:42:12 -04:00 |
|
Simon Cruanes
|
3589592296
|
wip: use real proofs
|
2021-10-16 22:00:29 -04:00 |
|
Simon Cruanes
|
af1ef089af
|
wip: proper proof production using Proof_ser-based traces
|
2021-10-15 23:00:09 -04:00 |
|
Simon Cruanes
|
9f01b98cde
|
wip: imperative proofs
- getting closer to having the SMT solver compile again
- dummy proof implementation
- DRUP proof implementation for pure SAT solver
|
2021-08-18 23:59:39 -04:00 |
|
Simon Cruanes
|
be46f40312
|
more docs
|
2021-07-03 21:46:39 -04:00 |
|
Simon Cruanes
|
813f645a9c
|
refactor: rename sidekick-base-term to sidekick-base
|
2021-07-03 17:42:19 -04:00 |
|