- Feb 15, 2016
- Feb 13, 2016
-
-
Robbert Krebbers authored
Also, make our redefinition of done more robust under different orders of Importing modules.
-
- Feb 11, 2016
-
-
Robbert Krebbers authored
Also do some minor clean up.
-
- Feb 04, 2016
-
-
Robbert Krebbers authored
-
- Feb 03, 2016
-
-
Ralf Jung authored
-
- Feb 01, 2016
-
-
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.
-
- Jan 16, 2016
-
-
Robbert Krebbers authored
This one (previously solve_elem_of) was hardly used. The tactic that uses naive_solver (previously esolve_elem_of, now solve_elem_of) has been extended with flags to say which hypotheses should be cleared/kept.
-
- Jan 13, 2016
-
-
Robbert Krebbers authored
-
- Dec 15, 2015
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Dec 08, 2015
-
-
Robbert Krebbers authored
-
- Nov 23, 2015
-
-
Robbert Krebbers authored
-
- Nov 22, 2015
-
-
Robbert Krebbers authored
* Framepreserving updates are now on CMRAs rather than RAs * Excl and auth are now CMRAs * Show that excl and auth are functors * STS is now an CMRA
-
- Nov 20, 2015
-
-
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.
-
- Nov 17, 2015
-
-
Robbert Krebbers authored
-
- Nov 16, 2015
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Nov 11, 2015
-
-
Robbert Krebbers authored
-