 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
