 01 Jul, 2016 1 commit


Robbert Krebbers authored

 30 Jun, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
In particular, it no longer uses set_solver (which made it often slow or diverge) but a more specific lemma about subseteq.

 23 Mar, 2016 1 commit


Robbert Krebbers authored

 10 Mar, 2016 1 commit


Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 24 Feb, 2016 1 commit


Robbert Krebbers authored
It now traverses terms at most once, whereas the setoid_rewrite approach was travering terms many times. Also, the tactic can now be extended by defining type class instances.

 23 Feb, 2016 2 commits
 22 Feb, 2016 2 commits


Robbert Krebbers authored
The non applied one should be only parsing.

Ralf Jung authored

 19 Feb, 2016 1 commit


Robbert Krebbers authored

 18 Feb, 2016 1 commit


Ralf Jung authored

 17 Feb, 2016 3 commits


Robbert Krebbers authored
It is doing much more than just dealing with ∈, it solves all kinds of goals involving set operations (including ≡ and ⊆).

Robbert Krebbers authored
simplify_equality => simplify_eq simplify_equality' => simplify_eq/= simplify_map_equality => simplify_map_eq simplify_map_equality' => simplify_map_eq/= simplify_option_equality => simplify_option_eq simplify_list_equality => simplify_list_eq f_equal' => f_equal/= The /= suffixes (meaning: do simpl) are inspired by ssreflect.

Ralf Jung authored

 16 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
Now that there is more of it, it deserves its own place :).
