 24 Oct, 2018 1 commit


Joseph Tassarotti authored
Modify adequacy proof to not break the 'fancy update' abstraction. Modify fupd plainly interface and add new derived results.

 14 Jun, 2018 1 commit


Ralf Jung authored

 05 Jun, 2018 1 commit


Ralf Jung authored

 09 May, 2018 1 commit


Robbert Krebbers authored

 03 May, 2018 1 commit


Ralf Jung authored
This follows the proof at https://en.wikipedia.org/wiki/L%C3%B6b's_theorem#Proof_of_L%C3%B6b's_theorem

 09 Apr, 2018 1 commit


JacquesHenri Jourdan authored
rename : affinely_persistently > intuitionistically. Add lemma about monpred_at and intuitionistically.

 05 Apr, 2018 2 commits
 04 Apr, 2018 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 19 Mar, 2018 1 commit


Ralf Jung authored

 16 Mar, 2018 1 commit


Robbert Krebbers authored
The old one is admissable. Thanks to @jtassaro and @jung.

 13 Mar, 2018 1 commit


JacquesHenri Jourdan authored

 05 Mar, 2018 1 commit


Ralf Jung authored
This is backwardscompatible; it desugars to a normal application on previous versions

 04 Mar, 2018 4 commits


Robbert Krebbers authored

Robbert Krebbers authored
sed i 's/∀ᵢ/\<obj\>/g; s/∃ᵢ/\<subj\>/g' $(find ./ name \*.v)

Robbert Krebbers authored
sed i 's/absolute/objective/g; s/relative/subjective/g; s/Absolute/Objective/g; s/Relative/Subjective/g' $(find ./ name \*.v)

JacquesHenri Jourdan authored

 03 Mar, 2018 3 commits


Robbert Krebbers authored
Based on an earlier MR by @jung.

Robbert Krebbers authored
This change is slightly more invasive than expected: in monPred we were using the embedding before the BI was defined. With the new setup, this is no longer possible, because in order to make an instance of the embedding, we need to know that `monPred` is a BI. As such, we define `emp`, `⌜ _ ⌝` and friends directly in the model of `monPred` and later prove that they are equal to a version in terms of the embedding.

Robbert Krebbers authored

 23 Feb, 2018 4 commits


Robbert Krebbers authored
As suggested by @jjourdan, and proved in the ordered RA model by @amintimany. This should solve the paradox in #149.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 14 Feb, 2018 2 commits
 07 Feb, 2018 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
In the same style as most of the BI lemmas, e.g. `or_mono`, `and_mono`, ...

 06 Feb, 2018 4 commits


JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

 02 Feb, 2018 1 commit


JacquesHenri Jourdan authored

 25 Jan, 2018 1 commit


JacquesHenri Jourdan authored

 22 Jan, 2018 1 commit


JacquesHenri Jourdan authored

 18 Jan, 2018 3 commits


JacquesHenri Jourdan authored
The types of propositions for monPred lemma need to be [monPred I PROP] and not [bi_car (monPredI I PROP)], otherwise iIntoValid fails in a very weird way. Seems to be related to a Coq bug.

JacquesHenri Jourdan authored
BiIndexBottom class for bottom element in a bi index. monPred_all is a monoid morphism, and related big op lemmas.

JacquesHenri Jourdan authored
Reorganize bi.monpred. Add unfolding manual lemmas for monPred_at, and use them in proofmode.monpred. Add big op lemmas for monpred_at.
