1. 29 May, 2018 2 commits
  2. 17 May, 2018 1 commit
  3. 09 Dec, 2016 4 commits
  4. 08 Dec, 2016 1 commit
  5. 06 Dec, 2016 1 commit
  6. 24 Nov, 2016 1 commit
  7. 22 Nov, 2016 3 commits
    • Robbert Krebbers's avatar
      Make nclose an explicit coercion. · 274209c2
      Robbert Krebbers authored
      We do this by introducing a type class UpClose with notation ↑.
      
      The reason for this change is as follows: since `nclose : namespace
      → coPset` is declared as a coercion, the notation `nclose N ⊆ E` was
      pretty printed as `N ⊆ E`. However, `N ⊆ E` could not be typechecked
      because type checking goes from left to right, and as such would look
      for an instance `SubsetEq namespace`, which causes the right hand side
      to be ill-typed.
      274209c2
    • Ralf Jung's avatar
      new notation for pure assertions · 99cbb525
      Ralf Jung authored
      99cbb525
    • Ralf Jung's avatar
      use OFEs instead of COFEs everywhere · 75518c9a
      Ralf Jung authored
      Use COFEs only for the recursive domain equation solver
      75518c9a
  8. 09 Nov, 2016 2 commits
  9. 03 Nov, 2016 2 commits
  10. 01 Nov, 2016 3 commits
  11. 31 Oct, 2016 1 commit
  12. 28 Oct, 2016 2 commits
  13. 27 Oct, 2016 3 commits
  14. 25 Oct, 2016 4 commits
  15. 13 Oct, 2016 1 commit
  16. 12 Oct, 2016 1 commit
  17. 06 Oct, 2016 1 commit
  18. 05 Oct, 2016 1 commit
  19. 27 Sep, 2016 1 commit
  20. 19 Sep, 2016 1 commit
  21. 09 Sep, 2016 1 commit
    • Robbert Krebbers's avatar
      Support for specialization of P₁ -★ .. -★ Pₙ -★ Q where Q is persistent. · 090aaea3
      Robbert Krebbers authored
      Before this commit, given "HP" : P and "H" : P -★ Q with Q persistent, one
      could write:
      
        iSpecialize ("H" with "#HP")
      
      to eliminate the wand in "H" while keeping the resource "HP". The lemma:
      
        own_valid : own γ x ⊢ ✓ x
      
      was the prototypical example where this pattern (using the #) was used.
      
      However, the pattern was too limited. For example, given "H" : P₁ -★ P₂ -★ Q",
      one could not write iSpecialize ("H" with "#HP₁") because P₂ -★ Q is not
      persistent, even when Q is.
      
      So, instead, this commit introduces the following tactic:
      
        iSpecialize pm_trm as #
      
      which allows one to eliminate implications and wands while being able to use
      all hypotheses to prove the premises, as well as being able to use all
      hypotheses to prove the resulting goal.
      
      In the case of iDestruct, we now check whether all branches of the introduction
      pattern start with an `#` (moving the hypothesis to the persistent context) or
      `%` (moving the hypothesis to the pure Coq context). If this is the case, we
      allow one to use all hypotheses for proving the premises, as well as for proving
      the resulting goal.
      090aaea3
  22. 27 Aug, 2016 1 commit
  23. 26 Aug, 2016 1 commit
  24. 25 Aug, 2016 1 commit