 25 Apr, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 24 Apr, 2016 2 commits


Ralf Jung authored
 21 Apr, 2016 4 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Ralf Jung authored

 20 Apr, 2016 8 commits


Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored
Now, it bases the type the quantifier ranges over on the goal, instead of the witness. This works better when dealing with witnesses involving type class constraints.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
 It can now also frame under later.  Better treatment of evars, it now won't end up in loops whenever the goal involves subformulas ?P and it trying to apply all framing rules eagerly.  It no longer delta expands while framing.  Better clean up of True subformulas after a successful frame. For example, framing "P" in "▷ ▷ P ★ Q" yields just "Q" instead of "▷ True ★ Q" or so.

Robbert Krebbers authored

Ralf Jung authored

 19 Apr, 2016 23 commits


Robbert Krebbers authored
Par is now defined as an expression of type [∀ X, expr X] (instead of a value) and we prove that it is stable under weakening and substitution.

Robbert Krebbers authored

Robbert Krebbers authored
It is just a test case and not really part of the barrier library.

Robbert Krebbers authored
This gets rid of the (ambiguous) notation %l, because we can declare LitLoc as a coercion. It also shortens the code.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored
