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/.
27 {annsynthesized : Cic.annterm ; annexpected : Cic.annterm option}
31 let res = "i" ^ string_of_int !seed in
36 let fresh_id seed ids_to_terms ids_to_father_ids =
38 let res = gen_id seed in
39 Hashtbl.add ids_to_father_ids res father ;
40 Hashtbl.add ids_to_terms res t ;
44 let source_id_of_id id = "#source#" ^ id;;
46 exception NotEnoughElements;;
47 exception NameExpected;;
49 (*CSC: cut&paste da cicPp.ml *)
50 (* get_nth l n returns the nth element of the list l if it exists or *)
51 (* raises NotEnoughElements if l has less than n elements *)
55 | (n, he::tail) when n > 1 -> get_nth tail (n-1)
56 | (_,_) -> raise NotEnoughElements
59 let acic_of_cic_context' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
60 ids_to_inner_types metasenv context idrefs t expectedty
62 let module D = DoubleTypeInference in
63 let module T = CicTypeChecker in
65 let fresh_id' = fresh_id seed ids_to_terms ids_to_father_ids in
67 D.double_type_of metasenv context t expectedty
69 let rec aux computeinnertypes father context idrefs tt =
70 let fresh_id'' = fresh_id' father tt in
71 (*CSC: computeinnertypes era true, il che e' proprio sbagliato, no? *)
72 let aux' = aux computeinnertypes (Some fresh_id'') in
73 (* First of all we compute the inner type and the inner sort *)
74 (* of the term. They may be useful in what follows. *)
75 (*CSC: This is a very inefficient way of computing inner types *)
76 (*CSC: and inner sorts: very deep terms have their types/sorts *)
77 (*CSC: computed again and again. *)
78 let string_of_sort t =
79 match CicReduction.whd context t with
80 C.Sort C.Prop -> "Prop"
81 | C.Sort C.Set -> "Set"
82 | C.Sort C.Type -> "Type"
85 let ainnertypes,innertype,innersort,expected_available =
86 (*CSC: Here we need the algorithm for Coscoy's double type-inference *)
87 (*CSC: (expected type + inferred type). Just for now we use the usual *)
88 (*CSC: type-inference, but the result is very poor. As a very weak *)
89 (*CSC: patch, I apply whd to the computed type. Full beta *)
90 (*CSC: reduction would be a much better option. *)
91 let {D.synthesized = synthesized; D.expected = expected} =
92 if computeinnertypes then
93 D.CicHash.find terms_to_types tt
95 (* We are already in an inner-type and Coscoy's double *)
96 (* type inference algorithm has not been applied. *)
98 CicReduction.whd context (T.type_of_aux' metasenv context tt) ;
101 let innersort = T.type_of_aux' metasenv context synthesized in
102 let ainnertypes,expected_available =
103 if computeinnertypes then
104 let annexpected,expected_available =
107 | Some expectedty' ->
109 (aux false (Some fresh_id'') context idrefs expectedty'),
114 aux false (Some fresh_id'') context idrefs synthesized ;
115 annexpected = annexpected
116 }, expected_available
120 ainnertypes,synthesized, string_of_sort innersort, expected_available
122 let add_inner_type id =
123 match ainnertypes with
125 | Some ainnertypes -> Hashtbl.add ids_to_inner_types id ainnertypes
130 match get_nth context n with
131 (Some (C.Name s,_)) -> s
132 | _ -> raise NameExpected
134 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
135 if innersort = "Prop" && expected_available then
136 add_inner_type fresh_id'' ;
137 C.ARel (fresh_id'', List.nth idrefs (n-1), n, id)
138 | C.Var (uri,exp_named_subst) ->
139 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
140 if innersort = "Prop" && expected_available then
141 add_inner_type fresh_id'' ;
142 let exp_named_subst' =
144 (function i,t -> i, (aux' context idrefs t)) exp_named_subst
146 C.AVar (fresh_id'', uri,exp_named_subst')
148 let (_,canonical_context,_) =
149 List.find (function (m,_,_) -> n = m) metasenv
151 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
152 if innersort = "Prop" && expected_available then
153 add_inner_type fresh_id'' ;
154 C.AMeta (fresh_id'', n,
159 | _, Some t -> Some (aux' context idrefs t)
160 | Some _, None -> assert false (* due to typing rules *))
161 canonical_context l))
162 | C.Sort s -> C.ASort (fresh_id'', s)
163 | C.Implicit -> C.AImplicit (fresh_id'')
165 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
166 if innersort = "Prop" then
167 add_inner_type fresh_id'' ;
168 C.ACast (fresh_id'', aux' context idrefs v, aux' context idrefs t)
170 Hashtbl.add ids_to_inner_sorts fresh_id''
171 (string_of_sort innertype) ;
173 (fresh_id'', n, aux' context idrefs s,
174 aux' ((Some (n, C.Decl s))::context) (fresh_id''::idrefs) t)
175 | C.Lambda (n,s,t) ->
176 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
177 let sourcetype = T.type_of_aux' metasenv context s in
178 Hashtbl.add ids_to_inner_sorts (source_id_of_id fresh_id'')
179 (string_of_sort sourcetype) ;
180 if innersort = "Prop" then
182 let father_is_lambda =
186 match Hashtbl.find ids_to_terms father' with
190 if (not father_is_lambda) || expected_available then
191 add_inner_type fresh_id''
194 (fresh_id'',n, aux' context idrefs s,
195 aux' ((Some (n, C.Decl s)::context)) (fresh_id''::idrefs) t)
197 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
198 if innersort = "Prop" then
199 add_inner_type fresh_id'' ;
201 (fresh_id'', n, aux' context idrefs s,
202 aux' ((Some (n, C.Def s))::context) (fresh_id''::idrefs) t)
204 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
205 if innersort = "Prop" then
206 add_inner_type fresh_id'' ;
207 C.AAppl (fresh_id'', List.map (aux' context idrefs) l)
208 | C.Const (uri,exp_named_subst) ->
209 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
210 if innersort = "Prop" && expected_available then
211 add_inner_type fresh_id'' ;
212 let exp_named_subst' =
214 (function i,t -> i, (aux' context idrefs t)) exp_named_subst
216 C.AConst (fresh_id'', uri, exp_named_subst')
217 | C.MutInd (uri,tyno,exp_named_subst) ->
218 let exp_named_subst' =
220 (function i,t -> i, (aux' context idrefs t)) exp_named_subst
222 C.AMutInd (fresh_id'', uri, tyno, exp_named_subst')
223 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
224 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
225 if innersort = "Prop" && expected_available then
226 add_inner_type fresh_id'' ;
227 let exp_named_subst' =
229 (function i,t -> i, (aux' context idrefs t)) exp_named_subst
231 C.AMutConstruct (fresh_id'', uri, tyno, consno, exp_named_subst')
232 | C.MutCase (uri, tyno, outty, term, patterns) ->
233 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
234 if innersort = "Prop" then
235 add_inner_type fresh_id'' ;
236 C.AMutCase (fresh_id'', uri, tyno, aux' context idrefs outty,
237 aux' context idrefs term, List.map (aux' context idrefs) patterns)
238 | C.Fix (funno, funs) ->
240 List.map (function _ -> gen_id seed) funs in
241 let new_idrefs = List.rev fresh_idrefs @ idrefs in
243 List.map (fun (name,_,ty,_) -> Some (C.Name name, C.Decl ty)) funs
245 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
246 if innersort = "Prop" then
247 add_inner_type fresh_id'' ;
248 C.AFix (fresh_id'', funno,
250 (fun id (name, indidx, ty, bo) ->
251 (id, name, indidx, aux' context idrefs ty,
252 aux' (tys@context) new_idrefs bo)
255 | C.CoFix (funno, funs) ->
257 List.map (function _ -> gen_id seed) funs in
258 let new_idrefs = List.rev fresh_idrefs @ idrefs in
260 List.map (fun (name,ty,_) -> Some (C.Name name, C.Decl ty)) funs
262 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
263 if innersort = "Prop" then
264 add_inner_type fresh_id'' ;
265 C.ACoFix (fresh_id'', funno,
267 (fun id (name, ty, bo) ->
268 (id, name, aux' context idrefs ty,
269 aux' (tys@context) new_idrefs bo)
273 aux true None context idrefs t
276 let acic_of_cic_context metasenv context idrefs t =
277 let ids_to_terms = Hashtbl.create 503 in
278 let ids_to_father_ids = Hashtbl.create 503 in
279 let ids_to_inner_sorts = Hashtbl.create 503 in
280 let ids_to_inner_types = Hashtbl.create 503 in
282 acic_of_cic_context' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
283 ids_to_inner_types metasenv context idrefs t,
284 ids_to_terms, ids_to_father_ids, ids_to_inner_sorts, ids_to_inner_types
287 let acic_object_of_cic_object obj =
288 let module C = Cic in
289 let ids_to_terms = Hashtbl.create 503 in
290 let ids_to_father_ids = Hashtbl.create 503 in
291 let ids_to_inner_sorts = Hashtbl.create 503 in
292 let ids_to_inner_types = Hashtbl.create 503 in
293 let ids_to_conjectures = Hashtbl.create 11 in
294 let ids_to_hypotheses = Hashtbl.create 127 in
295 let hypotheses_seed = ref 0 in
296 let conjectures_seed = ref 0 in
298 let acic_term_of_cic_term_context' =
299 acic_of_cic_context' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
300 ids_to_inner_types in
301 let acic_term_of_cic_term' = acic_term_of_cic_term_context' [] [] [] in
304 C.Constant (id,Some bo,ty,params) ->
305 let abo = acic_term_of_cic_term' bo (Some ty) in
306 let aty = acic_term_of_cic_term' ty None in
308 ("mettereaposto",Some "mettereaposto2",id,Some abo,aty, params)
309 | C.Constant (id,None,ty,params) ->
310 let aty = acic_term_of_cic_term' ty None in
312 ("mettereaposto",None,id,None,aty, params)
313 | C.Variable (id,bo,ty,params) ->
317 | Some bo -> Some (acic_term_of_cic_term' bo (Some ty))
319 let aty = acic_term_of_cic_term' ty None in
321 ("mettereaposto",id,abo,aty, params)
322 | C.CurrentProof (id,conjectures,bo,ty,params) ->
325 (function (i,canonical_context,term) as conjecture ->
326 let cid = "c" ^ string_of_int !conjectures_seed in
327 Hashtbl.add ids_to_conjectures cid conjecture ;
328 incr conjectures_seed ;
329 let idrefs',revacanonical_context =
330 let rec aux context idrefs =
334 let hid = "h" ^ string_of_int !hypotheses_seed in
335 let new_idrefs = hid::idrefs in
336 Hashtbl.add ids_to_hypotheses hid hyp ;
337 incr hypotheses_seed ;
339 (Some (n,C.Decl t)) ->
340 let final_idrefs,atl =
341 aux (hyp::context) new_idrefs tl in
343 acic_term_of_cic_term_context'
344 conjectures context idrefs t None
346 final_idrefs,(hid,Some (n,C.ADecl at))::atl
347 | (Some (n,C.Def t)) ->
348 let final_idrefs,atl =
349 aux (hyp::context) new_idrefs tl in
351 acic_term_of_cic_term_context'
352 conjectures context idrefs t None
354 final_idrefs,(hid,Some (n,C.ADef at))::atl
356 let final_idrefs,atl =
357 aux (hyp::context) new_idrefs tl
359 final_idrefs,(hid,None)::atl
361 aux [] [] (List.rev canonical_context)
364 acic_term_of_cic_term_context' conjectures
365 canonical_context idrefs' term None
367 (cid,i,(List.rev revacanonical_context),aterm)
370 acic_term_of_cic_term_context' conjectures [] [] bo (Some ty) in
371 let aty = acic_term_of_cic_term_context' conjectures [] [] ty None in
373 ("mettereaposto","mettereaposto2",id,aconjectures,abo,aty,params)
374 | C.InductiveDefinition (tys,params,paramsno) ->
377 (fun (name,_,arity,_) -> Some (C.Name name, C.Decl arity)) tys in
378 let idrefs = List.map (function _ -> gen_id seed) tys in
381 (fun id (name,inductive,ty,cons) ->
384 (function (name,ty) ->
386 acic_term_of_cic_term_context' [] context idrefs ty None)
389 (id,name,inductive,acic_term_of_cic_term' ty None,acons)
390 ) (List.rev idrefs) tys
392 C.AInductiveDefinition ("mettereaposto",atys,params,paramsno)
394 aobj,ids_to_terms,ids_to_father_ids,ids_to_inner_sorts,ids_to_inner_types,
395 ids_to_conjectures,ids_to_hypotheses