 18 Jul, 2016 1 commit


Robbert Krebbers authored

 15 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 13 Jul, 2016 1 commit


Robbert Krebbers authored
The intropattern {H} also meant clear (both in ssreflect, and the logic part of the introduction pattern).

 11 Jul, 2016 1 commit


Ralf Jung authored

 03 Jul, 2016 1 commit


Robbert Krebbers authored

 30 Jun, 2016 1 commit


Robbert Krebbers authored
Concretely, when execution of any of the wp_ tactics does not yield another wp, it will make sure that a view shift is kept. This behavior was already partially there, but now it is hopefully more consistent.

 23 Jun, 2016 2 commits


Robbert Krebbers authored
This is more consistent with the proofmode, where we also call it pure.

Robbert Krebbers authored
This is more natural, match should be used in user code, not case.

 16 Jun, 2016 1 commit


Robbert Krebbers authored
This introduces n hypotheses and destructs the nth one.

 14 Jun, 2016 1 commit


Robbert Krebbers authored

 01 Jun, 2016 3 commits


Robbert Krebbers authored
We used => before, which is strange, because it has another meaning in ssreflect.

Robbert Krebbers authored

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)

 30 May, 2016 1 commit


Robbert Krebbers authored

 24 May, 2016 5 commits


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 builtin. 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.

Robbert Krebbers authored

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.

 10 May, 2016 2 commits


Robbert Krebbers authored
And make constants P for which we do not want of_val P to reduce Opaque.

Robbert Krebbers authored

 06 May, 2016 4 commits


Robbert Krebbers authored

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 "!"

 25 Apr, 2016 1 commit


Robbert Krebbers authored

 20 Apr, 2016 3 commits


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.

Robbert Krebbers authored

Ralf Jung authored

 19 Apr, 2016 6 commits


Robbert Krebbers authored
Par is now defined as an expression of type [∀ X, expr X] (instead of a value) and we prove that it is stable under weakening and substitution.

Robbert Krebbers authored
It is just a test case and not really part of the barrier library.

Robbert Krebbers authored
This gets rid of the (ambiguous) notation %l, because we can declare LitLoc as a coercion. It also shortens the code.

Robbert Krebbers 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)".

Robbert Krebbers authored
