1. 13 Dec, 2016 1 commit
  2. 09 Dec, 2016 1 commit
  3. 25 Nov, 2016 1 commit
  4. 22 Nov, 2016 1 commit
  5. 25 Oct, 2016 1 commit
  6. 14 Aug, 2016 1 commit
  7. 21 Jul, 2016 1 commit
  8. 01 Jul, 2016 1 commit
  9. 31 May, 2016 1 commit
  10. 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
  11. 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
  12. 15 Mar, 2016 1 commit
  13. 11 Mar, 2016 1 commit
  14. 10 Mar, 2016 2 commits
  15. 08 Mar, 2016 1 commit
  16. 07 Mar, 2016 2 commits
  17. 06 Mar, 2016 1 commit
  18. 02 Mar, 2016 1 commit
  19. 01 Mar, 2016 1 commit
  20. 29 Feb, 2016 2 commits
  21. 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
  22. 25 Feb, 2016 1 commit
  23. 24 Feb, 2016 3 commits
  24. 23 Feb, 2016 1 commit
  25. 20 Feb, 2016 1 commit
  26. 18 Feb, 2016 1 commit
  27. 17 Feb, 2016 1 commit
  28. 13 Feb, 2016 4 commits
  29. 11 Feb, 2016 1 commit
  30. 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