GitLab

Terminology taken from "A Fresh Look at Separation Algebras and Share"
by Dockins et al.

See the discussion at https://gitlab.mpi-sws.org/FP/iris-coq/merge_requests/116.

`NoBackTrack P` requires `P` but will never backtrack on it
once a result for `P` has been found.

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

As we have for all classes for binary relations.

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

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

This one works for setoid rewriting under binders.

- Name all variables that we refer to.
- Put types in definitions.

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.

This is similar to `f_equal/=`.