1 (* Copyright (C) 2002, 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 module Codomain = struct
28 let compare = Pervasives.compare
30 module S = Set.Make(Codomain)
31 module TI = Discrimination_tree.DiscriminationTreeIndexing(S)
37 let get_candidates univ ty =
38 S.elements (TI.retrieve_unifiables univ ty)
41 let rec unfold context = function
42 | Cic.Prod(name,s,t) ->
43 let t' = unfold ((Some (name,Cic.Decl s))::context) t in
45 | t -> ProofEngineReduction.unfold context t
47 let rec collapse_head_metas = function
49 let a' = collapse_head_metas a in
51 | Cic.Meta(n,m) -> Cic.Meta(n,m)
53 let l' = List.map collapse_head_metas l in
58 let rec dummies_of_coercions =
60 | Cic.Appl (c::l) when CoercGraph.is_a_coercion c ->
63 let l' = List.map dummies_of_coercions l in Cic.Appl l'
64 | Cic.Lambda(n,s,t) ->
65 let s' = dummies_of_coercions s in
66 let t' = dummies_of_coercions t in
69 let s' = dummies_of_coercions s in
70 let t' = dummies_of_coercions t in
73 let s' = dummies_of_coercions s in
74 let t' = dummies_of_coercions t in
76 | Cic.MutCase _ -> prerr_endline "mutcase";Cic.Meta (-1,[])
80 let rec head remove_coercions t =
82 if remove_coercions then dummies_of_coercions t
84 let rec aux = function
86 CicSubstitution.subst (Cic.Meta (-1,[])) (aux t)
88 in collapse_head_metas (clean_up (aux t))
92 let index univ key term =
93 (* flexible terms are not indexed *)
94 if key = Cic.Meta(-1,[]) then univ
96 (prerr_endline("ADD: "^CicPp.ppterm key^" |-> "^CicPp.ppterm term);
97 TI.index univ key term)
100 let keys context ty =
102 [head true ty; head true (unfold context ty)]
103 with ProofEngineTypes.Fail _ -> [head true ty]
105 let index_term_and_unfolded_term univ context t ty =
106 let key = head true ty in
107 let univ = index univ key t in
109 let key = head true (unfold context ty) in
111 with ProofEngineTypes.Fail _ -> univ
114 let index_local_term univ context t ty =
115 let key = head true ty in
116 let univ = index univ key t in
117 let key1 = head false ty in
119 if key<>key1 then index univ key1 t else univ in
121 let key = head true (unfold context ty) in
123 with ProofEngineTypes.Fail _ -> univ
127 let index_list univ context terms_and_types =
129 (fun acc (term,ty) ->
130 index_term_and_unfolded_term acc context term ty)
135 let remove univ context term ty =
136 let key = head true ty in
137 let univ = TI.remove_index univ key term in
139 let key = head true (unfold context ty) in
140 TI.remove_index univ key term
141 with ProofEngineTypes.Fail _ -> univ
143 let remove_uri univ uri =
144 let term = CicUtil.term_of_uri uri in
145 let ty,_ = CicTypeChecker.type_of_aux' [] [] term CicUniv.empty_ugraph in
146 remove univ [] term ty