GitLab

* Clearly separate the file algebra/sts in three parts:
  1.) The definition of an STS, step relations, and closure stuff
  2.) The construction as a disjoint RA (this module should never be used)
  3.) The construction as a CMRA with many derived properties
* Turn stsT into a canonical structure so that we can make more of its arguments
  implicit.
* Rename the underlying step relation of STSs to prim_step (similar naming as
  for languages, but here in a module to avoid ambiguity)
* Refactor program_logic/sts by moving general properties of the STS CMRA to
  algebra/sts.v
* Make naming and use of modules in program_logic/sts more consistent with
  program_logic/auth and program_logic/saved_prop
* Prove setoid properties of all definitions in program_logic/sts

Turns out it only holds as a view shift, not as an implication

I thought I could derive an interesting Lemma from this. Turns out I cannot. But this one may still be useful, at some point.

Also, make our redefinition of done more robust under different
orders of Importing modules.

Also do some minor clean up.

Instead, we have just a construction to create a CMRA from a RA. This
construction is also slightly generalized, it now works for RAs over any
timeless COFE instead of just the discrete COFE.

Also:
* Put tactics and big_ops for CMRAs in a separate file.
* Valid is now a derived notion (as the limit of validN), so it does not have
  to be defined by hand for each CMRA.

Todo:
Make the constructions DRA -> CMRA and RA -> CMRA more uniform.

This one (previously solve_elem_of) was hardly used. The tactic that uses
naive_solver (previously esolve_elem_of, now solve_elem_of) has been
extended with flags to say which hypotheses should be cleared/kept.

* Framepreserving updates are now on CMRAs rather than RAs
* Excl and auth are now CMRAs
* Show that excl and auth are functors
* STS is now an CMRA

* Remove the order from RAs, it is now defined in terms of the ⋅ operation.
* Define ownership using the step-indexed order.
* Remove the order also from DRAs and change STS accordingly. While doing
  that, I changed STS to no longer use decidable token sets, which removes the
  requirement of decidable equality on tokens.