1. 27 Sep, 2016 1 commit
  2. 20 Sep, 2016 1 commit
  3. 19 Sep, 2016 3 commits
    • Robbert Krebbers's avatar
      Attempt at an iInduction tactic. · 9eb50174
      Robbert Krebbers authored
      This comment mostly addresses issue #34.
      There are still some issues:
      - For iLöb we can write `iLöb (x1 .. xn) as "IH"` to revert x1 .. xn
        before performing Löb induction. An analogue notation for iInduction
        results in parsing conflicts.
      - The names of the induction hypotheses in the Coq intro pattern are
        ignored. Instead, when using `iInduction x as pat "IH"` the induction
        hypotheses are given fresh names starting with "IH". The problem here
        is that the names in the introduction pattern are idents, whereas the
        induction hypotheses are inserted into the proof mode context, and thus
        need to have strings as names.
    • Robbert Krebbers's avatar
      Support for framing pure hypotheses. · 75ad3b2e
      Robbert Krebbers authored
      This closes issue 32.
    • Robbert Krebbers's avatar
  4. 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.
  5. 05 Sep, 2016 1 commit
  6. 30 Aug, 2016 1 commit
  7. 25 Aug, 2016 1 commit
  8. 24 Aug, 2016 2 commits
  9. 05 Aug, 2016 2 commits
    • Robbert Krebbers's avatar
    • 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.
      - 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).
  10. 28 Jul, 2016 2 commits
  11. 27 Jul, 2016 1 commit
  12. 25 Jul, 2016 4 commits
  13. 05 Jul, 2016 1 commit
  14. 30 Jun, 2016 1 commit
  15. 29 Jun, 2016 1 commit
  16. 27 Jun, 2016 2 commits
  17. 24 Jun, 2016 1 commit
  18. 23 Jun, 2016 2 commits
  19. 17 Jun, 2016 1 commit
  20. 15 Jun, 2016 1 commit
  21. 01 Jun, 2016 1 commit
    • Robbert Krebbers's avatar
      Make iFresh faster on environments containing evars. · 09b1563c
      Robbert Krebbers authored
      Generating a fresh name consists of two stages:
      + Use [cbv] to compute a list representing the domain of the environment. This
        is a very simply computation that just erases the hypotheses.
      + Use [vm_compute] to compute a fresh name based on the list representing the
        domain. The domain itself should never contain evars, so [vm_compute] will
        do the job.
  22. 31 May, 2016 1 commit
  23. 30 May, 2016 2 commits
  24. 27 May, 2016 2 commits
  25. 24 May, 2016 4 commits
    • Robbert Krebbers's avatar
      Change notations of big_ops for upred. · 93792f5c
      Robbert Krebbers authored
      Rationale: to make the code closer to what is on paper, I want the notations
      to look like quantifiers, i.e. have a binder built-in. I thus introduced the
      following notations:
        [★ map] k ↦ x ∈ m, P
        [★ set] x ∈ X, P
      The good thing - contrary to the notations that we had before that required an
      explicit lambda - is that type annotations of k and x are now not printed
      making goals much easier to read.
    • Robbert Krebbers's avatar
      Merge iAssert and iPvsAssert. · e965b669
      Robbert Krebbers authored
      To do so, we have introduced the specialization patterns:
        =>[H1 .. Hn] and =>[-H1 .. Hn]
      That generate a goal in which the view shift is preserved. These specialization
      patterns can also be used for e.g. iApply.
      Note that this machinery is not tied to primitive view shifts, and works for
      various kinds of goal (as captured by the ToAssert type class, which describes
      how to transform the asserted goal based on the main goal).
      TODO: change the name of these specialization patterns to reflect this
    • Robbert Krebbers's avatar
      Clean up some useless scope delimiters. · 555e1dad
      Robbert Krebbers authored
    • Robbert Krebbers's avatar
      Make specialization patterns for persistent premises more uniform. · 65bfa071
      Robbert Krebbers authored
      - We no longer have a different syntax for specializing a term H : P -★ Q whose
        range P or domain Q is persistent. There is just one syntax, and the system
        automatically determines whether either P or Q is persistent.
      - While specializing a term, always modalities are automatically stripped. This
        gets rid of the specialization pattern !.
      - Make the syntax of specialization patterns more consistent. The syntax for
        generating a goal is [goal_spec] where goal_spec is one of the following:
          H1 .. Hn : generate a goal using hypotheses H1 .. Hn
         -H1 .. Hn : generate a goal using all hypotheses but H1 .. Hn
                 # : generate a goal for the premise in which all hypotheses can be
                     used. This is only allowed when specializing H : P -★ Q where
                     either P or Q is persistent.
                 % : generate a goal for a pure premise.