- Feb 25, 2016
-
-
Robbert Krebbers authored
It now turns setoid equalities into Leibniz equalities when possible, and substitutes those.
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Ralf Jung authored
In principle, we could now un-seal heap_mapsto, saved_prop_own etc., and mark them as "Typeclass Opaque", and ecancel would still work just as fast as it does now. Thanks to Matthieu for pointing me to this unify feature.
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Robbert Krebbers authored
Conflicts: prelude/tactics.v
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
This replaces f_equiv and solve_proper with our own, hopefully better, versions
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
The performance gain seems neglectable, unfortunatelly...
-
- Feb 24, 2016
-
-
Robbert Krebbers authored
* Use sig instead of sigT: the proof is a Prop after all * Tweak implicit arguments * Shorten proof of sigma
-
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
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
Conflicts: barrier/barrier.v
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-