 01 Jun, 2016 1 commit


Robbert Krebbers authored

 31 May, 2016 2 commits


JacquesHenri Jourdan 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
Rationale: to make the code closer to what is on paper, I want the notations to look like quantifiers, i.e. have a binder builtin. I thus introduced the following notations: [★ map] k ↦ x ∈ m, P [★ set] x ∈ X, P The good thing  contrary to the notations that we had before that required an explicit lambda  is that type annotations of k and x are now not printed making goals much easier to read.

 07 May, 2016 1 commit


Robbert Krebbers authored

 06 May, 2016 1 commit


Robbert Krebbers authored

 21 Apr, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 20 Apr, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 19 Apr, 2016 1 commit


Robbert Krebbers authored
This gets rid of the (ambiguous) notation %l, because we can declare LitLoc as a coercion. It also shortens the code.

 12 Apr, 2016 1 commit


Robbert Krebbers authored
It is not a library; it does not contain code, but instead is a core part of heap_lang.

 29 Mar, 2016 1 commit


Robbert Krebbers authored
Also remove some superfluous map_ prefixes.

 20 Mar, 2016 1 commit


Ralf Jung authored

 15 Mar, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 12 Mar, 2016 1 commit


Robbert Krebbers authored

 11 Mar, 2016 1 commit


Robbert Krebbers authored

 10 Mar, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 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 2 commits
 04 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 2 commits
 26 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 25 Feb, 2016 3 commits


Ralf Jung authored
The changes are probably necessary because rewrite now tries harder not to instantiate evars, which it always said it would not do.

Ralf Jung authored

Robbert Krebbers authored
It now turns setoid equalities into Leibniz equalities when possible, and substitutes those.

 24 Feb, 2016 2 commits


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

Robbert Krebbers authored
