Leonardo de Moura 1726d37d4e fix(library/algebra/order): decidable_linear_order ... Add fields for decidable_eq and decidable_le. We need this because a concrete instance may have its own implementation that is not definitionally equal to the old ones defined at library/algebra/order.lean. Without this change, types such as nat and int would have multiple definitions for decidable_eq and decidable_le which are not definitionally equal.		2016-12-17 14:01:43 -08:00
..
algebra	fix(library/algebra/order): decidable_linear_order	2016-12-17 14:01:43 -08:00
category	feat(library/tools/super): add super prover	2016-12-16 18:18:13 -08:00
data	fix(library/algebra/order): decidable_linear_order	2016-12-17 14:01:43 -08:00
meta	feat(library/init/meta/simp_tactic, library/init/meta/interactive): add simp_using_hs	2016-12-17 12:54:04 -08:00
native	feat(library): add pre_monad	2016-12-08 12:48:55 -08:00
.gdb_history	chore(library, tests): switch to new attribute declaration syntax	2016-08-12 15:36:12 -07:00
classical.lean	refactor(library/data): delete init/data/instances.lean	2016-12-02 16:41:16 -08:00
coe.lean	refactor(library/data): delete init/data/instances.lean	2016-12-02 16:41:16 -08:00
core.lean	refactor(library/init): move combinator logic to core	2016-12-02 15:56:52 -08:00
default.lean	feat(*): C++ code generator	2016-12-05 16:11:41 -08:00
function.lean	refactor(library/init): create init.data folder	2016-12-02 14:23:06 -08:00
funext.lean	refactor(library/init): create init.data folder	2016-12-02 14:23:06 -08:00
init.md	chore(*.md): fix/remove broken links	2016-02-23 10:11:24 -08:00
logic.lean	feat(library/init/logic): alternative theorem names, and make some arguments explicit	2016-12-08 07:19:38 -08:00
propext.lean	refactor(library/init): move propext to its own file	2016-12-02 16:04:39 -08:00
util.lean	refactor(library/init): timeit, trace ==> util	2016-12-02 16:19:15 -08:00
wf.lean	refactor(library/init): merge some files	2016-12-02 16:13:45 -08:00