michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
lean2/library/data
History
Leonardo de Moura 064ecd3e3d refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package 
We also define key theorems that will be used to generate the
automatically generated a well-founded subterm relation for inductive
datatypes.
We also prove decidability and wf theorems asap.
2014-11-22 00:19:39 -08:00
..
bool refactor(library/data/bool): break into pieces to reduce dependencies 2014-11-07 08:41:14 -08:00
int refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package 2014-11-22 00:19:39 -08:00
list feat(library/definitional/cases_on): automatically add 'cases_on' 2014-10-25 17:22:02 -07:00
nat refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package 2014-11-22 00:19:39 -08:00
num refactor(data/num/string): break into pieces to reduce dependencies 2014-11-07 08:53:14 -08:00
prod refactor(library/logic): add basic definitions for relations at logic/relation.lean 2014-11-18 17:32:22 -08:00
quotient refactor(library/logic): add basic definitions for relations at logic/relation.lean 2014-11-18 17:32:22 -08:00
sigma refactor(library/data/prod/wf): remove duplication, and import wf's for sigma and prod 2014-11-16 21:19:10 -08:00
string refactor(data/num/string): break into pieces to reduce dependencies 2014-11-07 08:53:14 -08:00
unit fix(library/data/unit): missing file 2014-10-25 18:34:41 -07:00
data.md refactor(library): remove unnecessary 'standard' subdirectory 2014-08-23 18:08:09 -07:00
default.lean refactor(library): remove unnecessary 'standard' subdirectory 2014-08-23 18:08:09 -07:00
empty.lean feat(empty): define negation of types 2014-11-08 19:12:54 -08:00
fin.lean refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package 2014-11-22 00:19:39 -08:00
option.lean refactor(library/data/option): cleanup using 'no_confusion' 2014-11-16 17:56:51 -08:00
set.lean refactor(library): use 'reserve' notation in the standard library 2014-10-21 15:39:47 -07:00
subtype.lean refactor(library/data/subtype): define subtype using 'structure' command 2014-11-16 15:01:14 -08:00
sum.lean refactor(library/data/sum): use no_confusion construction to simplify proofs 2014-11-08 18:58:56 -08:00
vector.lean feat(library/data): define 'nat.addl' addition using recursion on the first argument, prove it to be equivalent to 'add', and use it to define vector.append 2014-11-17 22:03:39 -08:00