aboutsummaryrefslogtreecommitdiff
path: root/kernel/retroknowledge.ml
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/retroknowledge.ml
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/retroknowledge.ml')
-rw-r--r--kernel/retroknowledge.ml4
1 files changed, 3 insertions, 1 deletions
diff --git a/kernel/retroknowledge.ml b/kernel/retroknowledge.ml
index 4e642ca11d..f7c4b62d1f 100644
--- a/kernel/retroknowledge.ml
+++ b/kernel/retroknowledge.ml
@@ -19,6 +19,7 @@ open Names
type retroknowledge = {
retro_int63 : Constant.t option;
retro_float64 : Constant.t option;
+ retro_array : Constant.t option;
retro_bool : (constructor * constructor) option; (* true, false *)
retro_carry : (constructor * constructor) option; (* C0, C1 *)
retro_pair : constructor option;
@@ -40,6 +41,7 @@ type retroknowledge = {
let empty = {
retro_int63 = None;
retro_float64 = None;
+ retro_array = None;
retro_bool = None;
retro_carry = None;
retro_pair = None;
@@ -51,4 +53,4 @@ let empty = {
type action =
| Register_ind : 'a CPrimitives.prim_ind * inductive -> action
- | Register_type : CPrimitives.prim_type * Constant.t -> action
+ | Register_type : 'a CPrimitives.prim_type * Constant.t -> action