..
bool
refactor(library/init): create init.data folder
2016-12-02 14:23:06 -08:00
char
feat(library/init/meta): use cheap "reflexivity" after simp and rewrite
2016-12-08 14:41:26 -08:00
fin
refactor(library/init): create init.data folder
2016-12-02 14:23:06 -08:00
int
feat(library/init/data/int): import int by default
2016-12-15 16:59:36 -08:00
list
feat(library/tools/super): add super prover
2016-12-16 18:18:13 -08:00
nat
fix(library/algebra/order): decidable_linear_order
2016-12-17 14:01:43 -08:00
num
refactor(library/init): create init.data folder
2016-12-02 14:23:06 -08:00
option
feat(library/tools/super): add super prover
2016-12-16 18:18:13 -08:00
sigma
refactor(library/init): move combinator logic to core
2016-12-02 15:56:52 -08:00
string
refactor(library/init): create init.data folder
2016-12-02 14:23:06 -08:00
subtype
refactor(library/data): delete init/data/instances.lean
2016-12-02 16:41:16 -08:00
sum
refactor(library/data): delete init/data/instances.lean
2016-12-02 16:41:16 -08:00
basic.lean
refactor(library/data): delete init/data/instances.lean
2016-12-02 16:41:16 -08:00
default.lean
feat(library/init/data/int): import int by default
2016-12-15 16:59:36 -08:00
ordering.lean
refactor(library/init): create init.data folder
2016-12-02 14:23:06 -08:00
prod.lean
refactor(library/init): merge some files
2016-12-02 16:13:45 -08:00
quot.lean
refactor(library/init): move propext to its own file
2016-12-02 16:04:39 -08:00
set.lean
refator(library/init/data/set): make implicit argument in subset weak
2016-12-08 07:20:12 -08:00
setoid.lean
refactor(library/init): merge some files
2016-12-02 16:13:45 -08:00
to_string.lean
refactor(library/data): delete init/data/instances.lean
2016-12-02 16:41:16 -08:00
unit.lean
refactor(library/data): delete init/data/instances.lean
2016-12-02 16:41:16 -08:00
unsigned.lean
feat(library/tools/super): add super prover
2016-12-16 18:18:13 -08:00