 09 Dec, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 08 Dec, 2016 1 commit


Ralf Jung authored

 09 Nov, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
This reverts commit f3222ba2 because it broke the machinery for determining whether a term is closed. Example, by Morten: Definition dummy : val := λ: <>, #true  #false.

 28 Oct, 2016 1 commit


Robbert Krebbers authored
Otherwise, some ifs are being pretty printed as  or &&.

 25 Aug, 2016 1 commit


Janno authored

 05 Aug, 2016 1 commit


Robbert Krebbers authored
This commit features:  A simpler model. The recursive domain equation no longer involves a triple containing invariants, physical state and ghost state, but just ghost state. Invariants and physical state are encoded using (higherorder) ghost state.  (Primitive) view shifts are formalized in the logic and all properties about it are proven in the logic instead of the model. Instead, the core logic features only a notion of raw view shifts which internalizing performing frame preserving updates.  A better behaved notion of mask changing view shifts. In particular, we no longer have sideconditions on transitivity of view shifts, and we have a rule for introduction of mask changing view shifts ={E1,E2}=> P with E2 ⊆ E1 which allows to postpone performing a view shift.  The weakest precondition connective is formalized in the logic using Banach's fixpoint. All properties about the connective are proven in the logic instead of directly in the model.  Adequacy is proven in the logic and uses a primitive form of adequacy for uPred that only involves raw views shifts and laters. Some remarks:  I have removed binary view shifts. I did not see a way to describe all rules of the new mask changing view shifts using those.  There is no longer the need for the notion of "frame shifting assertions" and these are thus removed. The rules for Hoare triples are thus also stated in terms of primitive view shifts. TODO:  Maybe rename primitive view shift into something more sensible  Figure out a way to deal with closed proofs (see the commented out stuff in tests/heap_lang and tests/barrier_client).

 18 Jul, 2016 1 commit


Robbert Krebbers authored

 15 Jul, 2016 1 commit


Robbert Krebbers authored

 12 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 23 Jun, 2016 1 commit


Robbert Krebbers authored

 10 May, 2016 1 commit


Robbert Krebbers authored

 19 Apr, 2016 4 commits


Robbert Krebbers authored

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
That way, we do not have useless type annotations of the form "v : language.val heap_lang" cluttering about any goal. Note, that we could decide to eta expand everywhere (as we do for ∀ and ∃), and use the notation "WP e {{ Q }}" for "wp e ⊤ (λ _, Q)".

 15 Mar, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

 10 Mar, 2016 4 commits


Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 05 Mar, 2016 3 commits


Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

 04 Mar, 2016 1 commit


Robbert Krebbers authored

 03 Mar, 2016 1 commit


Robbert Krebbers authored

 02 Mar, 2016 5 commits


Ralf Jung authored

Ralf Jung authored

Ralf Jung authored
get rid of substitution in Case (use lambdas); introduce Match as derived form that involves binders

Robbert Krebbers authored
We no longer abuse empty strings for anonymous binders. Instead, we now have a data type for binders: a binder is either named or anonymous.

Robbert Krebbers authored

 01 Mar, 2016 1 commit


Robbert Krebbers authored

 29 Feb, 2016 1 commit


Ralf Jung authored

 27 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
