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 let expect_possible_parameters = ref false;;
28 exception NotExpectingPossibleParameters;;
30 let rec deannotate_term =
33 C.ARel (_,n,_) -> C.Rel n
34 | C.AVar (_,uri) -> C.Var uri
35 | C.AMeta (_,n) -> C.Meta n
36 | C.ASort (_,s) -> C.Sort s
37 | C.AImplicit _ -> C.Implicit
38 | C.ACast (_,va,ty) -> C.Cast (deannotate_term va, deannotate_term ty)
39 | C.AProd (_,name,so,ta) ->
40 C.Prod (name, deannotate_term so, deannotate_term ta)
41 | C.ALambda (_,name,so,ta) ->
42 C.Lambda (name, deannotate_term so, deannotate_term ta)
43 | C.ALetIn (_,name,so,ta) ->
44 C.LetIn (name, deannotate_term so, deannotate_term ta)
45 | C.AAppl (_,l) -> C.Appl (List.map deannotate_term l)
46 | C.AConst (_,uri, cookingsno) -> C.Const (uri, cookingsno)
47 | C.AAbst (_,uri) -> C.Abst uri
48 | C.AMutInd (_,uri,cookingsno,i) -> C.MutInd (uri,cookingsno,i)
49 | C.AMutConstruct (_,uri,cookingsno,i,j) ->
50 C.MutConstruct (uri,cookingsno,i,j)
51 | C.AMutCase (_,uri,cookingsno,i,outtype,te,pl) ->
52 C.MutCase (uri,cookingsno,i,deannotate_term outtype,
53 deannotate_term te, List.map deannotate_term pl)
54 | C.AFix (_,funno,ifl) ->
55 C.Fix (funno, List.map deannotate_inductiveFun ifl)
56 | C.ACoFix (_,funno,ifl) ->
57 C.CoFix (funno, List.map deannotate_coinductiveFun ifl)
59 and deannotate_inductiveFun (name,index,ty,bo) =
60 (name, index, deannotate_term ty, deannotate_term bo)
62 and deannotate_coinductiveFun (name,ty,bo) =
63 (name, deannotate_term ty, deannotate_term bo)
66 let deannotate_inductiveType (name, isinductive, arity, cons) =
67 (name, isinductive, deannotate_term arity,
68 List.map (fun (id,ty,recs) -> (id,deannotate_term ty, recs)) cons)
74 C.ADefinition (_, id, bo, ty, params) ->
77 if !expect_possible_parameters then
78 C.Definition (id, deannotate_term bo, deannotate_term ty, params)
80 raise NotExpectingPossibleParameters
82 C.Definition (id, deannotate_term bo, deannotate_term ty, params)
84 | C.AAxiom (_, id, ty, params) ->
85 C.Axiom (id, deannotate_term ty, params)
86 | C.AVariable (_, name, bo, ty) ->
88 (match bo with None -> None | Some bo -> Some (deannotate_term bo)),
90 | C.ACurrentProof (_, name, conjs, bo, ty) ->
92 name, List.map (fun (id,con) -> (id,deannotate_term con)) conjs,
93 deannotate_term bo, deannotate_term ty
95 | C.AInductiveDefinition (_, tys, params, parno) ->
96 C.InductiveDefinition ( List.map deannotate_inductiveType tys,