Leonardo de Moura
|
bdc93cb7f4
|
refactor(library/init): change subtype notation and put it on the top-level
|
2016-07-23 12:30:11 -07:00 |
|
Leonardo de Moura
|
97719a4c5f
|
refactor(frontends/lean): disable '!' operator, and adjust standard library
|
2016-07-02 01:41:46 +01:00 |
|
Leonardo de Moura
|
413a0faf99
|
chore(library/data/nat/bquant): make sure we can generate code for bsub_succ
|
2016-05-23 17:50:01 -07:00 |
|
Leonardo de Moura
|
a208f9473c
|
refactor(library): reorder and rename decidable constructors
Motivation: make sure the "false" case will have constructor idx 0.
|
2016-05-10 17:30:22 -07:00 |
|
Leonardo de Moura
|
de64750621
|
chore(frontends/lean): disable expressions that use tactic framework
|
2016-04-25 15:07:26 -07:00 |
|
Jeremy Avigad
|
6913eb0c76
|
refactor(library/init/subtype.lean): put subtype notation in the namespace
The notation { x : A | P x } is overloaded in set, and is ambiguous.
|
2015-12-22 16:39:13 -05:00 |
|
Leonardo de Moura
|
ef546c5c5b
|
refactor(library): use anonymous instance implicit arguments
|
2015-12-13 11:46:48 -08:00 |
|
Leonardo de Moura
|
5a98a2538c
|
refactor(library): move basic simp/congr rules to init folder, delete some legacy files
|
2015-11-20 16:38:10 -08:00 |
|
Jeremy Avigad
|
dc8858d764
|
refactor(library/init/nat,library/): protect more nat theorems
|
2015-11-08 14:04:59 -08:00 |
|
Leonardo de Moura
|
d2eb99bf11
|
refactor(library/logic): move logic/choice.lean to init/classical.lean
choice axiom is now in the classical namespace.
|
2015-08-12 18:37:33 -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
|
9d83361fdc
|
refactor(library): use subtype instead of sigma
|
2015-07-16 22:48:33 -04:00 |
|
Leonardo de Moura
|
89f69630b6
|
feat(library): use sigma instead of exists (experimental)
|
2015-07-15 15:49:47 -04:00 |
|
Leonardo de Moura
|
d76edf331b
|
feat(library/data/nat/bquant): add not bex and not ball lemmas
|
2015-07-02 23:18:02 -07:00 |
|
Floris van Doorn
|
ff41886a32
|
feat(nat/bquant): give instances for quantification bounded with le
also add theorems c_iff_c to logic/connectives, where c is a connective
|
2015-06-04 20:14:13 -04:00 |
|
Floris van Doorn
|
7f5caab694
|
feat(nat): redefine le and lt in the standard library
|
2015-06-04 20:14:13 -04:00 |
|
Jeremy Avigad
|
8bebd104ff
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
Leonardo de Moura
|
3ede8e9150
|
refactor(library): use [] binder annotation when declaring instances
|
2015-02-24 16:12:39 -08:00 |
|
Leonardo de Moura
|
1cd44e894b
|
feat(library/tactic/class_instance_synth): conservative class-instance resolution: expand only definitions marked as reducible
closes #442
|
2015-02-24 16:12:35 -08:00 |
|
Jeremy Avigad
|
5bc6dd84cf
|
feat(library/data/nat): make nat an instance of comm_semiring
|
2014-12-23 21:14:35 -05:00 |
|
Leonardo de Moura
|
5cf8064269
|
refactor(library): rename exists_elim and exists_intro to exists.elim
and exists.intro
|
2014-12-15 19:07:38 -08:00 |
|
Leonardo de Moura
|
c6ebe9456e
|
feat(library/data/nat): add "bounded" quantifiers
Later, we will add support for arbitrary well-founded relations
|
2014-12-13 15:42:38 -08:00 |
|