aboutsummaryrefslogtreecommitdiff
path: root/kernel/relevanceops.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/relevanceops.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/relevanceops.ml')
-rw-r--r--kernel/relevanceops.ml3
1 files changed, 2 insertions, 1 deletions
diff --git a/kernel/relevanceops.ml b/kernel/relevanceops.ml
index 3dd965aca4..f12b8cba37 100644
--- a/kernel/relevanceops.ml
+++ b/kernel/relevanceops.ml
@@ -54,7 +54,7 @@ let rec relevance_of_fterm env extra lft f =
| FRel n -> Range.get extra (Esubst.reloc_rel n lft - 1)
| FAtom c -> relevance_of_term_extra env extra lft (Esubst.subs_id 0) c
| FFlex key -> relevance_of_flex env key
- | FInt _ | FFloat _ -> Sorts.Relevant
+ | FInt _ | FFloat _ | FArray _ -> Sorts.Relevant
| FInd _ | FProd _ -> Sorts.Relevant (* types are always relevant *)
| FConstruct (c,_) -> relevance_of_constructor env c
| FApp (f, _) -> relevance_of_fterm env extra lft f
@@ -102,6 +102,7 @@ and relevance_of_term_extra env extra lft subs c =
| CoFix (i,(lna,_,_)) -> (lna.(i)).binder_relevance
| Proj (p, _) -> relevance_of_projection env p
| Int _ | Float _ -> Sorts.Relevant
+ | Array _ -> Sorts.Relevant
| Meta _ | Evar _ -> Sorts.Relevant (* let's assume metas and evars are relevant for now *)