| .. |
|
algebra
|
fix(init/algebra/ordered_ring): theorem has two instances
|
2017-09-18 13:04:59 -07:00 |
|
category
|
chore(init/category/combinators): remove monad.for
|
2017-07-26 11:52:11 +01:00 |
|
data
|
feat(library/vm/vm_string): add builtin VM implementation for string.cmp
|
2017-10-23 10:55:26 -07:00 |
|
meta
|
feat(library/vm/vm_string): add builtin VM implementation for string.has_decidable_eq
|
2017-10-23 10:55:26 -07:00 |
|
native
|
chore(init/category/combinators): remove monad.for
|
2017-07-26 11:52:11 +01:00 |
|
cc_lemmas.lean
|
feat(frontends/lean): use . for field access
|
2017-03-28 15:29:54 -07:00 |
|
classical.lean
|
refactor(init/classical): simplify classical proofs
|
2017-07-28 16:47:53 +01:00 |
|
coe.lean
|
chore(library): convert comments to docstrings
|
2017-06-12 15:17:00 +02:00 |
|
core.lean
|
chore(library/init/core): declare and using structure
|
2017-09-05 15:08:20 -07:00 |
|
default.lean
|
feat(init/meta/attribute,library/tactic/attribute): user_attribute apply handlers
|
2017-08-02 14:32:39 +01:00 |
|
function.lean
|
refactor(frontends/lean/token_table,library): take ~> assume
|
2017-07-05 11:20:10 -07:00 |
|
funext.lean
|
refactor(frontends/lean/token_table,library): take ~> assume
|
2017-07-05 11:20:10 -07:00 |
|
init.md
|
chore(*.md): fix/remove broken links
|
2016-02-23 10:11:24 -08:00 |
|
logic.lean
|
feat(frontends/lean): recursive equation preprocessor
|
2017-08-18 15:06:11 -07:00 |
|
propext.lean
|
feat(frontends/lean): add support for t.<id> and t.<idx> when t is a composite term
|
2017-03-28 17:47:49 -07:00 |
|
relator.lean
|
refactor(frontends/lean/token_table,library): take ~> assume
|
2017-07-05 11:20:10 -07:00 |
|
util.lean
|
refactor(library): has_to_string ==> has_repr
|
2017-06-18 18:29:19 -07:00 |
|
wf.lean
|
refactor(frontends/lean/token_table,library): take ~> assume
|
2017-07-05 11:20:10 -07:00 |
