 08 Aug, 2016 1 commit


Ralf Jung authored
With Coq 8.6, you can no longer have intro patterns that give more names than the constructor has. Also, patterns with too few names are now interpreted as filling up with "?", rather than putting the unnamed parts into the goal again. Furthermore, it seems the behavior of "simplify_eq/=" changed, I guess hypotheses are considered in different order now. I managed to work around this, but it all seem kind of fragile. The next compilation failure is an "Anyomaly: ... Please report", so that's what I will do.

 02 Aug, 2016 1 commit


Robbert Krebbers authored

 27 Jul, 2016 1 commit


Robbert Krebbers authored

 22 Jul, 2016 5 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
There was not really a need for the lattice type classes, so I removed these.

Robbert Krebbers authored

Robbert Krebbers authored
These just make things more complicated, it would be more useful to declare (efficient) decision procedures for each instance, so that we can properly predict which instance we will get.

 12 Jul, 2016 1 commit


Robbert Krebbers authored

 11 Jul, 2016 1 commit


Robbert Krebbers authored
This class whose name is horrible and purpose is arbitrary seems to be a leftover of some experiment with ch2o, a long time a ago.

 05 Jul, 2016 1 commit


Robbert Krebbers authored

 31 May, 2016 1 commit


Robbert Krebbers authored

 23 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 05 Mar, 2016 2 commits
 04 Mar, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 03 Mar, 2016 1 commit


Robbert Krebbers authored

 24 Feb, 2016 3 commits


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.

Robbert Krebbers authored

Robbert Krebbers authored
Also, use "set_solver by tac" to specify a tactic.

 22 Feb, 2016 2 commits


Robbert Krebbers authored
In most cases there is a lot of duplicate proof search performed by both naive_solver and eauto. Especially since naive_solver calls its tactic (in the case of set_solver this used to be eauto) quite eagerly this made it very slow. Note that set_solver is this too slow and should be improved.

Robbert Krebbers authored
In most cases there is a lot of duplicate proof search performed by both naive_solver and eauto. Especially since naive_solver calls its tactic (in the case of set_solver this used to be eauto) quite eagerly this made it very slow. Note that set_solver is this too slow and should be improved.

 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.

Robbert Krebbers authored

 16 Feb, 2016 1 commit


Ralf Jung authored

 15 Feb, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 13 Feb, 2016 1 commit


Robbert Krebbers authored
Also, make our redefinition of done more robust under different orders of Importing modules.

 16 Jan, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This one (previously solve_elem_of) was hardly used. The tactic that uses naive_solver (previously esolve_elem_of, now solve_elem_of) has been extended with flags to say which hypotheses should be cleared/kept.

 04 Jan, 2016 1 commit


Ralf Jung authored

 11 Dec, 2015 1 commit


Robbert Krebbers authored

 20 Nov, 2015 1 commit


Robbert Krebbers authored
* Remove the order from RAs, it is now defined in terms of the ⋅ operation. * Define ownership using the stepindexed order. * Remove the order also from DRAs and change STS accordingly. While doing that, I changed STS to no longer use decidable token sets, which removes the requirement of decidable equality on tokens.

 18 Nov, 2015 1 commit


Robbert Krebbers authored

 17 Nov, 2015 1 commit


Robbert Krebbers authored

 16 Nov, 2015 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
