 23 Apr, 2019 1 commit


Robbert Krebbers authored

 26 Mar, 2019 2 commits


Dan Frumin authored

Dan Frumin authored

 14 Mar, 2019 1 commit


Ralf Jung authored

 06 Mar, 2019 1 commit


Robbert Krebbers authored

 20 Feb, 2019 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
Get rid of using `Collection` and favor `set` everywhere. Also, prefer conversion functions that are called `X_to_Y`. The following sed script performs most of the renaming, with the exception of:  `set`, which has been renamed into `propset`. I couldn't do this rename using `sed` since it's too context sensitive.  There was a spurious rename of `Vec.of_list`, which I correctly manually.  Updating some section names and comments. ``` sed ' s/SimpleCollection/SemiSet/g; s/FinCollection/FinSet/g; s/CollectionMonad/MonadSet/g; s/Collection/Set\_/g; s/collection\_simple/set\_semi\_set/g; s/fin\_collection/fin\_set/g; s/collection\_monad\_simple/monad\_set\_semi\_set/g; s/collection\_equiv/set\_equiv/g; s/\bbset/boolset/g; s/mkBSet/BoolSet/g; s/mkSet/PropSet/g; s/set\_equivalence/set\_equiv\_equivalence/g; s/collection\_subseteq/set\_subseteq/g; s/collection\_disjoint/set\_disjoint/g; s/collection\_fold/set\_fold/g; s/collection\_map/set\_map/g; s/collection\_size/set\_size/g; s/collection\_filter/set\_filter/g; s/collection\_guard/set\_guard/g; s/collection\_choose/set\_choose/g; s/collection\_ind/set\_ind/g; s/collection\_wf/set\_wf/g; s/map\_to\_collection/map\_to\_set/g; s/map\_of\_collection/set\_to\_map/g; s/map\_of\_list/list\_to\_map/g; s/map\_of\_to_list/list\_to\_map\_to\_list/g; s/map\_to\_of\_list/map\_to\_list\_to\_map/g; s/\bof\_list/list\_to\_set/g; s/\bof\_option/option\_to\_set/g; s/elem\_of\_of\_list/elem\_of\_list\_to\_set/g; s/elem\_of\_of\_option/elem\_of\_option\_to\_set/g; s/collection\_not\_subset\_inv/set\_not\_subset\_inv/g; s/seq\_set/set\_seq/g; s/collections/sets/g; s/collection/set/g; ' i $(find name "*.v") ```

 07 Feb, 2019 1 commit


Robbert Krebbers authored

 29 Jan, 2019 1 commit


Robbert Krebbers authored

 15 Dec, 2018 1 commit


Mackie Loeffel authored

 12 Dec, 2018 1 commit


Robbert Krebbers authored
Two reasons:  The equality makes it very hard to use the lemma with `rewrite`.  The version for lists `insert_zip_with` does not have the equality either.

 30 Nov, 2018 1 commit


Robbert Krebbers authored

 28 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).

 12 Nov, 2018 1 commit


Robbert Krebbers authored

 11 Nov, 2018 1 commit


Robbert Krebbers authored
 Interaction with delete  Make name about map interacting with insert consistent.

 01 Nov, 2018 1 commit


Robbert Krebbers authored

 14 May, 2018 1 commit


Robbert Krebbers authored

 09 Apr, 2018 1 commit


Robbert Krebbers authored

 05 Apr, 2018 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This followed from discussions in https://gitlab.mpisws.org/FP/iriscoq/merge_requests/134

 27 Mar, 2018 1 commit


Robbert Krebbers authored

 06 Mar, 2018 1 commit


Robbert Krebbers authored

 29 Nov, 2017 1 commit


Robbert Krebbers authored

 12 Nov, 2017 1 commit


Robbert Krebbers authored
This follows the associativity in Haskell. So, something like f <$> g <$> h Is now parsed as: (f <$> g) <$> h Since the functor is a generalized form of function application, this also now also corresponds with the associativity of function application, which is also left associative.

 09 Nov, 2017 1 commit


Robbert Krebbers authored

 28 Oct, 2017 1 commit


Robbert Krebbers authored
This way, we will be compabile with Iris's heap_lang, which puts ;; at level 100.

 27 Oct, 2017 1 commit


JacquesHenri Jourdan authored

 06 Oct, 2017 1 commit


Hai Dang authored

 29 Sep, 2017 3 commits


Robbert Krebbers authored

Robbert Krebbers authored
This fixes the issue of Hai in !6.

Hai Dang authored

 21 Sep, 2017 1 commit


Robbert Krebbers authored
This allows for more control over `Hint Mode`.

 17 Sep, 2017 1 commit


Robbert Krebbers authored
This provides significant robustness against looping type class search. As a consequence, at many places throughout the library we had to add additional typing information to lemmas. This was to be expected, since most of the old lemmas were ambiguous. For example: Section fin_collection. Context `{FinCollection A C}. size_singleton (x : A) : size {[ x ]} = 1. In this case, the lemma does not tell us which `FinCollection` with elements `A` we are talking about. So, `{[ x ]}` could not only refer to the singleton operation of the `FinCollection A C` in the section, but also to any other `FinCollection` in the development. To make this lemma unambigious, it should be written as: Lemma size_singleton (x : A) : size ({[ x ]} : C) = 1. In similar spirit, lemmas like the one below were also ambiguous: Lemma lookup_alter_None {A} (f : A → A) m i j : alter f i m !! j = None
↔ m !! j = None. It is not clear which finite map implementation we are talking about. To make this lemma unambigious, it should be written as: Lemma lookup_alter_None {A} (f : A → A) (m : M A) i j : alter f i m !! j = None↔ m !! j = None. That is, we have to specify the type of `m`.

 06 Sep, 2017 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Dan Frumin authored

 26 Jun, 2017 1 commit


Robbert Krebbers authored

 30 May, 2017 1 commit


Dan Frumin authored

 25 May, 2017 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
