1. 31 May, 2016 1 commit
  2. 23 Mar, 2016 2 commits
  3. 10 Mar, 2016 1 commit
  4. 05 Mar, 2016 2 commits
  5. 04 Mar, 2016 2 commits
  6. 03 Mar, 2016 1 commit
  7. 24 Feb, 2016 3 commits
  8. 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
  9. 17 Feb, 2016 3 commits
  10. 16 Feb, 2016 1 commit
  11. 15 Feb, 2016 2 commits
  12. 13 Feb, 2016 1 commit
  13. 16 Jan, 2016 2 commits
  14. 04 Jan, 2016 1 commit
  15. 11 Dec, 2015 1 commit
  16. 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
  17. 18 Nov, 2015 1 commit
  18. 17 Nov, 2015 1 commit
  19. 16 Nov, 2015 2 commits
  20. 11 Nov, 2015 1 commit