 07 Dec, 2017 1 commit


Ralf Jung authored

 05 Dec, 2017 1 commit


Ralf Jung authored

 26 Nov, 2017 1 commit


David Swasey authored

 24 Nov, 2017 3 commits


Ralf Jung authored

Robbert Krebbers authored

Ralf Jung authored

 23 Nov, 2017 2 commits


Robbert Krebbers authored
It can be infered now.

Robbert Krebbers authored

 09 Nov, 2017 6 commits


David Swasey authored
This reverts commit 913059d2.

David Swasey authored
This is derived from `wp_forget_not_stuck` and a trivial preorder on stuckness bits. (The two lemmas are redundant, but I have examples where each seems more natural than the other.) I did *not* bake `wp_stuckness_mono` into `strong_mono` for two reasons. Mainly, I didn't see a nice way to combine the two proofs (beyond `cut`). Less important, changing the type of `wp_strong_mono` will break code.

David Swasey authored
I saw no need for `stuckness_flip`: strong atomicity always works, while weak atomicity works only for expressions that are not stuck. Since this seemed unclear, I split lemma `wp_atomic'` up into `wp_strong_atomic` (parametric in the WP's `s`) and `wp_weak_atomic` (not). The proof mode instance is stated in terms of the derived rule `wp_atomic` (parametric in `s`).

David Swasey authored

David Swasey authored

 08 Nov, 2017 2 commits


David Swasey authored

David Swasey authored

 04 Nov, 2017 1 commit


Robbert Krebbers authored

 01 Nov, 2017 1 commit


Robbert Krebbers authored
This class, in combination with `TCForall`, turns out the useful in LambdaRust to express that lists of expressions are values.

 29 Oct, 2017 2 commits
 04 Oct, 2017 1 commit


Robbert Krebbers authored

 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
