1. 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
  2. 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
  3. 01 Nov, 2016 3 commits
  4. 28 Oct, 2016 2 commits
  5. 27 Oct, 2016 2 commits
  6. 25 Oct, 2016 4 commits
  7. 06 Sep, 2016 1 commit
  8. 25 Aug, 2016 1 commit
  9. 09 Aug, 2016 1 commit
  10. 08 Aug, 2016 1 commit
  11. 05 Aug, 2016 4 commits
    • Robbert Krebbers's avatar
      Rename the wp_focus tactic into wp_bind. · 149d1ec6
      Robbert Krebbers authored
      This better reflects the name of the bind rule.
      
      I renamed an internal tactic that was previously called wp_bind into
      wp_bind_core.
      149d1ec6
    • 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
  12. 04 Aug, 2016 1 commit
  13. 27 Jul, 2016 2 commits
  14. 19 Jul, 2016 1 commit
  15. 13 Jul, 2016 1 commit
  16. 30 Jun, 2016 1 commit
  17. 16 Jun, 2016 1 commit
  18. 01 Jun, 2016 3 commits
  19. 31 May, 2016 2 commits
  20. 30 May, 2016 1 commit
  21. 24 May, 2016 5 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.
      93792f5c
    • Robbert Krebbers's avatar
    • 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
      generality.
      e965b669
    • Robbert Krebbers's avatar
      eacb1c46
    • Robbert Krebbers's avatar
      Make specialization patterns for persistent premises more uniform. · 65bfa071
      Robbert Krebbers authored
      Changes:
      - 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.
      65bfa071