 01 Jul, 2016 1 commit


Robbert Krebbers authored

 30 Jun, 2016 1 commit


Robbert Krebbers authored

 29 Jun, 2016 1 commit


Robbert Krebbers authored

 26 Jun, 2016 1 commit


Robbert Krebbers authored

 17 Jun, 2016 1 commit


Robbert Krebbers authored

 16 Jun, 2016 1 commit


Robbert Krebbers authored

 15 Jun, 2016 1 commit


Amin Timany authored

 14 Jun, 2016 1 commit


Amin Timany authored

 28 May, 2016 1 commit


Amin Timany authored

 24 May, 2016 1 commit


Amin Timany authored

 17 May, 2016 1 commit


Amin Timany authored
We still need to prove the many admitted lemmas in rules_binary module.

 16 May, 2016 2 commits


Amin Timany authored
The way the binary relation is defined, the binary fundamental lemma simply doesn't hold. I overlooked the fact that we need to enable CAS only for types where equality is checkable.

Amin Timany authored

 13 May, 2016 1 commit


Amin Timany authored

 06 May, 2016 1 commit


Amin Timany authored

 03 May, 2016 2 commits


Amin Timany authored
commit 392b7b43 Author: Amin Timany <amintimany@gmail.com> Date: Tue May 3 21:25:10 2016 +0200 Finish using new iris with "proof mode" In Fμ and Fμ_ref we do support reduction under Fold. In fact `Unfold (Fold v)` is reduced to `v` if and only if v is a variable. commit 9825e341 Author: Amin Timany <amintimany@gmail.com> Date: Mon May 2 20:35:57 2016 +0200 Prove fundamental lemma of stlc is proven Change the Fμ to make the operational semantics reduce under Fold. Fundamental lemma for Fμ is partially proven (up to App).

Amin Timany authored
In Fμ and Fμ_ref we do support reduction under Fold. In fact `Unfold (Fold v)` is reduced to `v` if and only if v is a variable.

 23 Mar, 2016 1 commit


Amin Timany authored
 ownI_proper for inv  later_contractive for later_ne anymore. Instead we use (contractive_proper _) and (contractive_ne _). Instead we can use (contractive)

 12 Mar, 2016 3 commits


Amin Timany authored

Amin Timany authored

Amin Timany authored
