max/lean4-htt
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 2
lean4-htt/library/init/meta
History
Leonardo de Moura 76799db032 feat(library/init/meta/interactive): simph ==> simp [*] 
This modification was suggested by @kha.

TODO:
- Use `simp [-f]` instead of `simp without f`
- Allow users to remove hypothesis from `*`. Example: `simp [*, -h]`
  for simplify using all hypotheses but `h`.
2017-07-03 15:14:47 -07:00
..
converter feat(library/init/meta/interactive): simph ==> simp [*] 2017-07-03 15:14:47 -07:00
lean feat(library/init/meta/converter/interactive): add for tactic to conv mode 2017-06-30 21:27:17 -07:00
smt feat(library/init/meta/interactive): simph ==> simp [*] 2017-07-03 15:14:47 -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 refactor(library): has_to_string ==> has_repr 2017-06-18 18:29:19 -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
coinductive_predicates.lean feat(library/tactic/apply_tactic): make apply tactic more robust 2017-06-27 10:42:26 -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
congr_tactic.lean feat(init/meta/congr_tactic.lean): tactic to apply congruence rules 2017-06-26 09:17:53 -04:00
constructor_tactic.lean feat(library/tactic/apply_tactic): make apply tactic more robust 2017-06-27 10:42:26 -07:00
contradiction_tactic.lean feat(frontends/lean): swap (t) and ``(t) semantics 2017-05-15 09:41:31 -07:00
decl_cmds.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
declaration.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
default.lean feat(init/meta/congr_tactic.lean): tactic to apply congruence rules 2017-06-26 09:17:53 -04:00
environment.lean refactor(init/meta/coinductive_predicates,frontends/lean/inductive_cmds): declare coinductive in Lean 2017-06-19 11:27:12 -07:00
exceptional.lean refactor(library): add has_to_string back (but it produces unquoted values) 2017-06-18 18:30:10 -07:00
expr.lean feat(library/init/meta/interactive): unfold is now based on the simp framework 2017-07-02 11:30:48 -07:00
format.lean chore(library): remove workarounds for issue #1682 2017-06-19 16:09:12 -07:00
fun_info.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
has_reflect.lean fix(reflect): move format instance to expr.lean 2017-06-08 15:54:41 +02:00
hole_command.lean chore(library): remove workarounds for issue #1682 2017-06-19 16:09:12 -07:00
injection_tactic.lean feat(library/tactic/apply_tactic): make apply tactic more robust 2017-06-27 10:42:26 -07:00
interaction_monad.lean fix(library/init/meta): make sure rw still produces useful error messages 2017-06-21 20:58:59 -07:00
interactive.lean feat(library/init/meta/interactive): simph ==> simp [*] 2017-07-03 15:14:47 -07:00
interactive_base.lean feat(frontends/lean,init/meta/interactive): assume and suppose tactics 2017-06-27 18:50:10 -07:00
level.lean fix(library): expr, level, hash_map, rb_map has_repr instances should be has_to_string since they do not produce results that can be parsed by Lean 2017-06-18 18:33:27 -07:00
match_tactic.lean feat(library/tactic/match_tactic): automatically convert metavariables occurring in patterns into temporary metavariables (i.e., which are considered during matching) 2017-06-29 11:39:18 -07:00
mk_dec_eq_instance.lean feat(library/tactic/apply_tactic): make apply tactic more robust 2017-06-27 10:42:26 -07: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 feat(init/meta/interactive): declare format! and sformat! macros and start putting them to use 2017-06-07 10:09:38 -07:00
name.lean fix(library/init): name has_repr instance is actually a has_to_string instance 2017-06-18 18:33:16 -07:00
occurrences.lean refactor(library): has_to_string ==> has_repr 2017-06-18 18:29:19 -07:00
options.lean feat(frontends/lean): no global universes in the frontend 2017-02-08 17:23:04 -08:00
pexpr.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
rb_map.lean feat(library/init/meta/expr): add expr.has_local_in 2017-07-01 20:23:37 -07:00
rec_util.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
ref.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
relation_tactics.lean feat(library/tactic/apply_tactic): make apply tactic more robust 2017-06-27 10:42:26 -07:00
rewrite_tactic.lean feat(library/init/meta/rewrite_tactic): improve rewrite tactic 2017-06-30 12:03:27 -07:00
set_get_option_tactics.lean chore(library/init): definition => def 2016-10-06 16:04:12 -07:00
simp_tactic.lean refactor(library/init/meta/simp_tactic): tactic.simp_at => tactic.simp_hyp 2017-07-03 14:07:18 -07:00
tactic.lean fix(library/init/meta/tactic): by_cases tactic 2017-07-02 21:34:10 -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(library): has_to_string ==> has_repr 2017-06-18 18:29:19 -07:00
vm.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
well_founded_tactics.lean feat(library/init/meta/simp_tactic): add option for reducing [reducible] definitions at dsimp, and to_unfold : list name similar to the one in the simp tactic 2017-07-03 13:28:46 -07:00