 06 Mar, 2016 1 commit


Ralf Jung authored
add a version of [cancel] that works with goals of the form [_  pvs _]; and use that for the barrier proof

 05 Mar, 2016 2 commits
 02 Mar, 2016 1 commit


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

 26 Feb, 2016 1 commit


Robbert Krebbers authored

 24 Feb, 2016 1 commit


Robbert Krebbers authored

 23 Feb, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 22 Feb, 2016 2 commits


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

Ralf Jung authored

 18 Feb, 2016 1 commit


Ralf Jung authored

 16 Feb, 2016 4 commits


Robbert Krebbers authored
Now that there is more of it, it deserves its own place :).

Ralf Jung authored

Robbert Krebbers authored

Ralf Jung authored

 15 Feb, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 14 Feb, 2016 1 commit


Robbert Krebbers authored

 13 Feb, 2016 1 commit


Ralf Jung authored
start the heap construction: load from a heap is done... store, CAS, and singleton (mapsto) to be done

 12 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 11 Feb, 2016 1 commit


Ralf Jung authored

 10 Feb, 2016 1 commit


Ralf Jung authored

 09 Feb, 2016 1 commit


Ralf Jung authored

 08 Feb, 2016 3 commits


Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

 05 Feb, 2016 2 commits
 04 Feb, 2016 1 commit


Robbert Krebbers authored

 03 Feb, 2016 1 commit


Ralf Jung authored

 02 Feb, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
Notable changes: * I am now using the same names for the fields of the language record and the instances in heap_lang. In order to deal with shadowing, I have put all definitions in heap_lang.v in a module. * Instead of defining evaluation contexts recursively, these are now defined using lists. This way we can easily reuse operations on lists. For example, composition of evaluation contexts is just appending lists. Also, it allowed me to simplify the rather complicated proof of step_by_val as induction on the shape of contexts no longer results in a blowup of the number of cases. * Use better automation to prove all lemmas of heap_lang. * I have introduced tactics to invert steps and to do steps. These tactics greatly helped simplifying boring parts of lifting lemmas.

 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.

 30 Jan, 2016 1 commit


Ralf Jung authored

 27 Jan, 2016 1 commit


Ralf Jung authored

 26 Jan, 2016 2 commits