Sebastian Ullrich
|
4aed79a13e
|
feat: less strict, hopefully more helpful syntax ident matching semantics
|
2022-04-08 15:53:58 +02:00 |
|
Leonardo de Moura
|
de2e2447d2
|
chore: style
|
2022-04-07 17:35:05 -07:00 |
|
Leonardo de Moura
|
9de6961906
|
chore: to doc string
|
2022-04-07 07:29:23 -07:00 |
|
Leonardo de Moura
|
27cd678717
|
doc: improve contradiction doc string
|
2022-04-06 19:27:23 -07:00 |
|
Leonardo de Moura
|
18707692a8
|
doc: add doc strings to some tactics
|
2022-04-05 06:27:09 -07:00 |
|
Leonardo de Moura
|
16523647b8
|
doc: add doc strings to some tactics
|
2022-04-05 06:27:09 -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
|
2c7c7471db
|
feat: add case' tactic for writing macros
It is similar to `case` but does not admit goal in case of failure.
This is useful for writing macros.
|
2022-04-02 17:54:06 -07:00 |
|
Leonardo de Moura
|
443dd79a02
|
feat: sizeOf theorems for Lean.Name
|
2022-04-02 17:09:55 -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
|
9f29d7ecb7
|
feat: add stop tactic macro
|
2022-04-02 15:39:03 -07:00 |
|
Leonardo de Moura
|
e058fe65a9
|
feat: make the hypothesis name optional in the by_cases tactic
|
2022-04-01 19:36:13 -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
|
fdd1cb5751
|
chore: remove workarounds for #1090
|
2022-04-01 11:28:17 -07:00 |
|
Leonardo de Moura
|
799c701f56
|
fix: inconsistency between syntax and kind names
TODO: remove staging workarounds
see #1090
|
2022-04-01 11:20:16 -07:00 |
|
Leonardo de Moura
|
68acfc7fb9
|
chore: prepare for #1090
|
2022-04-01 11:11:28 -07:00 |
|
Leonardo de Moura
|
d1022e5587
|
chore: add Nat.div_add_mod
|
2022-04-01 08:20:00 -07:00 |
|
E.W.Ayers
|
9fdb7429d4
|
doc: edits to MonadControl
|
2022-04-01 10:06:58 +02:00 |
|
E.W.Ayers
|
4c2fedae50
|
doc: fix @Kha's issues with MonadControl
|
2022-04-01 10:06:58 +02:00 |
|
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 |
|