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.Constant _ -> assert false
378 | Cic.Variable _ -> assert false
379 | Cic.CurrentProof _ -> assert false
380 | Cic.InductiveDefinition (l,_,_) -> l
382 let (_,_,_,constructors) =
383 List.nth inductive_types tyno in
384 let name,_ = List.nth constructors (consno - 1) in
386 { K.lemma_id = gen_id lemma_prefix seed;
389 UriManager.string_of_uri uri ^ "#xpointer(1/" ^
390 string_of_int (tyno+1) ^ "/" ^ string_of_int consno ^
394 | _ -> (K.Term t)) in
399 [{p with K.proof_name = None}],
402 K.Premise prem when prem.K.premise_xref = p.K.proof_id ->
403 K.Premise {prem with K.premise_binder = None}
409 build_def_item seed id n t ~ids_to_inner_sorts ~ids_to_inner_types =
410 let module K = Content in
412 let sort = Hashtbl.find ids_to_inner_sorts id in
413 if sort = "Prop" then
415 (acic2content seed ?name:(name_of n) ~ids_to_inner_sorts ~ids_to_inner_types t)
420 { K.def_name = name_of n;
421 K.def_id = gen_id definition_prefix seed;
426 Not_found -> assert false
428 (* the following function must be called with an object of sort
429 Prop. For debugging purposes this is tested again, possibly raising an
430 Not_a_proof exception *)
432 and acic2content seed ?name ~ids_to_inner_sorts ~ids_to_inner_types t =
433 let rec aux ?name t =
434 let module C = Cic in
435 let module K = Content in
436 let module C2A = Cic2acic in
439 C.ARel (id,idref,n,b) as t ->
440 let sort = Hashtbl.find ids_to_inner_sorts id in
441 if sort = "Prop" then
442 generate_exact seed t id name ~ids_to_inner_types
443 else raise Not_a_proof
444 | C.AVar (id,uri,exp_named_subst) as t ->
445 let sort = Hashtbl.find ids_to_inner_sorts id in
446 if sort = "Prop" then
447 generate_exact seed t id name ~ids_to_inner_types
448 else raise Not_a_proof
449 | C.AMeta (id,n,l) as t ->
450 let sort = Hashtbl.find ids_to_inner_sorts id in
451 if sort = "Prop" then
452 generate_exact seed t id name ~ids_to_inner_types
453 else raise Not_a_proof
454 | C.ASort (id,s) -> raise Not_a_proof
455 | C.AImplicit _ -> raise NotImplemented
456 | C.AProd (_,_,_,_) -> raise Not_a_proof
457 | C.ACast (id,v,t) -> aux v
458 | C.ALambda (id,n,s,t) ->
459 let sort = Hashtbl.find ids_to_inner_sorts id in
460 if sort = "Prop" then
463 if proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
464 match proof.K.proof_conclude.K.conclude_args with
472 (build_decl_item seed id n s ids_to_inner_sorts)::
473 proof'.K.proof_context
476 generate_intros_let_tac seed id n s true proof'' name ~ids_to_inner_types
477 else raise Not_a_proof
478 | C.ALetIn (id,n,s,t) ->
479 let sort = Hashtbl.find ids_to_inner_sorts id in
480 if sort = "Prop" then
483 if proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
484 match proof.K.proof_conclude.K.conclude_args with
492 ((build_def_item seed id n s ids_to_inner_sorts
493 ids_to_inner_types):> Cic.annterm K.in_proof_context_element)
494 ::proof'.K.proof_context;
497 generate_intros_let_tac seed id n s false proof'' name ~ids_to_inner_types
498 else raise Not_a_proof
501 seed name id li ~ids_to_inner_types ~ids_to_inner_sorts
502 with NotApplicable ->
504 seed name id li ~ids_to_inner_types ~ids_to_inner_sorts
505 with NotApplicable ->
506 let subproofs, args =
507 build_subproofs_and_args
508 seed li ~ids_to_inner_types ~ids_to_inner_sorts in
511 List.filter (test_for_lifting ~ids_to_inner_types) li in
513 match args_to_lift with
514 [_] -> List.map aux args_to_lift
515 | _ -> List.map (aux ~name:"H") args_to_lift in
516 let args = build_args seed li subproofs
517 ~ids_to_inner_types ~ids_to_inner_sorts in *)
518 { K.proof_name = name;
519 K.proof_id = gen_id proof_prefix seed;
520 K.proof_context = [];
521 K.proof_apply_context = serialize seed subproofs;
523 { K.conclude_id = gen_id conclude_prefix seed;
524 K.conclude_aref = id;
525 K.conclude_method = "Apply";
526 K.conclude_args = args;
527 K.conclude_conclusion =
529 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
530 with Not_found -> None
533 | C.AConst (id,uri,exp_named_subst) as t ->
534 let sort = Hashtbl.find ids_to_inner_sorts id in
535 if sort = "Prop" then
536 generate_exact seed t id name ~ids_to_inner_types
537 else raise Not_a_proof
538 | C.AMutInd (id,uri,i,exp_named_subst) -> raise Not_a_proof
539 | C.AMutConstruct (id,uri,i,j,exp_named_subst) as t ->
540 let sort = Hashtbl.find ids_to_inner_sorts id in
541 if sort = "Prop" then
542 generate_exact seed t id name ~ids_to_inner_types
543 else raise Not_a_proof
544 | C.AMutCase (id,uri,typeno,ty,te,patterns) ->
545 let inductive_types,noparams =
546 (let o, _ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
548 Cic.Constant _ -> assert false
549 | Cic.Variable _ -> assert false
550 | Cic.CurrentProof _ -> assert false
551 | Cic.InductiveDefinition (l,_,n) -> l,n
553 let (_,_,_,constructors) = List.nth inductive_types typeno in
554 let name_and_arities =
555 let rec count_prods =
557 C.Prod (_,_,t) -> 1 + count_prods t
560 (function (n,t) -> Some n,((count_prods t) - noparams)) constructors in
562 let build_proof p (name,arity) =
563 let rec make_context_and_body c p n =
564 if n = 0 then c,(aux p)
567 Cic.ALambda(idl,vname,s1,t1) ->
569 build_decl_item seed idl vname s1 ~ids_to_inner_sorts in
570 make_context_and_body (ce::c) t1 (n-1)
571 | _ -> assert false) in
572 let context,body = make_context_and_body [] p arity in
574 {body with K.proof_name = name; K.proof_context=context} in
575 List.map2 build_proof patterns name_and_arities in
576 let teid = get_id te in
579 build_subproofs_and_args
580 seed ~ids_to_inner_types ~ids_to_inner_sorts [te]
583 | _ -> assert false) in
584 { K.proof_name = name;
585 K.proof_id = gen_id proof_prefix seed;
586 K.proof_context = [];
587 K.proof_apply_context = serialize seed context;
589 { K.conclude_id = gen_id conclude_prefix seed;
590 K.conclude_aref = id;
591 K.conclude_method = "Case";
593 (K.Aux (UriManager.string_of_uri uri))::
594 (K.Aux (string_of_int typeno))::(K.Term ty)::term::pp;
595 K.conclude_conclusion =
597 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
598 with Not_found -> None
601 | C.AFix (id, no, funs) ->
604 (function (_,name,_,_,bo) -> `Proof (aux ~name bo)) funs in
605 let decreasing_args =
606 List.map (function (_,_,n,_,_) -> n) funs in
608 { K.joint_id = gen_id joint_prefix seed;
609 K.joint_kind = `Recursive decreasing_args;
610 K.joint_defs = proofs
613 { K.proof_name = name;
614 K.proof_id = gen_id proof_prefix seed;
615 K.proof_context = [`Joint jo];
616 K.proof_apply_context = [];
618 { K.conclude_id = gen_id conclude_prefix seed;
619 K.conclude_aref = id;
620 K.conclude_method = "Exact";
623 { K.premise_id = gen_id premise_prefix seed;
624 K.premise_xref = jo.K.joint_id;
625 K.premise_binder = Some "tiralo fuori";
626 K.premise_n = Some no;
629 K.conclude_conclusion =
631 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
632 with Not_found -> None
635 | C.ACoFix (id,no,funs) ->
638 (function (_,name,_,bo) -> `Proof (aux ~name bo)) funs in
640 { K.joint_id = gen_id joint_prefix seed;
641 K.joint_kind = `CoRecursive;
642 K.joint_defs = proofs
645 { K.proof_name = name;
646 K.proof_id = gen_id proof_prefix seed;
647 K.proof_context = [`Joint jo];
648 K.proof_apply_context = [];
650 { K.conclude_id = gen_id conclude_prefix seed;
651 K.conclude_aref = id;
652 K.conclude_method = "Exact";
655 { K.premise_id = gen_id premise_prefix seed;
656 K.premise_xref = jo.K.joint_id;
657 K.premise_binder = Some "tiralo fuori";
658 K.premise_n = Some no;
661 K.conclude_conclusion =
663 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
664 with Not_found -> None
669 generate_conversion seed false id t1 ~ids_to_inner_types
672 and inductive seed name id li ~ids_to_inner_types ~ids_to_inner_sorts =
673 let aux ?name = acic2content seed ~ids_to_inner_types ~ids_to_inner_sorts in
674 let module C2A = Cic2acic in
675 let module K = Content in
676 let module C = Cic in
678 C.AConst (idc,uri,exp_named_subst)::args ->
679 let uri_str = UriManager.string_of_uri uri in
680 let suffix = Str.regexp_string "_ind.con" in
681 let len = String.length uri_str in
682 let n = (try (Str.search_backward suffix uri_str len)
683 with Not_found -> -1) in
684 if n<0 then raise NotApplicable
687 if UriManager.eq uri HelmLibraryObjects.Logic.ex_ind_URI then "Exists"
688 else if UriManager.eq uri HelmLibraryObjects.Logic.and_ind_URI then "AndInd"
689 else if UriManager.eq uri HelmLibraryObjects.Logic.false_ind_URI then "FalseInd"
690 else "ByInduction" in
691 let prefix = String.sub uri_str 0 n in
692 let ind_str = (prefix ^ ".ind") in
693 let ind_uri = UriManager.uri_of_string ind_str in
694 let inductive_types,noparams =
695 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph ind_uri in
697 Cic.Constant _ -> assert false
698 | Cic.Variable _ -> assert false
699 | Cic.CurrentProof _ -> assert false
700 | Cic.InductiveDefinition (l,_,n) -> (l,n)
703 if n = 0 then ([],l) else
704 let p,a = split (n-1) (List.tl l) in
705 ((List.hd l::p),a) in
706 let params_and_IP,tail_args = split (noparams+1) args in
708 (match inductive_types with
710 | _ -> raise NotApplicable) (* don't care for mutual ind *) in
712 let rec clean_up n t =
715 (label,Cic.Prod (_,_,t)) -> clean_up (n-1) (label,t)
716 | _ -> assert false) in
717 List.map (clean_up noparams) constructors in
718 let no_constructors= List.length constructors in
719 let args_for_cases, other_args =
720 split no_constructors tail_args in
721 let subproofs,other_method_args =
722 build_subproofs_and_args seed other_args
723 ~ids_to_inner_types ~ids_to_inner_sorts in
725 let rec build_method_args =
727 [],_-> [] (* extra args are ignored ???? *)
728 | (name,ty)::tlc,arg::tla ->
729 let idarg = get_id arg in
731 (try (Hashtbl.find ids_to_inner_sorts idarg)
732 with Not_found -> "Type") in
734 if sortarg = "Prop" then
738 Cic.Prod (_,s,t),Cic.ALambda(idl,n,s1,t1) ->
741 seed idl n s1 ~ids_to_inner_sorts in
742 if (occur ind_uri s) then
744 Cic.ALambda(id2,n2,s2,t2) ->
747 { K.dec_name = name_of n2;
749 gen_id declaration_prefix seed;
750 K.dec_inductive = true;
754 let (context,body) = bc (t,t2) in
755 (ce::inductive_hyp::context,body)
759 let (context,body) = bc (t,t1) in
761 | _ , t -> ([],aux t) in
765 K.proof_name = Some name;
766 K.proof_context = co;
769 hdarg::(build_method_args (tlc,tla))
770 | _ -> assert false in
771 build_method_args (constructors1,args_for_cases) in
772 { K.proof_name = name;
773 K.proof_id = gen_id proof_prefix seed;
774 K.proof_context = [];
775 K.proof_apply_context = serialize seed subproofs;
777 { K.conclude_id = gen_id conclude_prefix seed;
778 K.conclude_aref = id;
779 K.conclude_method = method_name;
781 K.Aux (string_of_int no_constructors)
782 ::K.Term (C.AAppl(id,((C.AConst(idc,uri,exp_named_subst))::params_and_IP)))
783 ::method_args@other_method_args;
784 K.conclude_conclusion =
786 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
787 with Not_found -> None
790 | _ -> raise NotApplicable
792 and rewrite seed name id li ~ids_to_inner_types ~ids_to_inner_sorts =
793 let aux ?name = acic2content seed ~ids_to_inner_types ~ids_to_inner_sorts in
794 let module C2A = Cic2acic in
795 let module K = Content in
796 let module C = Cic in
798 C.AConst (sid,uri,exp_named_subst)::args ->
799 if UriManager.eq uri HelmLibraryObjects.Logic.eq_ind_URI or
800 UriManager.eq uri HelmLibraryObjects.Logic.eq_ind_r_URI then
803 build_subproofs_and_args
804 seed ~ids_to_inner_types ~ids_to_inner_sorts [List.nth args 3]
807 | _,_ -> assert false) in
809 let rec ma_aux n = function
815 let aid = get_id a in
816 let asort = (try (Hashtbl.find ids_to_inner_sorts aid)
817 with Not_found -> "Type") in
818 if asort = "Prop" then
821 hd::(ma_aux (n-1) tl) in
823 { K.proof_name = name;
824 K.proof_id = gen_id proof_prefix seed;
825 K.proof_context = [];
826 K.proof_apply_context = serialize seed subproofs;
828 { K.conclude_id = gen_id conclude_prefix seed;
829 K.conclude_aref = id;
830 K.conclude_method = "Rewrite";
832 K.Term (C.AConst (sid,uri,exp_named_subst))::method_args;
833 K.conclude_conclusion =
835 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
836 with Not_found -> None
839 else raise NotApplicable
840 | _ -> raise NotApplicable
844 seed ~ids_to_inner_sorts ~ids_to_inner_types (id,n,context,ty)
846 let module K = Content in
851 | (id,Some (name,Cic.ADecl t)) ->
853 (* We should call build_decl_item, but we have not computed *)
854 (* the inner-types ==> we always produce a declaration *)
856 { K.dec_name = name_of name;
857 K.dec_id = gen_id declaration_prefix seed;
858 K.dec_inductive = false;
859 K.dec_aref = get_id t;
862 | (id,Some (name,Cic.ADef t)) ->
864 (* We should call build_def_item, but we have not computed *)
865 (* the inner-types ==> we always produce a declaration *)
867 { K.def_name = name_of name;
868 K.def_id = gen_id definition_prefix seed;
869 K.def_aref = get_id t;
877 (* map_sequent is similar to map_conjectures, but the for the hid
878 of the hypothesis, which are preserved instead of generating
879 fresh ones. We shall have to adopt a uniform policy, soon or later *)
881 let map_sequent ((id,n,context,ty):Cic.annconjecture) =
882 let module K = Content in
887 | (id,Some (name,Cic.ADecl t)) ->
889 (* We should call build_decl_item, but we have not computed *)
890 (* the inner-types ==> we always produce a declaration *)
892 { K.dec_name = name_of name;
894 K.dec_inductive = false;
895 K.dec_aref = get_id t;
898 | (id,Some (name,Cic.ADef t)) ->
900 (* We should call build_def_item, but we have not computed *)
901 (* the inner-types ==> we always produce a declaration *)
903 { K.def_name = name_of name;
905 K.def_aref = get_id t;
913 let rec annobj2content ~ids_to_inner_sorts ~ids_to_inner_types =
914 let module C = Cic in
915 let module K = Content in
916 let module C2A = Cic2acic in
919 C.ACurrentProof (_,_,n,conjectures,bo,ty,params) ->
920 (gen_id object_prefix seed, params,
923 (map_conjectures seed ~ids_to_inner_sorts ~ids_to_inner_types)
926 build_def_item seed (get_id bo) (C.Name n) bo
927 ~ids_to_inner_sorts ~ids_to_inner_types))
928 | C.AConstant (_,_,n,Some bo,ty,params) ->
929 (gen_id object_prefix seed, params, None,
931 build_def_item seed (get_id bo) (C.Name n) bo
932 ~ids_to_inner_sorts ~ids_to_inner_types))
933 | C.AConstant (id,_,n,None,ty,params) ->
934 (gen_id object_prefix seed, params, None,
936 build_decl_item seed id (C.Name n) ty
937 ~ids_to_inner_sorts))
938 | C.AVariable (_,n,Some bo,ty,params) ->
939 (gen_id object_prefix seed, params, None,
941 build_def_item seed (get_id bo) (C.Name n) bo
942 ~ids_to_inner_sorts ~ids_to_inner_types))
943 | C.AVariable (id,n,None,ty,params) ->
944 (gen_id object_prefix seed, params, None,
946 build_decl_item seed id (C.Name n) ty
947 ~ids_to_inner_sorts))
948 | C.AInductiveDefinition (id,l,params,nparams) ->
949 (gen_id object_prefix seed, params, None,
951 { K.joint_id = gen_id joint_prefix seed;
952 K.joint_kind = `Inductive nparams;
953 K.joint_defs = List.map (build_inductive seed) l
957 build_inductive seed =
958 let module K = Content in
961 { K.inductive_id = gen_id inductive_prefix seed;
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 =