aboutsummaryrefslogtreecommitdiff
path: root/kernel/inferCumulativity.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/inferCumulativity.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/inferCumulativity.ml')
-rw-r--r--kernel/inferCumulativity.ml7
1 files changed, 7 insertions, 0 deletions
diff --git a/kernel/inferCumulativity.ml b/kernel/inferCumulativity.ml
index 71a3e95d25..8191a5b0f3 100644
--- a/kernel/inferCumulativity.ml
+++ b/kernel/inferCumulativity.ml
@@ -138,6 +138,13 @@ let rec infer_fterm cv_pb infos variances hd stk =
let le = Esubst.subs_liftn n e in
let variances = infer_vect infos variances (Array.map (mk_clos le) cl) in
infer_stack infos variances stk
+ | FArray (u,elemsdef,ty) ->
+ let variances = infer_generic_instance_eq variances u in
+ let variances = infer_fterm CONV infos variances ty [] in
+ let elems, def = Parray.to_array elemsdef in
+ let variances = infer_fterm CONV infos variances def [] in
+ let variances = infer_vect infos variances elems in
+ infer_stack infos variances stk
| FCaseInvert (_,p,_,_,br,e) ->
let infer c variances = infer_fterm CONV infos variances (mk_clos e c) [] in