1. 12 Mar, 2016 1 commit
  2. 10 Mar, 2016 2 commits
  3. 08 Mar, 2016 1 commit
  4. 07 Mar, 2016 1 commit
    • Ralf Jung's avatar
      Add both non-expansive and contractive functors, and bundle them for the... · 2467bf21
      Ralf Jung authored
      Add both non-expansive and contractive functors, and bundle them for the general Iris instance as well as the global functor construction
      
      This allows us to move the \later in the user-defined functor to any place we want.
      In particular, we can now have "\later (iProp -> iProp)" in the ghost CMRA.
      2467bf21
  5. 05 Mar, 2016 2 commits
  6. 02 Mar, 2016 1 commit
  7. 20 Feb, 2016 1 commit
  8. 19 Feb, 2016 1 commit
  9. 18 Feb, 2016 2 commits
  10. 17 Feb, 2016 1 commit
  11. 16 Feb, 2016 1 commit
  12. 13 Feb, 2016 1 commit
  13. 12 Feb, 2016 2 commits
  14. 11 Feb, 2016 1 commit
  15. 10 Feb, 2016 2 commits
  16. 09 Feb, 2016 2 commits
  17. 08 Feb, 2016 1 commit
    • Ralf Jung's avatar
      Do not export ownership · 7ca7ad53
      Ralf Jung authored
      Actual proofs will end up using own and inv, and none of the notions defined in ownership.v
      7ca7ad53
  18. 04 Feb, 2016 2 commits
  19. 02 Feb, 2016 3 commits
    • Ralf Jung's avatar
    • Robbert Krebbers's avatar
      Make names in hoare_lifting more consistent with those in lifting. · a7996f11
      Robbert Krebbers authored
      Still, there are some other inconsistencies between these two files
      that may need fixing, like whether to take fork into account or not
      and order of arguments.
      a7996f11
    • Robbert Krebbers's avatar
      Clean up heap_lang and remove some FIXMEs. · 15058014
      Robbert Krebbers authored
      Notable changes:
      * I am now using the same names for the fields of the language record and the
        instances in heap_lang. In order to deal with shadowing, I have put all
        definitions in heap_lang.v in a module.
      * Instead of defining evaluation contexts recursively, these are now defined
        using lists. This way we can easily reuse operations on lists. For example,
        composition of evaluation contexts is just appending lists. Also, it allowed
        me to simplify the rather complicated proof of step_by_val as induction on
        the shape of contexts no longer results in a blow-up of the number of cases.
      * Use better automation to prove all lemmas of heap_lang.
      * I have introduced tactics to invert steps and to do steps. These tactics
        greatly helped simplifying boring parts of lifting lemmas.
      15058014
  20. 01 Feb, 2016 1 commit
  21. 30 Jan, 2016 1 commit
  22. 19 Jan, 2016 1 commit
  23. 18 Jan, 2016 1 commit
    • Robbert Krebbers's avatar
      Derived lifting lemmas. · a50d7b04
      Robbert Krebbers authored
      The proofs are neither short nor nice, but at least they compile
      fast (4 sec for the whole file) and the statements look like
      they would look like on paper.
      a50d7b04