1 (* Copyright (C) 2000, 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://cs.unibo.it/helm/.
26 exception Impossible;;
27 exception NotImplemented of int * string;;
28 exception WrongUriToConstant;;
29 exception WrongUriToVariable of string;;
30 exception WrongUriToInductiveDefinition;;
32 (* mem x lol is true if x is a member of one *)
33 (* of the lists of the list of (int * list) lol *)
35 List.fold_right (fun (_,l) i -> i || List.mem x l) lol false
39 let cook curi cookingsno var =
45 n when n >= k -> C.Rel (n + 1)
49 if UriManager.eq uri var then
55 | C.Implicit as t -> t
56 | C.Cast (te, ty) -> C.Cast (aux k te, aux k ty)
57 | C.Prod (n,s,t) -> C.Prod (n, aux k s, aux (k + 1) t)
58 | C.Lambda (n,s,t) -> C.Lambda (n, aux k s, aux (k + 1) t)
59 | C.LetIn (n,s,t) -> C.LetIn (n, aux k s, aux (k + 1) t)
61 (* Get rid of C.Appl (C.Appl l1) l2 *)
62 let newtl = List.map (aux k) tl in
64 C.Appl (he'::tl') -> C.Appl (he'::(tl'@newtl))
65 | t -> C.Appl (t::newtl)
67 | C.Appl [] -> raise Impossible
69 if match CicCache.get_obj uri with
70 C.Definition (_,_,_,params) when mem var params -> true
71 | C.Definition _ -> false
72 | C.Axiom (_,_,params) when mem var params -> true
75 raise (NotImplemented (2,(UriManager.string_of_uri uri)))
76 | _ -> raise WrongUriToConstant
79 ((C.Const (uri,UriManager.relative_depth curi uri cookingsno))::
82 C.Const (uri,UriManager.relative_depth curi uri cookingsno)
84 | C.MutInd (uri,_,i) ->
85 if match CicCache.get_obj uri with
86 C.InductiveDefinition (_,params,_) when mem var params -> true
87 | C.InductiveDefinition _ -> false
88 | _ -> raise WrongUriToInductiveDefinition
90 C.Appl ((C.MutInd (uri,UriManager.relative_depth curi uri cookingsno,i))::[C.Rel k])
92 C.MutInd (uri,UriManager.relative_depth curi uri cookingsno,i)
93 | C.MutConstruct (uri,_,i,j) ->
94 if match CicCache.get_obj uri with
95 C.InductiveDefinition (_,params,_) when mem var params -> true
96 | C.InductiveDefinition _ -> false
97 | _ -> raise WrongUriToInductiveDefinition
99 C.Appl ((C.MutConstruct (uri,UriManager.relative_depth curi uri cookingsno,i,j))::[C.Rel k])
101 C.MutConstruct (uri,UriManager.relative_depth curi uri cookingsno,i,j)
102 | C.MutCase (uri,_,i,outt,term,pl) ->
106 C.MutCase (uri,UriManager.relative_depth curi uri cookingsno,i,
107 aux k outt,aux k term, substitutedfl)
109 let len = List.length fl in
112 (fun (name,i,ty,bo) -> (name,i,aux k ty, aux (k+len) bo))
115 C.Fix (i, substitutedfl)
117 let len = List.length fl in
120 (fun (name,ty,bo) -> (name,aux k ty, aux (k+len) bo))
123 C.CoFix (i, substitutedfl)
128 let cook_gen add_binder curi cookingsno ty vars =
129 let module C = Cic in
130 let module U = UriManager in
134 let (varname, varbody, vartype) =
135 match CicCache.get_obj var with
136 C.Variable (varname, varbody, vartype) -> (varname, varbody, vartype)
137 | _ -> raise (WrongUriToVariable (U.string_of_uri var))
139 cookrec (add_binder (C.Name varname) varbody vartype
140 (cook curi cookingsno var ty)) tl
147 cook_gen (fun n b s t ->
149 None -> Cic.Prod (n,s,t)
150 | Some b -> Cic.LetIn (n,b,t)
153 cook_gen (fun n b s t ->
155 None -> Cic.Lambda (n,s,t)
156 | Some b -> Cic.LetIn (n,b,t)
160 (*CSC: sbagliato da rifare e completare *)
161 let cook_one_level obj curi cookingsno vars =
162 let module C = Cic in
164 C.Definition (id,te,ty,params) ->
165 let ty' = cook_prod curi cookingsno ty vars in
166 let te' = cook_lambda curi cookingsno te vars in
167 C.Definition (id,te',ty',params)
168 | C.Axiom (id,ty,parameters) ->
169 let ty' = cook_prod curi cookingsno ty vars in
170 C.Axiom (id,ty',parameters)
171 | C.Variable _ as obj -> obj
172 | C.CurrentProof (id,conjs,te,ty) ->
173 let ty' = cook_prod curi cookingsno ty vars in
174 let te' = cook_lambda curi cookingsno te vars in
175 C.CurrentProof (id,conjs,te',ty')
176 | C.InductiveDefinition (dl, params, n_ind_params) ->
179 (fun (name,inductive,arity,constructors) ->
185 None -> raise Impossible
186 | Some r -> List.map (fun _ -> false) vars @ r
188 (name,cook_prod curi cookingsno ty vars,ref (Some r'))
191 (name,inductive,cook_prod curi cookingsno arity vars,constructors')
194 C.InductiveDefinition (dl', params, n_ind_params + List.length vars)
197 let cook_obj obj uri =
198 let module C = Cic in
201 C.Definition (_,_,_,params) -> params
202 | C.Axiom (_,_,params) -> params
204 | C.CurrentProof _ -> []
205 | C.InductiveDefinition (_,params,_) -> params
207 let rec cook_all_levels obj =
211 let cooked_obj = cook_one_level obj uri (n + 1) (List.rev vars) in
212 (n,cooked_obj)::(cook_all_levels cooked_obj tl)
214 cook_all_levels obj (List.rev params)
217 CicCache.cook_obj := cook_obj;;