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 (**************************************************************************)
30 (* Andrea Asperti <asperti@cs.unibo.it> *)
33 (**************************************************************************)
35 let object_prefix = "obj:";;
36 let declaration_prefix = "decl:";;
37 let definition_prefix = "def:";;
38 let inductive_prefix = "ind:";;
39 let joint_prefix = "joint:";;
40 let proof_prefix = "proof:";;
41 let conclude_prefix = "concl:";;
42 let premise_prefix = "prem:";;
43 let lemma_prefix = "lemma:";;
45 (* e se mettessi la conversione di BY nell'apply_context ? *)
46 (* sarebbe carino avere l'invariante che la proof2pres
47 generasse sempre prove con contesto vuoto *)
49 let gen_id prefix seed =
50 let res = prefix ^ string_of_int !seed in
55 let name_of = function
57 | Cic.Name b -> Some b;;
59 exception Not_a_proof;;
60 exception NotImplemented;;
61 exception NotApplicable;;
63 (* we do not care for positivity, here, that in any case is enforced by
64 well typing. Just a brutal search *)
73 | C.Implicit _ -> assert false
74 | C.Prod (_,s,t) -> (occur uri s) or (occur uri t)
75 | C.Cast (te,ty) -> (occur uri te)
76 | C.Lambda (_,s,t) -> (occur uri s) or (occur uri t) (* or false ?? *)
77 | C.LetIn (_,s,t) -> (occur uri s) or (occur uri t)
82 else (occur uri a)) false l
83 | C.Const (_,_) -> false
84 | C.MutInd (uri1,_,_) -> if uri = uri1 then true else false
85 | C.MutConstruct (_,_,_,_) -> false
86 | C.MutCase _ -> false (* presuming too much?? *)
87 | C.Fix _ -> false (* presuming too much?? *)
88 | C.CoFix (_,_) -> false (* presuming too much?? *)
94 C.ARel (id,_,_,_) -> id
95 | C.AVar (id,_,_) -> id
96 | C.AMeta (id,_,_) -> id
97 | C.ASort (id,_) -> id
98 | C.AImplicit _ -> raise NotImplemented
99 | C.AProd (id,_,_,_) -> id
100 | C.ACast (id,_,_) -> id
101 | C.ALambda (id,_,_,_) -> id
102 | C.ALetIn (id,_,_,_) -> id
103 | C.AAppl (id,_) -> id
104 | C.AConst (id,_,_) -> id
105 | C.AMutInd (id,_,_,_) -> id
106 | C.AMutConstruct (id,_,_,_,_) -> id
107 | C.AMutCase (id,_,_,_,_,_) -> id
108 | C.AFix (id,_,_) -> id
109 | C.ACoFix (id,_,_) -> id
112 let test_for_lifting ~ids_to_inner_types ~ids_to_inner_sorts=
113 let module C = Cic in
114 let module C2A = Cic2acic in
115 (* atomic terms are never lifted, according to my policy *)
117 C.ARel (id,_,_,_) -> false
120 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
122 with Not_found -> false)
123 | C.AMeta (id,_,_) ->
125 Hashtbl.find ids_to_inner_sorts id = "Prop"
126 with Not_found -> assert false)
127 | C.ASort (id,_) -> false
128 | C.AImplicit _ -> raise NotImplemented
129 | C.AProd (id,_,_,_) -> false
130 | C.ACast (id,_,_) ->
132 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
134 with Not_found -> false)
135 | C.ALambda (id,_,_,_) ->
137 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
139 with Not_found -> false)
140 | C.ALetIn (id,_,_,_) ->
142 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
144 with Not_found -> false)
147 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
149 with Not_found -> false)
150 | C.AConst (id,_,_) ->
152 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
154 with Not_found -> false)
155 | C.AMutInd (id,_,_,_) -> false
156 | C.AMutConstruct (id,_,_,_,_) ->
158 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
160 with Not_found -> false)
162 | C.AMutCase (id,_,_,_,_,_) ->
164 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
166 with Not_found -> false)
169 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
171 with Not_found -> false)
172 | C.ACoFix (id,_,_) ->
174 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
176 with Not_found -> false)
179 (* transform a proof p into a proof list, concatenating the last
180 conclude element to the apply_context list, in case context is
181 empty. Otherwise, it just returns [p] *)
184 let module K = Content in
185 if (p.K.proof_context = []) then
186 if p.K.proof_apply_context = [] then [p]
190 K.proof_context = [];
191 K.proof_apply_context = []
193 p.K.proof_apply_context@[p1]
198 let rec serialize seed =
201 | a::l -> (flat seed a)@(serialize seed l)
204 (* top_down = true if the term is a LAMBDA or a decl *)
205 let generate_conversion seed top_down id inner_proof ~ids_to_inner_types =
206 let module C2A = Cic2acic in
207 let module K = Content in
208 let exp = (try ((Hashtbl.find ids_to_inner_types id).C2A.annexpected)
209 with Not_found -> None)
214 if inner_proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
215 { K.proof_name = inner_proof.K.proof_name;
216 K.proof_id = gen_id proof_prefix seed;
217 K.proof_context = [] ;
218 K.proof_apply_context = [];
220 { K.conclude_id = gen_id conclude_prefix seed;
221 K.conclude_aref = id;
222 K.conclude_method = "TD_Conversion";
224 [K.ArgProof {inner_proof with K.proof_name = None}];
225 K.conclude_conclusion = Some expty
229 { K.proof_name = inner_proof.K.proof_name;
230 K.proof_id = gen_id proof_prefix seed;
231 K.proof_context = [] ;
232 K.proof_apply_context = [{inner_proof with K.proof_name = None}];
234 { K.conclude_id = gen_id conclude_prefix seed;
235 K.conclude_aref = id;
236 K.conclude_method = "BU_Conversion";
239 { K.premise_id = gen_id premise_prefix seed;
240 K.premise_xref = inner_proof.K.proof_id;
241 K.premise_binder = None;
245 K.conclude_conclusion = Some expty
250 let generate_exact seed t id name ~ids_to_inner_types =
251 let module C2A = Cic2acic in
252 let module K = Content in
253 { K.proof_name = name;
254 K.proof_id = gen_id proof_prefix seed ;
255 K.proof_context = [] ;
256 K.proof_apply_context = [];
258 { K.conclude_id = gen_id conclude_prefix seed;
259 K.conclude_aref = id;
260 K.conclude_method = "Exact";
261 K.conclude_args = [K.Term t];
262 K.conclude_conclusion =
263 try Some (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
264 with Not_found -> None
269 let generate_intros_let_tac seed id n s is_intro inner_proof name ~ids_to_inner_types =
270 let module C2A = Cic2acic in
271 let module C = Cic in
272 let module K = Content in
273 { K.proof_name = name;
274 K.proof_id = gen_id proof_prefix seed ;
275 K.proof_context = [] ;
276 K.proof_apply_context = [];
278 { K.conclude_id = gen_id conclude_prefix seed;
279 K.conclude_aref = id;
280 K.conclude_method = "Intros+LetTac";
281 K.conclude_args = [K.ArgProof inner_proof];
282 K.conclude_conclusion =
284 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
286 (match inner_proof.K.proof_conclude.K.conclude_conclusion with
289 if is_intro then Some (C.AProd ("gen"^id,n,s,t))
290 else Some (C.ALetIn ("gen"^id,n,s,t)))
295 let build_decl_item seed id n s ~ids_to_inner_sorts =
296 let module K = Content in
299 Some (Hashtbl.find ids_to_inner_sorts (Cic2acic.source_id_of_id id))
300 with Not_found -> None
305 { K.dec_name = name_of n;
306 K.dec_id = gen_id declaration_prefix seed;
307 K.dec_inductive = false;
313 { K.dec_name = name_of n;
314 K.dec_id = gen_id declaration_prefix seed;
315 K.dec_inductive = false;
321 let rec build_subproofs_and_args seed l ~ids_to_inner_types ~ids_to_inner_sorts =
322 let module C = Cic in
323 let module K = Content in
328 let subproofs,args = aux l1 in
329 if (test_for_lifting t ~ids_to_inner_types ~ids_to_inner_sorts) then
332 seed ~name:"H" ~ids_to_inner_types ~ids_to_inner_sorts t in
335 { K.premise_id = gen_id premise_prefix seed;
336 K.premise_xref = new_subproof.K.proof_id;
337 K.premise_binder = new_subproof.K.proof_name;
340 new_subproof::subproofs,new_arg::args
344 C.ARel (idr,idref,n,b) ->
346 (try Hashtbl.find ids_to_inner_sorts idr
347 with Not_found -> "Type") in
350 { K.premise_id = gen_id premise_prefix seed;
351 K.premise_xref = idr;
352 K.premise_binder = Some b;
356 | C.AConst(id,uri,[]) ->
358 (try Hashtbl.find ids_to_inner_sorts id
359 with Not_found -> "Type") in
362 { K.lemma_id = gen_id lemma_prefix seed;
363 K.lemma_name = UriManager.name_of_uri uri;
364 K.lemma_uri = UriManager.string_of_uri uri
367 | C.AMutConstruct(id,uri,tyno,consno,[]) ->
369 (try Hashtbl.find ids_to_inner_sorts id
370 with Not_found -> "Type") in
372 let inductive_types =
374 CicEnvironment.get_obj CicUniv.empty_ugraph uri
377 | Cic.InductiveDefinition (l,_,_,_) -> l
380 let (_,_,_,constructors) =
381 List.nth inductive_types tyno in
382 let name,_ = List.nth constructors (consno - 1) in
384 { K.lemma_id = gen_id lemma_prefix seed;
387 UriManager.string_of_uri uri ^ "#xpointer(1/" ^
388 string_of_int (tyno+1) ^ "/" ^ string_of_int consno ^
392 | _ -> (K.Term t)) in
397 [{p with K.proof_name = None}],
400 K.Premise prem when prem.K.premise_xref = p.K.proof_id ->
401 K.Premise {prem with K.premise_binder = None}
407 build_def_item seed id n t ~ids_to_inner_sorts ~ids_to_inner_types =
408 let module K = Content in
410 let sort = Hashtbl.find ids_to_inner_sorts id in
411 if sort = "Prop" then
413 (acic2content seed ?name:(name_of n) ~ids_to_inner_sorts ~ids_to_inner_types t)
418 { K.def_name = name_of n;
419 K.def_id = gen_id definition_prefix seed;
424 Not_found -> assert false
426 (* the following function must be called with an object of sort
427 Prop. For debugging purposes this is tested again, possibly raising an
428 Not_a_proof exception *)
430 and acic2content seed ?name ~ids_to_inner_sorts ~ids_to_inner_types t =
431 let rec aux ?name t =
432 let module C = Cic in
433 let module K = Content in
434 let module C2A = Cic2acic in
437 C.ARel (id,idref,n,b) as t ->
438 let sort = Hashtbl.find ids_to_inner_sorts id in
439 if sort = "Prop" then
440 generate_exact seed t id name ~ids_to_inner_types
441 else raise Not_a_proof
442 | C.AVar (id,uri,exp_named_subst) as t ->
443 let sort = Hashtbl.find ids_to_inner_sorts id in
444 if sort = "Prop" then
445 generate_exact seed t id name ~ids_to_inner_types
446 else raise Not_a_proof
447 | C.AMeta (id,n,l) as t ->
448 let sort = Hashtbl.find ids_to_inner_sorts id in
449 if sort = "Prop" then
450 generate_exact seed t id name ~ids_to_inner_types
451 else raise Not_a_proof
452 | C.ASort (id,s) -> raise Not_a_proof
453 | C.AImplicit _ -> raise NotImplemented
454 | C.AProd (_,_,_,_) -> raise Not_a_proof
455 | C.ACast (id,v,t) -> aux v
456 | C.ALambda (id,n,s,t) ->
457 let sort = Hashtbl.find ids_to_inner_sorts id in
458 if sort = "Prop" then
461 if proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
462 match proof.K.proof_conclude.K.conclude_args with
470 (build_decl_item seed id n s ids_to_inner_sorts)::
471 proof'.K.proof_context
474 generate_intros_let_tac seed id n s true proof'' name ~ids_to_inner_types
475 else raise Not_a_proof
476 | C.ALetIn (id,n,s,t) ->
477 let sort = Hashtbl.find ids_to_inner_sorts id in
478 if sort = "Prop" then
481 if proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
482 match proof.K.proof_conclude.K.conclude_args with
490 ((build_def_item seed id n s ids_to_inner_sorts
491 ids_to_inner_types):> Cic.annterm K.in_proof_context_element)
492 ::proof'.K.proof_context;
495 generate_intros_let_tac seed id n s false proof'' name ~ids_to_inner_types
496 else raise Not_a_proof
499 seed name id li ~ids_to_inner_types ~ids_to_inner_sorts
500 with NotApplicable ->
502 seed name id li ~ids_to_inner_types ~ids_to_inner_sorts
503 with NotApplicable ->
504 let subproofs, args =
505 build_subproofs_and_args
506 seed li ~ids_to_inner_types ~ids_to_inner_sorts in
509 List.filter (test_for_lifting ~ids_to_inner_types) li in
511 match args_to_lift with
512 [_] -> List.map aux args_to_lift
513 | _ -> List.map (aux ~name:"H") args_to_lift in
514 let args = build_args seed li subproofs
515 ~ids_to_inner_types ~ids_to_inner_sorts in *)
516 { K.proof_name = name;
517 K.proof_id = gen_id proof_prefix seed;
518 K.proof_context = [];
519 K.proof_apply_context = serialize seed subproofs;
521 { K.conclude_id = gen_id conclude_prefix seed;
522 K.conclude_aref = id;
523 K.conclude_method = "Apply";
524 K.conclude_args = args;
525 K.conclude_conclusion =
527 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
528 with Not_found -> None
531 | C.AConst (id,uri,exp_named_subst) as t ->
532 let sort = Hashtbl.find ids_to_inner_sorts id in
533 if sort = "Prop" then
534 generate_exact seed t id name ~ids_to_inner_types
535 else raise Not_a_proof
536 | C.AMutInd (id,uri,i,exp_named_subst) -> raise Not_a_proof
537 | C.AMutConstruct (id,uri,i,j,exp_named_subst) as t ->
538 let sort = Hashtbl.find ids_to_inner_sorts id in
539 if sort = "Prop" then
540 generate_exact seed t id name ~ids_to_inner_types
541 else raise Not_a_proof
542 | C.AMutCase (id,uri,typeno,ty,te,patterns) ->
543 let inductive_types,noparams =
544 (let o, _ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
546 Cic.Constant _ -> assert false
547 | Cic.Variable _ -> assert false
548 | Cic.CurrentProof _ -> assert false
549 | Cic.InductiveDefinition (l,_,n,_) -> l,n
551 let (_,_,_,constructors) = List.nth inductive_types typeno in
552 let name_and_arities =
553 let rec count_prods =
555 C.Prod (_,_,t) -> 1 + count_prods t
558 (function (n,t) -> Some n,((count_prods t) - noparams)) constructors in
560 let build_proof p (name,arity) =
561 let rec make_context_and_body c p n =
562 if n = 0 then c,(aux p)
565 Cic.ALambda(idl,vname,s1,t1) ->
567 build_decl_item seed idl vname s1 ~ids_to_inner_sorts in
568 make_context_and_body (ce::c) t1 (n-1)
569 | _ -> assert false) in
570 let context,body = make_context_and_body [] p arity in
572 {body with K.proof_name = name; K.proof_context=context} in
573 List.map2 build_proof patterns name_and_arities in
574 let teid = get_id te in
577 build_subproofs_and_args
578 seed ~ids_to_inner_types ~ids_to_inner_sorts [te]
581 | _ -> assert false) in
582 { K.proof_name = name;
583 K.proof_id = gen_id proof_prefix seed;
584 K.proof_context = [];
585 K.proof_apply_context = serialize seed context;
587 { K.conclude_id = gen_id conclude_prefix seed;
588 K.conclude_aref = id;
589 K.conclude_method = "Case";
591 (K.Aux (UriManager.string_of_uri uri))::
592 (K.Aux (string_of_int typeno))::(K.Term ty)::term::pp;
593 K.conclude_conclusion =
595 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
596 with Not_found -> None
599 | C.AFix (id, no, funs) ->
602 (function (_,name,_,_,bo) -> `Proof (aux ~name bo)) funs in
604 List.nth (List.map (fun (_,name,_,_,_) -> name) funs) no
606 let decreasing_args =
607 List.map (function (_,_,n,_,_) -> n) funs in
609 { K.joint_id = gen_id joint_prefix seed;
610 K.joint_kind = `Recursive decreasing_args;
611 K.joint_defs = proofs
614 { K.proof_name = name;
615 K.proof_id = gen_id proof_prefix seed;
616 K.proof_context = [`Joint jo];
617 K.proof_apply_context = [];
619 { K.conclude_id = gen_id conclude_prefix seed;
620 K.conclude_aref = id;
621 K.conclude_method = "Exact";
624 { K.premise_id = gen_id premise_prefix seed;
625 K.premise_xref = jo.K.joint_id;
626 K.premise_binder = Some fun_name;
627 K.premise_n = Some no;
630 K.conclude_conclusion =
632 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
633 with Not_found -> None
636 | C.ACoFix (id,no,funs) ->
639 (function (_,name,_,bo) -> `Proof (aux ~name bo)) funs in
641 { K.joint_id = gen_id joint_prefix seed;
642 K.joint_kind = `CoRecursive;
643 K.joint_defs = proofs
646 { K.proof_name = name;
647 K.proof_id = gen_id proof_prefix seed;
648 K.proof_context = [`Joint jo];
649 K.proof_apply_context = [];
651 { K.conclude_id = gen_id conclude_prefix seed;
652 K.conclude_aref = id;
653 K.conclude_method = "Exact";
656 { K.premise_id = gen_id premise_prefix seed;
657 K.premise_xref = jo.K.joint_id;
658 K.premise_binder = Some "tiralo fuori";
659 K.premise_n = Some no;
662 K.conclude_conclusion =
664 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
665 with Not_found -> None
670 generate_conversion seed false id t1 ~ids_to_inner_types
673 and inductive seed name id li ~ids_to_inner_types ~ids_to_inner_sorts =
674 let aux ?name = acic2content seed ~ids_to_inner_types ~ids_to_inner_sorts in
675 let module C2A = Cic2acic in
676 let module K = Content in
677 let module C = Cic in
679 C.AConst (idc,uri,exp_named_subst)::args ->
680 let uri_str = UriManager.string_of_uri uri in
681 let suffix = Str.regexp_string "_ind.con" in
682 let len = String.length uri_str in
683 let n = (try (Str.search_backward suffix uri_str len)
684 with Not_found -> -1) in
685 if n<0 then raise NotApplicable
688 if UriManager.eq uri HelmLibraryObjects.Logic.ex_ind_URI then "Exists"
689 else if UriManager.eq uri HelmLibraryObjects.Logic.and_ind_URI then "AndInd"
690 else if UriManager.eq uri HelmLibraryObjects.Logic.false_ind_URI then "FalseInd"
691 else "ByInduction" in
692 let prefix = String.sub uri_str 0 n in
693 let ind_str = (prefix ^ ".ind") in
694 let ind_uri = UriManager.uri_of_string ind_str in
695 let inductive_types,noparams =
696 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph ind_uri in
698 | Cic.InductiveDefinition (l,_,n,_) -> (l,n)
702 if n = 0 then ([],l) else
703 let p,a = split (n-1) (List.tl l) in
704 ((List.hd l::p),a) in
705 let params_and_IP,tail_args = split (noparams+1) args in
707 (match inductive_types with
709 | _ -> raise NotApplicable) (* don't care for mutual ind *) in
711 let rec clean_up n t =
714 (label,Cic.Prod (_,_,t)) -> clean_up (n-1) (label,t)
715 | _ -> assert false) in
716 List.map (clean_up noparams) constructors in
717 let no_constructors= List.length constructors in
718 let args_for_cases, other_args =
719 split no_constructors tail_args in
720 let subproofs,other_method_args =
721 build_subproofs_and_args seed other_args
722 ~ids_to_inner_types ~ids_to_inner_sorts in
724 let rec build_method_args =
726 [],_-> [] (* extra args are ignored ???? *)
727 | (name,ty)::tlc,arg::tla ->
728 let idarg = get_id arg in
730 (try (Hashtbl.find ids_to_inner_sorts idarg)
731 with Not_found -> "Type") in
733 if sortarg = "Prop" then
737 Cic.Prod (_,s,t),Cic.ALambda(idl,n,s1,t1) ->
740 seed idl n s1 ~ids_to_inner_sorts in
741 if (occur ind_uri s) then
743 Cic.ALambda(id2,n2,s2,t2) ->
746 { K.dec_name = name_of n2;
748 gen_id declaration_prefix seed;
749 K.dec_inductive = true;
753 let (context,body) = bc (t,t2) in
754 (ce::inductive_hyp::context,body)
758 let (context,body) = bc (t,t1) in
760 | _ , t -> ([],aux t) in
764 K.proof_name = Some name;
765 K.proof_context = co;
768 hdarg::(build_method_args (tlc,tla))
769 | _ -> assert false in
770 build_method_args (constructors1,args_for_cases) in
771 { K.proof_name = name;
772 K.proof_id = gen_id proof_prefix seed;
773 K.proof_context = [];
774 K.proof_apply_context = serialize seed subproofs;
776 { K.conclude_id = gen_id conclude_prefix seed;
777 K.conclude_aref = id;
778 K.conclude_method = method_name;
780 K.Aux (string_of_int no_constructors)
781 ::K.Term (C.AAppl(id,((C.AConst(idc,uri,exp_named_subst))::params_and_IP)))
782 ::method_args@other_method_args;
783 K.conclude_conclusion =
785 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
786 with Not_found -> None
789 | _ -> raise NotApplicable
791 and rewrite seed name id li ~ids_to_inner_types ~ids_to_inner_sorts =
792 let aux ?name = acic2content seed ~ids_to_inner_types ~ids_to_inner_sorts in
793 let module C2A = Cic2acic in
794 let module K = Content in
795 let module C = Cic in
797 C.AConst (sid,uri,exp_named_subst)::args ->
798 if UriManager.eq uri HelmLibraryObjects.Logic.eq_ind_URI or
799 UriManager.eq uri HelmLibraryObjects.Logic.eq_ind_r_URI then
802 build_subproofs_and_args
803 seed ~ids_to_inner_types ~ids_to_inner_sorts [List.nth args 3]
806 | _,_ -> assert false) in
808 let rec ma_aux n = function
814 let aid = get_id a in
815 let asort = (try (Hashtbl.find ids_to_inner_sorts aid)
816 with Not_found -> "Type") in
817 if asort = "Prop" then
820 hd::(ma_aux (n-1) tl) in
822 { K.proof_name = name;
823 K.proof_id = gen_id proof_prefix seed;
824 K.proof_context = [];
825 K.proof_apply_context = serialize seed subproofs;
827 { K.conclude_id = gen_id conclude_prefix seed;
828 K.conclude_aref = id;
829 K.conclude_method = "Rewrite";
831 K.Term (C.AConst (sid,uri,exp_named_subst))::method_args;
832 K.conclude_conclusion =
834 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
835 with Not_found -> None
838 else raise NotApplicable
839 | _ -> raise NotApplicable
843 seed ~ids_to_inner_sorts ~ids_to_inner_types (id,n,context,ty)
845 let module K = Content in
850 | (id,Some (name,Cic.ADecl t)) ->
852 (* We should call build_decl_item, but we have not computed *)
853 (* the inner-types ==> we always produce a declaration *)
855 { K.dec_name = name_of name;
856 K.dec_id = gen_id declaration_prefix seed;
857 K.dec_inductive = false;
858 K.dec_aref = get_id t;
861 | (id,Some (name,Cic.ADef t)) ->
863 (* We should call build_def_item, but we have not computed *)
864 (* the inner-types ==> we always produce a declaration *)
866 { K.def_name = name_of name;
867 K.def_id = gen_id definition_prefix seed;
868 K.def_aref = get_id t;
876 (* map_sequent is similar to map_conjectures, but the for the hid
877 of the hypothesis, which are preserved instead of generating
878 fresh ones. We shall have to adopt a uniform policy, soon or later *)
880 let map_sequent ((id,n,context,ty):Cic.annconjecture) =
881 let module K = Content in
886 | (id,Some (name,Cic.ADecl t)) ->
888 (* We should call build_decl_item, but we have not computed *)
889 (* the inner-types ==> we always produce a declaration *)
891 { K.dec_name = name_of name;
893 K.dec_inductive = false;
894 K.dec_aref = get_id t;
897 | (id,Some (name,Cic.ADef t)) ->
899 (* We should call build_def_item, but we have not computed *)
900 (* the inner-types ==> we always produce a declaration *)
902 { K.def_name = name_of name;
904 K.def_aref = get_id t;
912 let rec annobj2content ~ids_to_inner_sorts ~ids_to_inner_types =
913 let module C = Cic in
914 let module K = Content in
915 let module C2A = Cic2acic in
918 C.ACurrentProof (_,_,n,conjectures,bo,ty,params,_) ->
919 (gen_id object_prefix seed, params,
922 (map_conjectures seed ~ids_to_inner_sorts ~ids_to_inner_types)
925 build_def_item seed (get_id bo) (C.Name n) bo
926 ~ids_to_inner_sorts ~ids_to_inner_types))
927 | C.AConstant (_,_,n,Some bo,ty,params,_) ->
928 (gen_id object_prefix seed, params, None,
930 build_def_item seed (get_id bo) (C.Name n) bo
931 ~ids_to_inner_sorts ~ids_to_inner_types))
932 | C.AConstant (id,_,n,None,ty,params,_) ->
933 (gen_id object_prefix seed, params, None,
935 build_decl_item seed id (C.Name n) ty
936 ~ids_to_inner_sorts))
937 | C.AVariable (_,n,Some bo,ty,params,_) ->
938 (gen_id object_prefix seed, params, None,
940 build_def_item seed (get_id bo) (C.Name n) bo
941 ~ids_to_inner_sorts ~ids_to_inner_types))
942 | C.AVariable (id,n,None,ty,params,_) ->
943 (gen_id object_prefix seed, params, None,
945 build_decl_item seed id (C.Name n) ty
946 ~ids_to_inner_sorts))
947 | C.AInductiveDefinition (id,l,params,nparams,_) ->
948 (gen_id object_prefix seed, params, None,
950 { K.joint_id = gen_id joint_prefix seed;
951 K.joint_kind = `Inductive nparams;
952 K.joint_defs = List.map (build_inductive seed) l
956 build_inductive seed =
957 let module K = Content in
960 { K.inductive_id = gen_id inductive_prefix seed;
961 K.inductive_name = n;
962 K.inductive_kind = b;
963 K.inductive_type = ty;
964 K.inductive_constructors = build_constructors seed l
968 build_constructors seed l =
969 let module K = Content in
972 { K.dec_name = Some n;
973 K.dec_id = gen_id declaration_prefix seed;
974 K.dec_inductive = false;
981 and 'term cinductiveType =
982 id * string * bool * 'term * (* typename, inductive, arity *)
983 'term cconstructor list (* constructors *)
985 and 'term cconstructor =