Leonardo de Moura 59b11c815c refactor(library/data/list/perm): remove unnessary lambda abstractions ... The contradiction tactic takes care of it.		2015-04-30 14:02:19 -07:00
..
as_type.lean	feat(library/data): add structure for converting a list of elements into a type, and then show the resultant type is a finite type	2015-04-12 17:33:58 -07:00
basic.lean	refactor(library,hott): use/test new 'contradiction' tactic in the standard and hott libraries	2015-04-30 13:56:12 -07:00
bigop.lean	feat(library/data/list/bigop): add bigop perm theorem	2015-04-10 06:01:23 -07:00
comb.lean	feat(frontends/lean): nicer syntax for 'intros' 'reverts' and 'clears'	2015-04-30 11:00:39 -07:00
default.lean	feat(library/data): add structure for converting a list of elements into a type, and then show the resultant type is a finite type	2015-04-12 17:33:58 -07:00
list.md	refactor(library): remove unnecessary 'standard' subdirectory	2014-08-23 18:08:09 -07:00
perm.lean	refactor(library/data/list/perm): remove unnessary lambda abstractions	2015-04-30 14:02:19 -07:00
set.lean	fix(library/algebra/function): terminology	2015-04-16 20:52:18 -07:00