Skip to content
Snippets Groups Projects
  1. Nov 01, 2019
  2. Sep 19, 2019
  3. Sep 13, 2019
    • Jacques-Henri Jourdan's avatar
      Reorder Requires so that we do not depend of Export bugs. · 43a1a90f
      Jacques-Henri Jourdan authored
      The general idea is to first import/export modules which are further
      than the current one, and then import/export modules which are close
      dependencies.
      
      This commit tries to use the same order of imports for every file, and
      describes the convention in ProofGuide.md. There is one exception,
      where we do not follow said convention: in program_logic/weakestpre.v,
      using that order would break printing of texan triples (??).
      43a1a90f
  4. Mar 05, 2019
  5. Feb 20, 2019
  6. Jan 24, 2019
  7. Jan 11, 2019
  8. May 03, 2018
  9. May 02, 2018
    • Ralf Jung's avatar
      Add support for ElimInv to introduce a binder from the accessor · b2711d60
      Ralf Jung authored
      If the accessor introduces a binder, the first Coq-level intro pattern of `iInv`
      is used for that binder unless the type of the binder is unit, in which case
      `iInv` removes it completely.  Binders on the closing view shift are not (yet)
      supported as they are harder to smoothly eliminate in the unit case.
      b2711d60
  10. Apr 26, 2018
  11. Apr 25, 2018
  12. Apr 04, 2018
  13. Apr 03, 2018
  14. Mar 05, 2018
  15. Mar 01, 2018
  16. Feb 23, 2018
  17. Feb 21, 2018
  18. Jan 24, 2018
  19. Dec 11, 2017
  20. Nov 13, 2017
    • 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
  21. Oct 30, 2017
  22. Oct 25, 2017
  23. Sep 26, 2017
    • Robbert Krebbers's avatar
      Fix issue #98. · e17ac4ad
      Robbert Krebbers authored
      We used to normalize the goal, and then checked whether it was of
      a certain shape. Since `uPred_valid P` normalized to `True ⊢ P`,
      there was no way of making a distinction between the two, hence
      `True ⊢ P` was treated as `uPred_valid P`.
      
      In this commit, I use type classes to check whether the goal is of
      a certain shape. Since we declared `uPred_valid` as `Typeclasses
      Opaque`, we can now make a distinction between `True ⊢ P` and
      `uPred_valid P`.
      e17ac4ad
  24. Sep 17, 2017
  25. Mar 22, 2017
  26. Jan 11, 2017
  27. Jan 05, 2017
  28. Jan 04, 2017
  29. Jan 03, 2017
Loading