fst (List.nth (constructors_of_inductive_type uri i) (j-1))
with Not_found -> assert false)
+
let ast_of_acic0 term_info acic k =
let k = k term_info in
let id_to_uris = term_info.uri in
| Cic.ALetIn (id,n,s,t) ->
idref id (Ast.LetIn ((CicNotationUtil.name_of_cic_name n, None),
k s, k t))
- | Cic.AAppl (aid,args) -> idref aid (Ast.Appl (List.map k args))
+ | Cic.AAppl (aid,(Cic.AConst _ as he::tl as args))
+ | Cic.AAppl (aid,(Cic.AMutInd _ as he::tl as args))
+ | Cic.AAppl (aid,(Cic.AMutConstruct _ as he::tl as args)) ->
+ let last_n n l =
+ let rec aux =
+ function
+ [] -> assert false
+ | [_] as l -> l,1
+ | he::tl ->
+ let (res,len) as res' = aux tl in
+ if len < n then
+ he::res,len + 1
+ else
+ res'
+ in
+ match fst (aux l) with
+ [] -> assert false
+ | [t] -> t
+ | Ast.AttributedTerm (_,(Ast.Appl l))::tl ->
+ idref aid (Ast.Appl (l@tl))
+ | l -> idref aid (Ast.Appl l)
+ in
+ let deannot_he = Deannotate.deannotate_term he in
+ if CoercGraph.is_a_coercion deannot_he && !Acic2content.hide_coercions
+ then
+ match CoercGraph.is_a_coercion_to_funclass deannot_he with
+ | None -> idref aid (last_n 1 (List.map k tl))
+ | Some i -> idref aid (last_n (i+1) (List.map k tl))
+ else
+ idref aid (Ast.Appl (List.map k args))
+ | Cic.AAppl (aid,args) ->
+ idref aid (Ast.Appl (List.map k args))
| Cic.AConst (id,uri,substs) ->
register_uri id uri;
idref id (Ast.Ident (UriManager.name_of_uri uri, aux_substs substs))