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)
57 let add_obj refinement_toolkit uri obj status =
58 let lemmas = LibrarySync.add_obj refinement_toolkit uri obj in
59 let add_to_universe (universe,status) uri =
60 let term = CicUtil.term_of_uri uri in
61 let ty,_ = CicTypeChecker.type_of_aux' [] [] term CicUniv.empty_ugraph in
63 let sort,_ = CicTypeChecker.type_of_aux' [] [] ty CicUniv.empty_ugraph in
64 prerr_endline (CicPp.ppterm term);
65 prerr_endline (CicPp.ppterm sort);
67 if sort = Cic.Sort(Cic.Prop) then Universe.keys [] ty
71 let tkeys = Universe.keys [] ty in
74 (fun key -> GrafiteAst.Index(HExtlib.dummy_floc,(Some key),uri))
79 if sort = Cic.Sort(Cic.Prop) then
80 Universe.index_term_and_unfolded_term universe [] term ty
83 let universe = Universe.index_term_and_unfolded_term universe [] term ty
85 let status = GrafiteTypes.add_moo_content index_cmd status in
89 if is_a_variant obj then []
90 else (uris_for_inductive_type uri obj)@lemmas
93 List.fold_left add_to_universe
94 (status.GrafiteTypes.universe,status)
98 GrafiteTypes.objects = uri::status.GrafiteTypes.objects;
99 GrafiteTypes.universe = universe},
102 let add_coercion refinement_toolkit ~add_composites status uri arity baseuri =
104 LibrarySync.add_coercion ~add_composites refinement_toolkit uri arity baseuri in
105 {status with GrafiteTypes.coercions = uri :: status.GrafiteTypes.coercions},
110 type t = UriManager.uri * string
111 let compare (u1, _) (u2, _) = UriManager.compare u1 u2
114 module UriSet = Set.Make (OrderedUri)
116 (** @return l2 \ l1 *)
117 let uri_list_diff l2 l1 =
118 let module S = UriManager.UriSet in
119 let s1 = List.fold_left (fun set uri -> S.add uri set) S.empty l1 in
120 let s2 = List.fold_left (fun set uri -> S.add uri set) S.empty l2 in
121 let diff = S.diff s2 s1 in
122 S.fold (fun uri uris -> uri :: uris) diff []
124 let time_travel ~present ~past =
126 uri_list_diff present.GrafiteTypes.objects past.GrafiteTypes.objects in
127 let coercions_to_remove =
128 uri_list_diff present.GrafiteTypes.coercions past.GrafiteTypes.coercions
130 List.iter (fun uri -> LibrarySync.remove_coercion uri) coercions_to_remove;
131 List.iter LibrarySync.remove_obj objs_to_remove
134 LibrarySync.remove_all_coercions ();
135 LibraryObjects.reset_defaults ();
137 GrafiteTypes.moo_content_rev = [];
138 proof_status = GrafiteTypes.No_proof;
139 options = GrafiteTypes.no_options;
142 universe = Universe.empty;