Leonardo de Moura
|
23f41fddb3
|
feat: basic tactic cache
TODO: move `IO.Ref` to command
|
2022-03-31 19:53:03 -07:00 |
|
Leonardo de Moura
|
df3a8eb126
|
feat: add helper List.append simp theorems
|
2022-03-30 11:11:03 -07:00 |
|
E.W.Ayers
|
00151f39a1
|
doc: explain MonadControl
|
2022-03-29 15:55:08 -07:00 |
|
Leonardo de Moura
|
2a37f53fca
|
chore: fix core library
|
2022-03-28 14:32:04 -07:00 |
|
Sebastian Ullrich
|
c4d3c74837
|
feat: accept multiple patterns after matches
|
2022-03-21 17:59:02 +01: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
|
7dd38a7194
|
feat: add with_unfolding_all and rfl' tactics
|
2022-03-19 08:57:04 -07:00 |
|
Leonardo de Moura
|
63e42a8179
|
chore: fix copyright date
File was created in 2022.
|
2022-03-19 08:44:21 -07:00 |
|
Leonardo de Moura
|
c8c4d47420
|
feat: make decreasing_tactic easier to extend
|
2022-03-19 08:42:38 -07:00 |
|
Leonardo de Moura
|
bd7827ed04
|
feat: dbg_trace tactic for low-level tactic debugging
|
2022-03-19 08:25:49 -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
|
ed63274874
|
refactor: move ac_refl syntaxt to Init/Notation
|
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 |
|
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 |
|
Leonardo de Moura
|
9b9ed6db68
|
feat: add simp_all_arith macro
|
2022-03-16 16:17:45 -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
|
bbe6bd4e72
|
chore: simplify String.utf8ByteSize reference implementation
|
2022-03-14 15:42:58 -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 |
|
Leonardo de Moura
|
02145f66cf
|
chore: fix typo
|
2022-03-14 10:05:33 -07:00 |
|
Leonardo de Moura
|
bfe57a1cb0
|
chore: simplify definition
|
2022-03-12 20:16:45 -08: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
|
619186b2a8
|
feat: only use set_option codegen false where needed
|
2022-03-06 19:15:05 -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
|
022a4d5ac1
|
feat: add ∈ notation
|
2022-03-03 17:18:51 -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
|
89c3820781
|
chore: naming convention
|
2022-03-03 17:17:51 -08:00 |
|
Leonardo de Moura
|
5845002e8c
|
feat: use WF at anyM
|
2022-03-03 16:43:05 -08:00 |
|