 31 May, 2016 18 commits


JacquesHenri Jourdan authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
Now, for example, when having equiv (Some x) (Some y) it will try to find a Proper whose range is an equiv before hitting the eq instance. My hack is general enough that it works for Forall2, dist, and so on, too.

Robbert Krebbers authored
It used to be: (P ={E}=> Q) := (True ⊢ (P → ={E}=> Q)) Now it is: (P ={E}=> Q) := (P ⊢ ={E}=> Q)

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 30 May, 2016 17 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
It is now able to destruct:  [own γ (a1 ⋅ a1)] into [own γ a1] and [own γ a2]  [own γ a] into [own γ a] and [own γ a] if [a] is persistent  [own γ (a,b)] by proceeding recursively.  [own γ (Some a)] by preceeding resursively.

Robbert Krebbers authored

Robbert Krebbers authored

 29 May, 2016 4 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 28 May, 2016 1 commit


Robbert Krebbers authored
