1. 07 May, 2016 1 commit
  2. 15 Mar, 2016 1 commit
  3. 11 Mar, 2016 1 commit
  4. 10 Mar, 2016 2 commits
  5. 08 Mar, 2016 1 commit
  6. 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
  7. 06 Mar, 2016 2 commits
  8. 05 Mar, 2016 1 commit
  9. 02 Mar, 2016 1 commit
  10. 01 Mar, 2016 1 commit
  11. 27 Feb, 2016 1 commit
  12. 25 Feb, 2016 3 commits
  13. 24 Feb, 2016 6 commits
  14. 23 Feb, 2016 3 commits
  15. 22 Feb, 2016 3 commits
    • Robbert Krebbers's avatar
      Move global functor construction to its own file and define notations. · 457a11d9
      Robbert Krebbers authored
      And now the part that I forgot to commit.
      457a11d9
    • Robbert Krebbers's avatar
      Restraint instance search for global functors. · e0d0f8dd
      Robbert Krebbers authored
      Also, give all these global functors the suffix GF to avoid shadowing
      such as we had with authF.
      
      And add some type annotations for clarity.
      e0d0f8dd
    • Ralf Jung's avatar
      add the infrastructure for Coq to automatically infer the "inG" instances · 95c486ef
      Ralf Jung authored
      I added a new typeclass "inGF" to witness that a particular *functor* is part of \Sigma. inG, in contrast, witnesses a particular *CMRA* to be in there, after applying the functor to "\later iProp".
      inGF can be inferred if that functor is consed to the head of \Sigma, and it is preserved by consing a new functor to \Sigma. This is not the case for inG since the recursive occurence of \Sigma also changes.
      For evry construction (auth, sts, saved_prop), there is an instance infering the respective authG, stsG, savedPropG from an inGF. There is also a global inG_inGF, but Coq is unable to use it.
      
      I tried to instead have *only* inGF, since having both typeclasses seemed weird. However, then the actual type that e.g. "own" is about is the result of applying a functor, and Coq entirely fails to infer anything.
      
      I had to add a few type annotations in heap.v, because Coq tried to use the "authG_inGF" instance before the A got fixed, and ended up looping and expanding endlessly on that proof of timelessness.
      This does not seem entirely unreasonable, I was honestly surprised Coq was able to infer the types previously.
      95c486ef
  16. 20 Feb, 2016 2 commits
  17. 19 Feb, 2016 1 commit
  18. 18 Feb, 2016 1 commit
  19. 17 Feb, 2016 3 commits
  20. 16 Feb, 2016 2 commits
    • Robbert Krebbers's avatar
      Use bundled type classes for ghost ownership. · b07dd0b5
      Robbert Krebbers authored
      * These type classes bundle an identifier into the global CMRA with a proof
        that the identifier points to the correct CMRA. Bundling allows us to get
        rid of many arguments everywhere.
      
      * I have setup the type classes so that we no longer have to keep track of the
        global CMRA identifiers. These are implicit and resolved automatically.
      
      * For heap I am also bundling the name of the heap RA instance. There always
        should be at most one heap instance so this does not introduce ambiguities.
      
      * We now have a "maps to" notation!
      b07dd0b5
    • Ralf Jung's avatar
      strengthen auth and heap rules to only require the assertion under a later · e9c6a8ea
      Ralf Jung authored
      Whenever clients get this stuff out of invariants, this is much more convenient for them, compared to applying timelessness themselves.
      On the other hand, this makes the test proofs slightly more annoying, since they have to manually strip away that later. I am not sure if it is worth having separate lemmas (well, tactics, soon) for that.
      Eventually, we should have a tactic which, given "... * P * ... |- ... * \later^n P * ...", automatically gets rid of the P.
      e9c6a8ea
  21. 15 Feb, 2016 3 commits