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 NotImplemented;;
28 let fresh_id seed ids_to_terms ids_to_father_ids =
30 let res = "i" ^ string_of_int !seed in
32 Hashtbl.add ids_to_father_ids res father ;
33 Hashtbl.add ids_to_terms res t ;
37 exception NotEnoughElements;;
38 exception NameExpected;;
40 (*CSC: cut&paste da cicPp.ml *)
41 (* get_nth l n returns the nth element of the list l if it exists or *)
42 (* raises NotEnoughElements if l has less than n elements *)
46 | (n, he::tail) when n > 1 -> get_nth tail (n-1)
47 | (_,_) -> raise NotEnoughElements
50 let acic_of_cic_env' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
51 ids_to_inner_types metasenv env t
53 let module T = CicTypeChecker in
55 let fresh_id' = fresh_id seed ids_to_terms ids_to_father_ids in
56 let rec aux computeinnertypes father bs tt =
57 let fresh_id'' = fresh_id' father tt in
58 let aux' = aux true (Some fresh_id'') in
59 (* First of all we compute the inner type and the inner sort *)
60 (* of the term. They may be useful in what follows. *)
61 (*CSC: This is a very inefficient way of computing inner types *)
62 (*CSC: and inner sorts: very deep terms have their types/sorts *)
63 (*CSC: computed again and again. *)
66 C.Sort C.Prop -> "Prop"
67 | C.Sort C.Set -> "Set"
68 | C.Sort C.Type -> "Type"
71 let ainnertype,innertype,innersort =
72 let cicenv = List.map (function (_,ty) -> ty) bs in
73 let innertype = T.type_of_aux' metasenv cicenv tt in
74 let innersort = T.type_of_aux' metasenv cicenv innertype in
76 if computeinnertypes then
77 Some (aux false (Some fresh_id'') bs innertype)
81 ainnertype, innertype, string_of_sort innersort
83 let add_inner_type id =
86 | Some ainnertype -> Hashtbl.add ids_to_inner_types id ainnertype
91 match get_nth bs n with
93 | _ -> raise NameExpected
95 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
96 C.ARel (fresh_id'', n, id)
98 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
99 C.AVar (fresh_id'', uri)
101 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
102 C.AMeta (fresh_id'', n)
103 | C.Sort s -> C.ASort (fresh_id'', s)
104 | C.Implicit -> C.AImplicit (fresh_id'')
106 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
107 if innersort = "Prop" then
108 add_inner_type fresh_id'' ;
109 C.ACast (fresh_id'', aux' bs v, aux' bs t)
111 Hashtbl.add ids_to_inner_sorts fresh_id''
112 (string_of_sort innertype) ;
113 C.AProd (fresh_id'', n, aux' bs s, aux' ((n,s)::bs) t)
114 | C.Lambda (n,s,t) ->
115 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
116 if innersort = "Prop" then
118 let father_is_lambda =
122 match Hashtbl.find ids_to_terms father' with
126 if not father_is_lambda then
127 add_inner_type fresh_id''
129 C.ALambda (fresh_id'',n, aux' bs s, aux' ((n,s)::bs) t)
131 (*CSC: Nell'environment debbo poter avere anche dichiarazioni! ;-(
132 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
133 C.ALetIn (fresh_id'', n, aux' bs s, aux' (n::bs) t)
136 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
137 if innersort = "Prop" then
138 add_inner_type fresh_id'' ;
139 C.AAppl (fresh_id'', List.map (aux' bs) l)
140 | C.Const (uri,cn) ->
141 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
142 C.AConst (fresh_id'', uri, cn)
143 | C.Abst _ -> raise NotImplemented
144 | C.MutInd (uri,cn,tyno) -> C.AMutInd (fresh_id'', uri, cn, tyno)
145 | C.MutConstruct (uri,cn,tyno,consno) ->
146 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
147 C.AMutConstruct (fresh_id'', uri, cn, tyno, consno)
148 | C.MutCase (uri, cn, tyno, outty, term, patterns) ->
149 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
150 if innersort = "Prop" then
151 add_inner_type fresh_id'' ;
152 C.AMutCase (fresh_id'', uri, cn, tyno, aux' bs outty,
153 aux' bs term, List.map (aux' bs) patterns)
154 | C.Fix (funno, funs) ->
155 let names = List.map (fun (name,_,ty,_) -> C.Name name,ty) funs in
156 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
157 if innersort = "Prop" then
158 add_inner_type fresh_id'' ;
159 C.AFix (fresh_id'', funno,
161 (fun (name, indidx, ty, bo) ->
162 (name, indidx, aux' bs ty, aux' (names@bs) bo)
165 | C.CoFix (funno, funs) ->
166 let names = List.map (fun (name,ty,_) -> C.Name name,ty) funs in
167 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
168 if innersort = "Prop" then
169 add_inner_type fresh_id'' ;
170 C.ACoFix (fresh_id'', funno,
172 (fun (name, ty, bo) ->
173 (name, aux' bs ty, aux' (names@bs) bo)
180 let acic_of_cic_env metasenv env t =
181 let ids_to_terms = Hashtbl.create 503 in
182 let ids_to_father_ids = Hashtbl.create 503 in
183 let ids_to_inner_sorts = Hashtbl.create 503 in
184 let ids_to_inner_types = Hashtbl.create 503 in
186 acic_of_cic_env' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
187 ids_to_inner_types metasenv env t,
188 ids_to_terms, ids_to_father_ids, ids_to_inner_sorts, ids_to_inner_types
191 exception Found of (Cic.name * Cic.term) list;;
193 (* get_context_of_meta meta term *)
194 (* returns the context of the occurrence of [meta] in [term]. *)
195 (* Warning: if [meta] occurs not linearly in [term], the context *)
196 (* of one "random" occurrence is returned. *)
197 let get_context_of_meta meta term =
198 let module C = Cic in
203 | C.Meta i when meta = i -> raise (Found ctx)
207 | C.Cast (te,ty) -> aux ctx te ; aux ctx ty
208 | C.Prod (n,s,t) -> aux ctx s ; aux (((*P.Declaration,*)n,s)::ctx) t
209 | C.Lambda (n,s,t) -> aux ctx s ; aux (((*P.Declaration,*)n,s)::ctx) t
211 aux ctx s ; assert false (* aux ([P.Definition,n,s]::ctx) t *)
212 | C.Appl l -> List.iter (aux ctx) l
214 | C.Abst _ -> assert false
216 | C.MutConstruct _ -> ()
217 | C.MutCase (_,_,_,outt,t,pl) ->
218 aux ctx outt ; aux ctx t; List.iter (aux ctx) pl
220 let counter = ref 0 in
223 (function (name,_,ty,bo) ->
224 let res = ((*P.Definition,*) C.Name name, C.Fix (!counter,ifl)) in
230 List.iter (function (_,_,ty,bo) -> aux ctx ty ; aux ctx' bo) ifl
232 let counter = ref 0 in
235 (function (name,ty,bo) ->
236 let res = ((*P.Definition,*) C.Name name, C.CoFix (!counter,ifl)) in
242 List.iter (function (_,ty,bo) -> aux ctx ty ; aux ctx' bo) ifl
246 assert false (* No occurrences found. *)
248 Found context -> context
251 exception NotImplemented;;
253 let acic_object_of_cic_object obj =
254 let module C = Cic in
255 let ids_to_terms = Hashtbl.create 503 in
256 let ids_to_father_ids = Hashtbl.create 503 in
257 let ids_to_inner_sorts = Hashtbl.create 503 in
258 let ids_to_inner_types = Hashtbl.create 503 in
260 let acic_term_of_cic_term_env' =
261 acic_of_cic_env' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
262 ids_to_inner_types in
263 let acic_term_of_cic_term' = acic_term_of_cic_term_env' [] [] in
266 C.Definition (id,bo,ty,params) ->
267 let abo = acic_term_of_cic_term' bo in
268 let aty = acic_term_of_cic_term' ty
270 C.ADefinition ("mettereaposto",id,abo,aty,(Cic.Actual params))
271 | C.Axiom (id,ty,params) -> raise NotImplemented
272 | C.Variable (id,bo,ty) -> raise NotImplemented
273 | C.CurrentProof (id,conjectures,bo,ty) ->
276 (function (i,term) ->
277 let context = get_context_of_meta i bo in
278 let aterm = acic_term_of_cic_term_env' conjectures context term in
281 let abo = acic_term_of_cic_term_env' conjectures [] bo in
282 let aty = acic_term_of_cic_term_env' conjectures [] ty in
283 C.ACurrentProof ("mettereaposto",id,aconjectures,abo,aty)
284 | C.InductiveDefinition (tys,params,paramsno) -> raise NotImplemented
286 aobj,ids_to_terms,ids_to_father_ids,ids_to_inner_sorts,ids_to_inner_types