 23 Mar, 2016 1 commit


Robbert Krebbers authored

 17 Mar, 2016 1 commit


Ralf Jung authored

 12 Mar, 2016 1 commit


Ralf Jung authored

 10 Mar, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 08 Mar, 2016 1 commit


Ralf Jung authored

 07 Mar, 2016 1 commit


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.

 04 Mar, 2016 1 commit


Ralf Jung authored

 02 Mar, 2016 1 commit


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

 25 Feb, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

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

 24 Feb, 2016 1 commit


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

 20 Feb, 2016 1 commit


Ralf Jung authored

 19 Feb, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 18 Feb, 2016 2 commits


Robbert Krebbers authored

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 1 commit


Robbert Krebbers authored
It is doing much more than just dealing with ∈, it solves all kinds of goals involving set operations (including ≡ and ⊆).

 16 Feb, 2016 1 commit


Robbert Krebbers authored

 13 Feb, 2016 1 commit


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

 12 Feb, 2016 2 commits
 11 Feb, 2016 1 commit


Robbert Krebbers authored
Also do some minor clean up.

 10 Feb, 2016 1 commit


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.

 09 Feb, 2016 1 commit


Robbert Krebbers authored

 08 Feb, 2016 1 commit


Ralf Jung authored
Actual proofs will end up using own and inv, and none of the notions defined in ownership.v

 04 Feb, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored
No idea why these aren't resolved automatically, for unary predicates they do not seem necesarry.

Robbert Krebbers authored

 02 Feb, 2016 4 commits


Ralf Jung authored

Ralf Jung authored
...unfortunately, that proof actually got longer because some automation no longer works

Robbert Krebbers authored

Ralf Jung authored

 01 Feb, 2016 1 commit


Robbert Krebbers authored
This way we can more easily state lemmas for concrete languages for arbitrary global functors.

 19 Jan, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 18 Jan, 2016 1 commit


Robbert Krebbers authored
The proofs are neither short nor nice, but at least they compile fast (4 sec for the whole file) and the statements look like they would look like on paper.
