Gabriel Ebner
|
a8cab84735
|
refactor: use computed fields for Expr
|
2022-07-11 14:19:41 -07:00 |
|
Leonardo de Moura
|
2ebcf29cde
|
chore: use a[i]! for array accesses that may panic
|
2022-07-02 15:12:05 -07:00 |
|
Leonardo de Moura
|
041827bed5
|
chore: unused variables
|
2022-06-07 17:54:10 -07:00 |
|
Daniel Fabian
|
969eea19f0
|
refactor: do not use mkAppM so much
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
cf4e873974
|
feat: support Sort u in ac_refl.
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
8e0763f502
|
fix: binder case.
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
d667d5ab5d
|
feat: rewrite the tactic using simp as the basis.
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
ed63274874
|
refactor: move ac_refl syntaxt to Init/Notation
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
73a59e5bc4
|
feat: use simp instead of rewrite inside of ac_refl
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
84f72b9389
|
test: add further ac_refl tests.
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
a60220b036
|
feat: add tactic for ac_refl.
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
eaa48f0d8d
|
refactor: move ac proofs to Init.
|
2022-03-16 17:21:20 -07:00 |
|
Daniel Fabian
|
1114dfac6c
|
feat: add theory for ac normalization.
This lets us implement an AC reflexivity tactic.
|
2022-03-16 17:21:20 -07:00 |
|