1 (* Copyright (C) 2004-2005, 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://helm.cs.unibo.it/
30 let is_a_variant obj =
32 | Cic.Constant(_,_,_,_,attrs) ->
33 List.exists (fun x -> x = `Flavour `Variant) attrs
36 let uris_for_inductive_type uri obj =
38 | Cic.InductiveDefinition(types,_,_,_) ->
39 let suri = UriManager.string_of_uri uri in
42 (fun (acc,i) (_,_,_,constructors)->
43 let is = string_of_int i in
47 let js = string_of_int j in
48 UriManager.uri_of_string
49 (suri^"#xpointer(1/"^is^"/"^js^")")::acc,j+1)
58 let is_equational_fact ty =
60 match CicReduction.whd ctx t with
61 | Cic.Prod (name,src,tgt) ->
63 CicTypeChecker.type_of_aux' [] ctx src CicUniv.oblivion_ugraph
65 if fst (CicReduction.are_convertible ctx s (Cic.Sort Cic.Prop) u) then
68 aux (Some (name,Cic.Decl src)::ctx) tgt
69 | Cic.Appl [ Cic.MutInd (u,_,_) ; _; _; _] -> LibraryObjects.is_eq_URI u
75 let add_obj ~pack_coercion_obj uri obj status =
76 let lemmas = LibrarySync.add_obj ~pack_coercion_obj uri obj in
77 let add_to_universe (automation_cache,status) uri =
78 let term = CicUtil.term_of_uri uri in
79 let ty,_ = CicTypeChecker.type_of_aux' [] [] term CicUniv.oblivion_ugraph in
80 let tkeys = Universe.keys [] ty in
81 let universe = automation_cache.AutomationCache.univ in
82 let universe, index_cmd =
84 (fun (universe,acc) key ->
85 let cands = Universe.get_candidates universe key in
90 CicTypeChecker.type_of_aux' [] [] t CicUniv.oblivion_ugraph
97 not (fst(CicReduction.are_convertible [] ty cty
98 CicUniv.oblivion_ugraph))) tys
100 Universe.index universe key term,
101 GrafiteAst.Index(HExtlib.dummy_floc,(Some key),uri)::acc
106 let is_equational = is_equational_fact ty in
108 if is_equational then
109 [ GrafiteAst.Select(HExtlib.dummy_floc,uri) ]
113 let automation_cache =
114 if is_equational then
115 AutomationCache.add_term_to_active automation_cache [] [] [] term None
119 let automation_cache =
120 { automation_cache with AutomationCache.univ = universe } in
121 let status = GrafiteTypes.add_moo_content index_cmd status in
122 let status = GrafiteTypes.add_moo_content select_cmd status in
123 (automation_cache,status)
126 if is_a_variant obj then []
127 else (uris_for_inductive_type uri obj) @ lemmas
129 let automation_cache,status =
130 List.fold_left add_to_universe
131 (status#automation_cache,status)
135 #set_objects (uri :: lemmas @ status#objects))
136 #set_automation_cache automation_cache,
139 let add_coercion ~pack_coercion_obj ~add_composites status uri arity
143 LibrarySync.add_coercion ~add_composites ~pack_coercion_obj
144 uri arity saturations baseuri in
147 #set_coercions (CoercDb.dump ())) ;
148 #set_objects (lemmas @ status#objects)
150 let status = NCicCoercion.index_old_db (CoercDb.dump ()) status in
153 let prefer_coercion status u =
155 status#set_coercions (CoercDb.dump ())
157 (** @return l2 \ l1 *)
158 let uri_list_diff l2 l1 =
159 let module S = UriManager.UriSet in
160 let s1 = List.fold_left (fun set uri -> S.add uri set) S.empty l1 in
161 let s2 = List.fold_left (fun set uri -> S.add uri set) S.empty l2 in
162 let diff = S.diff s2 s1 in
163 S.fold (fun uri uris -> uri :: uris) diff []
165 let initial_status lexicon_status baseuri =
166 (new GrafiteTypes.status baseuri)#set_lstatus lexicon_status#lstatus
169 let time_travel ~present ?(past=initial_status present present#baseuri) () =
171 uri_list_diff present#objects past#objects in
172 List.iter LibrarySync.remove_obj objs_to_remove;
173 CoercDb.restore past#coercions;
174 NCicLibrary.time_travel past
177 let init lexicon_status =
178 CoercDb.restore CoercDb.empty_coerc_db;
179 LibraryObjects.reset_defaults ();
180 initial_status lexicon_status
184 LibraryObjects.pop ()
189 LibraryObjects.push ()