1. 27 Sep, 2017 2 commits
  2. 21 Sep, 2017 1 commit
  3. 28 Aug, 2017 2 commits
  4. 24 Aug, 2017 1 commit
  5. 17 May, 2017 1 commit
  6. 13 Apr, 2017 2 commits
  7. 11 Apr, 2017 1 commit
  8. 21 Mar, 2017 1 commit
  9. 15 Mar, 2017 1 commit
  10. 14 Mar, 2017 2 commits
  11. 12 Mar, 2017 1 commit
  12. 11 Mar, 2017 1 commit
  13. 10 Mar, 2017 1 commit
  14. 21 Feb, 2017 1 commit
  15. 15 Feb, 2017 1 commit
  16. 13 Feb, 2017 3 commits
  17. 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
  18. 23 Jan, 2017 1 commit
  19. 22 Jan, 2017 1 commit
  20. 05 Jan, 2017 1 commit
  21. 03 Jan, 2017 1 commit
  22. 28 Dec, 2016 1 commit
  23. 09 Dec, 2016 2 commits
  24. 24 Nov, 2016 1 commit
  25. 22 Nov, 2016 2 commits
    • Robbert Krebbers's avatar
      Make nclose an explicit coercion. · 274209c2
      Robbert Krebbers authored and Ralf Jung's avatar Ralf Jung committed
      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
  26. 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
  27. 28 Oct, 2016 2 commits
  28. 25 Oct, 2016 2 commits
    • Robbert Krebbers's avatar
      Rename uPred_eq into uPred_internal_eq. · e224e891
      Robbert Krebbers authored
      e224e891
    • Robbert Krebbers's avatar
      Generalize update tactics into iMod and iModIntro for modalities. · fc30ca08
      Robbert Krebbers authored
      There are now two proof mode tactics for dealing with modalities:
      
      - `iModIntro` : introduction of a modality
      - `iMod pm_trm as (x1 ... xn) "ipat"` : eliminate a modality
      
      The behavior of these tactics can be controlled by instances of the `IntroModal`
      and `ElimModal` type class. We have declared instances for later, except 0,
      basic updates and fancy updates. The tactic `iMod` is flexible enough that it
      can also eliminate an updates around a weakest pre, and so forth.
      
      The corresponding introduction patterns of these tactics are `!>` and `>`.
      
      These tactics replace the tactics `iUpdIntro`, `iUpd` and `iTimeless`.
      
      Source of backwards incompatability: the introduction pattern `!>` is used for
      introduction of arbitrary modalities. It used to introduce laters by stripping
      of a later of each hypotheses.
      fc30ca08
  29. 05 Oct, 2016 1 commit
  30. 19 Sep, 2016 1 commit