 13 Dec, 2016 1 commit


Ralf Jung authored

 09 Dec, 2016 1 commit


Ralf Jung authored

 25 Nov, 2016 1 commit


Ralf Jung authored

 22 Nov, 2016 1 commit


Ralf Jung authored
Use COFEs only for the recursive domain equation solver

 25 Oct, 2016 1 commit


Robbert Krebbers authored

 14 Aug, 2016 1 commit


Robbert Krebbers authored
This is more consistent with the definition of the extension order, which is also defined in terms of an existential.

 21 Jul, 2016 1 commit


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

 01 Jul, 2016 1 commit


Robbert Krebbers authored
This may save the need to seal off some stuff.

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

 28 May, 2016 1 commit


Robbert Krebbers authored
Based on an idea and WIP commits of JH. Jourdan: the core of a CMRA A is now a partial function A → option A. TODO: define sum CMRA TODO: remove one shot CMRA and define it in terms of sum

 25 May, 2016 1 commit


Robbert Krebbers authored
 Make the carrier argument of the constructors for the canonical structures cofeT and cmraT explicit. This way we make sure the carrier is properly exposed, instead of some alias of the carrier.  Make derived constructions (such as discreteC and discreteR) notations instead of definitions. This is yet again to make sure that the carrier is properly exposed.  Turn DRA into a canonical structure (it used to be a type class). This fixes some issues, notably it fixes some broken rewrites in algebra/sts and it makes canonical structures work properly with dec_agree.

 15 Mar, 2016 1 commit


Robbert Krebbers authored

 11 Mar, 2016 1 commit


Robbert Krebbers authored
The only drawback is that we have to restrict iprod to finite types, but that is fine.

 10 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 08 Mar, 2016 1 commit


Ralf Jung authored

 07 Mar, 2016 2 commits


Robbert Krebbers authored
So, only use the type class for contractive functors.

Ralf Jung authored
Add both nonexpansive and contractive functors, and bundle them for the general Iris instance as well as the global functor construction This allows us to move the \later in the userdefined functor to any place we want. In particular, we can now have "\later (iProp > iProp)" in the ghost CMRA.

 06 Mar, 2016 1 commit


Robbert Krebbers authored
Since functor instances are just used as combinators, there is really no need for functors that are not contractive.

 02 Mar, 2016 1 commit


Robbert Krebbers authored
This cleans up some adhoc stuff and prepares for a generalization of saved propositions.

 01 Mar, 2016 1 commit


Robbert Krebbers authored

 29 Feb, 2016 2 commits
 26 Feb, 2016 2 commits


Robbert Krebbers authored
It now also contains a nonexpansiveness proof.

Robbert Krebbers authored
I have simplified the following CMRA axioms: cmra_unit_preservingN n x y : x ≼{n} y → unit x ≼{n} unit y; cmra_op_minus n x y : x ≼{n} y → x ⋅ y ⩪ x ≡{n}≡ y; By dropping off the stepindex, so into: cmra_unit_preservingN x y : x ≼ y → unit x ≼ unit y; cmra_op_minus x y : x ≼ y → x ⋅ y ⩪ x ≡ y; The old axioms can be derived.

 25 Feb, 2016 1 commit


Robbert Krebbers authored
The performance gain seems neglectable, unfortunatelly...

 24 Feb, 2016 3 commits


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

Robbert Krebbers authored

Robbert Krebbers authored
This better seals off their definition. Although it did not give much of a speedup, I think it is conceptually nicer.

 23 Feb, 2016 1 commit


Ralf Jung authored

 20 Feb, 2016 1 commit


Ralf Jung authored

 18 Feb, 2016 1 commit


Robbert Krebbers authored

 17 Feb, 2016 1 commit


Robbert Krebbers authored

 13 Feb, 2016 4 commits


Robbert Krebbers authored

Robbert Krebbers authored
(missed practically everything in the previous commit)

Robbert Krebbers authored

Robbert Krebbers authored
Also, make our redefinition of done more robust under different orders of Importing modules.

 11 Feb, 2016 1 commit


Robbert Krebbers authored
Also do some minor clean up.

 10 Feb, 2016 2 commits


Robbert Krebbers authored
This way we avoid many oneoff indexes and no longer need special cases for index 0 in many definitions. For example, the definition of the distance relation on option and excl has become much easier. Also, uPreds no longer need to hold at index 0. In order to make this change possible, we had to change the notions of "contractive functions" and "chains" slightly. Thanks to Aleš Bizjak and Amin Timany for suggesting this change and to help with the proofs.

Ralf Jung authored
