- 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 one-off 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
-
- 05 Feb, 2016 1 commit
-
-
Ralf Jung authored
-
- 04 Feb, 2016 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 01 Feb, 2016 1 commit
-
-
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.
-
- 18 Jan, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 16 Jan, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 14 Jan, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 13 Jan, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 21 Dec, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 15 Dec, 2015 3 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 23 Nov, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 20 Nov, 2015 1 commit
-
-
Robbert Krebbers authored
* Remove the order from RAs, it is now defined in terms of the ⋅ operation. * Define ownership using the step-indexed order. * Remove the order also from DRAs and change STS accordingly. While doing that, I changed STS to no longer use decidable token sets, which removes the requirement of decidable equality on tokens.
-
- 17 Nov, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 16 Nov, 2015 3 commits
-
-
Robbert Krebbers authored
Also change the definition of agreement slightly, so agree_map can be defined for any function, and not just non-expansive functions.
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 12 Nov, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 11 Nov, 2015 1 commit
-
-
Robbert Krebbers authored
-