- 25 Oct, 2017 4 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
Rename `UCMRA` → `Ucmra` Rename `CMRA` → `Cmra` Rename `OFE` → `Ofe` (`Ofe` was already used partially, but many occurences were missing) Rename `STS` → `Sts` Rename `DRA` → `Dra`
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 10 Oct, 2017 2 commits
- 17 Sep, 2017 2 commits
-
-
Robbert Krebbers authored
For obsolete reasons, that no longer seem to apply, we used ∅ as the unit.
-
Robbert Krebbers authored
-
- 08 Jun, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 07 Apr, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 24 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
Instead, I have introduced a type class `Monoid` that is used by the big operators: Class Monoid {M : ofeT} (o : M → M → M) := { monoid_unit : M; monoid_ne : NonExpansive2 o; monoid_assoc : Assoc (≡) o; monoid_comm : Comm (≡) o; monoid_left_id : LeftId (≡) monoid_unit o; monoid_right_id : RightId (≡) monoid_unit o; }. Note that the operation is an argument because we want to have multiple monoids over the same type (for example, on `uPred`s we have monoids for `∗`, `∧`, and `∨`). However, we do bundle the unit because: - If we would not, the unit would appear explicitly in an implicit argument of the big operators, which confuses rewrite. By bundling the unit in the `Monoid` class it is hidden, and hence rewrite won't even see it. - The unit is unique. We could in principle have big ops over setoids instead of OFEs. However, since we do not have a canonical structure for bundled setoids, I did not go that way.
-
- 11 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 10 Mar, 2017 1 commit
-
-
Ralf Jung authored
-
- 11 Feb, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 09 Feb, 2017 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 03 Feb, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 01 Feb, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
Cancelable elements are a new way of proving local updates, by removing some cancellable element of the global state, provided that we own it and we are willing to lose this ownership. Identity-free elements are an auxiliary that is necessary to prove that [Some x] is cancelable. For technical reasons, these two notions are not defined exactly like what one might expect, but also take into account validity. Otherwise, an exclusive element would not be cancelable or idfree, which is rather confusing.
-
- 30 Jan, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 27 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 25 Jan, 2017 1 commit
-
-
Ralf Jung authored
Also add "Local" to some Default Proof Using to keep them more contained
-
- 22 Jan, 2017 2 commits
-
-
Jacques-Henri Jourdan authored
-
Robbert Krebbers authored
-
- 06 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 05 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 04 Jan, 2017 1 commit
-
-
Robbert Krebbers 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
-
- 09 Dec, 2016 2 commits
- 22 Nov, 2016 1 commit
-
-
Ralf Jung authored
Use COFEs only for the recursive domain equation solver
-
- 06 Oct, 2016 1 commit
-
-
Robbert Krebbers authored
These are very useful when dealing with the authoritative CMRA.
-
- 05 Oct, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 03 Oct, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 02 Oct, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 28 Sep, 2016 3 commits
-
-
Robbert Krebbers authored
This allows us to factor out properties about connectives that commute with the big operators.
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 27 Sep, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 09 Sep, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 06 Sep, 2016 1 commit
-
-
Robbert Krebbers authored
-