 05 Sep, 2016 1 commit


Robbert Krebbers authored

 30 Aug, 2016 1 commit


Robbert Krebbers authored

 25 Aug, 2016 1 commit


Robbert Krebbers authored
Following the time anology of later, the stepindex 0 corresponds does not correspond to 'now', but rather to the end of time (i.e. 'last').

 24 Aug, 2016 2 commits


Robbert Krebbers authored
This is allowed as long as one of the conjuncts is thrown away (i.e. is a wildcard _ in the introduction pattern). It corresponds to the principle of "external choice" in linear logic.

Robbert Krebbers authored

 05 Aug, 2016 2 commits


Robbert Krebbers authored

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).

 28 Jul, 2016 2 commits


Robbert Krebbers authored
This avoids recompilation of coq_tactics each time an instance is added.

Robbert Krebbers authored
The new implementation ensures that type class arguments are only infered in the very end. This avoids the need for the inG hack in a0348d7c.

 27 Jul, 2016 1 commit


Robbert Krebbers authored

 25 Jul, 2016 4 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 05 Jul, 2016 1 commit


Robbert Krebbers authored

 30 Jun, 2016 1 commit


Robbert Krebbers authored
This tweak allows us to declare pvs as an instance of FromPure (it is not an instance of IntoPure), making some tactics (like iPureIntro and done) work with pvs too.

 29 Jun, 2016 1 commit


Robbert Krebbers authored

 27 Jun, 2016 2 commits


Robbert Krebbers authored
We are now using the prefixes Into, From, and Is (the first two are inspired by the names of some traits in the Rust stdlib), and hopefully doing that consistenly.

Robbert Krebbers authored

 24 Jun, 2016 1 commit


Robbert Krebbers authored

 23 Jun, 2016 2 commits


Robbert Krebbers authored
This is more consistent with the proofmode, where we also call it pure.

Robbert Krebbers authored

 17 Jun, 2016 1 commit


Robbert Krebbers authored

 15 Jun, 2016 1 commit


Robbert Krebbers authored

 01 Jun, 2016 1 commit


Robbert Krebbers authored
Generating a fresh name consists of two stages: + Use [cbv] to compute a list representing the domain of the environment. This is a very simply computation that just erases the hypotheses. + Use [vm_compute] to compute a fresh name based on the list representing the domain. The domain itself should never contain evars, so [vm_compute] will do the job.

 31 May, 2016 1 commit


Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →.

 30 May, 2016 2 commits


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.

 27 May, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 24 May, 2016 4 commits


Robbert Krebbers authored
Rationale: to make the code closer to what is on paper, I want the notations to look like quantifiers, i.e. have a binder builtin. I thus introduced the following notations: [★ map] k ↦ x ∈ m, P [★ set] x ∈ X, P The good thing  contrary to the notations that we had before that required an explicit lambda  is that type annotations of k and x are now not printed making goals much easier to read.

Robbert Krebbers authored
To do so, we have introduced the specialization patterns: =>[H1 .. Hn] and =>[H1 .. Hn] That generate a goal in which the view shift is preserved. These specialization patterns can also be used for e.g. iApply. Note that this machinery is not tied to primitive view shifts, and works for various kinds of goal (as captured by the ToAssert type class, which describes how to transform the asserted goal based on the main goal). TODO: change the name of these specialization patterns to reflect this generality.

Robbert Krebbers authored

Robbert Krebbers authored
Changes:  We no longer have a different syntax for specializing a term H : P ★ Q whose range P or domain Q is persistent. There is just one syntax, and the system automatically determines whether either P or Q is persistent.  While specializing a term, always modalities are automatically stripped. This gets rid of the specialization pattern !.  Make the syntax of specialization patterns more consistent. The syntax for generating a goal is [goal_spec] where goal_spec is one of the following: H1 .. Hn : generate a goal using hypotheses H1 .. Hn H1 .. Hn : generate a goal using all hypotheses but H1 .. Hn # : generate a goal for the premise in which all hypotheses can be used. This is only allowed when specializing H : P ★ Q where either P or Q is persistent. % : generate a goal for a pure premise.

 20 May, 2016 1 commit


Robbert Krebbers authored
I have introduced the following definition to avoid many case analyses where both branches had nearly identical proofs. Definition uPred_always_if {M} (p : bool) (P : uPred M) : uPred M := (if p then □ P else P)%I.

 07 May, 2016 1 commit


Robbert Krebbers authored

 06 May, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 03 May, 2016 1 commit


Robbert Krebbers authored
We now give frame_here priority 0, so it is used immediately when an evar occurs. This thus avoids loops in the presence of evars.

 02 May, 2016 1 commit


Robbert Krebbers authored
iSpecialize and iDestruct. These tactics now all take an iTrm, which is a tuple consisting of a.) a lemma or name of a hypotheses b.) arguments to instantiate c.) a specialization pattern.
