[p_name,Some p_ty] @
List.map (function name -> name, None) k_names @
List.map (function name -> name, None) args in
- let recno = List.length final_params in
let cty = mk_appl (p_name :: args) in
let ty = Some cty in
let branches =
) cl
in
let bo = CicNotationPt.Case (rec_arg,None,None,branches) in
- let where = List.length final_params - 1 in
+ let recno = List.length final_params in
+ let where = recno - 1 in
let res =
CicNotationPt.LetRec (`Inductive,
[final_params, (rec_name,ty), bo, where], rec_name)
in
+(*
prerr_endline
(BoxPp.render_to_string
~map_unicode_to_tex:false
(BoxPp.render_to_string ~map_unicode_to_tex:false
(function x::_ -> x | _ -> assert false) 80
(CicNotationPres.mpres_of_box boxml)));
+*)
CicNotationPt.Theorem (`Definition,srec_name,CicNotationPt.Implicit,Some res)
;;