1. 25 Oct, 2016 1 commit
  2. 14 Aug, 2016 1 commit
  3. 21 Jul, 2016 1 commit
  4. 01 Jul, 2016 1 commit
  5. 31 May, 2016 1 commit
  6. 28 May, 2016 1 commit
    • Robbert Krebbers's avatar
      CMRAs with partial cores. · cfb00b3e
      Robbert Krebbers authored
      Based on an idea and WIP commits of J-H. Jourdan: the core of a CMRA
      A is now a partial function A → option A.
      
      TODO: define sum CMRA
      TODO: remove one shot CMRA and define it in terms of sum
      cfb00b3e
  7. 25 May, 2016 1 commit
    • Robbert Krebbers's avatar
      Tweak the algebraic hierarchy. · a3d0a338
      Robbert Krebbers authored
      - Make the carrier argument of the constructors for the canonical structures
        cofeT and cmraT explicit. This way we make sure the carrier is properly
        exposed, instead of some alias of the carrier.
      - Make derived constructions (such as discreteC and discreteR) notations
        instead of definitions. This is yet again to make sure that the carrier is
        properly exposed.
      - Turn DRA into a canonical structure (it used to be a type class).
      
      This fixes some issues, notably it fixes some broken rewrites in algebra/sts
      and it makes canonical structures work properly with dec_agree.
      a3d0a338
  8. 15 Mar, 2016 1 commit
  9. 11 Mar, 2016 1 commit
  10. 10 Mar, 2016 2 commits
  11. 08 Mar, 2016 1 commit
  12. 07 Mar, 2016 2 commits
  13. 06 Mar, 2016 1 commit
  14. 02 Mar, 2016 1 commit
  15. 01 Mar, 2016 1 commit
  16. 29 Feb, 2016 2 commits
  17. 26 Feb, 2016 2 commits
    • Robbert Krebbers's avatar
      Simplify CMRAMonotone. · ca3da7ca
      Robbert Krebbers authored
      It now also contains a non-expansiveness proof.
      ca3da7ca
    • Robbert Krebbers's avatar
      Simplify CMRA axioms. · aa947529
      Robbert Krebbers authored
      I have simplified the following CMRA axioms:
      
        cmra_unit_preservingN n x y : x ≼{n} y → unit x ≼{n} unit y;
        cmra_op_minus n x y : x ≼{n} y → x ⋅ y ⩪ x ≡{n}≡ y;
      
      By dropping off the step-index, so into:
      
        cmra_unit_preservingN x y : x ≼ y → unit x ≼ unit y;
        cmra_op_minus x y : x ≼ y → x ⋅ y ⩪ x ≡ y;
      
      The old axioms can be derived.
      aa947529
  18. 25 Feb, 2016 1 commit
  19. 24 Feb, 2016 3 commits
  20. 23 Feb, 2016 1 commit
  21. 20 Feb, 2016 1 commit
  22. 18 Feb, 2016 1 commit
  23. 17 Feb, 2016 1 commit
  24. 13 Feb, 2016 4 commits
  25. 11 Feb, 2016 1 commit
  26. 10 Feb, 2016 2 commits
    • Robbert Krebbers's avatar
      COFE distance is no longer trivial at index 0. · 07d525a0
      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.
      07d525a0
    • Ralf Jung's avatar
      f6909092
  27. 05 Feb, 2016 1 commit
  28. 04 Feb, 2016 2 commits
  29. 01 Feb, 2016 1 commit
    • Robbert Krebbers's avatar
      Remove RA from the hierarchy. · b936a5ca
      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.
      b936a5ca