 24 Jan, 2019 1 commit


Maxime Dénès authored
This is in preparation for coq/coq#9274.

 29 Nov, 2018 1 commit


Tej Chajed authored
Adding a hint without a database now triggers a deprecation warning in Coq master (https://github.com/coq/coq/pull/8987).

 01 Nov, 2018 1 commit


Robbert Krebbers authored

 04 Oct, 2018 1 commit


Robbert Krebbers authored

 29 May, 2018 2 commits
 23 May, 2018 1 commit


Robbert Krebbers authored
Thanks to @jung for proposing these names.

 20 Feb, 2018 3 commits


JacquesHenri Jourdan authored
The finiteness was needed to have the axiom of choice over the domain. This axiom is not needed if cmra_extend is in Type.

JacquesHenri Jourdan authored
Revert "Remove the domain finiteness hypothesis for the function CMRA, and put cmra_extend in Type." This reverts commit fa897ff5.

JacquesHenri Jourdan authored
The finiteness was needed to have the axiom of choice over the domain. This axiom is not needed if cmra_extend is in Type.

 29 Nov, 2017 3 commits


Robbert Krebbers authored

David Swasey authored

Robbert Krebbers authored

 28 Nov, 2017 3 commits


Robbert Krebbers authored

Ralf Jung authored

Robbert Krebbers authored

 27 Nov, 2017 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
In same spirit as the other 'primitive' types like `option`, `prod`, ...

 14 Nov, 2017 1 commit


Robbert Krebbers authored

 11 Nov, 2017 1 commit


Robbert Krebbers authored

 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


JacquesHenri 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


JacquesHenri 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. Identityfree 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


JacquesHenri Jourdan authored

 27 Jan, 2017 1 commit


Ralf Jung authored
