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 CannotSubstInMeta;;
27 exception RelToHiddenHypothesis;;
28 exception ReferenceToVariable;;
29 exception ReferenceToConstant;;
30 exception ReferenceToCurrentProof;;
31 exception ReferenceToInductiveDefinition;;
42 | C.Var (uri,exp_named_subst) ->
43 let exp_named_subst' =
44 List.map (function (uri,t) -> (uri,liftaux k t)) exp_named_subst
46 C.Var (uri,exp_named_subst')
52 | Some t -> Some (liftaux k t)
57 | C.Implicit _ as t -> t
58 | C.Cast (te,ty) -> C.Cast (liftaux k te, liftaux k ty)
59 | C.Prod (n,s,t) -> C.Prod (n, liftaux k s, liftaux (k+1) t)
60 | C.Lambda (n,s,t) -> C.Lambda (n, liftaux k s, liftaux (k+1) t)
61 | C.LetIn (n,s,t) -> C.LetIn (n, liftaux k s, liftaux (k+1) t)
62 | C.Appl l -> C.Appl (List.map (liftaux k) l)
63 | C.Const (uri,exp_named_subst) ->
64 let exp_named_subst' =
65 List.map (function (uri,t) -> (uri,liftaux k t)) exp_named_subst
67 C.Const (uri,exp_named_subst')
68 | C.MutInd (uri,tyno,exp_named_subst) ->
69 let exp_named_subst' =
70 List.map (function (uri,t) -> (uri,liftaux k t)) exp_named_subst
72 C.MutInd (uri,tyno,exp_named_subst')
73 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
74 let exp_named_subst' =
75 List.map (function (uri,t) -> (uri,liftaux k t)) exp_named_subst
77 C.MutConstruct (uri,tyno,consno,exp_named_subst')
78 | C.MutCase (sp,i,outty,t,pl) ->
79 C.MutCase (sp, i, liftaux k outty, liftaux k t,
80 List.map (liftaux k) pl)
82 let len = List.length fl in
85 (fun (name, i, ty, bo) -> (name, i, liftaux k ty, liftaux (k+len) bo))
90 let len = List.length fl in
93 (fun (name, ty, bo) -> (name, liftaux k ty, liftaux (k+len) bo))
106 let module C = Cic in
110 n when n = k -> lift (k - 1) arg
114 | C.Var (uri,exp_named_subst) ->
115 let exp_named_subst' =
116 List.map (function (uri,t) -> (uri,substaux k t)) exp_named_subst
118 C.Var (uri,exp_named_subst')
119 | C.Meta (i, l) as t ->
124 | Some t -> Some (substaux k t)
129 | C.Implicit _ as t -> t
130 | C.Cast (te,ty) -> C.Cast (substaux k te, substaux k ty)
131 | C.Prod (n,s,t) -> C.Prod (n, substaux k s, substaux (k + 1) t)
132 | C.Lambda (n,s,t) -> C.Lambda (n, substaux k s, substaux (k + 1) t)
133 | C.LetIn (n,s,t) -> C.LetIn (n, substaux k s, substaux (k + 1) t)
135 (* Invariant: no Appl applied to another Appl *)
136 let tl' = List.map (substaux k) tl in
138 match substaux k he with
139 C.Appl l -> C.Appl (l@tl')
140 | _ as he' -> C.Appl (he'::tl')
142 | C.Appl _ -> assert false
143 | C.Const (uri,exp_named_subst) ->
144 let exp_named_subst' =
145 List.map (function (uri,t) -> (uri,substaux k t)) exp_named_subst
147 C.Const (uri,exp_named_subst')
148 | C.MutInd (uri,typeno,exp_named_subst) ->
149 let exp_named_subst' =
150 List.map (function (uri,t) -> (uri,substaux k t)) exp_named_subst
152 C.MutInd (uri,typeno,exp_named_subst')
153 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
154 let exp_named_subst' =
155 List.map (function (uri,t) -> (uri,substaux k t)) exp_named_subst
157 C.MutConstruct (uri,typeno,consno,exp_named_subst')
158 | C.MutCase (sp,i,outt,t,pl) ->
159 C.MutCase (sp,i,substaux k outt, substaux k t,
160 List.map (substaux k) pl)
162 let len = List.length fl in
165 (fun (name,i,ty,bo) -> (name, i, substaux k ty, substaux (k+len) bo))
168 C.Fix (i, substitutedfl)
170 let len = List.length fl in
173 (fun (name,ty,bo) -> (name, substaux k ty, substaux (k+len) bo))
176 C.CoFix (i, substitutedfl)
181 (*CSC: i controlli di tipo debbono essere svolti da destra a *)
182 (*CSC: sinistra: i{B/A;b/a} ==> a{B/A;b/a} ==> a{b/a{B/A}} ==> b *)
183 (*CSC: la sostituzione ora e' implementata in maniera simultanea, ma *)
184 (*CSC: dovrebbe diventare da sinistra verso destra: *)
185 (*CSC: t{a=a/A;b/a} ==> \H:a=a.H{b/a} ==> \H:b=b.H *)
186 (*CSC: per la roba che proviene da Coq questo non serve! *)
187 let subst_vars exp_named_subst =
189 prerr_endline ("@@@POSSIBLE BUG: SUBSTITUTION IS NOT SIMULTANEOUS") ;
192 let module C = Cic in
195 | C.Var (uri,exp_named_subst') ->
199 (function (varuri,_) -> UriManager.eq uri varuri) exp_named_subst
205 let obj = CicEnvironment.get_obj uri in
207 C.Constant _ -> raise ReferenceToConstant
208 | C.Variable (_,_,_,params) -> params
209 | C.CurrentProof _ -> raise ReferenceToCurrentProof
210 | C.InductiveDefinition _ -> raise ReferenceToInductiveDefinition
214 prerr_endline "\n\n---- BEGIN " ;
215 prerr_endline ("----params: " ^ String.concat " ; " (List.map UriManager.string_of_uri params)) ;
216 prerr_endline ("----S(" ^ UriManager.string_of_uri uri ^ "): " ^ String.concat " ; " (List.map (function (uri,_) -> UriManager.string_of_uri uri) exp_named_subst)) ;
217 prerr_endline ("----P: " ^ String.concat " ; " (List.map (function (uri,_) -> UriManager.string_of_uri uri) exp_named_subst')) ;
219 let exp_named_subst'' =
220 substaux_in_exp_named_subst uri k exp_named_subst' params
223 prerr_endline ("----D: " ^ String.concat " ; " (List.map (function (uri,_) -> UriManager.string_of_uri uri) exp_named_subst'')) ;
224 prerr_endline "---- END\n\n " ;
226 C.Var (uri,exp_named_subst'')
228 | C.Meta (i, l) as t ->
233 | Some t -> Some (substaux k t)
238 | C.Implicit _ as t -> t
239 | C.Cast (te,ty) -> C.Cast (substaux k te, substaux k ty)
240 | C.Prod (n,s,t) -> C.Prod (n, substaux k s, substaux (k + 1) t)
241 | C.Lambda (n,s,t) -> C.Lambda (n, substaux k s, substaux (k + 1) t)
242 | C.LetIn (n,s,t) -> C.LetIn (n, substaux k s, substaux (k + 1) t)
244 (* Invariant: no Appl applied to another Appl *)
245 let tl' = List.map (substaux k) tl in
247 match substaux k he with
248 C.Appl l -> C.Appl (l@tl')
249 | _ as he' -> C.Appl (he'::tl')
251 | C.Appl _ -> assert false
252 | C.Const (uri,exp_named_subst') ->
254 let obj = CicEnvironment.get_obj uri in
256 C.Constant (_,_,_,params) -> params
257 | C.Variable _ -> raise ReferenceToVariable
258 | C.CurrentProof (_,_,_,_,params) -> params
259 | C.InductiveDefinition _ -> raise ReferenceToInductiveDefinition
262 let exp_named_subst'' =
263 substaux_in_exp_named_subst uri k exp_named_subst' params
265 C.Const (uri,exp_named_subst'')
266 | C.MutInd (uri,typeno,exp_named_subst') ->
268 let obj = CicEnvironment.get_obj uri in
270 C.Constant _ -> raise ReferenceToConstant
271 | C.Variable _ -> raise ReferenceToVariable
272 | C.CurrentProof _ -> raise ReferenceToCurrentProof
273 | C.InductiveDefinition (_,params,_) -> params
276 let exp_named_subst'' =
277 substaux_in_exp_named_subst uri k exp_named_subst' params
279 C.MutInd (uri,typeno,exp_named_subst'')
280 | C.MutConstruct (uri,typeno,consno,exp_named_subst') ->
282 let obj = CicEnvironment.get_obj uri in
284 C.Constant _ -> raise ReferenceToConstant
285 | C.Variable _ -> raise ReferenceToVariable
286 | C.CurrentProof _ -> raise ReferenceToCurrentProof
287 | C.InductiveDefinition (_,params,_) -> params
290 let exp_named_subst'' =
291 substaux_in_exp_named_subst uri k exp_named_subst' params
293 C.MutConstruct (uri,typeno,consno,exp_named_subst'')
294 | C.MutCase (sp,i,outt,t,pl) ->
295 C.MutCase (sp,i,substaux k outt, substaux k t,
296 List.map (substaux k) pl)
298 let len = List.length fl in
301 (fun (name,i,ty,bo) -> (name, i, substaux k ty, substaux (k+len) bo))
304 C.Fix (i, substitutedfl)
306 let len = List.length fl in
309 (fun (name,ty,bo) -> (name, substaux k ty, substaux (k+len) bo))
312 C.CoFix (i, substitutedfl)
313 and substaux_in_exp_named_subst uri k exp_named_subst' params =
314 (*CSC: invece di concatenare sarebbe meglio rispettare l'ordine dei params *)
315 (*CSC: e' vero???? una veloce prova non sembra confermare la teoria *)
316 let rec filter_and_lift =
321 (function (uri',_) -> not (UriManager.eq uri uri')) exp_named_subst'
325 (uri,lift (k-1) t)::(filter_and_lift tl)
326 | _::tl -> filter_and_lift tl
329 prerr_endline ("---- SKIPPO " ^ UriManager.string_of_uri uri) ;
330 if List.for_all (function (uri',_) -> not (UriManager.eq uri uri')) exp_named_subst' then prerr_endline "---- OK1" ;
331 prerr_endline ("++++ uri " ^ UriManager.string_of_uri uri ^ " not in " ^ String.concat " ; " (List.map UriManager.string_of_uri params)) ;
332 if List.mem uri params then prerr_endline "---- OK2" ;
336 List.map (function (uri,t) -> (uri,substaux k t)) exp_named_subst' @
337 (filter_and_lift exp_named_subst)
342 (* lift_meta [t_1 ; ... ; t_n] t *)
343 (* returns the term [t] where [Rel i] is substituted with [t_i] *)
344 (* [t_i] is lifted as usual when it crosses an abstraction *)
346 let module C = Cic in
347 if l = [] then t else
348 let rec aux k = function
350 if n <= k then t else
352 match List.nth l (n-k-1) with
353 None -> raise RelToHiddenHypothesis
356 (Failure _) -> assert false
358 | C.Var (uri,exp_named_subst) ->
359 let exp_named_subst' =
360 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
362 C.Var (uri,exp_named_subst')
372 RelToHiddenHypothesis -> None
377 | C.Implicit _ as t -> t
378 | C.Cast (te,ty) -> C.Cast (aux k te, aux k ty) (*CSC ??? *)
379 | C.Prod (n,s,t) -> C.Prod (n, aux k s, aux (k + 1) t)
380 | C.Lambda (n,s,t) -> C.Lambda (n, aux k s, aux (k + 1) t)
381 | C.LetIn (n,s,t) -> C.LetIn (n, aux k s, aux (k + 1) t)
382 | C.Appl l -> C.Appl (List.map (aux k) l)
383 | C.Const (uri,exp_named_subst) ->
384 let exp_named_subst' =
385 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
387 C.Const (uri,exp_named_subst')
388 | C.MutInd (uri,typeno,exp_named_subst) ->
389 let exp_named_subst' =
390 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
392 C.MutInd (uri,typeno,exp_named_subst')
393 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
394 let exp_named_subst' =
395 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
397 C.MutConstruct (uri,typeno,consno,exp_named_subst')
398 | C.MutCase (sp,i,outt,t,pl) ->
399 C.MutCase (sp,i,aux k outt, aux k t, List.map (aux k) pl)
401 let len = List.length fl in
404 (fun (name,i,ty,bo) -> (name, i, aux k ty, aux (k+len) bo))
407 C.Fix (i, substitutedfl)
409 let len = List.length fl in
412 (fun (name,ty,bo) -> (name, aux k ty, aux (k+len) bo))
415 C.CoFix (i, substitutedfl)