 05 Aug, 2016 2 commits


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.

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

 16 Jun, 2016 2 commits


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

Robbert Krebbers authored

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

 07 May, 2016 1 commit


Robbert Krebbers authored

 23 Mar, 2016 1 commit


Robbert Krebbers authored

 15 Mar, 2016 1 commit


Robbert Krebbers authored

 11 Mar, 2016 1 commit


Robbert Krebbers authored

 10 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 07 Mar, 2016 1 commit


Ralf Jung authored
Add both nonexpansive and contractive functors, and bundle them for the general Iris instance as well as the global functor construction This allows us to move the \later in the userdefined functor to any place we want. In particular, we can now have "\later (iProp > iProp)" in the ghost CMRA.

 06 Mar, 2016 2 commits
 05 Mar, 2016 3 commits


Robbert Krebbers authored

Ralf Jung authored
write tactics to move particular assertions to the front, and to introduce a (*) while taking paticular assertions to the left/right

Ralf Jung authored

 02 Mar, 2016 1 commit


Robbert Krebbers authored
This cleans up some adhoc stuff and prepares for a generalization of saved propositions.

 01 Mar, 2016 1 commit


Robbert Krebbers authored

 25 Feb, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
The performance gain seems neglectable, unfortunatelly...

 24 Feb, 2016 6 commits


Robbert Krebbers authored
* Use sig instead of sigT: the proof is a Prop after all * Tweak implicit arguments * Shorten proof of sigma

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored
This way it behaves better for discrete CMRAs.

Ralf Jung authored

Ralf Jung authored

 23 Feb, 2016 4 commits


Ralf Jung authored

Robbert Krebbers authored
I am now also using reification to obtain the indexes corresponding to the stuff we want to cancel instead of relying on matching using Ltac.

Ralf Jung authored

Ralf Jung authored
barrier: strive for consistency between barrierGF and the inGF assumptions; also change some instance names

 22 Feb, 2016 2 commits


Robbert Krebbers authored
And now the part that I forgot to commit.

Robbert Krebbers authored
Also, give all these global functors the suffix GF to avoid shadowing such as we had with authF. And add some type annotations for clarity.
