 05 Aug, 2016 2 commits


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


Robbert Krebbers authored

Robbert Krebbers authored
1.) iDestruct is able turns
↔ into two implications (because uPred_iff is (type classes) transparent). 2.) iApply only backtracks on turning P↔ Q into P → Q or Q → P when there are no future premises. This is not the case for 'P↔ □ (P → False)'. 
Robbert Krebbers authored
It not behaves more consistently with iExact and thus also works in the case H : P ★ □^n Q  Q.

Ralf Jung authored
show that even \later^n False is inconsistent (for any fixed n); properly use pvs in counter_examples

Ralf Jung authored

 02 Aug, 2016 1 commit


Zhen Zhang authored

 28 Jul, 2016 1 commit


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


Robbert Krebbers authored
This way type class inference is not invokved when used in tactics like iPvs while not having to write an @. (Idea suggested by Ralf.)

Robbert Krebbers authored
This reverts commit 20b4ae55, which does not seem to work with Coq 8.5pl2 (I accidentally tested with 8.5pl1).

Robbert Krebbers authored
This makes type checking more directed, and somewhat more predictable. On the downside, it makes it impossible to declare the singleton on lists as an instance of SingletonM and the insert and alter operations on functions as instances of Alter and Insert. However, these were not used often anyway.

Robbert Krebbers authored

Robbert Krebbers authored
This way, it won't pick arbitrary (and possibly wrong!) inG instances when multiple ones are available. We achieve this by declaring: Hint Mode inG   + So that type class inference only succeeds when the type of the ghost variable does not include any evars. This required me to make some minor changes throughout the whole development making some types explicit.

 25 Jul, 2016 4 commits


Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 22 Jul, 2016 1 commit


Robbert Krebbers authored
Similar files (gmap, listset, ...) were already in singular form and matched the name of the set/map data type.

 21 Jul, 2016 2 commits


Robbert Krebbers authored
In particular, remove ectx_language.atomic, because it seems unused expect for a smart constructor for language.atomic.

Robbert Krebbers authored
Also, remove some unused lemmas about agree.

 20 Jul, 2016 3 commits


JacquesHenri Jourdan authored
* Values are considered as atomic expressions (this does not hurt, and this makes the proofs of atomicity simpler).

Robbert Krebbers authored

Robbert Krebbers authored
Both ndot and nclose involve encodings of countable types, and conversion should thus never unfold these definitions.

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

 04 Jul, 2016 2 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored

 03 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 02 Jul, 2016 3 commits


JacquesHenri Jourdan authored

JacquesHenri Jourdan authored
Lifting lemmas : make the initial state appear under an existential under the view shift. This is still sound, but slightly more expressive.

Robbert Krebbers authored

 01 Jul, 2016 1 commit


Robbert Krebbers authored

 30 Jun, 2016 4 commits


Robbert Krebbers authored

Robbert Krebbers authored
In particular, it no longer uses set_solver (which made it often slow or diverge) but a more specific lemma about subseteq.

Robbert Krebbers authored

Robbert Krebbers authored
Concretely, when execution of any of the wp_ tactics does not yield another wp, it will make sure that a view shift is kept. This behavior was already partially there, but now it is hopefully more consistent.

 23 Jun, 2016 1 commit


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

 19 Jun, 2016 1 commit


Robbert Krebbers authored
