- 22 Aug, 2019 1 commit
-
-
Robbert Krebbers authored
-
- 16 Jun, 2019 1 commit
-
-
Robbert Krebbers authored
Used the following script: sed ' s/\bCofeMor/OfeMor/g; s/\-c>/\-d>/g; s/\bcFunctor/oFunctor/g; s/\bCFunctor/OFunctor/g; s/\b\%CF/\%OF/g; s/\bconstCF/constOF/g; s/\bidCF/idOF/g s/\bdiscreteC/discreteO/g; s/\bleibnizC/leibnizO/g; s/\bunitC/unitO/g; s/\bprodC/prodO/g; s/\bsumC/sumO/g; s/\bboolC/boolO/g; s/\bnatC/natO/g; s/\bpositiveC/positiveO/g; s/\bNC/NO/g; s/\bZC/ZO/g; s/\boptionC/optionO/g; s/\blaterC/laterO/g; s/\bofe\_fun/discrete\_fun/g; s/\bdiscrete\_funC/discrete\_funO/g; s/\bofe\_morC/ofe\_morO/g; s/\bsigC/sigO/g; s/\buPredC/uPredO/g; s/\bcsumC/csumO/g; s/\bagreeC/agreeO/g; s/\bauthC/authO/g; s/\bnamespace_mapC/namespace\_mapO/g; s/\bcmra\_ofeC/cmra\_ofeO/g; s/\bucmra\_ofeC/ucmra\_ofeO/g; s/\bexclC/exclO/g; s/\bgmapC/gmapO/g; s/\blistC/listO/g; s/\bvecC/vecO/g; s/\bgsetC/gsetO/g; s/\bgset\_disjC/gset\_disjO/g; s/\bcoPsetC/coPsetO/g; s/\bgmultisetC/gmultisetO/g; s/\bufracC/ufracO/g s/\bfracC/fracO/g; s/\bvalidityC/validityO/g; s/\bbi\_ofeC/bi\_ofeO/g; s/\bsbi\_ofeC/sbi\_ofeO/g; s/\bmonPredC/monPredO/g; s/\bstateC/stateO/g; s/\bvalC/valO/g; s/\bexprC/exprO/g; s/\blocC/locO/g; ' -i $(find theories -name "*.v")
-
- 24 May, 2019 1 commit
-
-
Robbert Krebbers authored
This MR is a follow up on the renamings performed (implicitly) as part of !215. This MR makes the following changes: - `auth_both_frac_valid` and `auth_both_valid` are now of the same shape as `auth_both_frac_validN` and `auth_both_validN`. That is, both are now biimplications. - The left-to-right direction of `auth_both_frac_valid` and `auth_both_valid` only holds in case the camera is discrete. The right-to-left versions for non-discrete cameras are prefixed `_2`, the convention that we use throughout the development. - Change the direction of lemmas like `auth_frag_valid` and `auth_auth_valid` so that it's consistent with the other lemmas. I.e. make sure that the ◯ and ● are always on the LHS of the biimplication.
-
- 23 May, 2019 1 commit
-
-
Hai Dang authored
-
- 01 May, 2019 1 commit
-
-
Robbert Krebbers authored
Notably, `big_andL_andL` and `big_andL_and` where a ⊣⊢ and ⊢ version of the same lemma. I favored the `big_opL_op` naming scheme.
-
- 06 Mar, 2019 1 commit
-
-
Dan Frumin authored
-
- 05 Mar, 2019 1 commit
-
-
Ralf Jung authored
-
- 24 Jan, 2019 1 commit
-
-
Maxime Dénès authored
This is in preparation for coq/coq#9274.
-
- 31 May, 2018 1 commit
-
-
Robbert Krebbers authored
Thanks to @dfrumin.
-
- 25 Apr, 2018 1 commit
-
-
Ralf Jung authored
-
- 21 Mar, 2018 1 commit
-
-
Ralf Jung authored
-
- 03 Mar, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 01 Mar, 2018 1 commit
-
-
Jacques-Henri Jourdan authored
This requires changing the Hint Mode of the [Frame] type class because it should not fail if its parameter is an evar, but instantiate it instead. In order to prevent all the other instances of [Frame] to intantiate this evar themselves, we create a new type class [KnwonFrame], which corresponds to the old behavior.
-
- 23 Jan, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 30 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 28 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
This way, it can be used with `iApply`.
-
- 25 Oct, 2017 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
The advantage is that we can directly use a Coq introduction pattern `cpat` to perform actions to the pure assertion. Before, this had to be done in several steps: iDestruct ... as "[Htmp ...]"; iDestruct "Htmp" as %cpat. That is, one had to introduce a temporary name. I expect this to be quite useful in various developments as many of e.g. our invariants are written as: ∃ x1 .. x2, ⌜ pure stuff ⌝ ∗ spacial stuff.
-
- 17 Sep, 2017 1 commit
-
-
Robbert Krebbers authored
For obsolete reasons, that no longer seem to apply, we used ∅ as the unit.
-
- 20 Aug, 2017 1 commit
-
-
Robbert Krebbers authored
This makes it easier to frame or introduce some modalities before introducing universal quantifiers.
-
- 07 Aug, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 24 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 15 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 14 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 27 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 23 Jan, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 09 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 06 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 05 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 03 Jan, 2017 1 commit
-
-
Ralf Jung authored
This patch was created using find -name *.v | xargs -L 1 awk -i inplace '{from = 0} /^From/{ from = 1; ever_from = 1} { if (from == 0 && seen == 0 && ever_from == 1) { print "Set Default Proof Using \"Type*\"."; seen = 1 } }1 ' and some minor manual editing
-
- 23 Dec, 2016 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 09 Dec, 2016 1 commit
-
-
Ralf Jung authored
-
- 05 Dec, 2016 1 commit
-
-
Robbert Krebbers authored
Using this new definition we can express being contractive using a Proper. This has the following advantages: - It makes it easier to state that a function with multiple arguments is contractive (in all or some arguments). - A solve_contractive tactic can be implemented by extending the solve_proper tactic.
-
- 02 Dec, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 28 Nov, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 27 Nov, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 25 Nov, 2016 4 commits
-
-
Robbert Krebbers authored
-
Jacques-Henri Jourdan authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
No longer `put box_own_prop γ P` in the invariant, it is persistent.
-