1. 03 Nov, 2017 1 commit
  2. 01 Nov, 2017 3 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
    • Jacques-Henri Jourdan's avatar
      58b8eafa
    • Jacques-Henri Jourdan's avatar
      Remove notations for bi_bare and bi_persistently. · a38db108
      Jacques-Henri Jourdan authored
      (□ P) now means (bi_bare (bi_persistently P)).
      
      This is motivated by the fact that these two modalities are rarely
      used separately.
      
      In the case of an affine BI, we keep the □ notation. This means that a
      bi_bare is inserted each time we use □. Hence, a few adaptations need
      to be done in the proof mode class instances.
      a38db108
  3. 31 Oct, 2017 1 commit
  4. 30 Oct, 2017 11 commits
  5. 28 Oct, 2017 2 commits
  6. 27 Oct, 2017 1 commit
  7. 26 Oct, 2017 2 commits
  8. 25 Oct, 2017 4 commits
  9. 05 Oct, 2017 1 commit
  10. 06 Sep, 2017 1 commit
  11. 28 Aug, 2017 1 commit
  12. 24 Aug, 2017 1 commit
  13. 13 Apr, 2017 1 commit
  14. 24 Mar, 2017 2 commits
  15. 21 Mar, 2017 1 commit
  16. 16 Mar, 2017 1 commit
  17. 15 Mar, 2017 1 commit
  18. 14 Mar, 2017 1 commit
    • Robbert Krebbers's avatar
      Extend specialization patterns. · 87a8a19c
      Robbert Krebbers authored
      - Support for a `//` modifier to close the goal using `done`.
      - Support for framing in the `[#]` specialization pattern for
        persistent premises, i.e. `[# $H1 $H2]`
      - Add new "auto framing patterns" `[$]`, `[# $]` and `>[$]` that
        will try to solve the premise by framing. Hypothesis that are
        not framed are carried over to the next goal.
      87a8a19c
  19. 21 Feb, 2017 1 commit
  20. 12 Feb, 2017 1 commit
    • Robbert Krebbers's avatar
      Make iSpecialize work with coercions. · f1b30a2e
      Robbert Krebbers authored
      For example, when having `"H" : ∀ x : Z, P x`, using
      `iSpecialize ("H" $! (0:nat))` now works. We do this by first
      resolving the `IntoForall` type class, and then instantiating
      the quantifier.
      f1b30a2e
  21. 11 Feb, 2017 2 commits
    • Robbert Krebbers's avatar
      Improve `iSpecialize ("H" $! x1 .. xn)`. · 9ea6fa45
      Robbert Krebbers authored
      Instead of doing all the instantiations by invoking a single type
      class search, it now performs the instantiations by invoking
      individual type class searches. This a.) gives better error messages
      and b.) works when `xj` depends on `xi`.
      9ea6fa45
    • Robbert Krebbers's avatar
      Improve `iIntros "_"`. · 211c2363
      Robbert Krebbers authored
      In the following ways:
      - When having `P → Q` it will now also work when the spatial context
        is non-empty.
      - When having `∀ x : A, Q` it will now do an `iIntros (_)`.
      211c2363