 08 Aug, 2016 4 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored
In most cases it is a temporary whose name is useless and just clutters the error message.

Robbert Krebbers authored

Robbert Krebbers authored

 05 Aug, 2016 7 commits


Robbert Krebbers authored
This fixes issue #25.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
Also make those for introduction and elimination more symmetric: !% pure introduction % pure elimination !# always introduction # always elimination !> later introduction > pat timeless later elimination !==> view shift introduction ==> pat view shift elimination

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

 04 Aug, 2016 4 commits


Robbert Krebbers authored
Prove some properties about it, and define timeless in terms of it, and factor this notion out of raw view shifts.

Robbert Krebbers authored
It not behaves more consistently with iExact and thus also works in the case H : P ★ □^n Q  Q.

Robbert Krebbers authored

Robbert Krebbers authored

 02 Aug, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 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 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This reverts commit c43eb936. The hack using class_apply has some strange behaviors, see: https://sympa.inria.fr/sympa/arc/coqclub/201607/msg00094.html

 26 Jul, 2016 1 commit


Robbert Krebbers authored

 25 Jul, 2016 5 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 19 Jul, 2016 1 commit


Robbert Krebbers authored
I also reverted 7952bca4 since there is no need for atomic to be a boolean predicate anymore. Moreover, I introduced a hint database fsaV for solving sideconditions related to FSAs, in particular, sideconditions related to expressions being atomic.

 13 Jul, 2016 1 commit


Robbert Krebbers authored
The intropattern {H} also meant clear (both in ssreflect, and the logic part of the introduction pattern).

 05 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 03 Jul, 2016 1 commit


Robbert Krebbers authored
That way type class search becomes more predictable.

 30 Jun, 2016 6 commits


Robbert Krebbers authored

Robbert Krebbers authored
For example iIntros "{$H1 H2} H1" frames H1, clears H2, and introduces H1.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
This fixes a bug in 916ff44a causing proof mode notations not being pretty printed.

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 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
