1. 22 Jul, 2016 2 commits
  2. 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
  3. 23 Mar, 2016 1 commit
  4. 11 Mar, 2016 3 commits
  5. 10 Mar, 2016 1 commit
  6. 08 Mar, 2016 1 commit
  7. 07 Mar, 2016 1 commit
  8. 03 Mar, 2016 1 commit
  9. 01 Mar, 2016 1 commit
  10. 29 Feb, 2016 1 commit
  11. 25 Feb, 2016 2 commits
  12. 24 Feb, 2016 4 commits
  13. 23 Feb, 2016 2 commits
  14. 22 Feb, 2016 4 commits
    • Robbert Krebbers's avatar
      Fix mess by my previous commits ... · e9af95ac
      Robbert Krebbers authored
      due to an accidental git commit --amend after a git push.
      e9af95ac
    • Robbert Krebbers's avatar
      Let set_solver not use eauto by default. · 9aff6bb6
      Robbert Krebbers authored
      In most cases there is a lot of duplicate proof search performed by
      both naive_solver and eauto. Especially since naive_solver calls its
      tactic (in the case of set_solver this used to be eauto) quite eagerly
      this made it very slow.
      
      Note that set_solver is this too slow and should be improved.
      9aff6bb6
    • Robbert Krebbers's avatar
      Let set_solver not use eauto by default. · de5f0f84
      Robbert Krebbers authored
      In most cases there is a lot of duplicate proof search performed by
      both naive_solver and eauto. Especially since naive_solver calls its
      tactic (in the case of set_solver this used to be eauto) quite eagerly
      this made it very slow.
      
      Note that set_solver is this too slow and should be improved.
      de5f0f84
    • Robbert Krebbers's avatar
      Small STS tweaks. · b7b455bd
      Robbert Krebbers authored
      b7b455bd
  15. 21 Feb, 2016 2 commits
  16. 20 Feb, 2016 3 commits
  17. 19 Feb, 2016 1 commit
  18. 17 Feb, 2016 6 commits
  19. 16 Feb, 2016 3 commits
    • Robbert Krebbers's avatar
      Many STS tweaks: · 9997d0ef
      Robbert Krebbers authored
      * Clearly separate the file algebra/sts in three parts:
        1.) The definition of an STS, step relations, and closure stuff
        2.) The construction as a disjoint RA (this module should never be used)
        3.) The construction as a CMRA with many derived properties
      * Turn stsT into a canonical structure so that we can make more of its arguments
        implicit.
      * Rename the underlying step relation of STSs to prim_step (similar naming as
        for languages, but here in a module to avoid ambiguity)
      * Refactor program_logic/sts by moving general properties of the STS CMRA to
        algebra/sts.v
      * Make naming and use of modules in program_logic/sts more consistent with
        program_logic/auth and program_logic/saved_prop
      * Prove setoid properties of all definitions in program_logic/sts
      9997d0ef
    • Ralf Jung's avatar
    • Ralf Jung's avatar