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 (* e se mettessi la conversione di BY nell'apply_context ? *)
36 (* sarebbe carino avere l'invariante che la proof2pres
37 generasse sempre prove con contesto vuoto *)
40 let res = "p" ^ string_of_int !seed in
45 let name_of = function
47 | Cic.Name b -> Some b;;
49 exception Not_a_proof;;
50 exception NotImplemented;;
51 exception NotApplicable;;
53 (* we do not care for positivity, here, that in any case is enforced by
54 well typing. Just a brutal search *)
63 | C.Implicit -> raise NotImplemented
64 | C.Prod (_,s,t) -> (occur uri s) or (occur uri t)
65 | C.Cast (te,ty) -> (occur uri te)
66 | C.Lambda (_,s,t) -> (occur uri s) or (occur uri t) (* or false ?? *)
67 | C.LetIn (_,s,t) -> (occur uri s) or (occur uri t)
72 else (occur uri a)) false l
73 | C.Const (_,_) -> false
74 | C.MutInd (uri1,_,_) -> if uri = uri1 then true else false
75 | C.MutConstruct (_,_,_,_) -> false
76 | C.MutCase _ -> false (* presuming too much?? *)
77 | C.Fix _ -> false (* presuming too much?? *)
78 | C.CoFix (_,_) -> false (* presuming too much?? *)
84 C.ARel (id,_,_,_) -> id
85 | C.AVar (id,_,_) -> id
86 | C.AMeta (id,_,_) -> id
87 | C.ASort (id,_) -> id
88 | C.AImplicit _ -> raise NotImplemented
89 | C.AProd (id,_,_,_) -> id
90 | C.ACast (id,_,_) -> id
91 | C.ALambda (id,_,_,_) -> id
92 | C.ALetIn (id,_,_,_) -> id
93 | C.AAppl (id,_) -> id
94 | C.AConst (id,_,_) -> id
95 | C.AMutInd (id,_,_,_) -> id
96 | C.AMutConstruct (id,_,_,_,_) -> id
97 | C.AMutCase (id,_,_,_,_,_) -> id
98 | C.AFix (id,_,_) -> id
99 | C.ACoFix (id,_,_) -> id
102 let test_for_lifting ~ids_to_inner_types =
103 let module C = Cic in
104 let module C2A = Cic2acic in
105 (* atomic terms are never lifted, according to my policy *)
107 C.ARel (id,_,_,_) -> false
108 | C.AVar (id,_,_) -> false
109 | C.AMeta (id,_,_) -> false
110 | C.ASort (id,_) -> false
111 | C.AImplicit _ -> raise NotImplemented
112 | C.AProd (id,_,_,_) -> false
113 | C.ACast (id,_,_) ->
115 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
117 with Not_found -> false)
118 | C.ALambda (id,_,_,_) ->
120 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
122 with Not_found -> false)
123 | C.ALetIn (id,_,_,_) ->
125 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
127 with Not_found -> false)
130 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
132 with Not_found -> false)
133 | C.AConst (id,_,_) ->
135 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
137 with Not_found -> false)
138 | C.AMutInd (id,_,_,_) -> false
139 | C.AMutConstruct (id,_,_,_,_) ->
141 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
143 with Not_found -> false)
145 | C.AMutCase (id,_,_,_,_,_) ->
147 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
149 with Not_found -> false)
152 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
154 with Not_found -> false)
155 | C.ACoFix (id,_,_) ->
157 ignore (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized;
159 with Not_found -> false)
162 let build_args seed l subproofs ~ids_to_inner_types ~ids_to_inner_sorts =
163 let module C = Cic in
164 let module K = Content in
165 let rec aux l subrpoofs =
169 if (test_for_lifting t ~ids_to_inner_types) then
170 (match subproofs with
175 { K.premise_id = gen_id seed;
176 K.premise_xref = p.K.proof_id;
177 K.premise_binder = p.K.proof_name;
180 in new_arg::(aux l1 tl))
184 C.ARel (idr,idref,n,b) ->
186 (try Hashtbl.find ids_to_inner_sorts idr
187 with Not_found -> "Type") in
190 { K.premise_id = gen_id seed;
191 K.premise_xref = idr;
192 K.premise_binder = Some b;
196 | _ -> (K.Term t)) in
197 hd::(aux l1 subproofs)
201 (* transform a proof p into a proof list, concatenating the last
202 conclude element to the apply_context list, in case context is
203 empty. Otherwise, it just returns [p] *)
206 let module K = Content in
207 if (p.K.proof_context = []) then
208 if p.K.proof_apply_context = [] then [p]
212 K.proof_id = gen_id seed;
213 K.proof_context = [];
214 K.proof_apply_context = []
216 p.K.proof_apply_context@[p1]
221 let rec serialize seed =
224 | p::tl -> (flat seed p)@(serialize seed tl);;
226 (* top_down = true if the term is a LAMBDA or a decl *)
227 let generate_conversion seed top_down id inner_proof ~ids_to_inner_types =
228 let module C2A = Cic2acic in
229 let module K = Content in
230 let exp = (try ((Hashtbl.find ids_to_inner_types id).C2A.annexpected)
231 with Not_found -> None)
236 if inner_proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
237 { K.proof_name = None ;
238 K.proof_id = gen_id seed;
239 K.proof_context = [] ;
240 K.proof_apply_context = [];
242 { K.conclude_id = gen_id seed;
243 K.conclude_aref = id;
244 K.conclude_method = "TD_Conversion";
245 K.conclude_args = [K.ArgProof inner_proof];
246 K.conclude_conclusion = Some expty
250 { K.proof_name = None ;
251 K.proof_id = gen_id seed;
252 K.proof_context = [] ;
253 K.proof_apply_context = [inner_proof];
255 { K.conclude_id = gen_id seed;
256 K.conclude_aref = id;
257 K.conclude_method = "BU_Conversion";
260 { K.premise_id = gen_id seed;
261 K.premise_xref = inner_proof.K.proof_id;
262 K.premise_binder = None;
266 K.conclude_conclusion = Some expty
271 let generate_exact seed t id name ~ids_to_inner_types =
272 let module C2A = Cic2acic in
273 let module K = Content in
274 { K.proof_name = name;
276 K.proof_context = [] ;
277 K.proof_apply_context = [];
279 { K.conclude_id = gen_id seed;
280 K.conclude_aref = id;
281 K.conclude_method = "Exact";
282 K.conclude_args = [K.Term t];
283 K.conclude_conclusion =
284 try Some (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
285 with Not_found -> None
290 let generate_intros_let_tac seed id n s is_intro inner_proof name ~ids_to_inner_types =
291 let module C2A = Cic2acic in
292 let module C = Cic in
293 let module K = Content in
294 { K.proof_name = name;
296 K.proof_context = [] ;
297 K.proof_apply_context = [];
299 { K.conclude_id = gen_id seed;
300 K.conclude_aref = id;
301 K.conclude_method = "Intros+LetTac";
302 K.conclude_args = [K.ArgProof inner_proof];
303 K.conclude_conclusion =
305 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
307 (match inner_proof.K.proof_conclude.K.conclude_conclusion with
310 if is_intro then Some (C.AProd ("gen"^id,n,s,t))
311 else Some (C.ALetIn ("gen"^id,n,s,t)))
316 let build_decl_item seed id n s ~ids_to_inner_sorts =
317 let module K = Content in
319 let sort = Hashtbl.find ids_to_inner_sorts (Cic2acic.source_id_of_id id) in
320 if sort = "Prop" then
322 { K.dec_name = name_of n;
323 K.dec_id = gen_id seed;
324 K.dec_inductive = false;
330 { K.dec_name = name_of n;
331 K.dec_id = gen_id seed;
332 K.dec_inductive = false;
337 Not_found -> assert false
340 let rec build_def_item seed id n t ~ids_to_inner_sorts ~ids_to_inner_types =
341 let module K = Content in
343 let sort = Hashtbl.find ids_to_inner_sorts id in
344 if sort = "Prop" then
345 `Proof (acic2content seed ?name:(name_of n) ~ids_to_inner_sorts ~ids_to_inner_types t)
348 { K.def_name = name_of n;
349 K.def_id = gen_id seed;
354 Not_found -> assert false
356 (* the following function must be called with an object of sort
357 Prop. For debugging purposes this is tested again, possibly raising an
358 Not_a_proof exception *)
360 and acic2content seed ?name ~ids_to_inner_sorts ~ids_to_inner_types t =
361 let rec aux ?name t =
362 let module C = Cic in
363 let module K = Content in
364 let module C2A = Cic2acic in
367 C.ARel (id,idref,n,b) as t ->
368 let sort = Hashtbl.find ids_to_inner_sorts id in
369 if sort = "Prop" then
370 generate_exact seed t id name ~ids_to_inner_types
371 else raise Not_a_proof
372 | C.AVar (id,uri,exp_named_subst) as t ->
373 let sort = Hashtbl.find ids_to_inner_sorts id in
374 if sort = "Prop" then
375 generate_exact seed t id name ~ids_to_inner_types
376 else raise Not_a_proof
377 | C.AMeta (id,n,l) as t ->
378 let sort = Hashtbl.find ids_to_inner_sorts id in
379 if sort = "Prop" then
380 generate_exact seed t id name ~ids_to_inner_types
381 else raise Not_a_proof
382 | C.ASort (id,s) -> raise Not_a_proof
383 | C.AImplicit _ -> raise NotImplemented
384 | C.AProd (_,_,_,_) -> raise Not_a_proof
385 | C.ACast (id,v,t) -> aux v
386 | C.ALambda (id,n,s,t) ->
387 let sort = Hashtbl.find ids_to_inner_sorts id in
388 if sort = "Prop" then
391 if proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
392 match proof.K.proof_conclude.K.conclude_args with
400 (build_decl_item seed id n s ids_to_inner_sorts)::
401 proof'.K.proof_context
404 generate_intros_let_tac seed id n s true proof'' name ~ids_to_inner_types
405 else raise Not_a_proof
406 | C.ALetIn (id,n,s,t) ->
407 let sort = Hashtbl.find ids_to_inner_sorts id in
408 if sort = "Prop" then
411 if proof.K.proof_conclude.K.conclude_method = "Intros+LetTac" then
412 match proof.K.proof_conclude.K.conclude_args with
420 ((build_def_item seed id n s ids_to_inner_sorts
421 ids_to_inner_types):> Cic.annterm K.in_proof_context_element)
422 ::proof'.K.proof_context;
425 generate_intros_let_tac seed id n s false proof'' name ~ids_to_inner_types
426 else raise Not_a_proof
429 seed name id li ids_to_inner_types ids_to_inner_sorts
430 with NotApplicable ->
432 seed name id li ids_to_inner_types ids_to_inner_sorts
433 with NotApplicable ->
435 List.filter (test_for_lifting ~ids_to_inner_types) li in
437 match args_to_lift with
438 [_] -> List.map aux args_to_lift
439 | _ -> List.map (aux ~name:"H") args_to_lift in
440 let args = build_args seed li subproofs
441 ~ids_to_inner_types ~ids_to_inner_sorts in
442 { K.proof_name = name;
443 K.proof_id = gen_id seed;
444 K.proof_context = [];
445 K.proof_apply_context = serialize seed subproofs;
447 { K.conclude_id = gen_id seed;
448 K.conclude_aref = id;
449 K.conclude_method = "Apply";
450 K.conclude_args = args;
451 K.conclude_conclusion =
453 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
454 with Not_found -> None
457 | C.AConst (id,uri,exp_named_subst) as t ->
458 let sort = Hashtbl.find ids_to_inner_sorts id in
459 if sort = "Prop" then
460 generate_exact seed t id name ~ids_to_inner_types
461 else raise Not_a_proof
462 | C.AMutInd (id,uri,i,exp_named_subst) -> raise Not_a_proof
463 | C.AMutConstruct (id,uri,i,j,exp_named_subst) as t ->
464 let sort = Hashtbl.find ids_to_inner_sorts id in
465 if sort = "Prop" then
466 generate_exact seed t id name ~ids_to_inner_types
467 else raise Not_a_proof
468 | C.AMutCase (id,uri,typeno,ty,te,patterns) ->
469 let teid = get_id te in
470 let pp = List.map (function p -> (K.ArgProof (aux p))) patterns in
472 (try Some (Hashtbl.find ids_to_inner_types teid).C2A.annsynthesized
473 with Not_found -> None)
475 Some tety -> (* we must lift up the argument *)
477 { K.proof_name = Some "name";
478 K.proof_id = gen_id seed;
479 K.proof_context = [];
480 K.proof_apply_context = flat seed p;
482 { K.conclude_id = gen_id seed;
483 K.conclude_aref = id;
484 K.conclude_method = "Case";
485 K.conclude_args = (K.Term ty)::(K.Term te)::pp;
486 K.conclude_conclusion =
488 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
489 with Not_found -> None
493 { K.proof_name = name;
494 K.proof_id = gen_id seed;
495 K.proof_context = [];
496 K.proof_apply_context = [];
498 { K.conclude_id = gen_id seed;
499 K.conclude_aref = id;
500 K.conclude_method = "Case";
501 K.conclude_args = (K.Term ty)::(K.Term te)::pp;
502 K.conclude_conclusion =
504 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
505 with Not_found -> None
509 | C.AFix (id, no, funs) ->
512 (function (_,name,_,_,bo) -> `Proof (aux ~name bo)) funs in
513 let decreasing_args =
514 List.map (function (_,_,n,_,_) -> n) funs in
516 { K.joint_id = gen_id seed;
517 K.joint_kind = `Recursive decreasing_args;
518 K.joint_defs = proofs
521 { K.proof_name = name;
522 K.proof_id = gen_id seed;
523 K.proof_context = [`Joint jo];
524 K.proof_apply_context = [];
526 { K.conclude_id = gen_id seed;
527 K.conclude_aref = id;
528 K.conclude_method = "Exact";
531 { K.premise_id = gen_id seed;
532 K.premise_xref = jo.K.joint_id;
533 K.premise_binder = Some "tiralo fuori";
534 K.premise_n = Some no;
537 K.conclude_conclusion =
539 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
540 with Not_found -> None
543 | C.ACoFix (id,no,funs) ->
546 (function (_,name,_,bo) -> `Proof (aux ~name bo)) funs in
548 { K.joint_id = gen_id seed;
549 K.joint_kind = `CoRecursive;
550 K.joint_defs = proofs
553 { K.proof_name = name;
554 K.proof_id = gen_id seed;
555 K.proof_context = [`Joint jo];
556 K.proof_apply_context = [];
558 { K.conclude_id = gen_id seed;
559 K.conclude_aref = id;
560 K.conclude_method = "Exact";
563 { K.premise_id = gen_id seed;
564 K.premise_xref = jo.K.joint_id;
565 K.premise_binder = Some "tiralo fuori";
566 K.premise_n = Some no;
569 K.conclude_conclusion =
571 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
572 with Not_found -> None
577 generate_conversion seed false id t1 ~ids_to_inner_types
580 and inductive seed name id li ids_to_inner_types ids_to_inner_sorts =
581 let aux ?name = acic2content seed ~ids_to_inner_types ~ids_to_inner_sorts in
582 let module C2A = Cic2acic in
583 let module K = Content in
584 let module C = Cic in
586 C.AConst (idc,uri,exp_named_subst)::args ->
587 let uri_str = UriManager.string_of_uri uri in
588 let suffix = Str.regexp_string "_ind.con" in
589 let len = String.length uri_str in
590 let n = (try (Str.search_backward suffix uri_str len)
591 with Not_found -> -1) in
592 if n<0 then raise NotApplicable
594 let prefix = String.sub uri_str 0 n in
595 let ind_str = (prefix ^ ".ind") in
596 let ind_uri = UriManager.uri_of_string ind_str in
597 let inductive_types,noparams =
598 (match CicEnvironment.get_obj ind_uri with
599 Cic.Constant _ -> assert false
600 | Cic.Variable _ -> assert false
601 | Cic.CurrentProof _ -> assert false
602 | Cic.InductiveDefinition (l,_,n) -> (l,n)
605 if n = 0 then ([],l) else
606 let p,a = split (n-1) (List.tl l) in
607 ((List.hd l::p),a) in
608 let params_and_IP,tail_args = split (noparams+1) args in
610 (match inductive_types with
612 | _ -> raise NotApplicable) (* don't care for mutual ind *) in
614 let rec clean_up n t =
617 (label,Cic.Prod (_,_,t)) -> clean_up (n-1) (label,t)
618 | _ -> assert false) in
619 List.map (clean_up noparams) constructors in
620 let no_constructors= List.length constructors in
621 let args_for_cases, other_args =
622 split no_constructors tail_args in
624 List.filter (test_for_lifting ~ids_to_inner_types) other_args in
626 match args_to_lift with
627 [_] -> List.map aux args_to_lift
628 | _ -> List.map (aux ~name:"H") args_to_lift in
629 prerr_endline "****** end subproofs *******"; flush stderr;
630 let other_method_args =
631 build_args seed other_args subproofs
632 ~ids_to_inner_types ~ids_to_inner_sorts in
634 let rparams,inductive_arg =
639 | a::tl -> let (p,ia) = aux tl in (a::p,ia) in
640 aux other_method_args in
642 prerr_endline "****** end other *******"; flush stderr;
644 let rec build_method_args =
646 [],_-> [] (* extra args are ignored ???? *)
647 | (name,ty)::tlc,arg::tla ->
648 let idarg = get_id arg in
650 (try (Hashtbl.find ids_to_inner_sorts idarg)
651 with Not_found -> "Type") in
653 if sortarg = "Prop" then
657 Cic.Prod (_,s,t),Cic.ALambda(idl,n,s1,t1) ->
660 seed idl n s1 ~ids_to_inner_sorts in
661 if (occur ind_uri s) then
662 ( prerr_endline ("inductive:" ^ (UriManager.string_of_uri ind_uri) ^ (CicPp.ppterm s)); flush stderr;
664 Cic.ALambda(id2,n2,s2,t2) ->
667 { K.dec_name = name_of n2;
668 K.dec_id = gen_id seed;
669 K.dec_inductive = true;
673 let (context,body) = bc (t,t2) in
674 (ce::inductive_hyp::context,body)
677 ( prerr_endline ("no inductive:" ^ (UriManager.string_of_uri ind_uri) ^ (CicPp.ppterm s)); flush stderr;
678 let (context,body) = bc (t,t1) in
680 | _ , t -> ([],aux t) in
684 K.proof_name = Some name;
685 K.proof_context = co;
688 hdarg::(build_method_args (tlc,tla))
689 | _ -> assert false in
690 build_method_args (constructors1,args_for_cases) in
691 { K.proof_name = None;
692 K.proof_id = gen_id seed;
693 K.proof_context = [];
694 K.proof_apply_context = subproofs;
696 { K.conclude_id = gen_id seed;
697 K.conclude_aref = id;
698 K.conclude_method = "ByInduction";
700 K.Aux no_constructors
701 ::K.Term (C.AAppl id ((C.AConst(idc,uri,exp_named_subst))::params_and_IP))
702 ::method_args@other_method_args;
703 K.conclude_conclusion =
705 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
706 with Not_found -> None
709 | _ -> raise NotApplicable
711 and rewrite seed name id li ids_to_inner_types ids_to_inner_sorts =
712 let aux ?name = acic2content seed ~ids_to_inner_types ~ids_to_inner_sorts in
713 let module C2A = Cic2acic in
714 let module K = Content in
715 let module C = Cic in
717 C.AConst (sid,uri,exp_named_subst)::args ->
718 let uri_str = UriManager.string_of_uri uri in
719 if uri_str = "cic:/Coq/Init/Logic/eq_ind.con" or
720 uri_str = "cic:/Coq/Init/Logic/eq_ind_r.con" then
721 let subproof = aux (List.nth args 3) in
723 let rec ma_aux n = function
729 { K.premise_id = gen_id seed;
730 K.premise_xref = subproof.K.proof_id;
731 K.premise_binder = None;
735 let aid = get_id a in
736 let asort = (try (Hashtbl.find ids_to_inner_sorts aid)
737 with Not_found -> "Type") in
738 if asort = "Prop" then
741 hd::(ma_aux (n-1) tl) in
743 { K.proof_name = None;
744 K.proof_id = gen_id seed;
745 K.proof_context = [];
746 K.proof_apply_context = [subproof];
748 { K.conclude_id = gen_id seed;
749 K.conclude_aref = id;
750 K.conclude_method = "Rewrite";
752 K.Term (C.AConst (sid,uri,exp_named_subst))::method_args;
753 K.conclude_conclusion =
755 (Hashtbl.find ids_to_inner_types id).C2A.annsynthesized
756 with Not_found -> None
759 else raise NotApplicable
760 | _ -> raise NotApplicable
764 seed ~ids_to_inner_sorts ~ids_to_inner_types (id,n,context,ty)
766 let module K = Content in
770 (id,None) as item -> item
771 | (id,Some (name,Cic.ADecl t)) ->
774 (* We should call build_decl_item, but we have not computed *)
775 (* the inner-types ==> we always produce a declaration *)
777 { K.dec_name = name_of name;
778 K.dec_id = gen_id seed;
779 K.dec_inductive = false;
780 K.dec_aref = get_id t;
783 | (id,Some (name,Cic.ADef t)) ->
786 (* We should call build_def_item, but we have not computed *)
787 (* the inner-types ==> we always produce a declaration *)
789 { K.def_name = name_of name;
790 K.def_id = gen_id seed;
791 K.def_aref = get_id t;
799 let rec annobj2content ~ids_to_inner_sorts ~ids_to_inner_types =
800 let module C = Cic in
801 let module K = Content in
802 let module C2A = Cic2acic in
805 C.ACurrentProof (_,_,n,conjectures,bo,ty,params) ->
806 (gen_id seed, params,
809 (map_conjectures seed ~ids_to_inner_sorts ~ids_to_inner_types)
812 build_def_item seed (get_id bo) (C.Name n) bo
813 ~ids_to_inner_sorts ~ids_to_inner_types))
814 | C.AConstant (_,_,n,Some bo,ty,params) ->
815 (gen_id seed, params, None,
817 build_def_item seed (get_id bo) (C.Name n) bo
818 ~ids_to_inner_sorts ~ids_to_inner_types))
819 | C.AConstant (id,_,n,None,ty,params) ->
820 (gen_id seed, params, None,
822 build_decl_item seed id (C.Name n) ty
823 ~ids_to_inner_sorts))
824 | C.AVariable (_,n,Some bo,ty,params) ->
825 (gen_id seed, params, None,
827 build_def_item seed (get_id bo) (C.Name n) bo
828 ~ids_to_inner_sorts ~ids_to_inner_types))
829 | C.AVariable (id,n,None,ty,params) ->
830 (gen_id seed, params, None,
832 build_decl_item seed id (C.Name n) ty
833 ~ids_to_inner_sorts))
834 | C.AInductiveDefinition (id,l,params,nparams) ->
835 (gen_id seed, params, None,
837 { K.joint_id = gen_id seed;
838 K.joint_kind = `Inductive nparams;
839 K.joint_defs = List.map (build_inductive seed) l
843 build_inductive seed =
844 let module K = Content in
847 { K.inductive_id = gen_id seed;
848 K.inductive_kind = b;
849 K.inductive_type = ty;
850 K.inductive_constructors = build_constructors seed l
854 build_constructors seed l =
855 let module K = Content in
858 { K.dec_name = Some n;
859 K.dec_id = gen_id seed;
860 K.dec_inductive = false;
867 and 'term cinductiveType =
868 id * string * bool * 'term * (* typename, inductive, arity *)
869 'term cconstructor list (* constructors *)
871 and 'term cconstructor =