1. 07 Apr, 2017 1 commit
  2. 05 Apr, 2017 1 commit
  3. 04 Apr, 2017 1 commit
  4. 09 Mar, 2017 1 commit
  5. 01 Mar, 2017 1 commit
  6. 05 Jan, 2017 2 commits
  7. 03 Jan, 2017 1 commit
  8. 21 Dec, 2016 1 commit
  9. 13 Dec, 2016 1 commit
    • 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
  10. 09 Dec, 2016 1 commit
  11. 05 Dec, 2016 1 commit
    • Robbert Krebbers's avatar
      New definition of contractive. · 176a588c
      Robbert Krebbers authored
      Using this new definition we can express being contractive using a
      Proper. This has the following advantages:
      
      - It makes it easier to state that a function with multiple arguments
        is contractive (in all or some arguments).
      - A solve_contractive tactic can be implemented by extending the
        solve_proper tactic.
      176a588c
  12. 22 Nov, 2016 1 commit
  13. 25 Oct, 2016 1 commit