1. 03 Oct, 2016 1 commit
  2. 20 Sep, 2016 1 commit
  3. 08 Aug, 2016 1 commit
    • Ralf Jung's avatar
      Better Coq 8.6 compatibility · ae135201
      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.
      ae135201
  4. 02 Aug, 2016 1 commit
  5. 27 Jul, 2016 1 commit
  6. 22 Jul, 2016 5 commits
  7. 12 Jul, 2016 1 commit
  8. 11 Jul, 2016 1 commit
    • Robbert Krebbers's avatar
      Remove CollectionOps class. · d7643649
      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.
      d7643649
  9. 05 Jul, 2016 1 commit
  10. 31 May, 2016 1 commit
  11. 23 Mar, 2016 2 commits
  12. 10 Mar, 2016 1 commit
  13. 05 Mar, 2016 2 commits
  14. 04 Mar, 2016 2 commits
  15. 03 Mar, 2016 1 commit
  16. 24 Feb, 2016 3 commits
  17. 22 Feb, 2016 2 commits
    • Robbert Krebbers's avatar
      Let set_solver not use eauto by default. · 9aff6bb6
      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.
      9aff6bb6
    • Robbert Krebbers's avatar
      Let set_solver not use eauto by default. · de5f0f84
      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.
      de5f0f84
  18. 17 Feb, 2016 3 commits
  19. 16 Feb, 2016 1 commit
  20. 15 Feb, 2016 2 commits
  21. 13 Feb, 2016 1 commit
  22. 16 Jan, 2016 2 commits
  23. 04 Jan, 2016 1 commit
  24. 11 Dec, 2015 1 commit
  25. 20 Nov, 2015 1 commit
    • Robbert Krebbers's avatar
      Step-indexed order on CMRAs · 780f6b82
      Robbert Krebbers authored
      * Remove the order from RAs, it is now defined in terms of the ⋅ operation.
      * Define ownership using the step-indexed 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.
      780f6b82
  26. 18 Nov, 2015 1 commit