 09 Jan, 2018 1 commit


Jonas Kastberg Hinrichsen authored

 18 Dec, 2017 1 commit


Jonas Kastberg Hinrichsen authored

 07 Dec, 2017 2 commits
 05 Dec, 2017 2 commits


Robbert Krebbers authored

Ralf Jung authored

 14 Nov, 2017 1 commit


Robbert Krebbers authored
This is an old flag set by the ssr plugin, and recently unset in coqstdpp, see https://gitlab.mpisws.org/robbertkrebbers/coqstdpp/issues/5.

 09 Nov, 2017 3 commits


David Swasey authored
This reverts commit 913059d2.

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

 08 Nov, 2017 3 commits


David Swasey authored

David Swasey authored

David Swasey authored

 07 Nov, 2017 1 commit


Ralf Jung authored

 04 Nov, 2017 3 commits


Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

 01 Nov, 2017 2 commits


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

Robbert Krebbers authored

 27 Sep, 2017 1 commit


Robbert Krebbers authored

 25 Sep, 2017 1 commit


Dan Frumin authored
Expression `e` such that `to_val e = Some v` is in the context gets reflected into value `v` together with the proof that `to_val e = Some v`. This is helpful for substitution and for `solve_to_val` operating on the reflected syntax.

 22 Mar, 2017 1 commit


Ralf Jung authored

 14 Mar, 2017 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This has some advantages:  Evaluation contexts behave like a proper "Huet's zipper", and thus: + We no longer need to reverse the list of evaluation context items in the `reshape_expr` tactic. + The `fill` function becomes tailrecursive.  It gives rise to more definitional equalities in simulation proofs using binary logical relations proofs. In the case of binary logical relations, we simulate an expressions in some ambient context, i.e. `fill K e`. Now, whenever we reshape `e` by turning it into `fill K' e'`, we end up with `fill K (fill K' e')`. In order to use the rules for the expression that is being simulated, we need to turn `fill K (fill K' e')` into `fill K'' e'` for some `K'`. In case of the old `foldr`based approach, we had to rewrite using the lemma `fill_app` to achieve that. However, in case of the old `foldl`based `fill`, we have that `fill K (fill K' e')` is definitionally equal to `fill (K' ++ K) e'` provided that `K'` consists of a bunch of `cons`es (which is always the case, since we obtained `K'` by reshaping `e`). Note that this change hardly affected `heap_lang`. Only the proof of `atomic_correct` broke. I fixed this by proving a more general lemma `ectxi_language_atomic` about `ectxi`languages, which should have been there in the first place.

 14 Feb, 2017 1 commit


Robbert Krebbers authored

 11 Jan, 2017 2 commits


Robbert Krebbers authored

JacquesHenri Jourdan authored

 05 Jan, 2017 1 commit


Ralf Jung 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 1 commit


Ralf Jung authored

 17 Nov, 2016 1 commit


Robbert Krebbers authored
This reverts commit 2a7755fe because it is no longer needed after Matthieu Sozeau reverted this change in Coq 8.6. See also the discussion: [CoqClub] Coq 8.6 typeclasses behavior change at 11/16/2016 02:14 PM.

 15 Nov, 2016 2 commits


Robbert Krebbers authored
In Coq 8.6 type class search is not called recursively on premises that are not type classes. To that end, we use a hint extern to invoke an ordinary auto.

Robbert Krebbers authored

 25 Oct, 2016 1 commit


Robbert Krebbers authored
And also rename the corresponding proof mode tactics.

 23 Aug, 2016 1 commit


Robbert Krebbers authored
Also, since do_head_step no longer has a purpose, I have removed it and just use a bunch of eauto hints.

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

 05 Aug, 2016 1 commit


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

 28 Jul, 2016 1 commit


Ralf Jung authored

 21 Jul, 2016 1 commit


Robbert Krebbers authored
In particular, remove ectx_language.atomic, because it seems unused expect for a smart constructor for language.atomic.
