- 03 Feb, 2018 1 commit
-
-
Ralf Jung authored
-
- 02 Feb, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 31 Jan, 2018 5 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 25 Jan, 2018 8 commits
- 23 Jan, 2018 1 commit
-
-
Ralf Jung 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.
-
- 13 Jan, 2018 1 commit
-
-
Robbert authored
Add a Notation for `sn`: strongly normalizing. See merge request robbertkrebbers/coq-stdpp!25
-
- 12 Jan, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 10 Jan, 2018 1 commit
-
-
Robbert Krebbers authored
As we have for all classes for binary relations.
-
- 19 Dec, 2017 1 commit
-
-
Ralf Jung authored
-
- 18 Dec, 2017 7 commits
- 17 Dec, 2017 3 commits
- 08 Dec, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 05 Dec, 2017 2 commits
- 04 Dec, 2017 3 commits
-
-
Jacques-Henri Jourdan authored
-
Robbert authored
Lattices notation for order, join, meet, top and bot. See merge request robbertkrebbers/coq-stdpp!23
-
Jacques-Henri Jourdan authored
-
- 29 Nov, 2017 3 commits
-
-
Robbert Krebbers authored
-
Robbert authored
Make x.1, x.2 notation compatible with ssrfun. See merge request robbertkrebbers/coq-stdpp!21
-
David Swasey authored
Enable one to import both stdpp's base and ssrfun. Note that (f x.1) now parses as (f (fst x)) rather than (fst (f x)). (This change affects one proof in Iris.)
-
