 07 Jul, 2019 2 commits
 03 Jul, 2019 2 commits


Michael Sammler authored

Michael Sammler authored

 28 Jun, 2019 1 commit


Simon Spies authored

 26 Jun, 2019 1 commit


Michael Sammler authored

 03 May, 2019 1 commit


Robbert Krebbers authored

 30 Apr, 2019 1 commit


Robbert Krebbers authored

 19 Apr, 2019 1 commit


Dan Frumin authored

 16 Mar, 2019 2 commits


Robbert Krebbers authored

Jakob Botsch Nielsen authored
This changes the encoding used for finite lists of values of countable types to be linear instead of exponential. The encoding works by duplicating bits of each element so that 0 > 00 and 1 > 11, and then separating each element with 10. The top 1bits are not kept since we know a 10 is starting a new element which ends with a 1. Fix #28

 15 Mar, 2019 1 commit


Robbert Krebbers authored

 01 Mar, 2019 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 21 Feb, 2019 1 commit


Hai Dang authored

 29 Jan, 2019 1 commit


Robbert Krebbers authored

 23 Jan, 2019 1 commit


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

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

 26 Nov, 2018 1 commit


Robbert Krebbers authored

 10 Nov, 2018 1 commit


Robbert Krebbers authored

 30 Jun, 2018 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 20 Jun, 2018 1 commit


Ralf Jung authored

 28 May, 2018 1 commit


Ralf Jung authored

 05 Apr, 2018 4 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

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

 31 Jan, 2018 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 14 Jan, 2018 1 commit


Robbert Krebbers authored
This is needed so that it can be used be used as a combinator for defining induction schemes for mutually inductive types.

 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.

 24 Sep, 2017 1 commit


Robbert Krebbers 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`.

 08 Sep, 2017 1 commit


Robbert Krebbers authored
See also Coq bug #5712.

 02 Sep, 2017 1 commit


Robbert Krebbers authored
