 27 May, 2016 4 commits


Robbert Krebbers authored
We git this from monotonicity now.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 25 May, 2016 3 commits


Ralf Jung authored

Ralf Jung authored
The good news is, this one works without FSAs, and it can be applied around the "view shift with a step"thing. Furthermore, the FSA lemma can be derived from the new one. The bad news is, the FSA lemma proof doesn't even get shorter in doing this change.

Robbert Krebbers authored
 Make the carrier argument of the constructors for the canonical structures cofeT and cmraT explicit. This way we make sure the carrier is properly exposed, instead of some alias of the carrier.  Make derived constructions (such as discreteC and discreteR) notations instead of definitions. This is yet again to make sure that the carrier is properly exposed.  Turn DRA into a canonical structure (it used to be a type class). This fixes some issues, notably it fixes some broken rewrites in algebra/sts and it makes canonical structures work properly with dec_agree.

 24 May, 2016 1 commit


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.

 22 May, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 09 May, 2016 1 commit


Robbert Krebbers authored

 07 May, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 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.

 26 Apr, 2016 1 commit


Robbert Krebbers authored
These tactics are superfluous:  iPure H as pat => iDestruct H as pat  iPersistent H => iSpecialize H "!"

 19 Apr, 2016 12 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
That way, we do not have useless type annotations of the form "v : language.val heap_lang" cluttering about any goal. Note, that we could decide to eta expand everywhere (as we do for ∀ and ∃), and use the notation "WP e {{ Q }}" for "wp e ⊤ (λ _, Q)".

Ralf Jung authored

Robbert Krebbers authored

 18 Apr, 2016 1 commit


Robbert Krebbers authored

 11 Apr, 2016 1 commit


Robbert Krebbers authored

 09 Apr, 2016 1 commit


Robbert Krebbers authored

 08 Apr, 2016 1 commit


Robbert Krebbers authored
And introduce more useful variants with a wand.

 07 Apr, 2016 1 commit


Robbert Krebbers authored

 30 Mar, 2016 2 commits
 29 Mar, 2016 4 commits


Robbert Krebbers authored

Ralf Jung authored
This required a new ectx axiom: Positivity of evaluation contexts. This axiom was also present in the old Iris 1.1 development, back when it still derived lifting axioms for ectx languages.

Ralf Jung authored

Robbert Krebbers authored
Also remove some superfluous map_ prefixes.

 23 Mar, 2016 1 commit


Robbert Krebbers authored
