| 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-03-18 | Actually use the binder type for Ltac2 that should be used in the kernel. | Pierre-Marie Pédrot | |
| That is, it contains the type of the binder so as not to rely on the relevance explicitly. | |||
| 2019-09-24 | Fix #10783: use binder_annot in Ltac2.Constr.Unsafe.kind | Gaëtan Gilbert | |
 |
index : coq | |
| The formal proof system |
| aboutsummaryrefslogtreecommitdiff |