1. 22 Jan, 2017 1 commit
  2. 11 Jan, 2017 5 commits
  3. 09 Jan, 2017 2 commits
  4. 06 Jan, 2017 2 commits
    • Ralf Jung's avatar
      587cde16
    • Robbert Krebbers's avatar
      Renaming in prelude/list. · ddf8ef49
      Robbert Krebbers authored
      Rename:
      
      - prefix_of -> prefix and suffix_of -> suffix because that saves keystrokes
        in lemma names. However, keep the infix notations with l1 `prefix_of` l2 and
        l1 `suffix_of` l2 because those are easier to read.
      - change the notation l1 `sublist` l2 into l1 `sublist_of` l2 to be consistent.
      - rename contains -> submseteq and use the notation ⊆+
      ddf8ef49
  5. 05 Jan, 2017 4 commits
  6. 04 Jan, 2017 3 commits
  7. 03 Jan, 2017 1 commit
  8. 27 Dec, 2016 2 commits
  9. 23 Dec, 2016 2 commits
  10. 22 Dec, 2016 5 commits
  11. 21 Dec, 2016 1 commit
  12. 20 Dec, 2016 2 commits
  13. 16 Dec, 2016 2 commits
  14. 13 Dec, 2016 2 commits
    • 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
    • Jacques-Henri Jourdan's avatar
      ef5af56a
  15. 12 Dec, 2016 1 commit
  16. 09 Dec, 2016 1 commit