 13 Jan, 2018 1 commit


Robbert authored
Add a Notation for `sn`: strongly normalizing. See merge request robbertkrebbers/coqstdpp!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


JacquesHenri Jourdan authored

Robbert authored
Lattices notation for order, join, meet, top and bot. See merge request robbertkrebbers/coqstdpp!23

JacquesHenri Jourdan authored

 29 Nov, 2017 5 commits


Robbert Krebbers authored

Robbert authored
Make x.1, x.2 notation compatible with ssrfun. See merge request robbertkrebbers/coqstdpp!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.)

Ralf Jung authored
Allow compiling against "dev" version of Coq See merge request robbertkrebbers/coqstdpp!20

Ralf Jung authored
This matches e.g. Iris allowing a "dev" version of std++: You can install a "dev" version to test stuff, but then you are responsible for making sure that these versions actually work together. We rely on that when testing things against Iris master every night, for which purpose we install Iris master as "dev" version.

 28 Nov, 2017 1 commit


Ralf Jung authored

 22 Nov, 2017 2 commits
 21 Nov, 2017 1 commit


Robbert Krebbers authored
This gets rid of the old hack to have specific notations for pairs up to a fixed arity, and moreover allows to do fancy things like: ``` Record test := Test { t1 : nat; t2 : nat }. Definition foo (x : option test) : option nat := ''(Test a1 a2) ← x; Some a1. ```

 20 Nov, 2017 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This one works for setoid rewriting under binders.

 18 Nov, 2017 2 commits
 16 Nov, 2017 2 commits
 12 Nov, 2017 4 commits


Robbert Krebbers authored
 Name all variables that we refer to.  Put types in definitions.

Robbert authored
Provide an Infinite typeclass and a generic implementation of Fresh. See merge request robbertkrebbers/coqstdpp!13

Robbert authored
Make `fmap` left associative. See merge request robbertkrebbers/coqstdpp!16

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.

 11 Nov, 2017 1 commit


Robbert Krebbers authored
This is similar to `f_equal/=`.
