(* Copyright (C) 2000, HELM Team. * * This file is part of HELM, an Hypertextual, Electronic * Library of Mathematics, developed at the Computer Science * Department, University of Bologna, Italy. * * HELM is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * HELM is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HELM; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, * MA 02111-1307, USA. * * For details, see the HELM World-Wide-Web page, * http://cs.unibo.it/helm/. *) (* converts annotated terms into cic terms (forgetting ids and names) *) let rec deannotate_term = let module C = Cic in function C.ARel (_,_,n,_) -> C.Rel n | C.AVar (_,uri,exp_named_subst) -> let deann_exp_named_subst = List.map (function (uri,t) -> uri,deannotate_term t) exp_named_subst in C.Var (uri, deann_exp_named_subst) | C.AMeta (_,n, l) -> let l' = List.map (function None -> None | Some at -> Some (deannotate_term at) ) l in C.Meta (n, l') | C.ASort (_,s) -> C.Sort s | C.AImplicit (_, annotation) -> C.Implicit annotation | C.ACast (_,va,ty) -> C.Cast (deannotate_term va, deannotate_term ty) | C.AProd (_,name,so,ta) -> C.Prod (name, deannotate_term so, deannotate_term ta) | C.ALambda (_,name,so,ta) -> C.Lambda (name, deannotate_term so, deannotate_term ta) | C.ALetIn (_,name,so,ta) -> C.LetIn (name, deannotate_term so, deannotate_term ta) | C.AAppl (_,l) -> C.Appl (List.map deannotate_term l) | C.AConst (_,uri,exp_named_subst) -> let deann_exp_named_subst = List.map (function (uri,t) -> uri,deannotate_term t) exp_named_subst in C.Const (uri, deann_exp_named_subst) | C.AMutInd (_,uri,i,exp_named_subst) -> let deann_exp_named_subst = List.map (function (uri,t) -> uri,deannotate_term t) exp_named_subst in C.MutInd (uri,i,deann_exp_named_subst) | C.AMutConstruct (_,uri,i,j,exp_named_subst) -> let deann_exp_named_subst = List.map (function (uri,t) -> uri,deannotate_term t) exp_named_subst in C.MutConstruct (uri,i,j,deann_exp_named_subst) | C.AMutCase (_,uri,i,outtype,te,pl) -> C.MutCase (uri,i,deannotate_term outtype, deannotate_term te, List.map deannotate_term pl) | C.AFix (_,funno,ifl) -> C.Fix (funno, List.map deannotate_inductiveFun ifl) | C.ACoFix (_,funno,ifl) -> C.CoFix (funno, List.map deannotate_coinductiveFun ifl) and deannotate_inductiveFun (_,name,index,ty,bo) = (name, index, deannotate_term ty, deannotate_term bo) and deannotate_coinductiveFun (_,name,ty,bo) = (name, deannotate_term ty, deannotate_term bo) ;; let deannotate_inductiveType (_, name, isinductive, arity, cons) = (name, isinductive, deannotate_term arity, List.map (fun (id,ty) -> (id,deannotate_term ty)) cons) ;; let deannotate_obj = let module C = Cic in function C.AConstant (_, _, id, bo, ty, params, attrs) -> C.Constant (id, (match bo with None -> None | Some bo -> Some (deannotate_term bo)), deannotate_term ty, params, attrs) | C.AVariable (_, name, bo, ty, params, attrs) -> C.Variable (name, (match bo with None -> None | Some bo -> Some (deannotate_term bo)), deannotate_term ty, params, attrs) | C.ACurrentProof (_, _, name, conjs, bo, ty, params, attrs) -> C.CurrentProof ( name, List.map (function (_,id,acontext,con) -> let context = List.map (function _,Some (n,(C.ADef at)) -> Some (n,(C.Def ((deannotate_term at),None))) | _,Some (n,(C.ADecl at)) -> Some (n,(C.Decl (deannotate_term at))) | _,None -> None ) acontext in (id,context,deannotate_term con) ) conjs, deannotate_term bo,deannotate_term ty, params, attrs ) | C.AInductiveDefinition (_, tys, params, parno, attrs) -> C.InductiveDefinition (List.map deannotate_inductiveType tys, params, parno, attrs) ;;