1. 08 Aug, 2016 1 commit
  2. 05 Aug, 2016 3 commits
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
      More introduction patterns. · 4d8c4ac8
      Robbert Krebbers authored
      Also make those for introduction and elimination more symmetric:
      
        !%   pure introduction         %        pure elimination
        !#   always introduction       #        always elimination
        !>   later introduction        > pat    timeless later elimination
        !==> view shift introduction   ==> pat  view shift elimination
      4d8c4ac8
    • Robbert Krebbers's avatar
      Iris 3.0: invariants and weakest preconditions encoded in the logic. · 1f589858
      Robbert Krebbers authored
      This commit features:
      
      - A simpler model. The recursive domain equation no longer involves a triple
        containing invariants, physical state and ghost state, but just ghost state.
        Invariants and physical state are encoded using (higher-order) ghost state.
      
      - (Primitive) view shifts are formalized in the logic and all properties about
        it are proven in the logic instead of the model. Instead, the core logic
        features only a notion of raw view shifts which internalizing performing frame
        preserving updates.
      
      - A better behaved notion of mask changing view shifts. In particular, we no
        longer have side-conditions on transitivity of view shifts, and we have a
        rule for introduction of mask changing view shifts |={E1,E2}=> P with
        E2 ⊆ E1 which allows to postpone performing a view shift.
      
      - The weakest precondition connective is formalized in the logic using Banach's
        fixpoint. All properties about the connective are proven in the logic instead
        of directly in the model.
      
      - Adequacy is proven in the logic and uses a primitive form of adequacy for
        uPred that only involves raw views shifts and laters.
      
      Some remarks:
      
      - I have removed binary view shifts. I did not see a way to describe all rules
        of the new mask changing view shifts using those.
      - There is no longer the need for the notion of "frame shifting assertions" and
        these are thus removed. The rules for Hoare triples are thus also stated in
        terms of primitive view shifts.
      
      TODO:
      
      - Maybe rename primitive view shift into something more sensible
      - Figure out a way to deal with closed proofs (see the commented out stuff in
        tests/heap_lang and tests/barrier_client).
      1f589858
  3. 02 Aug, 2016 1 commit
  4. 27 Jul, 2016 2 commits
    • Robbert Krebbers's avatar
      Declare inG arguments of own_* implicit but not maximally inserted. · de9438cb
      Robbert Krebbers authored
      This way type class inference is not invokved when used in tactics
      like iPvs while not having to write an @.
      
      (Idea suggested by Ralf.)
      de9438cb
    • Robbert Krebbers's avatar
      Make type class inference for inG less eager. · a0348d7c
      Robbert Krebbers authored
      This way, it won't pick arbitrary (and possibly wrong!) inG instances
      when multiple ones are available. We achieve this by declaring:
      
        Hint Mode inG - - +
      
      So that type class inference only succeeds when the type of the ghost
      variable does not include any evars.
      
      This required me to make some minor changes throughout the whole
      development making some types explicit.
      a0348d7c
  5. 13 Jul, 2016 1 commit
  6. 03 Jul, 2016 2 commits
  7. 16 Jun, 2016 3 commits
  8. 01 Jun, 2016 1 commit
  9. 31 May, 2016 3 commits
  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. 27 May, 2016 1 commit
  12. 24 May, 2016 1 commit
    • Robbert Krebbers's avatar
      Make specialization patterns for persistent premises more uniform. · 65bfa071
      Robbert Krebbers authored
      Changes:
      - We no longer have a different syntax for specializing a term H : P -★ Q whose
        range P or domain Q is persistent. There is just one syntax, and the system
        automatically determines whether either P or Q is persistent.
      - While specializing a term, always modalities are automatically stripped. This
        gets rid of the specialization pattern !.
      - Make the syntax of specialization patterns more consistent. The syntax for
        generating a goal is [goal_spec] where goal_spec is one of the following:
      
          H1 .. Hn : generate a goal using hypotheses H1 .. Hn
         -H1 .. Hn : generate a goal using all hypotheses but H1 .. Hn
                 # : generate a goal for the premise in which all hypotheses can be
                     used. This is only allowed when specializing H : P -★ Q where
                     either P or Q is persistent.
                 % : generate a goal for a pure premise.
      65bfa071
  13. 07 May, 2016 1 commit
  14. 15 Mar, 2016 1 commit
  15. 11 Mar, 2016 1 commit
  16. 10 Mar, 2016 2 commits
  17. 08 Mar, 2016 1 commit
  18. 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
  19. 06 Mar, 2016 2 commits
  20. 05 Mar, 2016 1 commit
  21. 02 Mar, 2016 1 commit
  22. 01 Mar, 2016 1 commit
  23. 27 Feb, 2016 1 commit
  24. 25 Feb, 2016 3 commits
  25. 24 Feb, 2016 4 commits