Leonardo de Moura
|
09dfd97593
|
chore: remove temporary workaround
|
2022-04-21 16:29:08 -07:00 |
|
Leonardo de Moura
|
57c3114875
|
fix: simpAll and tests
We need another `update stage0` to remove workaround at `AC.lean`
|
2022-04-21 15:00:07 -07:00 |
|
Leonardo de Moura
|
2a36ae4627
|
feat: add List.le_antisymm
|
2022-04-20 16:31:25 -07:00 |
|
Leonardo de Moura
|
bb3fc358c9
|
feat: add LawfulBEq Int instance
|
2022-04-20 14:52:41 -07:00 |
|
Leonardo de Moura
|
e3dcce5320
|
chore: remove temporary workarounds
|
2022-04-09 12:13:37 -07:00 |
|
Leonardo de Moura
|
628e33bf8a
|
feat: activate new rfl tactic implementation
|
2022-04-09 12:01:56 -07:00 |
|
Leonardo de Moura
|
de2e2447d2
|
chore: style
|
2022-04-07 17:35:05 -07:00 |
|
Leonardo de Moura
|
9d55d7bf9e
|
feat: add helper tactic for applying List.sizeOf_lt_of_mem in termination proofs
|
2022-04-02 18:38:55 -07:00 |
|
Leonardo de Moura
|
64cfbc1ae3
|
feat: add helper tactic for applying sizeOf (a.get i) < sizeOf a automatically in termination proofs
|
2022-04-02 18:29:41 -07:00 |
|
Leonardo de Moura
|
562af50191
|
feat: add ForIn' instance for Range
|
2022-04-02 18:22:21 -07:00 |
|
Leonardo de Moura
|
03ec8cb30b
|
feat: missing sizeOf theorems for Array.get and List.get
|
2022-04-02 16:04:46 -07:00 |
|
Leonardo de Moura
|
8636594dac
|
chore: add [simp] to Nat.lt_irrefl
|
2022-04-01 18:50:32 -07:00 |
|
Leonardo de Moura
|
cfb4e306f7
|
refactor: replace length_dropLast theorem
|
2022-04-01 16:44:24 -07:00 |
|
Leonardo de Moura
|
d1022e5587
|
chore: add Nat.div_add_mod
|
2022-04-01 08:20:00 -07:00 |
|
Leonardo de Moura
|
df3a8eb126
|
feat: add helper List.append simp theorems
|
2022-03-30 11:11:03 -07:00 |
|
Leonardo de Moura
|
2a37f53fca
|
chore: fix core library
|
2022-03-28 14:32:04 -07:00 |
|
Leonardo de Moura
|
87bb299f08
|
feat: add Iterator.atEnd
|
2022-03-20 11:40:46 -07:00 |
|
Leonardo de Moura
|
3862e7867b
|
refactor: make String.Pos opaque
TODO: this refactoring exposed bugs in `FuzzyMatching` and `Lake`
closes #410
|
2022-03-20 10:47:13 -07:00 |
|
casavaca
|
bf4ba1583d
|
feat: add simp theorem for List, (as.map f).length = as.length
|
2022-03-19 11:35:21 -07:00 |
|
Leonardo de Moura
|
72b6f4d528
|
chore: avoid unnecessary h :s
|
2022-03-19 11:21:37 -07:00 |
|
Leonardo de Moura
|
9fed5bda7d
|
chore: remove workarounds
|
2022-03-19 09:44:57 -07:00 |
|
Leonardo de Moura
|
4b374d4441
|
fix: Nat/Div.lean, add decreasing_with combinator, and rename decreasing_tactic_trivial
|
2022-03-19 09:40:10 -07:00 |
|
Leonardo de Moura
|
9722aeaf32
|
feat: use String.Iterator.sizeOf_next_lt in the builtin decreasing_tactic
|
2022-03-19 09:04:40 -07:00 |
|
Leonardo de Moura
|
9727387129
|
feat: helper theorem for proving termination of simple String traversal functions
|
2022-03-19 07:37:59 -07:00 |
|
Leonardo de Moura
|
64bd82dddd
|
feat: custom SizeOf instance for String.Iterator
|
2022-03-19 07:21:17 -07:00 |
|
zygi
|
ac793ce196
|
fix: forward start and stop in Array.allM
|
2022-03-17 10:08:40 +01:00 |
|
Daniel Fabian
|
cf4e873974
|
feat: support Sort u in ac_refl.
|
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
|
fda1c5b192
|
refactor: simplify proof using <;>
|
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 |
|
Leonardo de Moura
|
c6dae18787
|
chore: add helper theorems
|
2022-03-14 16:24:05 -07:00 |
|
Leonardo de Moura
|
40f608bfbd
|
chore: cleanup String.extract reference implementation
|
2022-03-14 16:23:13 -07:00 |
|
Leonardo de Moura
|
8e29747fe7
|
feat: add simp theorem (a : Nat) : (a ≤ 0) = (a = 0)
|
2022-03-14 15:43:42 -07:00 |
|
Leonardo de Moura
|
14ed473777
|
feat: mark Nat.zero_le as simp theorem
|
2022-03-14 15:19:52 -07:00 |
|
Leonardo de Moura
|
cab3217b05
|
feat: add forIn'_eq_forIn theorem for lists
|
2022-03-14 11:50:47 -07:00 |
|
Sebastian Ullrich
|
82c682d385
|
chore: remove redundant proof
|
2022-03-12 11:12:56 +01:00 |
|
Leonardo de Moura
|
5caf1bc692
|
chore: style
Use `·` instead of `.` for structuring tactics.
|
2022-03-11 16:12:46 -08:00 |
|
Leonardo de Moura
|
d3b2028a05
|
feat: add Fin.succ
|
2022-03-05 17:36:38 -08:00 |
|
Leonardo de Moura
|
ef38c82c77
|
fix: missing hypotheses at List.sizeOf_lt_of_mem
|
2022-03-03 19:52:05 -08:00 |
|
Leonardo de Moura
|
99677823c3
|
fix: ForIn' instance binder annotations
|
2022-03-03 19:51:45 -08:00 |
|
Leonardo de Moura
|
d8ee03c1bb
|
feat: add ForIn' instance that is similar to ForIn but provides a proof that the iterated elements are in the collection
|
2022-03-03 19:05:27 -08:00 |
|
Leonardo de Moura
|
e1424653b9
|
chore: remove workaround
|
2022-03-03 18:16:54 -08:00 |
|
Leonardo de Moura
|
337c55f322
|
fix: missing import
|
2022-03-03 18:13:34 -08:00 |
|
Leonardo de Moura
|
aeb9b2fb8c
|
chore: add Membership instance for Array
|
2022-03-03 18:13:34 -08:00 |
|
Leonardo de Moura
|
fd519401ff
|
feat: add Membership instance for List
and the theorem `a ∈ as -> sizeOf a < sizeOf as`.
We will use theorems like this one to improve the `decreasing_tactic`.
|
2022-03-03 18:13:21 -08:00 |
|
Leonardo de Moura
|
f629be745b
|
chore: add Nat.le_refl as simp theorem
|
2022-03-03 17:18:11 -08:00 |
|
Leonardo de Moura
|
5845002e8c
|
feat: use WF at anyM
|
2022-03-03 16:43:05 -08:00 |
|
Leonardo de Moura
|
02d7cedba8
|
chore: remove unnecessary termination_by annotations
|
2022-03-03 11:24:06 -08:00 |
|
Leonardo de Moura
|
de51160929
|
fix: core library
|
2022-03-01 13:36:24 -08:00 |
|