1. 28 Dec, 2016 2 commits
  2. 27 Dec, 2016 3 commits
  3. 26 Dec, 2016 2 commits
  4. 23 Dec, 2016 4 commits
  5. 22 Dec, 2016 6 commits
  6. 21 Dec, 2016 2 commits
  7. 20 Dec, 2016 4 commits
  8. 19 Dec, 2016 1 commit
  9. 18 Dec, 2016 3 commits
  10. 16 Dec, 2016 3 commits
  11. 15 Dec, 2016 1 commit
  12. 14 Dec, 2016 6 commits
  13. 13 Dec, 2016 3 commits
    • Ralf Jung's avatar
      agree: prove non-step-indexed uninjection · a953a68d
      Ralf Jung authored
      a953a68d
    • Robbert Krebbers's avatar
      Use different module structuring of uPred. · 766dbcd2
      Robbert Krebbers authored
      This fixes the following issue by JH Jourdan:
      
        The fact of including uPred_[...] in the module uPred (in base_logic.v),
        implies that typeclasses instances are declared twice. Once in module
        uPred and once in module uPred_[...]. This has the unfortunate
        consequence that it has to backtrack to both instances each time the
        first one fails, making failure of type class search for e.g.
        PersistentP potentially exponential.
      
        Goal ((□ ∀ (x1 x2 x3 x4 x5: nat), True -∗ True) -∗ True : iProp Σ).
          Time iIntros "#H".
          Undo.
          Remove Hints uPred_derived.forall_persistent : typeclass_instances.
          Time iIntros "#H".
      
      Thanks to Jason Gross @ Coq club for suggesting this fix.
      766dbcd2
    • Ralf Jung's avatar