Skip to content
Snippets Groups Projects
  1. Feb 02, 2022
  2. Jan 24, 2022
  3. Dec 16, 2021
  4. Nov 08, 2021
  5. Oct 01, 2021
  6. Sep 05, 2021
  7. Sep 03, 2021
  8. Jul 29, 2021
  9. Jul 28, 2021
  10. Jun 18, 2021
  11. Jun 14, 2021
  12. May 25, 2021
  13. Jan 27, 2021
  14. Jan 13, 2021
  15. Dec 04, 2020
  16. Nov 11, 2020
  17. Sep 28, 2020
    • Tej Chajed's avatar
      Improve some iIntros error messages · 3732f05e
      Tej Chajed authored
      A failing iIntros for implications should prettify the identifier before
      printing, and iIntros on something that isn't a wand or implication
      should say what couldn't be introduced (to clarify that `iIntros "HP
      HQ"` failed because of the HQ in particular, for example).
      3732f05e
  18. Sep 24, 2020
    • Tej Chajed's avatar
      Fix error when destructing as multiple pats · 84144f00
      Tej Chajed authored
      `iDestruct H as "H1 H2"` produces an error that says the pattern should
      contain exactly one proper introduction pattern. When multiple patterns
      are provided, due to Ltac variable shadowing iDestructHypFindPat was
      instead reporting only the first pattern in the error message (and even
      that was printed as the parsed AST rather than the original string).
      84144f00
  19. Sep 21, 2020
    • Tej Chajed's avatar
      Report an error when iIntro fails to find a forall · fa0b270b
      Tej Chajed authored
      The error handling for `iIntro (?)` and similar tactics didn't correctly
      report failures when the goal couldn't be turned into a universal
      quantifier. This is something missing from !482 due to no test
      triggering the error.
      fa0b270b
  20. Jul 22, 2020
  21. Jul 21, 2020
    • Tej Chajed's avatar
      Use user-supplied names in iIntros · c1affb21
      Tej Chajed authored
      Preserve identifiers in binders where possible, analogous to the support
      for destructing existentials in !479.
      
      Fixes #336.
      c1affb21
    • Robbert Krebbers's avatar
      Tweak some names in test file. · 11678073
      Robbert Krebbers authored
      11678073
    • Tej Chajed's avatar
      Use user names when destructing existentials · 7d0bb151
      Tej Chajed authored and Robbert Krebbers's avatar Robbert Krebbers committed
      When running `iDestruct "H" as (?) "H"`, use the name of the binder in
      "H". For example, if "H" has type `∃ y, Φ y`,  we now use `y` as the
      name of the variable after freshening. Previously the name was always
      the equivalent of running `fresh H`.
      
      The implementation achieves this by forwarding the desired identifier
      name through the `IntoExist` typeclass. Identifiers are serialized in
      Gallina by using them as the name of a function of type `ident_name :=
      unit -> unit`.
      7d0bb151
  22. Jun 12, 2020
  23. May 23, 2020
  24. Apr 07, 2020
  25. Apr 06, 2020
    • Tej Chajed's avatar
      Add support for pure names in intro patterns · 1375d6aa
      Tej Chajed authored
      Notably this support relies on string to identifier conversion, which
      works natively using Ltac2 in Coq 8.11+ and with a plugin
      (https://github.com/ppedrot/coq-string-ident) in Coq 8.10. To use it,
      you must replace intro_patterns.string_to_ident_hook with a real
      implementation; see https://gitlab.mpi-sws.org/iris/string-ident for a
      working implementation that works with Coq 8.11 (using Ltac2).
      
      The syntax is %H (within a string intro pattern). This is technically
      backwards-incompatible, because this was previously supported and parsed
      as % and H separately. To restore the old behavior, separate with a
      space, eg [% H].
      1375d6aa
  26. Mar 20, 2020
  27. Feb 28, 2020
  28. Feb 18, 2020
  29. Feb 01, 2020
  30. Nov 20, 2019
    • Robbert Krebbers's avatar
      Use `notypeclasses refine` in `iPoseProof` helpers. · d5d02af5
      Robbert Krebbers authored
      Also, rewrite `iIntoEmpValid`. Now, instead of using Ltac to traverse
      the type of the term and generate goals for the premises, we repeatedly
      apply a series of lemmas. This has the advantage that it works up to
      convertability, and we no longer need the `eval ...` hacks.
      d5d02af5
  31. Sep 20, 2019
  32. Sep 19, 2019
Loading