 16 Jun, 2016 3 commits


Robbert Krebbers authored
This introduces n hypotheses and destructs the nth one.

Robbert Krebbers authored

Robbert Krebbers authored

 01 Jun, 2016 1 commit


Robbert Krebbers authored

 31 May, 2016 3 commits


Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →. 
Ralf Jung authored

Robbert Krebbers authored
It used to be: (P ={E}=> Q) := (True ⊢ (P → ={E}=> Q)) Now it is: (P ={E}=> Q) := (P ⊢ ={E}=> Q)

 28 May, 2016 1 commit


Robbert Krebbers authored
Based on an idea and WIP commits of JH. 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

 27 May, 2016 1 commit


Robbert Krebbers authored

 24 May, 2016 1 commit


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.

 07 May, 2016 1 commit


Robbert Krebbers authored

 15 Mar, 2016 1 commit


Robbert Krebbers authored

 11 Mar, 2016 1 commit


Robbert Krebbers authored

 10 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 08 Mar, 2016 1 commit


Ralf Jung authored

 07 Mar, 2016 1 commit


Ralf Jung authored
Add both nonexpansive 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 userdefined functor to any place we want. In particular, we can now have "\later (iProp > iProp)" in the ghost CMRA.

 06 Mar, 2016 2 commits
 05 Mar, 2016 1 commit


Ralf Jung authored

 02 Mar, 2016 1 commit


Robbert Krebbers authored
This cleans up some adhoc stuff and prepares for a generalization of saved propositions.

 01 Mar, 2016 1 commit


Robbert Krebbers authored

 27 Feb, 2016 1 commit


Ralf Jung authored

 25 Feb, 2016 3 commits


Ralf Jung authored

Robbert Krebbers authored

Ralf Jung authored

 24 Feb, 2016 6 commits


Robbert Krebbers authored
* Use sig instead of sigT: the proof is a Prop after all * Tweak implicit arguments * Shorten proof of sigma

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

 23 Feb, 2016 3 commits


Ralf Jung authored

Robbert Krebbers authored
I am now also using reification to obtain the indexes corresponding to the stuff we want to cancel instead of relying on matching using Ltac.

Ralf Jung authored

 22 Feb, 2016 3 commits


Robbert Krebbers authored
And now the part that I forgot to commit.

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.

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.

 20 Feb, 2016 2 commits