aboutsummaryrefslogtreecommitdiff
path: root/kernel/entries.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/entries.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/entries.ml')
-rw-r--r--kernel/entries.ml3
1 files changed, 1 insertions, 2 deletions
diff --git a/kernel/entries.ml b/kernel/entries.ml
index e0b678621a..ae64112e33 100644
--- a/kernel/entries.ml
+++ b/kernel/entries.ml
@@ -91,8 +91,7 @@ type parameter_entry =
Id.Set.t option * types in_universes_entry * inline
type primitive_entry = {
- prim_entry_type : types option;
- prim_entry_univs : Univ.ContextSet.t; (* always monomorphic *)
+ prim_entry_type : types in_universes_entry option;
prim_entry_content : CPrimitives.op_or_type;
}