 09 Dec, 2016 3 commits


Ralf Jung authored

Ralf Jung authored
Thanks to Robbert for fixing gen_heap

Robbert Krebbers authored
The WP construction now takes an invariant on states as a parameter (part of the irisG class) and no longer builds in the authoritative ownership of the entire state. When instantiating WP with a concrete language on can choose its state invariant. For example, for heap_lang we directly use `auth (gmap loc (frac * dec_agree val))`, and avoid the indirection through invariants entirely. As a result, we no longer have to carry `heap_ctx` around.

 08 Dec, 2016 1 commit


Ralf Jung authored

 06 Dec, 2016 1 commit


Ralf Jung authored

 22 Nov, 2016 1 commit


Ralf Jung authored

 09 Nov, 2016 1 commit


Robbert Krebbers authored

 03 Nov, 2016 1 commit


Robbert Krebbers authored
The old choice for ★ was a arbitrary: the precedence of the ASCII asterisk * was fixed at a wrong level in Coq, so we had to pick another symbol. The ★ was a random choice from a unicode chart. The new symbol ∗ (as proposed by David Swasey) corresponds better to conventional practise and matches the symbol we use on paper.

 01 Nov, 2016 1 commit


Ralf Jung authored
Now we try to avoid adding them unnecessarily, so we don't have to remove them automatically any more.

 27 Oct, 2016 1 commit


Robbert Krebbers authored

 25 Oct, 2016 2 commits


Robbert Krebbers authored
There are now two proof mode tactics for dealing with modalities:  `iModIntro` : introduction of a modality  `iMod pm_trm as (x1 ... xn) "ipat"` : eliminate a modality The behavior of these tactics can be controlled by instances of the `IntroModal` and `ElimModal` type class. We have declared instances for later, except 0, basic updates and fancy updates. The tactic `iMod` is flexible enough that it can also eliminate an updates around a weakest pre, and so forth. The corresponding introduction patterns of these tactics are `!>` and `>`. These tactics replace the tactics `iUpdIntro`, `iUpd` and `iTimeless`. Source of backwards incompatability: the introduction pattern `!>` is used for introduction of arbitrary modalities. It used to introduce laters by stripping of a later of each hypotheses.

Robbert Krebbers authored
And also rename the corresponding proof mode tactics.

 05 Oct, 2016 1 commit


Robbert Krebbers authored

 09 Sep, 2016 1 commit


Robbert Krebbers authored
Before this commit, given "HP" : P and "H" : P ★ Q with Q persistent, one could write: iSpecialize ("H" with "#HP") to eliminate the wand in "H" while keeping the resource "HP". The lemma: own_valid : own γ x ⊢ ✓ x was the prototypical example where this pattern (using the #) was used. However, the pattern was too limited. For example, given "H" : P₁ ★ P₂ ★ Q", one could not write iSpecialize ("H" with "#HP₁") because P₂ ★ Q is not persistent, even when Q is. So, instead, this commit introduces the following tactic: iSpecialize pm_trm as # which allows one to eliminate implications and wands while being able to use all hypotheses to prove the premises, as well as being able to use all hypotheses to prove the resulting goal. In the case of iDestruct, we now check whether all branches of the introduction pattern start with an `#` (moving the hypothesis to the persistent context) or `%` (moving the hypothesis to the pure Coq context). If this is the case, we allow one to use all hypotheses for proving the premises, as well as for proving the resulting goal.

 25 Aug, 2016 1 commit


Robbert Krebbers authored

 08 Aug, 2016 1 commit


Robbert Krebbers authored
This makes stuff more uniform and also removes the need for the [inGFs] type class. Instead, there is now a type class [subG Σ1 Σ2] which expresses that a list of functors [Σ1] is contained in [Σ2].

 05 Aug, 2016 4 commits


Robbert Krebbers authored
This better reflects the name of the bind rule. I renamed an internal tactic that was previously called wp_bind into wp_bind_core.

Robbert Krebbers authored

Robbert Krebbers authored
Also make those for introduction and elimination more symmetric: !% pure introduction % pure elimination !# always introduction # always elimination !> later introduction > pat timeless later elimination !==> view shift introduction ==> pat view shift elimination

Robbert Krebbers authored
This commit features:  A simpler model. The recursive domain equation no longer involves a triple containing invariants, physical state and ghost state, but just ghost state. Invariants and physical state are encoded using (higherorder) ghost state.  (Primitive) view shifts are formalized in the logic and all properties about it are proven in the logic instead of the model. Instead, the core logic features only a notion of raw view shifts which internalizing performing frame preserving updates.  A better behaved notion of mask changing view shifts. In particular, we no longer have sideconditions on transitivity of view shifts, and we have a rule for introduction of mask changing view shifts ={E1,E2}=> P with E2 ⊆ E1 which allows to postpone performing a view shift.  The weakest precondition connective is formalized in the logic using Banach's fixpoint. All properties about the connective are proven in the logic instead of directly in the model.  Adequacy is proven in the logic and uses a primitive form of adequacy for uPred that only involves raw views shifts and laters. Some remarks:  I have removed binary view shifts. I did not see a way to describe all rules of the new mask changing view shifts using those.  There is no longer the need for the notion of "frame shifting assertions" and these are thus removed. The rules for Hoare triples are thus also stated in terms of primitive view shifts. TODO:  Maybe rename primitive view shift into something more sensible  Figure out a way to deal with closed proofs (see the commented out stuff in tests/heap_lang and tests/barrier_client).

 27 Jul, 2016 2 commits


Robbert Krebbers authored
This way type class inference is not invokved when used in tactics like iPvs while not having to write an @. (Idea suggested by Ralf.)

Robbert Krebbers authored
This way, it won't pick arbitrary (and possibly wrong!) inG instances when multiple ones are available. We achieve this by declaring: Hint Mode inG   + So that type class inference only succeeds when the type of the ghost variable does not include any evars. This required me to make some minor changes throughout the whole development making some types explicit.

 19 Jul, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
We reify to a representation of expressions that includes an explicit constructor for closed terms. Substitution can then be implemented as the identify, which enables us to perform it using computation.

 15 Jul, 2016 1 commit


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

 30 Jun, 2016 4 commits


Robbert Krebbers authored

Robbert Krebbers authored

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.

Robbert Krebbers authored
This tweak allows us to declare pvs as an instance of FromPure (it is not an instance of IntoPure), making some tactics (like iPureIntro and done) work with pvs too.

 23 Jun, 2016 1 commit


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

 01 Jun, 2016 3 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored

Robbert Krebbers authored

 31 May, 2016 1 commit


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

 25 May, 2016 1 commit


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 2 commits


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 1 commit


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