1. 09 Nov, 2017 2 commits
  2. 08 Nov, 2017 3 commits
  3. 05 Nov, 2017 1 commit
  4. 01 Nov, 2017 2 commits
    • Robbert Krebbers's avatar
      Hide the proof mode entailment behind a definition. · 8574d1ea
      Robbert Krebbers authored
      This solves issue #100: the proof mode notation is sometimes not printed. As
      Ralf discovered, the problem is that there are two overlapping notations:
      
      ```coq
      Notation "P ⊢ Q" := (uPred_entails P Q).
      ```
      
      And the "proof mode" notation:
      
      ```
      Notation "Γ '--------------------------------------' □ Δ '--------------------------------------' ∗ Q" :=
        (of_envs (Envs Γ Δ) ⊢ Q%I).
      ```
      
      These two notations overlap, so, when having a "proof mode" goal of the shape
      `of_envs (Envs Γ Δ) ⊢ Q%I`, how do we know which notation is Coq going to pick
      for pretty printing this goal? As we have seen, this choice depends on the
      import order (since both notations appear in different files), and as such, Coq
      sometimes (unintendedly) uses the first notation instead of the latter.
      
      The idea of this commit is to wrap `of_envs (Envs Γ Δ) ⊢ Q%I` into a definition
      so that there is no ambiguity for the pretty printer anymore.
      8574d1ea
    • Robbert Krebbers's avatar
      Add an `AsVal` type class. · b2ed0162
      Robbert Krebbers authored
      This class, in combination with `TCForall`, turns out the useful in
      LambdaRust to express that lists of expressions are values.
      b2ed0162
  5. 25 Sep, 2017 10 commits
  6. 09 Sep, 2017 1 commit
  7. 28 Aug, 2017 1 commit
    • Robbert Krebbers's avatar
      Optimize wp_apply and improve its error reporting. · 211dc7ca
      Robbert Krebbers authored
      We now first iPoseProof the lemma and instantiate its premises before trying
      to search for the sub-term where to apply. As a result, instantiation of the
      premises of the applied lemmas happens only once, instead of it being done for
      each sub-term as obtained by reshape_expr.
      211dc7ca
  8. 20 Jan, 2017 1 commit
  9. 05 Jan, 2017 1 commit
  10. 03 Jan, 2017 1 commit
  11. 12 Dec, 2016 3 commits
  12. 09 Dec, 2016 4 commits
  13. 27 Nov, 2016 1 commit
  14. 23 Nov, 2016 1 commit
  15. 22 Nov, 2016 1 commit
    • 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
  16. 01 Nov, 2016 2 commits
  17. 27 Oct, 2016 1 commit
  18. 05 Oct, 2016 1 commit
  19. 24 Aug, 2016 1 commit
  20. 05 Aug, 2016 2 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
      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