 25 Sep, 2017 2 commits


Dan Frumin authored

Dan Frumin authored

 24 Sep, 2017 1 commit


Robbert Krebbers authored

 20 Sep, 2017 1 commit


Robbert Krebbers authored

 14 Mar, 2017 1 commit


Robbert Krebbers authored

 05 Jan, 2017 1 commit


Ralf Jung authored

 04 Jan, 2017 1 commit


JacquesHenri Jourdan authored

 03 Jan, 2017 1 commit


Ralf Jung authored
This patch was created using find name *.v  xargs L 1 awk i inplace '{from = 0} /^From/{ from = 1; ever_from = 1} { if (from == 0 && seen == 0 && ever_from == 1) { print "Set Default Proof Using \"Type*\"."; seen = 1 } }1 ' and some minor manual editing

 09 Dec, 2016 1 commit


Ralf Jung authored

 06 Dec, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 22 Nov, 2016 1 commit


Ralf Jung authored
Use COFEs only for the recursive domain equation solver

 25 Aug, 2016 1 commit


Janno authored

 08 Aug, 2016 1 commit


Robbert Krebbers authored
This generalization is surprisingly easy in Iris 3.0, so I could not resist not doing it :).

 20 Jul, 2016 1 commit


JacquesHenri Jourdan authored
* Values are considered as atomic expressions (this does not hurt, and this makes the proofs of atomicity simpler).

 19 Jul, 2016 1 commit


Robbert Krebbers authored
I also reverted 7952bca4 since there is no need for atomic to be a boolean predicate anymore. Moreover, I introduced a hint database fsaV for solving sideconditions related to FSAs, in particular, sideconditions related to expressions being atomic.

 19 Apr, 2016 1 commit


Robbert Krebbers authored

 07 Apr, 2016 1 commit


Robbert Krebbers authored

 18 Mar, 2016 1 commit


Robbert Krebbers authored

 10 Mar, 2016 1 commit


Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 02 Mar, 2016 2 commits


Robbert Krebbers authored
For consistency's sake.

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

 13 Feb, 2016 1 commit


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

 11 Feb, 2016 1 commit


Robbert Krebbers authored
Also do some minor clean up.

 04 Feb, 2016 1 commit


Robbert Krebbers 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

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

 21 Jan, 2016 1 commit


Ralf Jung authored

 19 Jan, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

 17 Jan, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 16 Jan, 2016 1 commit


Robbert Krebbers authored

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


Ralf Jung authored
