1 (* Copyright (C) 2004, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
26 exception Meta_not_found of int
28 let lookup_meta index metasenv =
30 List.find (fun (index', _, _) -> index = index') metasenv
31 with Not_found -> raise (Meta_not_found index)
33 let exists_meta index = List.exists (fun (index', _, _) -> (index = index'))
39 C.Rel m when m > k -> false
43 (fun i t -> i && (match t with None -> true | Some t -> is_closed k t)
46 | C.Implicit _ -> assert false
47 | C.Cast (te,ty) -> is_closed k te && is_closed k ty
48 | C.Prod (name,so,dest) -> is_closed k so && is_closed (k+1) dest
49 | C.Lambda (_,so,dest) -> is_closed k so && is_closed (k+1) dest
50 | C.LetIn (_,so,dest) -> is_closed k so && is_closed (k+1) dest
52 List.fold_right (fun x i -> i && is_closed k x) l true
53 | C.Var (_,exp_named_subst)
54 | C.Const (_,exp_named_subst)
55 | C.MutInd (_,_,exp_named_subst)
56 | C.MutConstruct (_,_,_,exp_named_subst) ->
57 List.fold_right (fun (_,x) i -> i && is_closed k x)
59 | C.MutCase (_,_,out,te,pl) ->
60 is_closed k out && is_closed k te &&
61 List.fold_right (fun x i -> i && is_closed k x) pl true
63 let len = List.length fl in
64 let k_plus_len = k + len in
66 (fun (_,_,ty,bo) i -> i && is_closed k ty && is_closed k_plus_len bo
69 let len = List.length fl in
70 let k_plus_len = k + len in
72 (fun (_,ty,bo) i -> i && is_closed k ty && is_closed k_plus_len bo