 04 Aug, 2016 17 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
Prove some properties about it, and define timeless in terms of it, and factor this notion out of raw view shifts.

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

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored
Also cleanup the file a bit.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

 02 Aug, 2016 9 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Zhen Zhang authored
ticket lock @jung merge? See merge request !1

Zhen Zhang authored

 01 Aug, 2016 7 commits


Robbert Krebbers authored

Robbert Krebbers authored
The new updates allow allocation fresh elements satisfying an arbitrary proposition (for example, being even) instead of just not being in a given finite set. TODO: maybe also do this for finite maps (gmaps).

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
This makes clear that we do not range over Coq terms.

Robbert Krebbers authored

Robbert Krebbers authored
This change makes it possible to use hlists in the proof mode, which itself uses hlists in the implementation of the specialize tactic.

 28 Jul, 2016 6 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
This avoids recompilation of coq_tactics each time an instance is added.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
The new implementation ensures that type class arguments are only infered in the very end. This avoids the need for the inG hack in a0348d7c.

 27 Jul, 2016 1 commit


Aleš Bizjak authored
