- Dec 04, 2017
-
-
Robbert Krebbers authored
-
- Nov 21, 2017
-
-
Ralf Jung authored
-
- Oct 25, 2017
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
The advantage is that we can directly use a Coq introduction pattern `cpat` to perform actions to the pure assertion. Before, this had to be done in several steps: iDestruct ... as "[Htmp ...]"; iDestruct "Htmp" as %cpat. That is, one had to introduce a temporary name. I expect this to be quite useful in various developments as many of e.g. our invariants are written as: ∃ x1 .. x2, ⌜ pure stuff ⌝ ∗ spacial stuff.
-
- Apr 19, 2017
-
-
Ralf Jung authored
-
- Jan 27, 2017
-
-
Ralf Jung authored
-
- Jan 09, 2017
-
-
Ralf Jung authored
-
- Jan 06, 2017
- Jan 05, 2017
-
-
Ralf Jung authored
-
- Jan 03, 2017
-
-
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
-
- Dec 09, 2016
-
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
The WP construction now takes an invariant on states as a parameter (part of the irisG class) and no longer builds in the authoritative ownership of the entire state. When instantiating WP with a concrete language on can choose its state invariant. For example, for heap_lang we directly use `auth (gmap loc (frac * dec_agree val))`, and avoid the indirection through invariants entirely. As a result, we no longer have to carry `heap_ctx` around.
-
- Dec 08, 2016
-
-
Ralf Jung authored
-
- Dec 07, 2016
-
- Dec 06, 2016
- Nov 22, 2016
-
-
Ralf Jung authored
-
- Nov 17, 2016
-
-
Robbert Krebbers authored
-
- Nov 03, 2016
-
-
Robbert Krebbers authored
The old choice for ★ was a arbitrary: the precedence of the ASCII asterisk * was fixed at a wrong level in Coq, so we had to pick another symbol. The ★ was a random choice from a unicode chart. The new symbol ∗ (as proposed by David Swasey) corresponds better to conventional practise and matches the symbol we use on paper.
-
- Nov 01, 2016
- Oct 27, 2016
-
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
- Oct 25, 2016
-
-
Robbert Krebbers authored
There are now two proof mode tactics for dealing with modalities: - `iModIntro` : introduction of a modality - `iMod pm_trm as (x1 ... xn) "ipat"` : eliminate a modality The behavior of these tactics can be controlled by instances of the `IntroModal` and `ElimModal` type class. We have declared instances for later, except 0, basic updates and fancy updates. The tactic `iMod` is flexible enough that it can also eliminate an updates around a weakest pre, and so forth. The corresponding introduction patterns of these tactics are `!>` and `>`. These tactics replace the tactics `iUpdIntro`, `iUpd` and `iTimeless`. Source of backwards incompatability: the introduction pattern `!>` is used for introduction of arbitrary modalities. It used to introduce laters by stripping of a later of each hypotheses.
-
Robbert Krebbers authored
And also rename the corresponding proof mode tactics.
-
- Oct 14, 2016
-
-
Jacques-Henri Jourdan authored
-
- Oct 05, 2016
-
-
Robbert Krebbers authored
-
- Oct 04, 2016
-
-
Zhen Zhang authored
-
- Sep 20, 2016
-
-
Robbert Krebbers authored
-
- Aug 26, 2016
-
-
Robbert Krebbers authored
-
Zhen Zhang authored
-
- Aug 25, 2016
-
-
Robbert Krebbers authored
NB: these scopes delimiters were already there before Janno's a0067662.
-
- Aug 09, 2016
-
-
Ralf Jung authored
-
- Aug 08, 2016
-
-
Robbert Krebbers authored
This makes stuff more uniform and also removes the need for the [inGFs] type class. Instead, there is now a type class [subG Σ1 Σ2] which expresses that a list of functors [Σ1] is contained in [Σ2].
-
- Aug 05, 2016
-
-
Robbert Krebbers authored
This better reflects the name of the bind rule. I renamed an internal tactic that was previously called wp_bind into wp_bind_core.
-