1. 12 Feb, 2021 1 commit
  2. 07 Jan, 2021 2 commits
  3. 03 Dec, 2020 1 commit
  4. 12 Nov, 2020 1 commit
  5. 11 Nov, 2020 1 commit
  6. 10 Nov, 2020 1 commit
  7. 05 Nov, 2020 1 commit
  8. 04 Nov, 2020 1 commit
  9. 03 Nov, 2020 1 commit
  10. 10 Sep, 2020 1 commit
  11. 29 Aug, 2020 2 commits
  12. 28 Aug, 2020 1 commit
  13. 12 Aug, 2020 2 commits
  14. 15 Jul, 2020 1 commit
  15. 15 Feb, 2020 1 commit
  16. 02 Feb, 2020 1 commit
  17. 18 Dec, 2019 1 commit
  18. 13 Sep, 2019 1 commit
    • 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
  19. 11 Sep, 2019 1 commit
  20. 19 May, 2019 1 commit
  21. 24 Jan, 2019 1 commit
  22. 25 Dec, 2018 1 commit
  23. 29 Nov, 2018 1 commit
  24. 03 Oct, 2018 1 commit
  25. 12 Sep, 2018 3 commits
  26. 16 Jun, 2018 1 commit
  27. 15 Jun, 2018 1 commit
  28. 15 Feb, 2018 1 commit
  29. 23 Dec, 2017 1 commit
  30. 22 Nov, 2017 2 commits
  31. 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
  32. 30 Oct, 2017 1 commit
  33. 28 Oct, 2017 1 commit
  34. 27 Oct, 2017 1 commit