aboutsummaryrefslogtreecommitdiff
path: root/kernel/constr.mli
diff options
context:
space:
mode:
authorMaxime Dénès2020-02-03 18:19:42 +0100
committerMaxime Dénès2020-07-06 11:22:43 +0200
commit0ea2d0ff4ed84e1cc544c958b8f6e98f6ba2e9b6 (patch)
treefbad060c3c2e29e81751dea414c898b5cb0fa22d /kernel/constr.mli
parentcf388fdb679adb88a7e8b3122f65377552d2fb94 (diff)
Primitive persistent arrays
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>
Diffstat (limited to 'kernel/constr.mli')
-rw-r--r--kernel/constr.mli4
1 files changed, 4 insertions, 0 deletions
diff --git a/kernel/constr.mli b/kernel/constr.mli
index 0c151bb43c..62f2555a7e 100644
--- a/kernel/constr.mli
+++ b/kernel/constr.mli
@@ -84,6 +84,9 @@ val mkVar : Id.t -> constr
(** Constructs a machine integer *)
val mkInt : Uint63.t -> constr
+(** Constructs an array *)
+val mkArray : Univ.Instance.t * constr array * constr * types -> constr
+
(** Constructs a machine float number *)
val mkFloat : Float64.t -> constr
@@ -246,6 +249,7 @@ type ('constr, 'types, 'sort, 'univs) kind_of_term =
| Proj of Projection.t * 'constr
| Int of Uint63.t
| Float of Float64.t
+ | Array of 'univs * 'constr array * 'constr * 'types
(** User view of [constr]. For [App], it is ensured there is at
least one argument and the function is not itself an applicative