- Nov 28, 2017
-
-
Ralf Jung authored
-
- Nov 22, 2017
-
-
Robbert Krebbers authored
Pattern matching notation for monadic binds See merge request robbertkrebbers/coq-stdpp!18
-
Ralf Jung authored
-
- Nov 21, 2017
-
-
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. ```
-
- Nov 20, 2017
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
This one works for setoid rewriting under binders.
-
- Nov 18, 2017
- Nov 16, 2017
- Nov 12, 2017
-
-
Robbert Krebbers authored
- Name all variables that we refer to. - Put types in definitions.
-
Robbert Krebbers authored
Provide an Infinite typeclass and a generic implementation of Fresh. See merge request robbertkrebbers/coq-stdpp!13
-
Robbert Krebbers authored
Make `fmap` left associative. See merge request robbertkrebbers/coq-stdpp!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.
-
- Nov 11, 2017
-
-
Robbert Krebbers authored
This is similar to `f_equal/=`.
-
Robbert Krebbers authored
Use `stdpp_scope` for all notations. See merge request robbertkrebbers/coq-stdpp!17
-
- Nov 09, 2017
-
-
Johannes Kloos authored
-
Johannes Kloos authored
-
Johannes Kloos authored
-
Johannes Kloos authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Nov 03, 2017
-
-
Ralf Jung authored
-
- Nov 01, 2017
-
-
Johannes Kloos authored
-
Johannes Kloos authored
-
Johannes Kloos authored
Also make the instances non-global, to prevent multiple instance problems.
-
Johannes Kloos authored
-
Johannes Kloos authored
-
Johannes Kloos authored
We prove that various types are infinite, notably: - nat, N, positive and Z; - string (using pretty-printing of nat); - option, with an infinite element type; - list, with an inhabited element type. Furthermore, we instantiate Fresh for strings.
-
Johannes Kloos authored
This implements a simple linear search for fresh elements.
-
Johannes Kloos authored
This generalizes Fix_unfold to a setoid setting. In particular, we can use this to unfold multi-argument fixpoints without requiring functional extensionality.
-
Johannes Kloos authored
Infinity is described by having an injection from nat.
-
Robbert Krebbers authored
Provide a pretty-printer for [nat]. See merge request robbertkrebbers/coq-stdpp!15
-
- Oct 31, 2017
-
-
Johannes Kloos authored
-
Johannes Kloos authored
-
Robbert Krebbers authored
Minor documentation fixes See merge request robbertkrebbers/coq-stdpp!14
-
Johannes Kloos authored
The documentation for some typeclasses used the wrong names for these typeclasses.
-
- Oct 28, 2017
-
-
Jacques-Henri Jourdan authored
Notation for disjointness: replace ⊥ with ##, so that ⊥ can be used for bottom. See merge request robbertkrebbers/coq-stdpp!12
-
Ralf Jung authored
-
Ralf Jung authored
-