- 23 May, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 28 Mar, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 25 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 11 Apr, 2017 2 commits
- 07 Apr, 2017 1 commit
-
-
Ralf Jung authored
-
- 27 Jan, 2017 1 commit
-
-
Ralf Jung 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
-
- 13 Dec, 2016 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 09 Dec, 2016 2 commits
-
-
Ralf Jung authored
-
Robbert Krebbers authored
-
- 24 Nov, 2016 1 commit
-
-
Jacques-Henri Jourdan authored
The idea on magic wand is to use it for curried lemmas and use ⊢ for uncurried lemmas.
-
- 23 Nov, 2016 1 commit
-
-
- 22 Nov, 2016 1 commit
-
-
We do this by introducing a type class UpClose with notation ↑. The reason for this change is as follows: since `nclose : namespace → coPset` is declared as a coercion, the notation `nclose N ⊆ E` was pretty printed as `N ⊆ E`. However, `N ⊆ E` could not be typechecked because type checking goes from left to right, and as such would look for an instance `SubsetEq namespace`, which causes the right hand side to be ill-typed.
-
- 17 Nov, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 03 Nov, 2016 1 commit
-
-
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.
-
- 28 Oct, 2016 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 25 Oct, 2016 3 commits
-
-
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
-
Robbert Krebbers authored
And also rename the corresponding proof mode tactics.
-
- 05 Oct, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 20 Sep, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 25 Aug, 2016 1 commit
-
-
Robbert Krebbers authored
-