 23 Jun, 2016 1 commit


Robbert Krebbers authored

 31 May, 2016 2 commits


Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →. 
Robbert Krebbers authored
It used to be: (P ={E}=> Q) := (True ⊢ (P → ={E}=> Q)) Now it is: (P ={E}=> Q) := (P ⊢ ={E}=> Q)

 24 May, 2016 3 commits


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.

Robbert Krebbers authored

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.

 20 May, 2016 3 commits


Robbert Krebbers authored

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.

Robbert Krebbers authored

 06 May, 2016 1 commit


Robbert Krebbers authored

 03 May, 2016 1 commit


Robbert Krebbers authored
We now give frame_here priority 0, so it is used immediately when an evar occurs. This thus avoids loops in the presence of evars.

 02 May, 2016 1 commit


Robbert Krebbers authored
iSpecialize and iDestruct. These tactics now all take an iTrm, which is a tuple consisting of a.) a lemma or name of a hypotheses b.) arguments to instantiate c.) a specialization pattern.

 20 Apr, 2016 1 commit


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 subformulas ?P and it trying to apply all framing rules eagerly.  It no longer delta expands while framing.  Better clean up of True subformulas after a successful frame. For example, framing "P" in "▷ ▷ P ★ Q" yields just "Q" instead of "▷ True ★ Q" or so.

 19 Apr, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 12 Apr, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored
This reverts commit 3cc38ff6. The reverted pure hypotheses and variables appear in the wrong order.

Robbert Krebbers authored

 11 Apr, 2016 1 commit


Robbert Krebbers authored
