1. 27 Jun, 2016 2 commits
  2. 24 Jun, 2016 1 commit
  3. 23 Jun, 2016 2 commits
  4. 17 Jun, 2016 1 commit
  5. 15 Jun, 2016 1 commit
  6. 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
  7. 31 May, 2016 1 commit
  8. 30 May, 2016 2 commits
  9. 27 May, 2016 2 commits
  10. 24 May, 2016 4 commits
    • Robbert Krebbers's avatar
      Change notations of big_ops for upred. · 93792f5c
      Robbert Krebbers authored
      Rationale: to make the code closer to what is on paper, I want the notations
      to look like quantifiers, i.e. have a binder built-in. I thus introduced the
      following notations:
      
        [★ map] k ↦ x ∈ m, P
        [★ set] x ∈ X, P
      
      The good thing - contrary to the notations that we had before that required an
      explicit lambda - is that type annotations of k and x are now not printed
      making goals much easier to read.
      93792f5c
    • Robbert Krebbers's avatar
      Merge iAssert and iPvsAssert. · e965b669
      Robbert Krebbers authored
      To do so, we have introduced the specialization patterns:
      
        =>[H1 .. Hn] and =>[-H1 .. Hn]
      
      That generate a goal in which the view shift is preserved. These specialization
      patterns can also be used for e.g. iApply.
      
      Note that this machinery is not tied to primitive view shifts, and works for
      various kinds of goal (as captured by the ToAssert type class, which describes
      how to transform the asserted goal based on the main goal).
      
      TODO: change the name of these specialization patterns to reflect this
      generality.
      e965b669
    • Robbert Krebbers's avatar
      Clean up some useless scope delimiters. · 555e1dad
      Robbert Krebbers authored
      555e1dad
    • Robbert Krebbers's avatar
      Make specialization patterns for persistent premises more uniform. · 65bfa071
      Robbert Krebbers authored
      Changes:
      - We no longer have a different syntax for specializing a term H : P -★ Q whose
        range P or domain Q is persistent. There is just one syntax, and the system
        automatically determines whether either P or Q is persistent.
      - While specializing a term, always modalities are automatically stripped. This
        gets rid of the specialization pattern !.
      - Make the syntax of specialization patterns more consistent. The syntax for
        generating a goal is [goal_spec] where goal_spec is one of the following:
      
          H1 .. Hn : generate a goal using hypotheses H1 .. Hn
         -H1 .. Hn : generate a goal using all hypotheses but H1 .. Hn
                 # : generate a goal for the premise in which all hypotheses can be
                     used. This is only allowed when specializing H : P -★ Q where
                     either P or Q is persistent.
                 % : generate a goal for a pure premise.
      65bfa071
  11. 20 May, 2016 1 commit
    • Robbert Krebbers's avatar
      Some refactoring of the proofmode proofs. · 2cec343c
      Robbert Krebbers authored
      I have introduced the following definition to avoid many case
      analyses where both branches had nearly identical proofs.
      
      Definition uPred_always_if {M} (p : bool) (P : uPred M) : uPred M :=
        (if p then □ P else P)%I.
      2cec343c
  12. 07 May, 2016 1 commit
  13. 06 May, 2016 2 commits
  14. 03 May, 2016 1 commit
  15. 02 May, 2016 1 commit
  16. 26 Apr, 2016 1 commit
  17. 20 Apr, 2016 2 commits
    • Robbert Krebbers's avatar
      Improve iExist. · 04e8c944
      Robbert Krebbers authored
      Now, it bases the type the quantifier ranges over on the goal, instead
      of the witness. This works better when dealing with witnesses involving
      type class constraints.
      04e8c944
    • Robbert Krebbers's avatar
      Improve iFrame tactic · 43d45c6b
      Robbert Krebbers authored
      - It can now also frame under later.
      - Better treatment of evars, it now won't end up in loops whenever the goal
        involves sub-formulas ?P and it trying to apply all framing rules eagerly.
      - It no longer delta expands while framing.
      - Better clean up of True sub-formulas after a successful frame. For example,
        framing "P" in "▷ ▷ P ★ Q" yields just "Q" instead of "▷ True ★ Q" or so.
      43d45c6b
  18. 19 Apr, 2016 1 commit
  19. 15 Apr, 2016 1 commit
  20. 12 Apr, 2016 3 commits
  21. 11 Apr, 2016 1 commit