1. 22 Nov, 2017 1 commit
  2. 13 Nov, 2017 1 commit
    • Robbert Krebbers's avatar
      Improved treatment of anonymous hypotheses in the proof mode. · bb3584e7
      Robbert Krebbers authored
      The proof mode now explicitly keeps track of anonymous hypotheses (i.e.
      hypotheses that are introduced by the introduction pattern `?`). Consider:
      
        Lemma foo {M} (P Q R : uPred M) : P -∗ (Q ∗ R) -∗ Q ∗ P.
        Proof. iIntros "? [H ?]". iFrame "H". iFrame. Qed.
      
      After the `iIntros`, the goal will be:
      
        _ : P
        "H" : Q
        _ : R
        --------------------------------------∗
        Q ∗ P
      
      Anonymous hypotheses are displayed in a special way (`_ : P`). An important
      property of the new anonymous hypotheses is that it is no longer possible to
      refer to them by name, whereas before, anonymous hypotheses were given some
      arbitrary fresh name (typically prefixed by `~`).
      
      Note tactics can still operate on these anonymous hypotheses. For example, both
      `iFrame` and `iAssumption`, as well as the symbolic execution tactics, will
      use them. The only thing that is not possible is to refer to them yourself,
      for example, in an introduction, specialization or selection pattern.
      
      Advantages of the new approach:
      
      - Proofs become more robust as one cannot accidentally refer to anonymous
        hypotheses by their fresh name.
      - Fresh name generation becomes considerably easier. Since anonymous hypotheses
        are internally represented by natural numbers (of type `N`), we can just fold
        over the hypotheses and take the max plus one. This thus solve issue #101.
      bb3584e7
  3. 01 Nov, 2017 1 commit
    • 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
  4. 28 Oct, 2017 2 commits
  5. 27 Oct, 2017 1 commit
  6. 26 Oct, 2017 2 commits
  7. 25 Oct, 2017 4 commits
  8. 05 Oct, 2017 1 commit
  9. 06 Sep, 2017 1 commit
  10. 28 Aug, 2017 1 commit
  11. 24 Aug, 2017 1 commit
  12. 13 Apr, 2017 1 commit
  13. 24 Mar, 2017 2 commits
  14. 21 Mar, 2017 1 commit
  15. 16 Mar, 2017 1 commit
  16. 15 Mar, 2017 1 commit
  17. 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
  18. 21 Feb, 2017 1 commit
  19. 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
  20. 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
  21. 06 Feb, 2017 1 commit
  22. 27 Jan, 2017 1 commit
  23. 22 Jan, 2017 1 commit
  24. 05 Jan, 2017 1 commit
  25. 03 Jan, 2017 1 commit
  26. 28 Dec, 2016 1 commit
  27. 09 Dec, 2016 1 commit
  28. 27 Nov, 2016 1 commit
  29. 24 Nov, 2016 1 commit
  30. 22 Nov, 2016 2 commits
  31. 21 Nov, 2016 1 commit
  32. 20 Nov, 2016 1 commit