 24 Feb, 2016 2 commits


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.

 20 Feb, 2016 1 commit


Ralf Jung authored

 19 Feb, 2016 1 commit


Robbert Krebbers authored

 18 Feb, 2016 1 commit


Robbert Krebbers authored

 17 Feb, 2016 2 commits


Robbert Krebbers authored
simplify_equality => simplify_eq simplify_equality' => simplify_eq/= simplify_map_equality => simplify_map_eq simplify_map_equality' => simplify_map_eq/= simplify_option_equality => simplify_option_eq simplify_list_equality => simplify_list_eq f_equal' => f_equal/= The /= suffixes (meaning: do simpl) are inspired by ssreflect.

Robbert Krebbers authored

 13 Feb, 2016 3 commits


Ralf Jung authored
On branch master modified: algebra/fin_maps.v Untracked files: heap_lang/heap.v no changes added to commit (use "git add" and/or "git commit a")

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.

 11 Feb, 2016 3 commits


Robbert Krebbers authored
Also do some minor clean up.

Robbert Krebbers authored

Robbert Krebbers authored
Instead, I separate it into a total function and a predicate describe whether the action is allowed or not. This has some advantages: * It is much easier to deal with total functions and predicates in Coq than with functions into option. * Already existing functions do not need to be wrapped. Instead, when using a local update you end up with a sensible side condition as a Coq Prop. * The definition of local updates (and all CMRA instances) no longer depend on option.

 10 Feb, 2016 3 commits


Ralf Jung authored

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

 08 Feb, 2016 1 commit


Robbert Krebbers authored

 05 Feb, 2016 1 commit


Ralf Jung authored

 04 Feb, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 03 Feb, 2016 1 commit


Ralf Jung authored

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

 16 Jan, 2016 1 commit


Robbert Krebbers authored

 15 Jan, 2016 1 commit


Robbert Krebbers authored

 14 Jan, 2016 1 commit


Robbert Krebbers authored

 21 Dec, 2015 1 commit


Robbert Krebbers authored

 15 Dec, 2015 1 commit


Robbert Krebbers authored
