 15 Mar, 2016 1 commit


Robbert Krebbers authored

 11 Mar, 2016 2 commits


Robbert Krebbers authored

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

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


Robbert Krebbers authored

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

 20 Feb, 2016 1 commit


Ralf Jung authored

 19 Feb, 2016 1 commit


Robbert Krebbers authored

 17 Feb, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 16 Feb, 2016 1 commit


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

 15 Feb, 2016 2 commits
 13 Feb, 2016 2 commits


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

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

 12 Feb, 2016 1 commit


Ralf Jung authored

 11 Feb, 2016 3 commits


Robbert Krebbers authored
Also do some minor clean up.

Ralf Jung authored

Ralf Jung authored

 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

 09 Feb, 2016 1 commit


Ralf Jung authored

 08 Feb, 2016 1 commit


Ralf Jung authored

 04 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 01 Feb, 2016 2 commits


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

Robbert Krebbers authored
Instead, we have just a construction to create a CMRA from a RA. This construction is also slightly generalized, it now works for RAs over any timeless COFE instead of just the discrete COFE. Also: * Put tactics and big_ops for CMRAs in a separate file. * Valid is now a derived notion (as the limit of validN), so it does not have to be defined by hand for each CMRA. Todo: Make the constructions DRA > CMRA and RA > CMRA more uniform.

 31 Jan, 2016 1 commit


Robbert Krebbers authored

 23 Jan, 2016 1 commit


Ralf Jung authored

 21 Jan, 2016 2 commits
 19 Jan, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 18 Jan, 2016 1 commit


Robbert Krebbers authored

 16 Jan, 2016 1 commit


Robbert Krebbers authored
