michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
lean2/library/data
History
Leonardo de Moura cd17618f4a refactor(library): replace 'calc_trans', 'calc_symm', 'calc_refl' and 'calc_subst' commands with attributes '[symm]', '[refl]', '[trans]' and '[subst]' 
These attributes are used by the calc command.
They will also be used by tactics such as 'reflexivity', 'symmetry' and
'transitivity'.

See issue #500
2015-05-02 15:15:35 -07:00
..
examples chore(library): remove some unnecessary parentheses 2015-04-29 14:39:59 -07:00
finset feat(library/data/finset/comb): add cross_product to finset 2015-04-11 19:46:04 -07:00
int refactor(library): replace 'calc_trans', 'calc_symm', 'calc_refl' and 'calc_subst' commands with attributes '[symm]', '[refl]', '[trans]' and '[subst]' 2015-05-02 15:15:35 -07:00
list refactor(library): replace 'calc_trans', 'calc_symm', 'calc_refl' and 'calc_subst' commands with attributes '[symm]', '[refl]', '[trans]' and '[subst]' 2015-05-02 15:15:35 -07:00
nat refactor(library,hott): use/test new 'contradiction' tactic in the standard and hott libraries 2015-04-30 13:56:12 -07:00
quotient feat(library/init): move propext to init/quot, add Jeremy's funext theorem 2015-04-01 12:36:33 -07:00
rat refactor(library): replace 'calc_trans', 'calc_symm', 'calc_refl' and 'calc_subst' commands with attributes '[symm]', '[refl]', '[trans]' and '[subst]' 2015-05-02 15:15:35 -07:00
set feat(library/data/set): add theory of functions and maps between sets 2015-04-08 09:46:34 -07:00
bool.lean feat(library/data/bool): add auxiliary theorems for bool 2015-03-30 04:55:28 -07:00
countable.lean refactor(library/data): rename 'countable' to 'encodable', define countable in the usual way, and prove all 'encodable' type is 'countable' 2015-04-19 14:20:47 -07:00
data.md feat(library/data/rat/basic.lean): begin theory of rationals, show rat is a field 2015-04-18 11:39:52 -07:00
default.lean refactor(library/data/set): expand set.lean to set directory 2015-04-05 09:27:15 -04:00
empty.lean refactor(library/init): move subsingleton to init folder 2015-04-01 11:57:29 -07:00
encodable.lean refactor(library): test new tactics in the standard library 2015-05-01 18:18:29 -07:00
fin.lean refactor(library/data/fin): cleanup pattern matching equations 2015-03-05 14:42:42 -08:00
fintype.lean refactor(library): test new tactics in the standard library 2015-05-01 18:18:29 -07:00
num.lean refactor(library,hott): use/test new 'contradiction' tactic in the standard and hott libraries 2015-04-30 13:56:12 -07:00
option.lean refactor(library): test new tactics in the standard library 2015-05-01 18:18:29 -07:00
prod.lean feat(library/data/prod): define swap 2015-04-01 17:30:37 -07:00
sigma.lean refactor(library): reorganize init folder and add setoid 2015-03-31 19:56:05 -07:00
squash.lean feat(library/data/squash): define squash type using quotients 2015-04-24 18:11:25 -07:00
string.lean refactor(library/data/string): put is_inhabited theorems on the toplevel 2015-01-10 14:07:20 -08:00
subtype.lean feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-25 16:20:44 -08:00
sum.lean refactor(library): test new tactics in the standard library 2015-05-01 18:18:29 -07:00
unit.lean refactor(library/init): move subsingleton to init folder 2015-04-01 11:57:29 -07:00
uprod.lean feat(library/data): define unordered pairs using quotients 2015-04-01 17:30:49 -07:00
vector.lean feat(frontends/lean): nicer syntax for 'intros' 'reverts' and 'clears' 2015-04-30 11:00:39 -07:00