 25 Feb, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
It now turns setoid equalities into Leibniz equalities when possible, and substitutes those.

 24 Feb, 2016 8 commits


Robbert Krebbers authored
* Use sig instead of sigT: the proof is a Prop after all * Tweak implicit arguments * Shorten proof of sigma

Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored
This way it behaves better for discrete CMRAs.

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

 23 Feb, 2016 4 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
I am now also using reification to obtain the indexes corresponding to the stuff we want to cancel instead of relying on matching using Ltac.

Ralf Jung authored

 22 Feb, 2016 2 commits


Robbert Krebbers authored
Also, give all these global functors the suffix GF to avoid shadowing such as we had with authF. And add some type annotations for clarity.

Ralf Jung authored
I added a new typeclass "inGF" to witness that a particular *functor* is part of \Sigma. inG, in contrast, witnesses a particular *CMRA* to be in there, after applying the functor to "\later iProp". inGF can be inferred if that functor is consed to the head of \Sigma, and it is preserved by consing a new functor to \Sigma. This is not the case for inG since the recursive occurence of \Sigma also changes. For evry construction (auth, sts, saved_prop), there is an instance infering the respective authG, stsG, savedPropG from an inGF. There is also a global inG_inGF, but Coq is unable to use it. I tried to instead have *only* inGF, since having both typeclasses seemed weird. However, then the actual type that e.g. "own" is about is the result of applying a functor, and Coq entirely fails to infer anything. I had to add a few type annotations in heap.v, because Coq tried to use the "authG_inGF" instance before the A got fixed, and ended up looping and expanding endlessly on that proof of timelessness. This does not seem entirely unreasonable, I was honestly surprised Coq was able to infer the types previously.

 20 Feb, 2016 2 commits
 19 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 18 Feb, 2016 1 commit


Robbert Krebbers authored
This avoids ambiguity with P and Q that we were using before for both uPreds/iProps and indexed uPreds/iProps.

 17 Feb, 2016 2 commits
 16 Feb, 2016 5 commits


Robbert Krebbers authored
The singleton maps notation is now also more consistent with the insert <[_ := _]> _ notation for maps.

Robbert Krebbers authored
* These type classes bundle an identifier into the global CMRA with a proof that the identifier points to the correct CMRA. Bundling allows us to get rid of many arguments everywhere. * I have setup the type classes so that we no longer have to keep track of the global CMRA identifiers. These are implicit and resolved automatically. * For heap I am also bundling the name of the heap RA instance. There always should be at most one heap instance so this does not introduce ambiguities. * We now have a "maps to" notation!

Ralf Jung authored
Whenever clients get this stuff out of invariants, this is much more convenient for them, compared to applying timelessness themselves. On the other hand, this makes the test proofs slightly more annoying, since they have to manually strip away that later. I am not sure if it is worth having separate lemmas (well, tactics, soon) for that. Eventually, we should have a tactic which, given "... * P * ...  ... * \later^n P * ...", automatically gets rid of the P.

Robbert Krebbers authored
We now have: Π★{map Q } ... Π★{set Q } ... to differentiate between sets and maps.

Robbert Krebbers authored
With nicely overloaded notations for sets and maps.

 15 Feb, 2016 1 commit


Ralf Jung authored

 14 Feb, 2016 11 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
This is shorter and more consistent with naming elsewhere.

Robbert Krebbers authored
This makes the proofs a lot nicer. I tried factoring out some properties about finite maps, but this was not entirely satisfactory. It would be nice to generalize from_heap_None and heap_singleton_inv_l somehow.

Robbert Krebbers authored

Robbert Krebbers authored
This works better with class interference.

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored
