1. 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
  2. 21 Feb, 2017 1 commit
  3. 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
  4. 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
  5. 06 Feb, 2017 1 commit
  6. 27 Jan, 2017 1 commit
  7. 22 Jan, 2017 1 commit
  8. 05 Jan, 2017 1 commit
  9. 03 Jan, 2017 1 commit
  10. 28 Dec, 2016 1 commit
  11. 09 Dec, 2016 1 commit
  12. 27 Nov, 2016 1 commit
  13. 24 Nov, 2016 1 commit
  14. 22 Nov, 2016 2 commits
  15. 21 Nov, 2016 1 commit
  16. 20 Nov, 2016 1 commit
  17. 10 Nov, 2016 1 commit
  18. 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
  19. 01 Nov, 2016 1 commit
  20. 28 Oct, 2016 1 commit
  21. 25 Oct, 2016 5 commits
  22. 05 Oct, 2016 1 commit
  23. 28 Sep, 2016 2 commits
  24. 27 Sep, 2016 2 commits
  25. 20 Sep, 2016 1 commit
  26. 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.
      9eb50174
    • Robbert Krebbers's avatar
      Support for framing pure hypotheses. · 75ad3b2e
      Robbert Krebbers authored
      This closes issue 32.
      75ad3b2e
    • Robbert Krebbers's avatar
  27. 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.
      090aaea3
  28. 05 Sep, 2016 1 commit
  29. 30 Aug, 2016 1 commit
  30. 25 Aug, 2016 1 commit