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/.
38 | C.Implicit as t -> t
39 | C.Cast (te,ty) -> C.Cast (liftaux k te, liftaux k ty)
40 | C.Prod (n,s,t) -> C.Prod (n, liftaux k s, liftaux (k+1) t)
41 | C.Lambda (n,s,t) -> C.Lambda (n, liftaux k s, liftaux (k+1) t)
42 | C.LetIn (n,s,t) -> C.LetIn (n, liftaux k s, liftaux (k+1) t)
43 | C.Appl l -> C.Appl (List.map (liftaux k) l)
46 | C.MutInd _ as t -> t
47 | C.MutConstruct _ as t -> t
48 | C.MutCase (sp,cookingsno,i,outty,t,pl) ->
49 C.MutCase (sp, cookingsno, i, liftaux k outty, liftaux k t,
50 List.map (liftaux k) pl)
52 let len = List.length fl in
55 (fun (name, i, ty, bo) -> (name, i, liftaux k ty, liftaux (k+len) bo))
60 let len = List.length fl in
63 (fun (name, ty, bo) -> (name, liftaux k ty, liftaux (k+len) bo))
80 n when n = k -> lift (k - 1) arg
87 | C.Implicit as t -> t
88 | C.Cast (te,ty) -> C.Cast (substaux k te, substaux k ty) (*CSC ??? *)
89 | C.Prod (n,s,t) -> C.Prod (n, substaux k s, substaux (k + 1) t)
90 | C.Lambda (n,s,t) -> C.Lambda (n, substaux k s, substaux (k + 1) t)
91 | C.LetIn (n,s,t) -> C.LetIn (n, substaux k s, substaux (k + 1) t)
92 | C.Appl l -> C.Appl (List.map (substaux k) l)
95 | C.MutInd _ as t -> t
96 | C.MutConstruct _ as t -> t
97 | C.MutCase (sp,cookingsno,i,outt,t,pl) ->
98 C.MutCase (sp,cookingsno,i,substaux k outt, substaux k t,
99 List.map (substaux k) pl)
101 let len = List.length fl in
104 (fun (name,i,ty,bo) -> (name, i, substaux k ty, substaux (k+len) bo))
107 C.Fix (i, substitutedfl)
109 let len = List.length fl in
112 (fun (name,ty,bo) -> (name, substaux k ty, substaux (k+len) bo))
115 C.CoFix (i, substitutedfl)
120 let undebrujin_inductive_def uri =
122 Cic.InductiveDefinition (dl,params,n_ind_params) ->
125 (fun (name,inductive,arity,constructors) ->
130 let counter = ref (List.length dl) in
134 subst (Cic.MutInd (uri,0,!counter))
140 (name,inductive,arity,constructors')
143 Cic.InductiveDefinition (dl', params, n_ind_params)