| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2020-07-06 | Primitive persistent arrays | Maxime Dénès | |
| Persistent arrays expose a functional interface but are implemented using an imperative data structure. The OCaml implementation is based on Jean-Christophe Filliâtre's. Co-authored-by: Benjamin Grégoire <Benjamin.Gregoire@inria.fr> Co-authored-by: Gaëtan Gilbert <gaetan.gilbert@skyskimmer.net> | |||
| 2020-07-01 | UIP in SProp | Gaëtan Gilbert | |
| 2020-06-19 | Try to preserve more sharing in nf_evars_and_universes_opt_subst. | Pierre-Marie Pédrot | |
| 2020-04-06 | Use lists instead of arrays in evar instances. | Pierre-Marie Pédrot | |
| This corresponds more naturally to the use we make of them, as we don't need fast indexation but we instead keep pushing terms on top of them. | |||
| 2020-03-18 | Update headers in the whole code base. | Théo Zimmermann | |
| Add headers to a few files which were missing them. | |||
| 2019-06-17 | Update ml-style headers to new year. | Théo Zimmermann | |
| 2018-07-03 | Remove unused output of Universes.normalize_univ_variables | Gaëtan Gilbert | |
| 2018-05-17 | Split off Universes functions about substitutions and constraints | Gaëtan Gilbert | |
 |
index : coq | |
| The formal proof system |
| aboutsummaryrefslogtreecommitdiff |