lean4-htt/library/init/meta
2017-05-17 10:38:12 -07:00
..
lean feat(init): add default value proofs to the monadic hierarchy 2017-03-27 13:42:08 -07:00
smt refactor(init/meta/expr): unify expr and pexpr 2017-05-17 10:38:12 -07:00
ac_tactics.lean feat(frontends/lean): 'mutual' and 'meta' are now keywords 2016-09-24 10:44:40 -07:00
async_tactic.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
attribute.lean feat(frontends/lean): swap (t) and ``(t) semantics 2017-05-15 09:41:31 -07:00
backward.lean chore(library/init): definition => def 2016-10-06 16:04:12 -07:00
comp_value_tactics.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
congr_lemma.lean refactor(library/init/meta/congr_lemma): cleanup congr_lemma API 2017-01-31 16:46:13 -08:00
constructor_tactic.lean feat(frontends/lean): use . for field access 2017-03-28 15:29:54 -07:00
contradiction_tactic.lean feat(frontends/lean): swap (t) and ``(t) semantics 2017-05-15 09:41:31 -07:00
converter.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
decl_cmds.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
declaration.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
default.lean chore(library/inductive_compiler/nested.cpp): prove all theorems in C++ 2017-05-04 16:34:32 -07:00
environment.lean feat(library/class): add attribute for tracking symbols occurring in instances of type classes 2017-05-01 18:02:30 -07:00
exceptional.lean feat(frontends/lean): change notation for inaccessible patterns 2017-03-28 16:09:15 -07:00
expr.lean refactor(init/meta/expr): unify expr and pexpr 2017-05-17 10:38:12 -07:00
format.lean feat(init/meta): add has_to_format instances and prefer direct has_to_tactic_format implementations 2017-04-11 17:07:28 -07:00
fun_info.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
has_reflect.lean feat(frontends/lean): swap (t) and ``(t) semantics 2017-05-15 09:41:31 -07:00
injection_tactic.lean feat(frontends/lean): use . for field access 2017-03-28 15:29:54 -07:00
interaction_monad.lean feat(frontends/lean): use . for field access 2017-03-28 15:29:54 -07:00
interactive.lean refactor(init/meta/expr): unify expr and pexpr 2017-05-17 10:38:12 -07:00
level.lean feat(frontends/lean/elaborator): coercion from (decidable) Prop to bool 2017-02-14 18:41:32 -08:00
match_tactic.lean feat(library/init/category): add has_map type class, delete fmap 2017-05-01 10:13:02 -07:00
mk_dec_eq_instance.lean refactor(library): remove all instances of `(...) 2017-05-12 19:13:48 +02:00
mk_has_sizeof_instance.lean refactor(init/meta,tools): rename now tactic to done 2017-05-03 11:18:31 +02:00
mk_inhabited_instance.lean refactor(init/meta,tools): rename now tactic to done 2017-05-03 11:18:31 +02:00
name.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
occurrences.lean feat(frontends/lean/elaborator): coercion from (decidable) Prop to bool 2017-02-14 18:41:32 -08:00
options.lean feat(frontends/lean): no global universes in the frontend 2017-02-08 17:23:04 -08:00
pexpr.lean refactor(init/meta/expr): unify expr and pexpr 2017-05-17 10:38:12 -07:00
rb_map.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
rec_util.lean feat(frontends/lean): use . for field access 2017-03-28 15:29:54 -07:00
relation_tactics.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
rewrite_tactic.lean refactor(library/init/meta): avoid '_core' idiom using default parameters 2017-02-14 09:46:55 -08:00
set_get_option_tactics.lean chore(library/init): definition => def 2016-10-06 16:04:12 -07:00
simp_tactic.lean feat(library/tactic): start algebraic normalizer 2017-05-15 21:46:19 -07:00
tactic.lean refactor(init/meta/expr): unify expr and pexpr 2017-05-17 10:38:12 -07:00
task.lean feat(init): add default value proofs to the monadic hierarchy 2017-03-27 13:42:08 -07:00
transfer.lean refactor(init/meta/expr): unify expr and pexpr 2017-05-17 10:38:12 -07:00
vm.lean feat(library): add functor, applicative, and monad laws, and prove them correct for non-meta instances 2017-03-27 13:42:08 -07:00