2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
15 module Ref = NReference
17 let map_term_fold_a g k f a = function
18 | C.Meta _ -> assert false
23 | C.Appl [] | C.Appl [_] -> assert false
27 List.fold_right (fun t (a,l) -> let a,t = f k a t in a, t :: l) l (a,[])
30 | C.Appl l :: tl -> C.Appl (l@tl)
31 | l1 when l == l1 -> orig
33 | C.Prod (n,s,t) as orig ->
34 let a,s1 = f k a s in let a,t1 = f (g (n,C.Decl s) k) a t in
35 a, if t1 == t && s1 == s then orig else C.Prod (n,s1,t1)
36 | C.Lambda (n,s,t) as orig ->
37 let a,s1 = f k a s in let a,t1 = f (g (n,C.Decl s) k) a t in
38 a, if t1 == t && s1 == s then orig else C.Lambda (n,s1,t1)
39 | C.LetIn (n,ty,t,b) as orig ->
40 let a,ty1 = f k a ty in let a,t1 = f k a t in
41 let a,b1 = f (g (n,C.Def (t,ty)) k) a b in
42 a, if ty1 == ty && t1 == t && b1 == b then orig else C.LetIn (n,ty1,t1,b1)
43 | C.Match (r,oty,t,pl) as orig ->
44 let a,oty1 = f k a oty in let a,t1 = f k a t in
47 List.fold_right (fun t (a,l) -> let a,t = f k a t in a,t::l) pl (a,[])
49 a, if oty1 == oty && t1 == t && pl1 == pl then orig
50 else C.Match(r,oty1,t1,pl1)
53 let metas_of_term subst context term =
54 let rec aux ctx acc = function
56 (match HExtlib.list_skip (i-1) ctx with
57 | (_,NCic.Def (bo,_)) :: ctx -> aux ctx acc bo
61 let _,_,bo,_ = NCicUtils.lookup_subst i subst in
62 let bo = NCicSubstitution.subst_meta l bo in
64 with NCicUtils.Subst_not_found _ ->
66 let lc = NCicUtils.expand_local_context lc in
67 let l = List.map (NCicSubstitution.lift shift) lc in
68 List.fold_left (aux ctx) (i::acc) l)
69 | t -> NCicUtils.fold (fun e c -> e::c) ctx aux acc t
71 HExtlib.list_uniq (List.sort Pervasives.compare (aux context [] term))