 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.

 09 Feb, 2017 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 06 Feb, 2017 1 commit


Ralf Jung 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.

 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

 11 Jan, 2017 1 commit


Robbert Krebbers authored

 05 Jan, 2017 1 commit


Ralf Jung authored

 04 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

 09 Dec, 2016 2 commits
 22 Nov, 2016 1 commit


Ralf Jung authored
Use COFEs only for the recursive domain equation solver

 25 Oct, 2016 1 commit


Robbert Krebbers authored

 06 Oct, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
These are very useful when dealing with the authoritative CMRA.

 02 Oct, 2016 1 commit


Robbert Krebbers authored

 28 Sep, 2016 1 commit


Robbert Krebbers authored
This allows us to factor out properties about connectives that commute with the big operators.

 20 Sep, 2016 2 commits


Robbert Krebbers authored
We only had the stepindexed version before. Unfortunately, the non stepindexed version does not follow from the stepindexed version.

Robbert Krebbers authored

 01 Sep, 2016 1 commit


Robbert Krebbers authored

 30 Aug, 2016 1 commit


Robbert Krebbers authored

 20 Aug, 2016 1 commit


Robbert Krebbers authored
This requirement was useful in Iris 2.0: in order to ensure that ownership of the physical state was timeless, we required the ghost CMRA to have a timeless unit. To avoid having additional type class parameters, or having to extend the algebraic hierarchy, we required the units of any CMRA to be timeless. In Iris 3.0, this issue no longer applies: ownership of the physical state is ghost ownership in the global CMRA, whose unit is always timeless. Thanks to Jeehoon Kang for spotting this unnecessary requirement.

 14 Aug, 2016 1 commit


Robbert Krebbers authored
This is more consistent with the definition of the extension order, which is also defined in terms of an existential.

 27 Jul, 2016 2 commits


Robbert Krebbers authored
This reverts commit 20b4ae55, which does not seem to work with Coq 8.5pl2 (I accidentally tested with 8.5pl1).

Robbert Krebbers authored
This makes type checking more directed, and somewhat more predictable. On the downside, it makes it impossible to declare the singleton on lists as an instance of SingletonM and the insert and alter operations on functions as instances of Alter and Insert. However, these were not used often anyway.

 25 Jul, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 11 Jul, 2016 1 commit


Robbert Krebbers authored

 16 Jun, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 15 Jun, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 06 Jun, 2016 1 commit


Robbert Krebbers authored

 31 May, 2016 2 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →.
