1. 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
  2. 21 Mar, 2017 2 commits
  3. 27 Jan, 2017 1 commit
  4. 09 Jan, 2017 1 commit
  5. 06 Jan, 2017 1 commit
  6. 05 Jan, 2017 1 commit
  7. 03 Jan, 2017 1 commit
  8. 09 Dec, 2016 1 commit
  9. 24 Nov, 2016 1 commit
  10. 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
  11. 17 Nov, 2016 1 commit
  12. 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
  13. 28 Oct, 2016 2 commits
  14. 25 Oct, 2016 4 commits
  15. 12 Oct, 2016 2 commits
  16. 06 Oct, 2016 1 commit
  17. 05 Oct, 2016 1 commit
  18. 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
  19. 09 Aug, 2016 1 commit
  20. 08 Aug, 2016 1 commit
  21. 05 Aug, 2016 3 commits
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
      More introduction patterns. · 4d8c4ac8
      Robbert Krebbers authored
      Also make those for introduction and elimination more symmetric:
      
        !%   pure introduction         %        pure elimination
        !#   always introduction       #        always elimination
        !>   later introduction        > pat    timeless later elimination
        !==> view shift introduction   ==> pat  view shift elimination
      4d8c4ac8
    • Robbert Krebbers's avatar
      Iris 3.0: invariants and weakest preconditions encoded in the logic. · 1f589858
      Robbert Krebbers authored
      This commit features:
      
      - A simpler model. The recursive domain equation no longer involves a triple
        containing invariants, physical state and ghost state, but just ghost state.
        Invariants and physical state are encoded using (higher-order) ghost state.
      
      - (Primitive) view shifts are formalized in the logic and all properties about
        it are proven in the logic instead of the model. Instead, the core logic
        features only a notion of raw view shifts which internalizing performing frame
        preserving updates.
      
      - A better behaved notion of mask changing view shifts. In particular, we no
        longer have side-conditions on transitivity of view shifts, and we have a
        rule for introduction of mask changing view shifts |={E1,E2}=> P with
        E2 ⊆ E1 which allows to postpone performing a view shift.
      
      - The weakest precondition connective is formalized in the logic using Banach's
        fixpoint. All properties about the connective are proven in the logic instead
        of directly in the model.
      
      - Adequacy is proven in the logic and uses a primitive form of adequacy for
        uPred that only involves raw views shifts and laters.
      
      Some remarks:
      
      - I have removed binary view shifts. I did not see a way to describe all rules
        of the new mask changing view shifts using those.
      - There is no longer the need for the notion of "frame shifting assertions" and
        these are thus removed. The rules for Hoare triples are thus also stated in
        terms of primitive view shifts.
      
      TODO:
      
      - Maybe rename primitive view shift into something more sensible
      - Figure out a way to deal with closed proofs (see the commented out stuff in
        tests/heap_lang and tests/barrier_client).
      1f589858
  22. 02 Aug, 2016 1 commit
  23. 27 Jul, 2016 2 commits
    • Robbert Krebbers's avatar
      Declare inG arguments of own_* implicit but not maximally inserted. · de9438cb
      Robbert Krebbers authored
      This way type class inference is not invokved when used in tactics
      like iPvs while not having to write an @.
      
      (Idea suggested by Ralf.)
      de9438cb
    • Robbert Krebbers's avatar
      Make type class inference for inG less eager. · a0348d7c
      Robbert Krebbers authored
      This way, it won't pick arbitrary (and possibly wrong!) inG instances
      when multiple ones are available. We achieve this by declaring:
      
        Hint Mode inG - - +
      
      So that type class inference only succeeds when the type of the ghost
      variable does not include any evars.
      
      This required me to make some minor changes throughout the whole
      development making some types explicit.
      a0348d7c
  24. 13 Jul, 2016 1 commit
  25. 03 Jul, 2016 2 commits
  26. 16 Jun, 2016 3 commits
  27. 01 Jun, 2016 1 commit