 24 Feb, 2016 1 commit


Robbert Krebbers authored
This better seals off their definition. Although it did not give much of a speedup, I think it is conceptually nicer.

 21 Feb, 2016 1 commit


Ralf Jung authored

 19 Feb, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
Still need to use it everywhere.

 18 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This avoids ambiguity with P and Q that we were using before for both uPreds/iProps and indexed uPreds/iProps.

 17 Feb, 2016 3 commits


Robbert Krebbers authored
It is doing much more than just dealing with ∈, it solves all kinds of goals involving set operations (including ≡ and ⊆).

Ralf Jung authored

Robbert Krebbers authored

 16 Feb, 2016 1 commit


Robbert Krebbers authored
The singleton maps notation is now also more consistent with the insert <[_ := _]> _ notation for maps.

 13 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
Also, make our redefinition of done more robust under different orders of Importing modules.

 12 Feb, 2016 1 commit


Ralf Jung authored

 11 Feb, 2016 2 commits


Robbert Krebbers authored
Also do some minor clean up.

Ralf Jung authored
Introduce the notion of "Frame Shift Assertions", and use to prove the rules about inv and auth at once for pvs and wp Yeah, the name is horrible... but on the plus side, I think it should be possible to show that atomic triples and atomic shifts are also frame shift assertions, and then we get all this stuff for them for free.

 10 Feb, 2016 2 commits


Robbert Krebbers authored
This way we avoid many oneoff indexes and no longer need special cases for index 0 in many definitions. For example, the definition of the distance relation on option and excl has become much easier. Also, uPreds no longer need to hold at index 0. In order to make this change possible, we had to change the notions of "contractive functions" and "chains" slightly. Thanks to Aleš Bizjak and Amin Timany for suggesting this change and to help with the proofs.

Ralf Jung authored

 09 Feb, 2016 6 commits


Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

 08 Feb, 2016 4 commits


Ralf Jung authored

Ralf Jung authored
Actual proofs will end up using own and inv, and none of the notions defined in ownership.v

Ralf Jung authored

Robbert Krebbers authored

 04 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 03 Feb, 2016 1 commit


Ralf Jung authored

 01 Feb, 2016 2 commits


Robbert Krebbers authored
This way we can more easily state lemmas for concrete languages for arbitrary global functors.

Robbert Krebbers authored
Instead, we have just a construction to create a CMRA from a RA. This construction is also slightly generalized, it now works for RAs over any timeless COFE instead of just the discrete COFE. Also: * Put tactics and big_ops for CMRAs in a separate file. * Valid is now a derived notion (as the limit of validN), so it does not have to be defined by hand for each CMRA. Todo: Make the constructions DRA > CMRA and RA > CMRA more uniform.

 21 Jan, 2016 2 commits
 19 Jan, 2016 1 commit


Robbert Krebbers authored

 18 Jan, 2016 1 commit


Robbert Krebbers authored

 17 Jan, 2016 1 commit


Robbert Krebbers authored
