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


Robbert Krebbers authored

 25 Oct, 2016 4 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

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

 07 Oct, 2016 1 commit


Ralf Jung authored

 27 Sep, 2016 1 commit


Robbert Krebbers authored
Used in iRevert, iClear, iFrame, and for generalizing the IH in iInduction and iLöb.

 08 Aug, 2016 5 commits


Ralf Jung authored

Derek Dreyer authored

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

 05 Aug, 2016 9 commits


Robbert Krebbers authored
Instead of having connectives pvs0 and pvs1 we now have one connective pvs that is indexed by a Boolean.

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
Also make those for introduction and elimination more symmetric: !% pure introduction % pure elimination !# always introduction # always elimination !> later introduction > pat timeless later elimination !==> view shift introduction ==> pat view shift elimination

 04 Aug, 2016 5 commits


Robbert Krebbers authored

Robbert Krebbers authored
1.) iDestruct is able turns
↔ into two implications (because uPred_iff is (type classes) transparent). 2.) iApply only backtracks on turning P↔ Q into P → Q or Q → P when there are no future premises. This is not the case for 'P↔ □ (P → False)'. 
Robbert Krebbers authored
It not behaves more consistently with iExact and thus also works in the case H : P ★ □^n Q  Q.

Ralf Jung authored
show that even \later^n False is inconsistent (for any fixed n); properly use pvs in counter_examples

Ralf Jung authored
