Rob Lewis
|
f402f322aa
|
feat(theories/analysis): add theorems about convergent sequences, functions, and continuity
|
2016-02-04 11:03:28 -08:00 |
|
Rob Lewis
|
ffed988a34
|
feat(data/list): add missing theorems
|
2016-02-04 11:03:28 -08:00 |
|
Rob Lewis
|
dcfc496992
|
feat(algebra/ordered_field): ad missing theorem
|
2016-02-04 11:03:28 -08:00 |
|
Rob Lewis
|
40a1371cd0
|
feat(theories/analysis): define real square roots
|
2016-02-04 11:03:28 -08:00 |
|
Rob Lewis
|
796e16bdb7
|
feat(library/theories/analysis): add theorems about convergent functions in metric spaces
|
2016-02-04 11:03:28 -08:00 |
|
Rob Lewis
|
cb4f71b16c
|
feat(library/data/real): add more theorems concerning rationals embedded in reals
|
2016-02-04 11:03:28 -08:00 |
|
Rob Lewis
|
110036c4dc
|
feat(library/algebra/ordered_field): add missing theorems
|
2016-02-04 11:03:28 -08:00 |
|
Leonardo de Moura
|
790dbc53c3
|
refactor(library/algebra/ring): cleanup
|
2016-02-03 20:07:12 -08:00 |
|
Leonardo de Moura
|
cb12b9b876
|
refactor(library): cleanup proofs
Fixed proofs that broke when we tried to implement a "checkpoint" have.
|
2016-02-03 19:52:23 -08:00 |
|
Leonardo de Moura
|
9d88db3941
|
perf(library/type_context): add cache for minimizing the access to is_opaque and environment::find
|
2016-02-02 19:47:58 -08:00 |
|
Leonardo de Moura
|
701d6b5016
|
perf(library/blast/forward/pattern): simplify is_higher_order test
|
2016-02-02 18:56:48 -08:00 |
|
Leonardo de Moura
|
a7b3dcbc09
|
perf(library/blast/state): do not add hypotheses that are Pi-expressions into discrimination trees
|
2016-02-02 18:50:23 -08:00 |
|
Leonardo de Moura
|
4324726a8e
|
perf(kernel/expr_eq_fn): minimize number of calls to check_system
|
2016-02-02 18:16:14 -08:00 |
|
Leonardo de Moura
|
c55b10af1b
|
perf(library/type_context): move check_system to strategic places
|
2016-02-02 16:12:53 -08:00 |
|
Leonardo de Moura
|
b508cf813c
|
perf(library/type_context): small optimization
|
2016-02-02 15:36:53 -08:00 |
|
Leonardo de Moura
|
bc86e9f179
|
perf(library/type_context): add caching for type_context::infer
|
2016-02-02 15:24:57 -08:00 |
|
Leonardo de Moura
|
bd52e58294
|
perf(util/name): use quick_cmp at name_pair_quick_cmp
|
2016-02-02 13:56:02 -08:00 |
|
Leonardo de Moura
|
cb203c3272
|
perf(src/util/name): if the hashcodes are equal, then there is a high probability the names are equal
So, we use == before trying cmp.
Reason: == is much faster.
|
2016-02-02 12:52:06 -08:00 |
|
Leonardo de Moura
|
a9cb9ff912
|
perf(util/name): more inlining
|
2016-02-02 09:49:50 -08:00 |
|
Leonardo de Moura
|
187bce307e
|
perf(src/util/name): inline hash
|
2016-02-02 09:21:01 -08:00 |
|
Leonardo de Moura
|
c779590517
|
feat(library/algebra/ring): add lemma
|
2016-01-30 16:34:59 -08:00 |
|
Leonardo de Moura
|
a7b37d0e09
|
perf(library/type_context): cache type class resolution failures too
|
2016-01-29 14:06:47 -08:00 |
|
Leonardo de Moura
|
6b137b7dd3
|
chore(library/blast/forward/ematch): improve comment
|
2016-01-29 11:55:51 -08:00 |
|
Leonardo de Moura
|
587c263c28
|
feat(library/blast/forward/ematch): improve support for casts in the e-matcher
|
2016-01-29 11:38:43 -08:00 |
|
Daniel Selsam
|
6ed6306c3f
|
fix(library/blast/unit/unit_propagate): use ppb when tracing
|
2016-01-27 15:23:52 -08:00 |
|
Leonardo de Moura
|
684995640a
|
fix(library/blast/unit/unit_propagate): memory access violation
|
2016-01-27 15:22:34 -08:00 |
|
Leonardo de Moura
|
fb95b71a5e
|
fix(library/blast/forward/pattern): bug in the pattern inference code
|
2016-01-27 13:39:19 -08:00 |
|
Leonardo de Moura
|
a713ca9686
|
feat(library/type_context): add helper method get_num_choice_points
|
2016-01-26 22:02:25 -08:00 |
|
Daniel Selsam
|
12e148c7b6
|
feat(library/blast/forward/ematch): even more tracing
|
2016-01-26 21:40:46 -08:00 |
|
Soonho Kong
|
30b5313118
|
feat(CMakeLists.txt): handle new/old ABIs issue for MSYS2 + g++ combination
related issue: #930
|
2016-01-26 20:41:20 -08:00 |
|
Daniel Selsam
|
2868ec9c43
|
fix(library/blast/trace): missing pragma
|
2016-01-26 20:41:01 -08:00 |
|
Daniel Selsam
|
eca079a4fc
|
feat(library/blast/unit/unit_propagate): basic tracing
|
2016-01-26 20:40:42 -08:00 |
|
Floris van Doorn
|
29c84aad19
|
fix(book.md): add types.arrow to 2.9
closes #976
|
2016-01-26 20:40:22 -08:00 |
|
Leonardo de Moura
|
810ee9759c
|
fix(library/blast/backward/backward_action): add missing normalize at backward_action, and remove incorrect fix at discrimination tree
|
2016-01-26 20:35:57 -08:00 |
|
Leonardo de Moura
|
4821af8685
|
feat(frontends/lean/scanner): disallow superscripts in identifiers
See new test for motivating example.
|
2016-01-26 18:46:40 -08:00 |
|
Leonardo de Moura
|
6f6672eaaa
|
fix(library/blast/discr_tree): ignore annotations in discrimination trees
|
2016-01-26 18:46:40 -08:00 |
|
Floris van Doorn
|
3409deecdb
|
chore(hott): update md files, move port.md
|
2016-01-24 16:34:45 -08:00 |
|
Floris van Doorn
|
8eab58f41a
|
fix(choice): make some style changes
|
2016-01-24 16:34:45 -08:00 |
|
seulbaek
|
92d6806073
|
refactor(hott/choice): rename 3.8.5
|
2016-01-24 16:34:35 -08:00 |
|
seulbaek
|
107550238b
|
refactor(hott/choice): rename lemmas for 3.8.2
|
2016-01-24 16:34:23 -08:00 |
|
seulbaek
|
d42f3d313f
|
feat(hott): add choice.hlean
|
2016-01-24 16:34:12 -08:00 |
|
seulbaek
|
2c81c93d69
|
feat(hott/types/equiv): add is_trunc_equiv to equiv.hlean
|
2016-01-24 16:33:59 -08:00 |
|
Jakob von Raumer
|
aa5e188179
|
feat(hott): add symmetry of pushouts and pointed pushouts
|
2016-01-24 16:30:26 -08:00 |
|
Jakob von Raumer
|
d8d3b0c0b2
|
feat(hott): add wedge sum of pointed types, neutrality of wedging with the unit type
|
2016-01-24 16:30:21 -08:00 |
|
Jakob von Raumer
|
664132b845
|
feat(hott): add calc lemmas for pointed equivalences, make pinl and pinr constructors
|
2016-01-24 16:30:16 -08:00 |
|
Jakob von Raumer
|
8d22e454e7
|
feat(hott): add theory about pointed pushouts
|
2016-01-24 16:30:12 -08:00 |
|
Jeremy Avigad
|
b4d8b1db33
|
fix(library/library.md): update and correct information. Fixes #973.
|
2016-01-24 16:26:58 -08:00 |
|
Jeremy Avigad
|
27865e1c8b
|
feat(library/algebra/order_bigops): add min and max over finsets and finite sets
|
2016-01-24 16:26:57 -08:00 |
|
Jeremy Avigad
|
53b2d90c90
|
feat(library/data/{set,finset}): add some useful facts
|
2016-01-24 16:26:57 -08:00 |
|
Jeremy Avigad
|
69d953126a
|
refactor(library/algebra/ordered_group,ordered_ring): add versions of classes with decidable linear order, for min and max
|
2016-01-24 16:26:57 -08:00 |
|