 31 May, 2016 1 commit


Amin Timany authored

 30 May, 2016 7 commits


Amin Timany authored

Amin Timany authored

Amin Timany authored
The case of lam and case expressions that before required the terms to be welltyped now require terms to be closed. Separated definition context and context refinement from soundness_binary file.

Amin Timany authored

Amin Timany authored

Amin Timany authored

Amin Timany authored

 29 May, 2016 1 commit


Amin Timany authored
Squashed commit of the following: commit a8d2dd620df2fe8531b590811b7f08d2bc1289b4 Author: Amin Timany <amintimany@gmail.com> Date: Sun May 29 13:54:07 2016 +0200 Prove refinement of fine/coarsegrained stack commit 6347ef920581b4f21b5dfa74d288afcf482c9b50 Author: Amin Timany <amintimany@gmail.com> Date: Sun May 29 01:37:23 2016 +0200 Backup commit 39552d8055f55458c9515e629707d496e26e92b7 Author: Amin Timany <amintimany@gmail.com> Date: Sat May 28 22:40:02 2016 +0200 Backup

 28 May, 2016 6 commits


Amin Timany authored

Amin Timany authored

Amin Timany authored

Amin Timany authored

Amin Timany authored
This is to avoid confusion when Coq loads the module.

Amin Timany authored

 27 May, 2016 4 commits


Amin Timany authored

Amin Timany authored
It now produces a lambda that when evaluated with a value runs the underlying lambda that value after acquiring the lock. As before, the lock is released afterwards.

Amin Timany authored
It now returns the value of the expression evaluated.

Amin Timany authored

 26 May, 2016 2 commits


Amin Timany authored

Amin Timany authored

 25 May, 2016 2 commits


Amin Timany authored

Amin Timany authored

 24 May, 2016 2 commits


Amin Timany authored

Amin Timany authored

 23 May, 2016 2 commits


Amin Timany authored

Amin Timany authored
We used to have: (λ x, b) a >β b[a/x] But now we have: (λ f x, b) a >β b[a/x, (λ f x, b)/f]

 22 May, 2016 4 commits


Amin Timany authored
There is one admit that needs to be taken care of. The admitted case is validity of a monoid element of iprod. At the moment iris doesn't seem to have necessary lemmas to prove this easily.

Amin Timany authored

Amin Timany authored
With this change, recursive types don't use the context for type variables. This allows us to assume that all types in typing context are universally quantified, i.e., they are all polymorphic types.

Amin Timany authored

 21 May, 2016 5 commits


Amin Timany authored
We divide the binary fundamental lemma for Fμ,ref,par into several lemmas. This also generalizes the lemmas. We used to show Δ ∥ Γ ⊩ e ≤log≤ e ∷ τ in the fundamental lemma. But now in smaller lemmas in each case we show Δ ∥ Γ ⊩ e ≤log≤ e' ∷ τ Given some hypotheses of course.

Amin Timany authored

Amin Timany authored

Amin Timany authored

Amin Timany authored

 18 May, 2016 1 commit


Amin Timany authored

 17 May, 2016 3 commits


Amin Timany authored

Amin Timany authored

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