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 (* Claudio Sacerdoti Coen <sacerdot@cs.unibo.it> *)
33 (* Missing description *)
35 (******************************************************************************)
44 let soften_classification =
46 Backbone _ -> InConclusion
47 | Branch _ -> InHypothesis
54 "http://www.cs.unibo.it/helm/schemas/schema-helm#MainConclusion", Some n
56 "http://www.cs.unibo.it/helm/schemas/schema-helm#MainHypothesis", Some n
58 "http://www.cs.unibo.it/helm/schemas/schema-helm#InConclusion", None
60 "http://www.cs.unibo.it/helm/schemas/schema-helm#InHypothesis", None
63 let (@@) (l1,l2,l3) (l1',l2',l3') =
65 List.fold_left (fun i t -> if List.mem t l2 then i else t::i) l2 l1
67 merge l1 l1', merge l2 l2', merge l3 l3'
70 let get_constraints term =
71 let module U = UriManager in
73 let rec process_type_aux kind =
75 C.Var (uri,expl_named_subst) ->
76 let kind',depth = !!kind in
77 ([UriManager.string_of_uri uri,kind',depth],[],[]) @@
78 (process_type_aux_expl_named_subst kind expl_named_subst)
80 let kind',depth = !!kind in
83 | Some d -> [],[kind',Some d],[])
94 let kind',depth = !!kind in
97 | Some d -> [],[],[kind',Some d,s'])
100 | C.Implicit -> assert false
103 process_type_aux kind te
104 | C.Prod (_,sou,ta) ->
105 let (source_kind,target_kind) =
107 Backbone n -> (Branch 0, Backbone (n+1))
108 | Branch n -> (InHypothesis, Branch (n+1))
111 process_type_aux source_kind sou @@
112 process_type_aux target_kind ta
113 | C.Lambda (_,sou,ta) ->
114 let kind' = soften_classification kind in
115 process_type_aux kind' sou @@
116 process_type_aux kind' ta
117 | C.LetIn (_,te,ta)->
118 let kind' = soften_classification kind in
119 process_type_aux kind' te @@
120 process_type_aux kind ta
122 let kind' = soften_classification kind in
123 process_type_aux kind he @@
124 List.fold_left (fun i t -> i @@ process_type_aux kind' t) ([],[],[]) tl
125 | C.Appl _ -> assert false
127 let kind',depth = !!kind in
128 [UriManager.string_of_uri uri,kind',depth],[],[]
129 | C.MutInd (uri,typeno,expl_named_subst) ->
130 let kind',depth = !!kind in
131 ([U.string_of_uri uri ^ "#xpointer(1/" ^ string_of_int (typeno + 1) ^
132 ")", kind', depth],[],[]) @@
133 (process_type_aux_expl_named_subst kind expl_named_subst)
134 | C.MutConstruct (uri,typeno,consno,expl_named_subst) ->
135 let kind',depth = !!kind in
136 ([U.string_of_uri uri ^ "#xpointer(1/" ^ string_of_int (typeno + 1) ^
137 "/" ^ string_of_int consno ^ ")",kind',depth],[],[]) @@
138 (process_type_aux_expl_named_subst kind expl_named_subst)
139 | C.MutCase (_,_,_,term,patterns) ->
140 (* outtype ignored *)
141 let kind' = soften_classification kind in
142 process_type_aux kind' term @@
143 List.fold_left (fun i t -> i @@ process_type_aux kind' t)
146 let kind' = soften_classification kind in
148 (fun i (_,_,bo,ty) ->
150 process_type_aux kind' bo @@
151 process_type_aux kind' ty
153 | C.CoFix (_,funs) ->
154 let kind' = soften_classification kind in
158 process_type_aux kind' bo @@
159 process_type_aux kind' ty
161 and process_type_aux_expl_named_subst kind =
163 (fun i (_,t) -> i @@ (process_type_aux (soften_classification kind) t))
166 let obj_constraints,rel_constraints,sort_constraints =
167 process_type_aux (Backbone 0) (CicMiniReduction.letin_nf term)
169 (obj_constraints,rel_constraints,sort_constraints)
172 (*CSC: Debugging only *)
173 let get_constraints term =
174 let res = get_constraints term in
175 let (objs,rels,sorts) = res in
176 prerr_endline "Constraints on objs:" ;
178 (function (s1,s2,n) ->
180 (s1 ^ " " ^ s2 ^ " " ^
181 match n with None -> "NULL" | Some n -> string_of_int n)
183 prerr_endline "Constraints on Rels:" ;
187 (s ^ " " ^ (match n with Some n' -> string_of_int n' | None -> "NULL"))
189 prerr_endline "Constraints on Sorts:" ;
191 (function (s1,n,s2) ->
193 (s1 ^ " " ^ (match n with Some n' -> string_of_int n' | None -> "NULL") ^