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 (***************************************************************************)
38 split (n-1) (List.tl l) in
43 let is_big_general countterm p =
44 let maxsize = Cexpr2pres.maxsize in
45 let module Con = Content in
46 let rec countp current_size p =
47 if current_size > maxsize then current_size
49 let c1 = (countcontext current_size p.Con.proof_context) in
50 if c1 > maxsize then c1
52 let c2 = (countapplycontext c1 p.Con.proof_apply_context) in
53 if c2 > maxsize then c2
55 countconclude c2 p.Con.proof_conclude
58 countcontext current_size c =
59 List.fold_left countcontextitem current_size c
61 countcontextitem current_size e =
62 if current_size > maxsize then maxsize
66 (match d.Con.dec_name with
67 Some s -> current_size + 4 + (String.length s)
68 | None -> prerr_endline "NO NAME!!"; assert false)
70 (match h.Con.dec_name with
71 Some s -> current_size + 4 + (String.length s)
72 | None -> prerr_endline "NO NAME!!"; assert false)
73 | `Proof p -> countp current_size p
75 (match d.Con.def_name with
77 let c1 = (current_size + 4 + (String.length s)) in
78 (countterm c1 d.Con.def_term)
80 prerr_endline "NO NAME!!"; assert false)
81 | `Joint ho -> maxsize + 1) (* we assume is big *)
83 countapplycontext current_size ac =
84 List.fold_left countp current_size ac
86 countconclude current_size co =
87 if current_size > maxsize then current_size
89 let c1 = countargs current_size co.Con.conclude_args in
90 if c1 > maxsize then c1
92 (match co.Con.conclude_conclusion with
93 Some concl -> countterm c1 concl
96 countargs current_size args =
97 List.fold_left countarg current_size args
99 countarg current_size arg =
100 if current_size > maxsize then current_size
103 Con.Aux _ -> current_size
104 | Con.Premise prem ->
105 (match prem.Con.premise_binder with
106 Some s -> current_size + (String.length s)
107 | None -> current_size + 7)
109 current_size + (String.length lemma.Con.lemma_name)
110 | Con.Term t -> countterm current_size t
111 | Con.ArgProof p -> countp current_size p
112 | Con.ArgMethod s -> (maxsize + 1)) in
113 let size = (countp 0 p) in
117 let is_big = is_big_general (Cexpr2pres.countterm)
121 let module Con = Content in
124 | `Hypothesis d -> d.Con.dec_id
125 | `Proof p -> p.Con.proof_id
126 | `Definition d -> d.Con.def_id
127 | `Joint jo -> jo.Con.joint_id
130 let make_row ?(attrs=[]) items concl =
131 let module P = Mpresentation in
133 P.Mtable _ -> (* big! *)
134 P.Mtable (attrs@[None,"align","baseline 1"; None,"equalrows","false";
135 None,"columnalign","left"],
136 [P.Mtr([],[P.Mtd ([],P.Mrow([],items))]);
137 P.Mtr ([],[P.Mtd ([],P.indented concl)])])
139 P.Mrow(attrs,items@[P.Mspace([None,"width","0.1cm"]);concl]))
142 let make_concl ?(attrs=[]) verb concl =
143 let module P = Mpresentation in
145 P.Mtable _ -> (* big! *)
146 P.Mtable (attrs@[None,"align","baseline 1"; None,"equalrows","false";
147 None,"columnalign","left"],
148 [P.Mtr([],[P.Mtd ([],P.Mtext([None,"mathcolor","Red"],verb))]);
149 P.Mtr ([],[P.Mtd ([],P.indented concl)])])
152 [P.Mtext([None,"mathcolor","Red"],verb);
153 P.Mspace([None,"width","0.1cm"]);
157 let make_args_for_apply term2pres args =
158 let module Con = Content in
159 let module P = Mpresentation in
160 let make_arg_for_apply is_first arg row =
163 Con.Aux n -> assert false
164 | Con.Premise prem ->
166 (match prem.Con.premise_binder with
171 P.Mi([],lemma.Con.lemma_name)::row
175 else P.Mi([],"_")::row
180 if is_first then res else P.smallskip::res
184 make_arg_for_apply true hd
185 (List.fold_right (make_arg_for_apply false) tl [])
189 let rec justification term2pres p =
190 let module Con = Content in
191 let module P = Mpresentation in
192 if ((p.Con.proof_conclude.Con.conclude_method = "Exact") or
193 ((p.Con.proof_context = []) &
194 (p.Con.proof_apply_context = []) &
195 (p.Con.proof_conclude.Con.conclude_method = "Apply"))) then
197 make_args_for_apply term2pres p.Con.proof_conclude.Con.conclude_args in
199 P.Mtext([None,"mathcolor","Red"],"by")::P.Mspace([None,"width","0.1cm"])::
200 P.Mo([],"(")::pres_args@[P.Mo([],")")])
201 else proof2pres term2pres p
203 and proof2pres term2pres p =
204 let rec proof2pres p =
205 let module Con = Content in
206 let module P = Mpresentation in
211 | `Hypothesis _ -> true
213 ((List.filter is_decl p.Con.proof_context) != []) in
214 let omit_conclusion = (not indent) && (p.Con.proof_context != []) in
216 (match p.Con.proof_conclude.Con.conclude_conclusion with
218 | Some t -> Some (term2pres t)) in
221 conclude2pres p.Con.proof_conclude indent omit_conclusion in
223 acontext2pres p.Con.proof_apply_context presconclude indent in
224 context2pres p.Con.proof_context presacontext in
225 match p.Con.proof_name with
233 ([None,"actiontype","toggle" ; None,"selection","1"],
234 [P.Mtext [] "proof" ; body])
238 ([None,"actiontype","toggle" ; None,"selection","1"],
239 [(make_concl "proof of" ac); body])
241 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
242 None,"columnalign","left"],
243 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
244 P.Mtr ([],[P.Mtd ([], P.indented action)])])
246 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
247 None,"columnalign","left";Some "helm", "xref", p.Con.proof_id],
248 [P.Mtr ([],[P.Mtd ([],P.Mfenced([],[P.Mtext ([],name)]))]);
249 P.Mtr ([],[P.Mtd ([], P.indented action)])]) *)
251 and context2pres c continuation =
252 (* we generate a subtable for each context element, for selection
254 The table generated by the head-element does not have an xref;
255 the whole context-proof is already selectable *)
256 let module P = Mpresentation in
262 (fun ce continuation ->
263 let xref = get_xref ce in
264 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
265 None,"columnalign","left"; Some "helm", "xref", xref ],
266 [P.Mtr([Some "helm", "xref", "ce_"^xref],[P.Mtd ([],ce2pres ce)]);
267 P.Mtr([],[P.Mtd ([], continuation)])])) tl continuation in
268 let hd_xref= get_xref hd in
269 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
270 None,"columnalign","left"],
271 [P.Mtr([Some "helm", "xref", "ce_"^hd_xref],
272 [P.Mtd ([],ce2pres hd)]);
273 P.Mtr([],[P.Mtd ([], continuation')])])
276 let module P = Mpresentation in
277 let module Con = Content in
280 (match d.Con.dec_name with
282 let ty = term2pres d.Con.dec_type in
284 [P.Mtext([None,"mathcolor","Red"],"Assume");
285 P.Mspace([None,"width","0.1cm"]);
290 prerr_endline "NO NAME!!"; assert false)
292 (match h.Con.dec_name with
294 let ty = term2pres h.Con.dec_type in
296 [P.Mtext([None,"mathcolor","Red"],"Suppose");
297 P.Mspace([None,"width","0.1cm"]);
301 P.Mspace([None,"width","0.1cm"]);
304 prerr_endline "NO NAME!!"; assert false)
306 (match p.Con.proof_name with
307 Some "w" -> prerr_endline ("processing w");
311 (match d.Con.def_name with
313 let term = term2pres d.Con.def_term in
320 prerr_endline "NO NAME!!"; assert false)
322 P.Mtext ([],"jointdef")
324 and acontext2pres ac continuation indent =
325 let module Con = Content in
326 let module P = Mpresentation in
328 (fun p continuation ->
331 P.indented (proof2pres p)
334 P.Mtable([None,"align","baseline 1"; None,"equalrows","false";
335 None,"columnalign","left"; Some "helm","xref",p.Con.proof_id],
336 [P.Mtr([Some "helm","xref","ace_"^p.Con.proof_id],[P.Mtd ([],hd)]);
337 P.Mtr([],[P.Mtd ([], continuation)])])) ac continuation
339 and conclude2pres conclude indent omit_conclusion =
340 let module Con = Content in
341 let module P = Mpresentation in
343 match conclude.Con.conclude_conclusion with
344 Some t when not omit_conclusion ->
345 let concl = (term2pres t) in
346 if conclude.Con.conclude_method = "BU_Conversion" then
347 make_concl "that is equivalent to" concl
348 else if conclude.Con.conclude_method = "FalseInd" then
349 (* false ind is in charge to add the conclusion *)
352 let conclude_body = conclude_aux conclude in
354 if conclude.Con.conclude_method = "TD_Conversion" then
355 make_concl "that is equivalent to" concl
356 else make_concl "we conclude" concl in
357 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
358 None,"columnalign","left"],
359 [P.Mtr ([],[P.Mtd ([],conclude_body)]);
360 P.Mtr ([],[P.Mtd ([],ann_concl)])])
361 | _ -> conclude_aux conclude in
363 P.indented (P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],
366 P.Mrow ([Some "helm", "xref", conclude.Con.conclude_id],[tconclude_body])
369 and conclude_aux conclude =
370 let module Con = Content in
371 let module P = Mpresentation in
372 if conclude.Con.conclude_method = "TD_Conversion" then
374 (match conclude.Con.conclude_conclusion with
375 None -> P.Mtext([],"NO EXPECTED!!!")
376 | Some c -> term2pres c) in
378 (match conclude.Con.conclude_args with
379 [Con.ArgProof p] -> p
380 | _ -> assert false) in
382 (match subproof.Con.proof_conclude.Con.conclude_conclusion with
383 None -> P.Mtext([],"NO SYNTH!!!")
384 | Some c -> (term2pres c)) in
386 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
387 [P.Mtr([],[P.Mtd([],make_concl "we must prove" expected)]);
388 P.Mtr([],[P.Mtd([],make_concl "or equivalently" synth)]);
389 P.Mtr([],[P.Mtd([],proof2pres subproof)])])
390 else if conclude.Con.conclude_method = "BU_Conversion" then
392 else if conclude.Con.conclude_method = "Exact" then
394 (match conclude.Con.conclude_args with
395 [Con.Term t] -> term2pres t
396 | _ -> assert false) in
397 (match conclude.Con.conclude_conclusion with
400 [P.Mtext [None, "mathcolor", "red"] "Consider" ; P.smallskip; arg]
401 | Some c -> let conclusion = term2pres c in
403 [arg; P.Mspace([None,"width","0.1cm"]);P.Mtext([],"proves")]
406 else if conclude.Con.conclude_method = "Intros+LetTac" then
407 (match conclude.Con.conclude_args with
408 [Con.ArgProof p] -> proof2pres p
412 (match conclude.Con.conclude_conclusion with
413 None -> P.Mtext([],"NO Conclusion!!!")
414 | Some c -> term2pres c) in
415 (match conclude.Con.conclude_args with
418 ([None,"align","baseline 1"; None,"equalrows","false";
419 None,"columnalign","left"],
420 [P.Mtr([],[P.Mtd([],proof2pres p)]);
422 (make_concl "we proved 1" conclusion))])]);
425 else if (conclude.Con.conclude_method = "ByInduction") then
427 else if (conclude.Con.conclude_method = "Exists") then
429 else if (conclude.Con.conclude_method = "AndInd") then
431 else if (conclude.Con.conclude_method = "FalseInd") then
433 else if (conclude.Con.conclude_method = "Rewrite") then
435 (match (List.nth conclude.Con.conclude_args 6) with
436 Con.ArgProof p -> justification term2pres p
437 | _ -> assert false) in
439 (match List.nth conclude.Con.conclude_args 2 with
440 Con.Term t -> term2pres t
441 | _ -> assert false) in
443 (match List.nth conclude.Con.conclude_args 5 with
444 Con.Term t -> term2pres t
445 | _ -> assert false) in
446 P.Mtable ([None,"align","baseline 1";None,"equalrows","false";
447 None,"columnalign","left"],
448 [P.Mtr ([],[P.Mtd ([],P.Mrow([],[
449 P.Mtext([None,"mathcolor","Red"],"rewrite");
450 P.Mspace([None,"width","0.1cm"]);term1;
451 P.Mspace([None,"width","0.1cm"]);
452 P.Mtext([None,"mathcolor","Red"],"with");
453 P.Mspace([None,"width","0.1cm"]);term2]))]);
454 P.Mtr ([],[P.Mtd ([],P.indented justif)])]);
455 else if conclude.Con.conclude_method = "Apply" then
457 make_args_for_apply term2pres conclude.Con.conclude_args in
459 P.Mtext([None,"mathcolor","Red"],"by")::
460 P.Mspace([None,"width","0.1cm"])::
461 P.Mo([],"(")::pres_args@[P.Mo([],")")])
464 ([None,"align","baseline 1"; None,"equalrows","false"; None,"columnalign","left"],
465 [P.Mtr ([],[P.Mtd ([],P.Mtext([],"Apply method" ^ conclude.Con.conclude_method ^ " to"))]);
470 ([None,"align","baseline 1"; None,"equalrows","false";
471 None,"columnalign","left"],
472 args2pres conclude.Con.conclude_args))))])])
475 let module P = Mpresentation in
477 (function a -> P.Mtr ([], [P.Mtd ([], arg2pres a)])) l
480 let module P = Mpresentation in
481 let module Con = Content in
484 P.Mtext ([],"aux " ^ n)
485 | Con.Premise prem ->
486 P.Mtext ([],"premise")
494 P.Mtext ([],"method")
496 and byinduction conclude =
497 let module P = Mpresentation in
498 let module Con = Content in
499 let proof_conclusion =
500 (match conclude.Con.conclude_conclusion with
501 None -> P.Mtext([],"No conclusion???")
502 | Some t -> term2pres t) in
503 let inductive_arg,args_for_cases =
504 (match conclude.Con.conclude_args with
506 let l1,l2 = split (int_of_string n) tl in
507 let last_pos = (List.length l2)-1 in
508 List.nth l2 last_pos,l1
509 | _ -> assert false) in
512 (match inductive_arg with
514 P.Mtext ([],"an aux???")
515 | Con.Premise prem ->
516 (match prem.Con.premise_binder with
517 None -> P.Mtext ([],"the previous result")
518 | Some n -> P.Mi([],n))
519 | Con.Lemma lemma -> P.Mi([],lemma.Con.lemma_name)
523 P.Mtext ([],"a proof???")
525 P.Mtext ([],"a method???")) in
526 (make_concl "we proceede by induction on" arg) in
528 (make_concl "to prove" proof_conclusion) in
530 ([None,"align","baseline 1"; None,"equalrows","false";
531 None,"columnalign","left"],
532 P.Mtr ([],[P.Mtd ([],induction_on)])::
533 P.Mtr ([],[P.Mtd ([],to_prove)])::
534 (make_cases args_for_cases))
536 and make_cases args_for_cases =
537 let module P = Mpresentation in
539 (fun p -> P.Mtr ([],[P.Mtd ([],make_case p)])) args_for_cases
542 let module P = Mpresentation in
543 let module Con = Content in
547 (match p.Con.proof_name with
548 None -> P.Mtext([],"no name for case!!")
549 | Some n -> P.Mi([],n)) in
553 `Hypothesis h -> h.Con.dec_inductive
554 | _ -> false) p.Con.proof_context in
563 (match h.Con.dec_name with
566 [P.Mspace([None,"width","0.1cm"]);
569 (term2pres h.Con.dec_type)]
570 | _ -> [P.Mtext ([],"???")]) in
573 P.Mtr ([],[P.Mtd ([],P.Mrow([],
574 P.Mtext([],"Case")::P.Mspace([None,"width","0.1cm"])::name::pattern_aux@
575 [P.Mspace([None,"width","0.1cm"]);
576 P.Mtext([],"->")]))]) in
578 (match p.Con.proof_conclude.Con.conclude_conclusion with
579 None -> P.Mtext([],"No conclusion!!!")
580 | Some t -> term2pres t) in
583 P.indented (make_concl "the thesis becomes" subconcl))]) in
584 let induction_hypothesis =
589 P.Mtr([],[P.Mtd([], P.indented
590 (P.Mtext([],"by induction hypothesis we know:")))]) in
595 (match h.Con.dec_name with
598 P.indented (P.Mrow ([],
602 P.Mspace([None,"width","0.1cm"]);
603 term2pres h.Con.dec_type]))
604 | _ -> assert false in
607 (function ce -> P.Mtr ([], [P.Mtd ([], make_hyp ce)]))
611 acontext2pres_old p.Con.proof_apply_context true in *)
612 let body = conclude2pres p.Con.proof_conclude true false in
614 P.Maction([None,"actiontype","toggle" ; None,"selection","1"],
615 [P.indented (P.Mtext([None,"mathcolor","Red"],"Proof"));
616 acontext2pres p.Con.proof_apply_context body true]) in
617 P.Mtable ([None,"align","baseline 1"; None,"equalrows","false";
618 None,"columnalign","left"],
619 pattern::asubconcl::induction_hypothesis@
620 [P.Mtr([],[P.Mtd([],presacontext)])])
623 and falseind conclude =
624 let module P = Mpresentation in
625 let module Con = Content in
626 let proof_conclusion =
627 (match conclude.Con.conclude_conclusion with
628 None -> P.Mtext([],"No conclusion???")
629 | Some t -> term2pres t) in
631 (match conclude.Con.conclude_args with
632 [Con.Aux(n);_;case_arg] -> case_arg
635 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
639 Con.Aux n -> assert false
640 | Con.Premise prem ->
641 (match prem.Con.premise_binder with
642 None -> [P.Mtext([],"Contradiction, hence")]
644 [P.Mi([],n);P.smallskip;P.Mtext([],"is contradictory, hence")])
646 [P.Mi([],lemma.Con.lemma_name);P.smallskip;P.Mtext([],"is contradictory, hence")]
647 | _ -> assert false) in
648 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
649 make_row arg proof_conclusion
651 and andind conclude =
652 let module P = Mpresentation in
653 let module Con = Content in
654 let proof_conclusion =
655 (match conclude.Con.conclude_conclusion with
656 None -> P.Mtext([],"No conclusion???")
657 | Some t -> term2pres t) in
659 (match conclude.Con.conclude_args with
660 [Con.Aux(n);_;Con.ArgProof proof;case_arg] -> proof,case_arg
663 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
667 Con.Aux n -> assert false
668 | Con.Premise prem ->
669 (match prem.Con.premise_binder with
671 | Some n -> [P.Mtext([],"by");P.smallskip;P.Mi([],n)])
673 [P.Mtext([],"by");P.smallskip;P.Mi([],lemma.Con.lemma_name)]
674 | _ -> assert false) in
675 match proof.Con.proof_context with
676 `Hypothesis hyp1::`Hypothesis hyp2::tl ->
678 (match hyp.Con.dec_name with
684 P.Mi([],get_name hyp1);
687 term2pres hyp1.Con.dec_type]) in
691 P.Mi([],get_name hyp2);
694 term2pres hyp2.Con.dec_type]) in
695 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
696 let body = conclude2pres proof.Con.proof_conclude false true in
698 acontext2pres proof.Con.proof_apply_context body false in
700 ([None,"align","baseline 1"; None,"equalrows","false";
701 None,"columnalign","left"],
702 [P.Mtr ([],[P.Mtd ([],
703 P.Mrow([],arg@[P.smallskip;P.Mtext([],"we have")]))]);
704 P.Mtr ([],[P.Mtd ([],preshyp1)]);
705 P.Mtr ([],[P.Mtd ([],P.Mtext([],"and"))]);
706 P.Mtr ([],[P.Mtd ([],preshyp2)]);
707 P.Mtr ([],[P.Mtd ([],presacontext)])]);
710 and exists conclude =
711 let module P = Mpresentation in
712 let module Con = Content in
713 let proof_conclusion =
714 (match conclude.Con.conclude_conclusion with
715 None -> P.Mtext([],"No conclusion???")
716 | Some t -> term2pres t) in
718 (match conclude.Con.conclude_args with
719 [Con.Aux(n);_;Con.ArgProof proof;_] -> proof
722 List.map (ContentPp.parg 0) conclude.Con.conclude_args;
724 match proof.Con.proof_context with
725 `Declaration decl::`Hypothesis hyp::tl
726 | `Hypothesis decl::`Hypothesis hyp::tl ->
728 (match decl.Con.dec_name with
733 [P.Mtext([None,"mathcolor","Red"],"let");
735 P.Mi([],get_name decl);
736 P.Mtext([],":"); term2pres decl.Con.dec_type]) in
739 [P.Mtext([None,"mathcolor","Red"],"such that");
742 P.Mi([],get_name hyp);
745 term2pres hyp.Con.dec_type]) in
746 (* let body = proof2pres {proof with Con.proof_context = tl} in *)
747 let body = conclude2pres proof.Con.proof_conclude false true in
749 acontext2pres proof.Con.proof_apply_context body false in
751 ([None,"align","baseline 1"; None,"equalrows","false";
752 None,"columnalign","left"],
753 [P.Mtr ([],[P.Mtd ([],presdecl)]);
754 P.Mtr ([],[P.Mtd ([],suchthat)]);
755 P.Mtr ([],[P.Mtd ([],presacontext)])]);
756 | _ -> assert false in
763 let content2pres term2pres (id,params,metasenv,obj) =
764 let module K = Content in
765 let module P = Mpresentation in
767 `Def (K.Const,thesis,`Proof p) ->
769 [None,"align","baseline 1";
770 None,"equalrows","false";
771 None,"columnalign","left";
772 None,"helm:xref","id"]
777 ("UNFINISHED PROOF" ^ id ^"(" ^
778 String.concat " ; " (List.map UriManager.string_of_uri params)^
783 [P.Mtext [] "THESIS:"])] ;
789 term2pres thesis])]] @
795 (* Conjectures are in their own table to make *)
796 (* diffing the DOM trees easier. *)
798 [None,"align","baseline 1";
799 None,"equalrows","false";
800 None,"columnalign","left"]
804 [P.Mtext [] "CONJECTURES:"])])::
810 (P.Mrow [Some "helm", "xref", id]
818 | Some (`Declaration d)
819 | Some (`Hypothesis d) ->
821 { K.dec_name = dec_name ;
822 K.dec_type = ty } = d
831 | Some (`Definition d) ->
833 { K.def_name = def_name ;
834 K.def_term = bo } = d
844 let proof_name = p.K.proof_name in
847 (match proof_name with
851 proof2pres term2pres p]
854 [ P.Mi [] (string_of_int n) ;
865 [proof2pres term2pres p])]])
869 let content2pres ~ids_to_inner_sorts =
872 (Cexpr2pres.cexpr2pres_charcount
873 (Content_expressions.acic2cexpr ids_to_inner_sorts p)))