1. 12 Sep, 2018 3 commits
  2. 16 Jun, 2018 1 commit
  3. 15 Jun, 2018 1 commit
  4. 15 Feb, 2018 1 commit
  5. 23 Dec, 2017 1 commit
  6. 22 Nov, 2017 2 commits
  7. 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
  8. 30 Oct, 2017 1 commit
  9. 28 Oct, 2017 1 commit
  10. 27 Oct, 2017 1 commit
  11. 26 Oct, 2017 1 commit
  12. 06 Feb, 2017 1 commit
  13. 05 Jan, 2017 1 commit
  14. 03 Jan, 2017 1 commit
  15. 09 Dec, 2016 1 commit
  16. 10 Nov, 2016 1 commit
  17. 27 Sep, 2016 2 commits
  18. 20 Sep, 2016 1 commit
  19. 01 Jun, 2016 1 commit
    • Robbert Krebbers's avatar
      Make iFresh faster on environments containing evars. · 09b1563c
      Robbert Krebbers authored
      Generating a fresh name consists of two stages:
      + Use [cbv] to compute a list representing the domain of the environment. This
        is a very simply computation that just erases the hypotheses.
      + Use [vm_compute] to compute a fresh name based on the list representing the
        domain. The domain itself should never contain evars, so [vm_compute] will
        do the job.
      09b1563c
  20. 07 May, 2016 1 commit
  21. 12 Apr, 2016 3 commits
  22. 11 Apr, 2016 1 commit