 13 Sep, 2019 40 commits


JacquesHenri Jourdan authored
The general idea is to first import/export modules which are further than the current one, and then import/export modules which are close dependencies. This commit tries to use the same order of imports for every file, and describes the convention in ProofGuide.md. There is one exception, where we do not follow said convention: in program_logic/weakestpre.v, using that order would break printing of texan triples (??).

 21 Feb, 2019 40 commits


Robbert Krebbers authored

 20 Feb, 2019 40 commits


Robbert Krebbers authored

 24 Mar, 2017 40 commits


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.

Robbert Krebbers authored

 06 Feb, 2017 40 commits


Ralf Jung authored

 27 Jan, 2017 40 commits


Ralf Jung authored

 06 Jan, 2017 40 commits


Robbert Krebbers authored
Rename:  prefix_of > prefix and suffix_of > suffix because that saves keystrokes in lemma names. However, keep the infix notations with l1 `prefix_of` l2 and l1 `suffix_of` l2 because those are easier to read.  change the notation l1 `sublist` l2 into l1 `sublist_of` l2 to be consistent.  rename contains > submseteq and use the notation ⊆+

 05 Jan, 2017 40 commits


Ralf Jung authored

 03 Jan, 2017 40 commits


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 40 commits


Ralf Jung authored

JacquesHenri Jourdan authored

 06 Dec, 2016 40 commits


Dan Frumin authored

Robbert Krebbers authored

 05 Dec, 2016 40 commits


JacquesHenri Jourdan authored

 02 Dec, 2016 40 commits


Robbert Krebbers authored

 21 Nov, 2016 40 commits


Robbert Krebbers authored

Robbert Krebbers authored

 20 Nov, 2016 40 commits


Robbert Krebbers authored

 19 Nov, 2016 40 commits


Robbert Krebbers authored

 17 Nov, 2016 40 commits


Robbert Krebbers authored

 15 Nov, 2016 40 commits


Robbert Krebbers authored
Many useful properties are probably still missing.

 03 Oct, 2016 40 commits


Robbert Krebbers authored

Robbert Krebbers authored

 02 Oct, 2016 40 commits


Robbert Krebbers authored

 28 Sep, 2016 40 commits


Robbert Krebbers authored

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

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 30 May, 2016 40 commits


Robbert Krebbers authored

 27 May, 2016 40 commits


Robbert Krebbers authored

 21 Mar, 2016 40 commits


Robbert Krebbers authored

Robbert Krebbers authored

 10 Mar, 2016 40 commits


Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 08 Mar, 2016 40 commits


Ralf Jung authored

 20 Feb, 2016 40 commits


Ralf Jung authored

 17 Feb, 2016 40 commits


Robbert Krebbers authored

Robbert Krebbers authored
