Leonardo de Moura 6dbcf86fd4 feat(library/logic/axioms): use diaconescu to prove em ... With the new "noncomputable" feature we can use Hilbert's choice without being concerned it may accidentaly "leak" inside definitions we don't want to use it.		2015-07-29 13:01:07 -07:00
..
algebra	feat(library): add 'noncomputable' keyword for the standard library	2015-07-28 21:56:35 -07:00
data	feat(frontends/lean): check for noncomputability when moving theorems from theorem_queue to environment	2015-07-29 13:01:07 -07:00
examples	chore(examples/ex): move example to library	2015-05-13 17:07:10 -07:00
init	feat(library): add 'noncomputable' keyword for the standard library	2015-07-28 21:56:35 -07:00
logic	feat(library/logic/axioms): use diaconescu to prove em	2015-07-29 13:01:07 -07:00
theories	feat(library/theories/number_theory/prime_factorization): prove that n is equal to its prime factorization	2015-07-27 15:16:16 -07:00
tools	feat(frontends/lean): add simp tactic frontend stub	2015-07-14 09:54:53 -04:00
.gitignore	chore(library/.gitignore): update	2014-08-29 10:31:16 -07:00
.project	chore(library): add .project file	2014-08-29 10:31:16 -07:00
classical.lean	refactor(library/*): remove 'Module:' lines	2015-05-23 20:52:23 +10:00
library.md	fix(hott/*.md,library/*.md): use the word 'file' instead of 'module'	2015-05-25 16:50:42 -07:00
standard.lean	refactor(library/*): remove 'Module:' lines	2015-05-23 20:52:23 +10:00