Leonardo de Moura
|
ebf8c7fbdb
|
feat(library/data): define bag using quotients
|
2015-07-24 23:45:08 -07:00 |
|
Leonardo de Moura
|
8be82d7405
|
feat(data/list): add count for lists
|
2015-07-24 23:44:11 -07:00 |
|
Leonardo de Moura
|
99a9dec93f
|
refactor(library/data/real/basic): declare 'real' in the toplevel like 'nat', 'int' and 'rat'
|
2015-07-24 11:59:46 -07:00 |
|
Leonardo de Moura
|
5c7a20e5bd
|
fix(library/unifier): crash when unifying constraints of the form (pr t =?= s)
where pr is a projection and t is a stuck term
see issue #737
|
2015-07-24 11:52:46 -07:00 |
|
Leonardo de Moura
|
0f2c0b6512
|
feat(library/data/real/basic): replace 'have ... [visible]' with 'assert ...'
Remove comments about "sorry"s. Mario has fixed all of them.
|
2015-07-24 10:07:16 -07:00 |
|
Mario Carneiro
|
066b0fcdf9
|
feat(library): clean up "sorry"s in library
Breaking changes: pnat was redefined to use subtype instead of a custom inductive type, which affects the notation for pnat 2 and 3
|
2015-07-24 12:21:33 -04:00 |
|
Leonardo de Moura
|
946308b187
|
feat(frontends/lean): allow anonymous 'have'-expressions in tactic mode
|
2015-07-23 18:52:59 -07:00 |
|
Leonardo de Moura
|
18dd7c13f9
|
feat(frontends/lean): add '[congr]' attribute
|
2015-07-22 17:21:47 -07:00 |
|
Leonardo de Moura
|
fbaa8b21f6
|
refactor(library/data/nat): cleanup for the tutorial
|
2015-07-22 13:41:50 -07:00 |
|
Leonardo de Moura
|
e969c7a8d6
|
refactor(library): remove 'simp' hack
|
2015-07-22 10:13:19 -07:00 |
|
Leonardo de Moura
|
092c8d05b9
|
feat(frontends/lean,library): rename '[rewrite]' to '[simp]'
|
2015-07-22 09:01:42 -07:00 |
|
Leonardo de Moura
|
0de715ae54
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
Leonardo de Moura
|
3e3d37905c
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 08:26:44 -07:00 |
|
Leonardo de Moura
|
ff425b66e7
|
feat(library/data/list): test type notation in the standard library
|
2015-07-20 22:00:05 -07:00 |
|
Leonardo de Moura
|
10e5b182b5
|
refactor(library/data): use "suppose"-expressions to cleanup proofs
|
2015-07-20 19:45:54 -07:00 |
|
Leonardo de Moura
|
8ad6312764
|
feat(library/hlist): add helper eq.rec lemmas
|
2015-07-20 14:56:50 -07:00 |
|
Leonardo de Moura
|
0a8bab14ee
|
feat(library/data/vector): add helper lemmas for proving v == w when v and w are vectors
|
2015-07-20 11:59:03 -07:00 |
|
Leonardo de Moura
|
48f8b8f18d
|
refactor(library): use new 'suppose'-expression
|
2015-07-19 21:15:20 -07:00 |
|
Leonardo de Moura
|
c2fc612ec1
|
fix(library/data/nat/order): add missing theorems back
|
2015-07-19 20:21:25 -07:00 |
|
Leonardo de Moura
|
6936d71030
|
feat(library/data/list/basic): add 'firstn' definition and theorems
|
2015-07-19 20:15:40 -07:00 |
|
Leonardo de Moura
|
d2f64d7744
|
feat(library/data/nat/order): add 'max/min' auxiliary theorems
|
2015-07-19 20:15:11 -07:00 |
|
Leonardo de Moura
|
d91627ebec
|
refactor(library): move 'max/min' to 'data/nat'
|
2015-07-19 19:47:14 -07:00 |
|
Leonardo de Moura
|
01169ca2a8
|
feat(library/data/hlist): add heterogeneous lists
|
2015-07-19 14:33:15 -07:00 |
|
Leonardo de Moura
|
73f665dce3
|
refactor(library/data/list/perm): use anonymous 'suppose' and 'have' expressions
|
2015-07-19 12:35:12 -07:00 |
|
Leonardo de Moura
|
812ddf1ef5
|
feat(frontends/lean): add 'suppose'-expression
It is a variant of 'assume' that allow anonymous declarations.
|
2015-07-19 12:15:12 -07:00 |
|
Leonardo de Moura
|
92f8eb173b
|
feat(frontends/lean): use 'this' as the name for anonymous 'have'-expression
|
2015-07-18 13:36:05 -05:00 |
|
Leonardo de Moura
|
ade60278d0
|
refactor(library): rename iff.mp' to iff.mpr
|
2015-07-18 08:52:58 -05:00 |
|
Leonardo de Moura
|
16f50d9aea
|
feat(library/data/list/basic): add list.is_inhabited
|
2015-07-17 06:52:43 -04:00 |
|
Leonardo de Moura
|
9d83361fdc
|
refactor(library): use subtype instead of sigma
|
2015-07-16 22:48:33 -04:00 |
|
Leonardo de Moura
|
d70c79f4e3
|
refactor(library/data/fin,library/theories/group_theory/cyclic): fixes #735
|
2015-07-16 19:39:12 -04:00 |
|
Haitao Zhang
|
ca895e4901
|
fix(library/data/finset/partition): improve lemmas on binary partition
|
2015-07-16 14:13:06 -07:00 |
|
Haitao Zhang
|
9ba350098f
|
feat(library/data): add a few convenience lemmas
|
2015-07-15 17:44:37 -07:00 |
|
Haitao Zhang
|
8dc45686ff
|
feat(library/data/finset/partition): add theory of binary partition
|
2015-07-15 17:44:36 -07:00 |
|
Leonardo de Moura
|
89f69630b6
|
feat(library): use sigma instead of exists (experimental)
|
2015-07-15 15:49:47 -04:00 |
|
Haitao Zhang
|
721d3781ca
|
feat(library/data/list/basic): add a lemma length_pos_of_mem
|
2015-07-15 14:49:53 -04:00 |
|
Haitao Zhang
|
9d523bae6b
|
feat(library/data/fin): add more fin definition and lemmas
|
2015-07-15 14:49:53 -04:00 |
|
Leonardo de Moura
|
3ab0e07ba9
|
feat(frontends/lean): add simp tactic frontend stub
This commit also removes the fake_simplifier. It doesn't work anymore
because simp is now a reserved word.
|
2015-07-14 09:54:53 -04:00 |
|
Haitao Zhang
|
5034de9c4e
|
feat(library/data/nat/power): add nat power divide theorems
|
2015-07-13 22:02:17 -04:00 |
|
Haitao Zhang
|
fae8176363
|
feat(library/data/list/comb): add map theorems
|
2015-07-13 22:02:17 -04:00 |
|
Leonardo de Moura
|
ebe6ec0017
|
feat(library): add '[rewrite]' annotation some some theorems
|
2015-07-13 16:39:53 -04:00 |
|
Leonardo de Moura
|
ea62a27b6b
|
feat(library/data/stream): define lex-order for streams
|
2015-07-12 16:55:04 -04:00 |
|
Jeremy Avigad
|
98cace9bf8
|
fix(library/data/finset/bigops): remove extraneous parameter
|
2015-07-11 19:01:44 -04:00 |
|
Jeremy Avigad
|
9810105a2a
|
refactor(library/data/finste/basic): rename non_empty_of_card_succ to ne_empty_of_card_eq_succ
|
2015-07-11 19:01:44 -04:00 |
|
Jeremy Avigad
|
d443b25dee
|
fix(library/data/{finset,set}/basic: change notation from {[a, b, c]} to '{a, b, c}
|
2015-07-11 19:01:44 -04:00 |
|
Jeremy Avigad
|
e8ad284ead
|
feat(library/data/finset/{bigops,comb}): add two theorems for Haitao
|
2015-07-11 19:01:43 -04:00 |
|
Jeremy Avigad
|
70407473c2
|
feat(library/theories/combinatorics/choose): begin theory of binomial coefficients
|
2015-07-11 19:01:43 -04:00 |
|
Leonardo de Moura
|
8e8e08cfe7
|
feat(library/tactic): use occurrence object in unfold tactic family
|
2015-07-11 18:53:45 -04:00 |
|
Leonardo de Moura
|
d939509135
|
doc(library/data/nat/examples): add tail recursive fib example
|
2015-07-10 20:38:07 -04:00 |
|
Leonardo de Moura
|
fc82b46171
|
chore(library/data/nat/examples/fib): cleanup example
|
2015-07-10 08:18:30 -04:00 |
|
Leonardo de Moura
|
32cc2e917b
|
doc(library/data/nat/examples): add examples
|
2015-07-09 21:56:48 -04:00 |
|