1. 13 Sep, 2019 1 commit
    • Jacques-Henri Jourdan's avatar
      Reorder Requires so that we do not depend of Export bugs. · 43a1a90f
      Jacques-Henri Jourdan authored
      The general idea is to first import/export modules which are further
      than the current one, and then import/export modules which are close
      dependencies.
      
      This commit tries to use the same order of imports for every file, and
      describes the convention in ProofGuide.md. There is one exception,
      where we do not follow said convention: in program_logic/weakestpre.v,
      using that order would break printing of texan triples (??).
      43a1a90f
  2. 24 May, 2019 1 commit
    • Robbert Krebbers's avatar
      More consistent naming for `auth`. · 597ec42e
      Robbert Krebbers authored
      This MR is a follow up on the renamings performed (implicitly) as part of
      !215. This MR makes the following changes:
      
      - `auth_both_frac_valid` and `auth_both_valid` are now of the same shape
        as `auth_both_frac_validN` and `auth_both_validN`. That is, both are
        now biimplications.
      - The left-to-right  direction of `auth_both_frac_valid` and
        `auth_both_valid` only holds in case the camera is discrete. The
        right-to-left versions for non-discrete cameras are prefixed `_2`, the
        convention that we use throughout the development.
      - Change the direction of lemmas like `auth_frag_valid` and
        `auth_auth_valid` so that it's consistent with the other lemmas. I.e.
        make sure that the ◯ and ● are always on the LHS of the biimplication.
      597ec42e
  3. 23 May, 2019 1 commit
  4. 06 Mar, 2019 1 commit
  5. 05 Mar, 2019 1 commit
  6. 24 Jan, 2019 1 commit
  7. 26 Apr, 2018 1 commit
  8. 25 Apr, 2018 1 commit
  9. 30 Oct, 2017 1 commit
  10. 25 Oct, 2017 3 commits
  11. 17 Sep, 2017 1 commit
  12. 17 Aug, 2017 1 commit
  13. 08 Jun, 2017 1 commit
  14. 24 Mar, 2017 1 commit
    • Robbert Krebbers's avatar
      Generic big operators that are no longer tied to CMRAs. · 6fbff46e
      Robbert Krebbers authored
      Instead, I have introduced a type class `Monoid` that is used by the big operators:
      
          Class Monoid {M : ofeT} (o : M → M → M) := {
            monoid_unit : M;
            monoid_ne : NonExpansive2 o;
            monoid_assoc : Assoc (≡) o;
            monoid_comm : Comm (≡) o;
            monoid_left_id : LeftId (≡) monoid_unit o;
            monoid_right_id : RightId (≡) monoid_unit o;
          }.
      
      Note that the operation is an argument because we want to have multiple monoids over
      the same type (for example, on `uPred`s we have monoids for `∗`, `∧`, and `∨`). However,
      we do bundle the unit because:
      
      - If we would not, the unit would appear explicitly in an implicit argument of the
        big operators, which confuses rewrite. By bundling the unit in the `Monoid` class
        it is hidden, and hence rewrite won't even see it.
      - The unit is unique.
      
      We could in principle have big ops over setoids instead of OFEs. However, since we do
      not have a canonical structure for bundled setoids, I did not go that way.
      6fbff46e
  15. 21 Mar, 2017 2 commits
  16. 27 Jan, 2017 1 commit
  17. 09 Jan, 2017 1 commit
  18. 06 Jan, 2017 1 commit
  19. 05 Jan, 2017 1 commit
  20. 03 Jan, 2017 1 commit
  21. 09 Dec, 2016 1 commit
  22. 24 Nov, 2016 1 commit
  23. 22 Nov, 2016 2 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
  24. 17 Nov, 2016 1 commit
  25. 03 Nov, 2016 1 commit
    • Robbert Krebbers's avatar
      Use symbol ∗ for separating conjunction. · cc31476d
      Robbert Krebbers authored
      The old choice for ★ was a arbitrary: the precedence of the ASCII asterisk *
      was fixed at a wrong level in Coq, so we had to pick another symbol. The ★ was
      a random choice from a unicode chart.
      
      The new symbol ∗ (as proposed by David Swasey) corresponds better to
      conventional practise and matches the symbol we use on paper.
      cc31476d
  26. 28 Oct, 2016 2 commits
  27. 25 Oct, 2016 4 commits
  28. 12 Oct, 2016 2 commits
  29. 06 Oct, 2016 1 commit
  30. 05 Oct, 2016 1 commit
  31. 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