mirror of
https://github.com/c-cube/sidekick.git
synced 2025-12-06 19:25:36 -05:00
merge
This commit is contained in:
parent
faf2af1bac
commit
227df58afd
1 changed files with 3 additions and 1 deletions
4
TODO.md
4
TODO.md
|
|
@ -10,7 +10,7 @@
|
||||||
- data oriented congruence closure (all based on VecI32.t)
|
- data oriented congruence closure (all based on VecI32.t)
|
||||||
|
|
||||||
- new proofs:
|
- new proofs:
|
||||||
* simplify : use subproof
|
* simplify : use subproof (maybe not even there?)
|
||||||
* preprocess: no subproof
|
* preprocess: no subproof
|
||||||
* rule for proving `t=u` by CC modulo all previous unit equalities (needed
|
* rule for proving `t=u` by CC modulo all previous unit equalities (needed
|
||||||
for simp/preprocess)
|
for simp/preprocess)
|
||||||
|
|
@ -123,6 +123,8 @@
|
||||||
than resolution with explicit order+pivots) ⇒ used in SAT solver
|
than resolution with explicit order+pivots) ⇒ used in SAT solver
|
||||||
* [x] store proof in temp file, then parse it backward (using adequate framing)
|
* [x] store proof in temp file, then parse it backward (using adequate framing)
|
||||||
to obtain relevant part in memory and produce Quip file
|
to obtain relevant part in memory and produce Quip file
|
||||||
|
- dyn-trans for CC: add hooks in CC explanation of conflict
|
||||||
|
so the theory can intercept that
|
||||||
- write theory of datatypes (without acyclicity) with local case splits + injectivity + selectors
|
- write theory of datatypes (without acyclicity) with local case splits + injectivity + selectors
|
||||||
- datatype acyclicity check
|
- datatype acyclicity check
|
||||||
- make CC work on QF_UF
|
- make CC work on QF_UF
|
||||||
|
|
|
||||||
Loading…
Add table
Reference in a new issue