lean4-htt

Author SHA1 Message Date

Author	SHA1	Message	Date
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
Leonardo de Moura	72134a7bbd	feat(library/equations_compiler/wf_rec): provide recursive equations to rel_tac rel_tac is a tactic used for synthesizing a well founded relation. The default implementation just uses type class resolution. More sophisticated strategies may need to access the set of recursive equations. This commit addresses this need.	2017-05-30 16:55:37 -07:00

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

Leonardo de Moura

72134a7bbd

feat(library/equations_compiler/wf_rec): provide recursive equations to rel_tac

rel_tac is a tactic used for synthesizing a well founded relation.
The default implementation just uses type class resolution.
More sophisticated strategies may need to access the set of recursive
equations. This commit addresses this need.

2017-05-30 16:55:37 -07:00

2 commits