wenzelm@19
|
1 |
(* Title: Pure/sign.ML
|
clasohm@0
|
2 |
ID: $Id$
|
wenzelm@251
|
3 |
Author: Lawrence C Paulson and Markus Wenzel
|
clasohm@0
|
4 |
|
wenzelm@251
|
5 |
The abstract type "sg" of signatures.
|
clasohm@0
|
6 |
*)
|
clasohm@0
|
7 |
|
wenzelm@3956
|
8 |
(*base names*)
|
wenzelm@3956
|
9 |
type bstring = string;
|
wenzelm@3956
|
10 |
type bclass = class;
|
wenzelm@3956
|
11 |
(*external forms -- partially qualified names*)
|
wenzelm@3805
|
12 |
type xstring = string;
|
wenzelm@3805
|
13 |
type xclass = class;
|
wenzelm@3805
|
14 |
type xsort = sort;
|
wenzelm@3805
|
15 |
type xtyp = typ;
|
wenzelm@3805
|
16 |
type xterm = term;
|
wenzelm@3805
|
17 |
|
wenzelm@19
|
18 |
signature SIGN =
|
wenzelm@3791
|
19 |
sig
|
paulson@1501
|
20 |
type sg
|
wenzelm@3967
|
21 |
type sg_ref
|
wenzelm@4256
|
22 |
type data
|
wenzelm@2197
|
23 |
val rep_sg: sg ->
|
wenzelm@3975
|
24 |
{self: sg_ref,
|
wenzelm@3967
|
25 |
tsig: Type.type_sig,
|
wenzelm@2197
|
26 |
const_tab: typ Symtab.table,
|
wenzelm@2197
|
27 |
syn: Syntax.syntax,
|
wenzelm@3791
|
28 |
path: string list,
|
wenzelm@3791
|
29 |
spaces: (string * NameSpace.T) list,
|
wenzelm@4256
|
30 |
data: data}
|
wenzelm@3975
|
31 |
val name_of: sg -> string
|
wenzelm@3975
|
32 |
val stamp_names_of: sg -> string list
|
wenzelm@3967
|
33 |
val tsig_of: sg -> Type.type_sig
|
wenzelm@3967
|
34 |
val deref: sg_ref -> sg
|
wenzelm@3967
|
35 |
val self_ref: sg -> sg_ref
|
paulson@1501
|
36 |
val subsig: sg * sg -> bool
|
paulson@1501
|
37 |
val eq_sg: sg * sg -> bool
|
paulson@1501
|
38 |
val same_sg: sg * sg -> bool
|
paulson@1501
|
39 |
val is_draft: sg -> bool
|
wenzelm@4951
|
40 |
val is_stale: sg -> bool
|
paulson@1501
|
41 |
val const_type: sg -> string -> typ option
|
paulson@1501
|
42 |
val classes: sg -> class list
|
wenzelm@4844
|
43 |
val defaultS: sg -> sort
|
paulson@1501
|
44 |
val subsort: sg -> sort * sort -> bool
|
paulson@1501
|
45 |
val nodup_Vars: term -> unit
|
paulson@1501
|
46 |
val norm_sort: sg -> sort -> sort
|
paulson@1501
|
47 |
val nonempty_sort: sg -> sort list -> sort -> bool
|
wenzelm@4568
|
48 |
val of_sort: sg -> typ * sort -> bool
|
wenzelm@3791
|
49 |
val long_names: bool ref
|
wenzelm@3810
|
50 |
val classK: string
|
wenzelm@3810
|
51 |
val typeK: string
|
wenzelm@3810
|
52 |
val constK: string
|
wenzelm@3956
|
53 |
val full_name: sg -> bstring -> string
|
wenzelm@4844
|
54 |
val full_name_path: sg -> string -> bstring -> string
|
wenzelm@3956
|
55 |
val base_name: string -> bstring
|
wenzelm@3810
|
56 |
val intern: sg -> string -> xstring -> string
|
wenzelm@3810
|
57 |
val extern: sg -> string -> string -> xstring
|
wenzelm@3937
|
58 |
val cond_extern: sg -> string -> string -> xstring
|
wenzelm@3805
|
59 |
val intern_class: sg -> xclass -> class
|
wenzelm@3805
|
60 |
val intern_tycon: sg -> xstring -> string
|
wenzelm@3805
|
61 |
val intern_const: sg -> xstring -> string
|
wenzelm@3937
|
62 |
val intern_sort: sg -> xsort -> sort
|
wenzelm@3937
|
63 |
val intern_typ: sg -> xtyp -> typ
|
wenzelm@3937
|
64 |
val intern_term: sg -> xterm -> term
|
wenzelm@3937
|
65 |
val intern_tycons: sg -> xtyp -> typ
|
paulson@1501
|
66 |
val pretty_sg: sg -> Pretty.T
|
wenzelm@4051
|
67 |
val str_of_sg: sg -> string
|
paulson@1501
|
68 |
val pprint_sg: sg -> pprint_args -> unit
|
paulson@1501
|
69 |
val pretty_term: sg -> term -> Pretty.T
|
paulson@1501
|
70 |
val pretty_typ: sg -> typ -> Pretty.T
|
wenzelm@3791
|
71 |
val pretty_sort: sg -> sort -> Pretty.T
|
wenzelm@4249
|
72 |
val pretty_classrel: sg -> class * class -> Pretty.T
|
wenzelm@4249
|
73 |
val pretty_arity: sg -> string * sort list * sort -> Pretty.T
|
paulson@1501
|
74 |
val string_of_term: sg -> term -> string
|
paulson@1501
|
75 |
val string_of_typ: sg -> typ -> string
|
wenzelm@3791
|
76 |
val string_of_sort: sg -> sort -> string
|
wenzelm@3855
|
77 |
val str_of_sort: sg -> sort -> string
|
wenzelm@3855
|
78 |
val str_of_classrel: sg -> class * class -> string
|
wenzelm@3855
|
79 |
val str_of_arity: sg -> string * sort list * sort -> string
|
paulson@1501
|
80 |
val pprint_term: sg -> term -> pprint_args -> unit
|
paulson@1501
|
81 |
val pprint_typ: sg -> typ -> pprint_args -> unit
|
paulson@1501
|
82 |
val certify_typ: sg -> typ -> typ
|
paulson@1501
|
83 |
val certify_term: sg -> term -> term * typ * int
|
wenzelm@4227
|
84 |
val read_raw_typ: sg * (indexname -> sort option) -> string -> typ
|
paulson@1501
|
85 |
val read_typ: sg * (indexname -> sort option) -> string -> typ
|
paulson@1501
|
86 |
val infer_types: sg -> (indexname -> typ option) ->
|
paulson@1501
|
87 |
(indexname -> sort option) -> string list -> bool
|
wenzelm@4249
|
88 |
-> xterm list * typ -> term * (indexname * typ) list
|
wenzelm@4249
|
89 |
val infer_types_simult: sg -> (indexname -> typ option) ->
|
wenzelm@4249
|
90 |
(indexname -> sort option) -> string list -> bool
|
wenzelm@4249
|
91 |
-> (xterm list * typ) list -> term list * (indexname * typ) list
|
wenzelm@3956
|
92 |
val add_classes: (bclass * xclass list) list -> sg -> sg
|
wenzelm@3956
|
93 |
val add_classes_i: (bclass * class list) list -> sg -> sg
|
wenzelm@3805
|
94 |
val add_classrel: (xclass * xclass) list -> sg -> sg
|
wenzelm@3791
|
95 |
val add_classrel_i: (class * class) list -> sg -> sg
|
wenzelm@3805
|
96 |
val add_defsort: xsort -> sg -> sg
|
wenzelm@3791
|
97 |
val add_defsort_i: sort -> sg -> sg
|
wenzelm@3956
|
98 |
val add_types: (bstring * int * mixfix) list -> sg -> sg
|
wenzelm@4844
|
99 |
val add_nonterminals: bstring list -> sg -> sg
|
wenzelm@3956
|
100 |
val add_tyabbrs: (bstring * string list * string * mixfix) list -> sg -> sg
|
wenzelm@3956
|
101 |
val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> sg -> sg
|
wenzelm@3805
|
102 |
val add_arities: (xstring * xsort list * xsort) list -> sg -> sg
|
wenzelm@3791
|
103 |
val add_arities_i: (string * sort list * sort) list -> sg -> sg
|
wenzelm@3956
|
104 |
val add_consts: (bstring * string * mixfix) list -> sg -> sg
|
wenzelm@3956
|
105 |
val add_consts_i: (bstring * typ * mixfix) list -> sg -> sg
|
wenzelm@3956
|
106 |
val add_syntax: (bstring * string * mixfix) list -> sg -> sg
|
wenzelm@3956
|
107 |
val add_syntax_i: (bstring * typ * mixfix) list -> sg -> sg
|
wenzelm@3956
|
108 |
val add_modesyntax: (string * bool) * (bstring * string * mixfix) list -> sg -> sg
|
wenzelm@3956
|
109 |
val add_modesyntax_i: (string * bool) * (bstring * typ * mixfix) list -> sg -> sg
|
paulson@1501
|
110 |
val add_trfuns:
|
wenzelm@4344
|
111 |
(string * (ast list -> ast)) list *
|
wenzelm@4344
|
112 |
(string * (term list -> term)) list *
|
wenzelm@4344
|
113 |
(string * (term list -> term)) list *
|
wenzelm@4344
|
114 |
(string * (ast list -> ast)) list -> sg -> sg
|
wenzelm@2385
|
115 |
val add_trfunsT:
|
wenzelm@4344
|
116 |
(string * (bool -> typ -> term list -> term)) list -> sg -> sg
|
wenzelm@2693
|
117 |
val add_tokentrfuns:
|
wenzelm@2693
|
118 |
(string * string * (string -> string * int)) list -> sg -> sg
|
wenzelm@4619
|
119 |
val add_trrules: (xstring * string) Syntax.trrule list -> sg -> sg
|
paulson@1810
|
120 |
val add_trrules_i: ast Syntax.trrule list -> sg -> sg
|
wenzelm@3791
|
121 |
val add_path: string -> sg -> sg
|
wenzelm@3810
|
122 |
val add_space: string * string list -> sg -> sg
|
paulson@1501
|
123 |
val add_name: string -> sg -> sg
|
wenzelm@4256
|
124 |
val data_kinds: data -> string list
|
wenzelm@4998
|
125 |
val init_data: Object.kind * (Object.T * (Object.T -> Object.T) *
|
wenzelm@4998
|
126 |
(Object.T * Object.T -> Object.T) * (sg -> Object.T -> unit)) -> sg -> sg
|
wenzelm@4998
|
127 |
val get_data: Object.kind -> (Object.T -> 'a) -> sg -> 'a
|
wenzelm@4998
|
128 |
val put_data: Object.kind -> ('a -> Object.T) -> 'a -> sg -> sg
|
wenzelm@4998
|
129 |
val print_data: Object.kind -> sg -> unit
|
wenzelm@3967
|
130 |
val merge_refs: sg_ref * sg_ref -> sg_ref
|
wenzelm@4627
|
131 |
val merge: sg * sg -> sg
|
wenzelm@3975
|
132 |
val prep_ext: sg -> sg
|
wenzelm@4627
|
133 |
val nontriv_merge: sg * sg -> sg
|
wenzelm@3995
|
134 |
val pre_pure: sg
|
paulson@1501
|
135 |
val const_of_class: class -> string
|
paulson@1501
|
136 |
val class_of_const: string -> class
|
wenzelm@3791
|
137 |
end;
|
clasohm@0
|
138 |
|
wenzelm@4249
|
139 |
structure Sign: SIGN =
|
wenzelm@143
|
140 |
struct
|
clasohm@0
|
141 |
|
wenzelm@3967
|
142 |
|
wenzelm@251
|
143 |
(** datatype sg **)
|
wenzelm@251
|
144 |
|
wenzelm@4256
|
145 |
(* types sg, data, sg_ref *)
|
wenzelm@4256
|
146 |
|
wenzelm@19
|
147 |
datatype sg =
|
wenzelm@3975
|
148 |
Sg of
|
wenzelm@3975
|
149 |
{id: string ref, (*id*)
|
wenzelm@3975
|
150 |
stamps: string ref list} * (*unique theory indentifier*)
|
wenzelm@3975
|
151 |
{self: sg_ref, (*mutable self reference*)
|
wenzelm@3791
|
152 |
tsig: Type.type_sig, (*order-sorted signature of types*)
|
wenzelm@3805
|
153 |
const_tab: typ Symtab.table, (*type schemes of constants*)
|
wenzelm@3791
|
154 |
syn: Syntax.syntax, (*syntax for parsing and printing*)
|
wenzelm@3975
|
155 |
path: string list, (*current name space entry prefix*)
|
wenzelm@3975
|
156 |
spaces: (string * NameSpace.T) list, (*name spaces for consts, types etc.*)
|
wenzelm@4256
|
157 |
data: data} (*anytype data*)
|
wenzelm@4256
|
158 |
and data =
|
wenzelm@4256
|
159 |
Data of
|
wenzelm@4998
|
160 |
(Object.kind * (*kind (for authorization)*)
|
wenzelm@4998
|
161 |
(Object.T * (*value*)
|
wenzelm@4998
|
162 |
((Object.T -> Object.T) * (*prepare extend method*)
|
wenzelm@4998
|
163 |
(Object.T * Object.T -> Object.T) * (*merge and prepare extend method*)
|
wenzelm@4998
|
164 |
(sg -> Object.T -> unit)))) (*print method*)
|
wenzelm@4256
|
165 |
Symtab.table
|
wenzelm@3967
|
166 |
and sg_ref =
|
wenzelm@4998
|
167 |
SgRef of sg ref option;
|
clasohm@0
|
168 |
|
wenzelm@3967
|
169 |
(*make signature*)
|
wenzelm@3967
|
170 |
fun make_sign (id, self, tsig, const_tab, syn, path, spaces, data, stamps) =
|
wenzelm@3975
|
171 |
Sg ({id = id, stamps = stamps}, {self = self, tsig = tsig, const_tab = const_tab,
|
wenzelm@3975
|
172 |
syn = syn, path = path, spaces = spaces, data = data});
|
wenzelm@3975
|
173 |
|
wenzelm@3975
|
174 |
|
wenzelm@4256
|
175 |
(* basic operations *)
|
wenzelm@3975
|
176 |
|
wenzelm@3975
|
177 |
fun rep_sg (Sg (_, args)) = args;
|
wenzelm@3967
|
178 |
|
wenzelm@3975
|
179 |
(*show stamps*)
|
wenzelm@3975
|
180 |
fun stamp_names_of (Sg ({stamps, ...}, _)) = rev (map ! stamps);
|
wenzelm@3975
|
181 |
fun pretty_sg sg = Pretty.str_list "{" "}" (stamp_names_of sg);
|
wenzelm@3975
|
182 |
val str_of_sg = Pretty.str_of o pretty_sg;
|
wenzelm@3975
|
183 |
val pprint_sg = Pretty.pprint o pretty_sg;
|
wenzelm@3975
|
184 |
|
wenzelm@402
|
185 |
val tsig_of = #tsig o rep_sg;
|
wenzelm@3967
|
186 |
|
wenzelm@3975
|
187 |
fun const_type (Sg (_, {const_tab, ...})) c = Symtab.lookup (const_tab, c);
|
wenzelm@3967
|
188 |
|
wenzelm@3967
|
189 |
|
wenzelm@3995
|
190 |
(* id and self *)
|
wenzelm@3967
|
191 |
|
wenzelm@3975
|
192 |
fun check_stale (sg as Sg ({id, ...},
|
wenzelm@3975
|
193 |
{self = SgRef (Some (ref (Sg ({id = id', ...}, _)))), ...})) =
|
wenzelm@3967
|
194 |
if id = id' then sg
|
wenzelm@3975
|
195 |
else raise TERM ("Stale signature: " ^ str_of_sg sg, [])
|
wenzelm@3967
|
196 |
| check_stale _ = sys_error "Sign.check_stale";
|
clasohm@0
|
197 |
|
wenzelm@4951
|
198 |
fun is_stale sg = (check_stale sg; false) handle TERM _ => true;
|
wenzelm@4951
|
199 |
|
wenzelm@3995
|
200 |
fun self_ref (sg as Sg (_, {self, ...})) = (check_stale sg; self);
|
wenzelm@3995
|
201 |
|
wenzelm@3995
|
202 |
fun deref (SgRef (Some (ref sg))) = sg
|
wenzelm@3995
|
203 |
| deref (SgRef None) = sys_error "Sign.deref";
|
wenzelm@3995
|
204 |
|
wenzelm@3975
|
205 |
fun name_of (sg as Sg ({id = ref name, ...}, _)) =
|
wenzelm@4844
|
206 |
if name = "" orelse ord name = ord "#" then
|
wenzelm@3975
|
207 |
raise TERM ("Nameless signature " ^ str_of_sg sg, [])
|
wenzelm@3975
|
208 |
else name;
|
wenzelm@3975
|
209 |
|
nipkow@206
|
210 |
|
wenzelm@2979
|
211 |
(* inclusion and equality *)
|
paulson@2180
|
212 |
|
wenzelm@2185
|
213 |
local
|
wenzelm@2185
|
214 |
(*avoiding polymorphic equality: factor 10 speedup*)
|
wenzelm@2185
|
215 |
fun mem_stamp (_:string ref, []) = false
|
wenzelm@2185
|
216 |
| mem_stamp (x, y :: ys) = x = y orelse mem_stamp (x, ys);
|
wenzelm@2185
|
217 |
|
wenzelm@2185
|
218 |
fun subset_stamp ([], ys) = true
|
wenzelm@2185
|
219 |
| subset_stamp (x :: xs, ys) =
|
wenzelm@2185
|
220 |
mem_stamp (x, ys) andalso subset_stamp (xs, ys);
|
paulson@2180
|
221 |
|
wenzelm@2185
|
222 |
(*fast partial test*)
|
wenzelm@2185
|
223 |
fun fast_sub ([]: string ref list, _) = true
|
wenzelm@2185
|
224 |
| fast_sub (_, []) = false
|
wenzelm@2185
|
225 |
| fast_sub (x :: xs, y :: ys) =
|
wenzelm@2185
|
226 |
if x = y then fast_sub (xs, ys)
|
wenzelm@2185
|
227 |
else fast_sub (x :: xs, ys);
|
wenzelm@2185
|
228 |
in
|
wenzelm@3975
|
229 |
fun eq_sg (sg1 as Sg ({id = id1, ...}, _), sg2 as Sg ({id = id2, ...}, _)) =
|
wenzelm@3967
|
230 |
(check_stale sg1; check_stale sg2; id1 = id2);
|
wenzelm@2185
|
231 |
|
wenzelm@3975
|
232 |
fun subsig (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
|
wenzelm@3967
|
233 |
eq_sg (sg1, sg2) orelse subset_stamp (s1, s2);
|
paulson@2180
|
234 |
|
wenzelm@3975
|
235 |
fun fast_subsig (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
|
wenzelm@3967
|
236 |
eq_sg (sg1, sg2) orelse fast_sub (s1, s2);
|
wenzelm@2185
|
237 |
end;
|
wenzelm@2185
|
238 |
|
wenzelm@402
|
239 |
|
wenzelm@2185
|
240 |
(*test if same theory names are contained in signatures' stamps,
|
wenzelm@2185
|
241 |
i.e. if signatures belong to same theory but not necessarily to the
|
wenzelm@2185
|
242 |
same version of it*)
|
wenzelm@3975
|
243 |
fun same_sg (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
|
wenzelm@3967
|
244 |
eq_sg (sg1, sg2) orelse eq_set_string (pairself (map (op !)) (s1, s2));
|
wenzelm@2185
|
245 |
|
wenzelm@2185
|
246 |
(*test for drafts*)
|
wenzelm@4844
|
247 |
fun is_draft (Sg ({stamps = ref name :: _, ...}, _)) = name = "" orelse ord name = ord "#";
|
wenzelm@386
|
248 |
|
clasohm@0
|
249 |
|
wenzelm@4568
|
250 |
(* classes and sorts *)
|
wenzelm@4568
|
251 |
|
wenzelm@4568
|
252 |
val classes = #classes o Type.rep_tsig o tsig_of;
|
wenzelm@4568
|
253 |
|
wenzelm@4844
|
254 |
val defaultS = Type.defaultS o tsig_of;
|
wenzelm@4568
|
255 |
val subsort = Type.subsort o tsig_of;
|
wenzelm@4568
|
256 |
val norm_sort = Type.norm_sort o tsig_of;
|
wenzelm@4568
|
257 |
val nonempty_sort = Type.nonempty_sort o tsig_of;
|
wenzelm@4568
|
258 |
|
wenzelm@4568
|
259 |
fun of_sort (Sg (_, {tsig, ...})) =
|
wenzelm@4568
|
260 |
Sorts.of_sort (#classrel (Type.rep_tsig tsig)) (#arities (Type.rep_tsig tsig));
|
wenzelm@4568
|
261 |
|
wenzelm@4568
|
262 |
|
wenzelm@4256
|
263 |
|
wenzelm@4256
|
264 |
(** signature data **)
|
wenzelm@4256
|
265 |
|
wenzelm@4256
|
266 |
(* errors *)
|
wenzelm@4256
|
267 |
|
wenzelm@4261
|
268 |
fun of_theory sg = "\nof theory " ^ str_of_sg sg;
|
wenzelm@4256
|
269 |
|
wenzelm@4998
|
270 |
fun err_inconsistent kinds =
|
wenzelm@4998
|
271 |
error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " data");
|
wenzelm@4998
|
272 |
|
wenzelm@4256
|
273 |
fun err_method name kind =
|
wenzelm@4892
|
274 |
error ("Error while invoking " ^ quote kind ^ " " ^ name ^ " method");
|
wenzelm@4256
|
275 |
|
wenzelm@4256
|
276 |
fun err_dup_init sg kind =
|
wenzelm@4256
|
277 |
error ("Duplicate initialization of " ^ quote kind ^ " data" ^ of_theory sg);
|
wenzelm@4256
|
278 |
|
wenzelm@4256
|
279 |
fun err_uninit sg kind =
|
wenzelm@4256
|
280 |
error ("Tried to access uninitialized " ^ quote kind ^ " data" ^ of_theory sg);
|
wenzelm@4256
|
281 |
|
wenzelm@4998
|
282 |
fun err_access sg kind =
|
wenzelm@4998
|
283 |
error ("Unauthorized access to " ^ quote kind ^ " data" ^ of_theory sg);
|
wenzelm@4998
|
284 |
|
wenzelm@4256
|
285 |
|
wenzelm@4256
|
286 |
(* prepare data *)
|
wenzelm@4256
|
287 |
|
wenzelm@4489
|
288 |
val empty_data = Data Symtab.empty;
|
wenzelm@4256
|
289 |
|
wenzelm@4256
|
290 |
fun merge_data (Data tab1, Data tab2) =
|
wenzelm@4256
|
291 |
let
|
wenzelm@4998
|
292 |
val data1 = map snd (Symtab.dest tab1);
|
wenzelm@4998
|
293 |
val data2 = map snd (Symtab.dest tab2);
|
wenzelm@4256
|
294 |
val all_data = data1 @ data2;
|
wenzelm@4998
|
295 |
val kinds = gen_distinct Object.eq_kind (map fst all_data);
|
wenzelm@4256
|
296 |
|
wenzelm@4256
|
297 |
fun entry data kind =
|
wenzelm@4998
|
298 |
(case gen_assoc Object.eq_kind (data, kind) of
|
wenzelm@4256
|
299 |
None => []
|
wenzelm@4256
|
300 |
| Some x => [(kind, x)]);
|
wenzelm@4256
|
301 |
|
wenzelm@4256
|
302 |
fun merge_entries [(kind, (e, mths as (ext, _, _)))] =
|
wenzelm@4998
|
303 |
(kind, (ext e handle _ => err_method "prep_ext" (Object.name_of_kind kind), mths))
|
wenzelm@4256
|
304 |
| merge_entries [(kind, (e1, mths as (_, mrg, _))), (_, (e2, _))] =
|
wenzelm@4998
|
305 |
(kind, (mrg (e1, e2) handle _ => err_method "merge" (Object.name_of_kind kind), mths))
|
wenzelm@4256
|
306 |
| merge_entries _ = sys_error "merge_entries";
|
wenzelm@4256
|
307 |
|
wenzelm@4256
|
308 |
val data = map (fn k => merge_entries (entry data1 k @ entry data2 k)) kinds;
|
wenzelm@4998
|
309 |
val data_idx = map (fn (k, x) => (Object.name_of_kind k, (k, x))) data;
|
wenzelm@4998
|
310 |
in
|
wenzelm@4998
|
311 |
Data (Symtab.make data_idx)
|
wenzelm@4998
|
312 |
handle Symtab.DUPS dups => err_inconsistent dups
|
wenzelm@4998
|
313 |
end;
|
wenzelm@4256
|
314 |
|
wenzelm@4256
|
315 |
fun prep_ext_data data = merge_data (data, empty_data);
|
wenzelm@4256
|
316 |
|
wenzelm@4256
|
317 |
fun init_data_sg sg (Data tab) kind e ext mrg prt =
|
wenzelm@4998
|
318 |
let val name = Object.name_of_kind kind in
|
wenzelm@4998
|
319 |
Data (Symtab.update_new ((name, (kind, (e, (ext, mrg, prt)))), tab))
|
wenzelm@4998
|
320 |
handle Symtab.DUP _ => err_dup_init sg name
|
wenzelm@4998
|
321 |
end;
|
wenzelm@4256
|
322 |
|
wenzelm@4256
|
323 |
|
wenzelm@4256
|
324 |
(* access data *)
|
wenzelm@4256
|
325 |
|
wenzelm@4256
|
326 |
fun data_kinds (Data tab) = map fst (Symtab.dest tab);
|
wenzelm@4256
|
327 |
|
wenzelm@4256
|
328 |
fun lookup_data sg tab kind =
|
wenzelm@4998
|
329 |
let val name = Object.name_of_kind kind in
|
wenzelm@4998
|
330 |
(case Symtab.lookup (tab, name) of
|
wenzelm@4998
|
331 |
Some (k, x) =>
|
wenzelm@4998
|
332 |
if Object.eq_kind (kind, k) then x
|
wenzelm@4998
|
333 |
else err_access sg name
|
wenzelm@4998
|
334 |
| None => err_uninit sg name)
|
wenzelm@4998
|
335 |
end;
|
wenzelm@4256
|
336 |
|
wenzelm@4998
|
337 |
fun get_data kind f (sg as Sg (_, {data = Data tab, ...})) =
|
wenzelm@4998
|
338 |
let val x = fst (lookup_data sg tab kind)
|
wenzelm@4998
|
339 |
in f x handle Match => Object.kind_error kind end;
|
wenzelm@4998
|
340 |
|
wenzelm@4998
|
341 |
fun print_data kind (sg as Sg (_, {data = Data tab, ...})) =
|
wenzelm@4256
|
342 |
let val (e, (_, _, prt)) = lookup_data sg tab kind
|
wenzelm@4998
|
343 |
in prt sg e handle _ => err_method ("print" ^ of_theory sg) (Object.name_of_kind kind) end;
|
wenzelm@4256
|
344 |
|
wenzelm@4998
|
345 |
fun put_data_sg sg (Data tab) kind f x =
|
wenzelm@4998
|
346 |
Data (Symtab.update ((Object.name_of_kind kind,
|
wenzelm@4998
|
347 |
(kind, (f x, snd (lookup_data sg tab kind)))), tab));
|
wenzelm@4256
|
348 |
|
wenzelm@4256
|
349 |
|
wenzelm@4256
|
350 |
|
wenzelm@4256
|
351 |
(** build signatures **)
|
wenzelm@3967
|
352 |
|
wenzelm@3967
|
353 |
fun ext_stamps stamps (id as ref name) =
|
wenzelm@3967
|
354 |
let val stmps = (case stamps of ref "#" :: ss => ss | ss => ss) in
|
wenzelm@3967
|
355 |
if exists (equal name o !) stmps then
|
wenzelm@3967
|
356 |
error ("Theory already contains a " ^ quote name ^ " component")
|
wenzelm@3967
|
357 |
else id :: stmps
|
wenzelm@3967
|
358 |
end;
|
wenzelm@3967
|
359 |
|
wenzelm@3967
|
360 |
fun create_sign self stamps name (syn, tsig, ctab, (path, spaces), data) =
|
wenzelm@3967
|
361 |
let
|
wenzelm@3967
|
362 |
val id = ref name;
|
wenzelm@3967
|
363 |
val sign =
|
wenzelm@3967
|
364 |
make_sign (id, self, tsig, ctab, syn, path, spaces, data, ext_stamps stamps id);
|
wenzelm@3967
|
365 |
in
|
wenzelm@3967
|
366 |
(case self of
|
wenzelm@3967
|
367 |
SgRef (Some r) => r := sign
|
wenzelm@3967
|
368 |
| _ => sys_error "Sign.create_sign");
|
wenzelm@3967
|
369 |
sign
|
wenzelm@3967
|
370 |
end;
|
wenzelm@3967
|
371 |
|
wenzelm@3975
|
372 |
fun extend_sign keep extfun name decls
|
wenzelm@3975
|
373 |
(sg as Sg ({id = _, stamps}, {self, tsig, const_tab, syn, path, spaces, data})) =
|
wenzelm@3967
|
374 |
let
|
wenzelm@3967
|
375 |
val _ = check_stale sg;
|
wenzelm@3967
|
376 |
val (self', data') =
|
wenzelm@3975
|
377 |
if is_draft sg andalso keep then (self, data)
|
wenzelm@4256
|
378 |
else (SgRef (Some (ref sg)), prep_ext_data data);
|
wenzelm@3967
|
379 |
in
|
wenzelm@3967
|
380 |
create_sign self' stamps name
|
wenzelm@3967
|
381 |
(extfun (syn, tsig, const_tab, (path, spaces), data') decls)
|
wenzelm@3967
|
382 |
end;
|
wenzelm@3967
|
383 |
|
wenzelm@3967
|
384 |
|
wenzelm@3791
|
385 |
|
wenzelm@3791
|
386 |
(** name spaces **)
|
wenzelm@3791
|
387 |
|
wenzelm@3805
|
388 |
(*prune names on output by default*)
|
wenzelm@3791
|
389 |
val long_names = ref false;
|
wenzelm@3791
|
390 |
|
wenzelm@3791
|
391 |
|
wenzelm@3791
|
392 |
(* kinds *)
|
wenzelm@3791
|
393 |
|
wenzelm@3791
|
394 |
val classK = "class";
|
wenzelm@3791
|
395 |
val typeK = "type";
|
wenzelm@3791
|
396 |
val constK = "const";
|
wenzelm@3791
|
397 |
|
wenzelm@3791
|
398 |
|
wenzelm@3791
|
399 |
(* add and retrieve names *)
|
wenzelm@3791
|
400 |
|
wenzelm@3791
|
401 |
fun space_of spaces kind =
|
wenzelm@3791
|
402 |
if_none (assoc (spaces, kind)) NameSpace.empty;
|
wenzelm@3791
|
403 |
|
wenzelm@3791
|
404 |
(*input and output of qualified names*)
|
wenzelm@3995
|
405 |
fun intrn spaces kind = NameSpace.intern (space_of spaces kind);
|
wenzelm@3995
|
406 |
fun extrn spaces kind = NameSpace.extern (space_of spaces kind);
|
wenzelm@3791
|
407 |
|
wenzelm@3791
|
408 |
(*add names*)
|
wenzelm@3791
|
409 |
fun add_names spaces kind names =
|
wenzelm@4489
|
410 |
let val space' = NameSpace.extend (space_of spaces kind, names) in
|
wenzelm@3791
|
411 |
overwrite (spaces, (kind, space'))
|
wenzelm@3791
|
412 |
end;
|
wenzelm@3791
|
413 |
|
wenzelm@3810
|
414 |
(*make full names*)
|
wenzelm@3937
|
415 |
fun full path name =
|
wenzelm@4489
|
416 |
if name = "" then error "Attempt to declare empty name \"\""
|
wenzelm@4489
|
417 |
else if NameSpace.qualified name then
|
wenzelm@3937
|
418 |
error ("Attempt to declare qualified name " ^ quote name)
|
wenzelm@3937
|
419 |
else NameSpace.pack (path @ [name]);
|
wenzelm@3937
|
420 |
|
wenzelm@3937
|
421 |
(*base name*)
|
wenzelm@3937
|
422 |
val base_name = NameSpace.base;
|
wenzelm@3791
|
423 |
|
wenzelm@3791
|
424 |
|
wenzelm@3791
|
425 |
(* intern / extern names *)
|
wenzelm@3791
|
426 |
|
wenzelm@3791
|
427 |
local
|
wenzelm@3791
|
428 |
(*prepare mapping of names*)
|
wenzelm@3791
|
429 |
fun mapping f add_xs t =
|
wenzelm@3791
|
430 |
let
|
wenzelm@3791
|
431 |
fun f' x = let val y = f x in if x = y then None else Some (x, y) end;
|
wenzelm@3791
|
432 |
val table = mapfilter f' (add_xs (t, []));
|
wenzelm@3791
|
433 |
fun lookup x = if_none (assoc (table, x)) x;
|
wenzelm@3791
|
434 |
in lookup end;
|
wenzelm@3791
|
435 |
|
wenzelm@3791
|
436 |
(*intern / extern typ*)
|
wenzelm@3791
|
437 |
fun trn_typ trn T =
|
wenzelm@3791
|
438 |
T |> map_typ
|
wenzelm@3791
|
439 |
(mapping (trn classK) add_typ_classes T)
|
wenzelm@3791
|
440 |
(mapping (trn typeK) add_typ_tycons T);
|
wenzelm@3791
|
441 |
|
wenzelm@3791
|
442 |
(*intern / extern term*)
|
wenzelm@3791
|
443 |
fun trn_term trn t =
|
wenzelm@3791
|
444 |
t |> map_term
|
wenzelm@3791
|
445 |
(mapping (trn classK) add_term_classes t)
|
wenzelm@3791
|
446 |
(mapping (trn typeK) add_term_tycons t)
|
wenzelm@3791
|
447 |
(mapping (trn constK) add_term_consts t);
|
wenzelm@3791
|
448 |
|
wenzelm@3975
|
449 |
val spaces_of = #spaces o rep_sg;
|
wenzelm@3791
|
450 |
in
|
wenzelm@3791
|
451 |
fun intrn_class spaces = intrn spaces classK;
|
wenzelm@3791
|
452 |
fun extrn_class spaces = extrn spaces classK;
|
wenzelm@3937
|
453 |
|
wenzelm@3791
|
454 |
val intrn_sort = map o intrn_class;
|
wenzelm@3791
|
455 |
val intrn_typ = trn_typ o intrn;
|
wenzelm@3937
|
456 |
val intrn_term = trn_term o intrn;
|
wenzelm@3937
|
457 |
|
wenzelm@3937
|
458 |
val extrn_sort = map o extrn_class;
|
wenzelm@3791
|
459 |
val extrn_typ = trn_typ o extrn;
|
wenzelm@3791
|
460 |
val extrn_term = trn_term o extrn;
|
wenzelm@3791
|
461 |
|
wenzelm@3805
|
462 |
fun intrn_tycons spaces T =
|
wenzelm@3805
|
463 |
map_typ I (mapping (intrn spaces typeK) add_typ_tycons T) T;
|
wenzelm@3805
|
464 |
|
wenzelm@3810
|
465 |
val intern = intrn o spaces_of;
|
wenzelm@3855
|
466 |
val extern = extrn o spaces_of;
|
wenzelm@3937
|
467 |
fun cond_extern sg kind = if ! long_names then I else extern sg kind;
|
wenzelm@3937
|
468 |
|
wenzelm@3791
|
469 |
val intern_class = intrn_class o spaces_of;
|
wenzelm@3791
|
470 |
val intern_sort = intrn_sort o spaces_of;
|
wenzelm@3791
|
471 |
val intern_typ = intrn_typ o spaces_of;
|
wenzelm@3791
|
472 |
val intern_term = intrn_term o spaces_of;
|
wenzelm@3791
|
473 |
|
wenzelm@3791
|
474 |
fun intern_tycon sg = intrn (spaces_of sg) typeK;
|
wenzelm@3791
|
475 |
fun intern_const sg = intrn (spaces_of sg) constK;
|
wenzelm@3937
|
476 |
|
wenzelm@3791
|
477 |
val intern_tycons = intrn_tycons o spaces_of;
|
wenzelm@3791
|
478 |
|
wenzelm@3975
|
479 |
val full_name = full o #path o rep_sg;
|
wenzelm@4908
|
480 |
fun full_name_path sg elems name =
|
wenzelm@4844
|
481 |
full (#path (rep_sg sg) @ NameSpace.unpack elems) name;
|
wenzelm@3791
|
482 |
end;
|
wenzelm@620
|
483 |
|
wenzelm@402
|
484 |
|
clasohm@0
|
485 |
|
wenzelm@4249
|
486 |
(** pretty printing of terms, types etc. **)
|
wenzelm@3937
|
487 |
|
wenzelm@4249
|
488 |
fun pretty_term (sg as Sg ({stamps, ...}, {syn, spaces, ...})) t =
|
wenzelm@3937
|
489 |
Syntax.pretty_term syn
|
wenzelm@4249
|
490 |
(exists (equal "CPure" o !) stamps)
|
wenzelm@3937
|
491 |
(if ! long_names then t else extrn_term spaces t);
|
wenzelm@3937
|
492 |
|
wenzelm@3975
|
493 |
fun pretty_typ (Sg (_, {syn, spaces, ...})) T =
|
wenzelm@3937
|
494 |
Syntax.pretty_typ syn
|
wenzelm@3937
|
495 |
(if ! long_names then T else extrn_typ spaces T);
|
wenzelm@3937
|
496 |
|
wenzelm@3975
|
497 |
fun pretty_sort (Sg (_, {syn, spaces, ...})) S =
|
wenzelm@3937
|
498 |
Syntax.pretty_sort syn
|
wenzelm@3937
|
499 |
(if ! long_names then S else extrn_sort spaces S);
|
wenzelm@3937
|
500 |
|
wenzelm@3937
|
501 |
fun pretty_classrel sg (c1, c2) = Pretty.block
|
wenzelm@3937
|
502 |
[pretty_sort sg [c1], Pretty.str " <", Pretty.brk 1, pretty_sort sg [c2]];
|
wenzelm@3937
|
503 |
|
wenzelm@3937
|
504 |
fun pretty_arity sg (t, Ss, S) =
|
wenzelm@3937
|
505 |
let
|
wenzelm@3937
|
506 |
val t' = cond_extern sg typeK t;
|
wenzelm@3937
|
507 |
val dom =
|
wenzelm@3937
|
508 |
if null Ss then []
|
wenzelm@3937
|
509 |
else [Pretty.list "(" ")" (map (pretty_sort sg) Ss), Pretty.brk 1];
|
wenzelm@3937
|
510 |
in
|
wenzelm@3937
|
511 |
Pretty.block
|
wenzelm@3937
|
512 |
([Pretty.str (t' ^ " ::"), Pretty.brk 1] @ dom @ [pretty_sort sg S])
|
wenzelm@3937
|
513 |
end;
|
wenzelm@3937
|
514 |
|
wenzelm@3937
|
515 |
fun string_of_term sg t = Pretty.string_of (pretty_term sg t);
|
wenzelm@3937
|
516 |
fun string_of_typ sg T = Pretty.string_of (pretty_typ sg T);
|
wenzelm@3937
|
517 |
fun string_of_sort sg S = Pretty.string_of (pretty_sort sg S);
|
wenzelm@3937
|
518 |
|
wenzelm@3937
|
519 |
fun str_of_sort sg S = Pretty.str_of (pretty_sort sg S);
|
wenzelm@3937
|
520 |
fun str_of_classrel sg c1_c2 = Pretty.str_of (pretty_classrel sg c1_c2);
|
wenzelm@3937
|
521 |
fun str_of_arity sg ar = Pretty.str_of (pretty_arity sg ar);
|
wenzelm@3937
|
522 |
|
wenzelm@3937
|
523 |
fun pprint_term sg = Pretty.pprint o Pretty.quote o (pretty_term sg);
|
wenzelm@3937
|
524 |
fun pprint_typ sg = Pretty.pprint o Pretty.quote o (pretty_typ sg);
|
wenzelm@3937
|
525 |
|
wenzelm@3937
|
526 |
|
wenzelm@3937
|
527 |
|
wenzelm@562
|
528 |
(** read types **) (*exception ERROR*)
|
wenzelm@562
|
529 |
|
wenzelm@562
|
530 |
fun err_in_type s =
|
wenzelm@562
|
531 |
error ("The error(s) above occurred in type " ^ quote s);
|
wenzelm@562
|
532 |
|
wenzelm@4227
|
533 |
fun rd_raw_typ syn tsig spaces def_sort str =
|
wenzelm@3791
|
534 |
intrn_tycons spaces
|
wenzelm@3791
|
535 |
(Syntax.read_typ syn (Type.get_sort tsig def_sort (intrn_sort spaces)) str
|
wenzelm@3791
|
536 |
handle ERROR => err_in_type str);
|
wenzelm@4227
|
537 |
|
wenzelm@4227
|
538 |
fun read_raw_typ (sg as Sg (_, {tsig, syn, spaces, ...}), def_sort) str =
|
wenzelm@4227
|
539 |
(check_stale sg; rd_raw_typ syn tsig spaces def_sort str);
|
wenzelm@4227
|
540 |
|
wenzelm@562
|
541 |
(*read and certify typ wrt a signature*)
|
wenzelm@4227
|
542 |
fun read_typ (sg, def_sort) str =
|
wenzelm@4227
|
543 |
(Type.cert_typ (tsig_of sg) (read_raw_typ (sg, def_sort) str)
|
wenzelm@3969
|
544 |
handle TYPE (msg, _, _) => (error_msg msg; err_in_type str));
|
wenzelm@562
|
545 |
|
wenzelm@562
|
546 |
|
wenzelm@562
|
547 |
|
wenzelm@386
|
548 |
(** certify types and terms **) (*exception TYPE*)
|
wenzelm@251
|
549 |
|
wenzelm@4961
|
550 |
(* certify_typ *)
|
wenzelm@4961
|
551 |
|
wenzelm@3975
|
552 |
val certify_typ = Type.cert_typ o tsig_of;
|
wenzelm@251
|
553 |
|
wenzelm@4961
|
554 |
|
wenzelm@4961
|
555 |
(* certify_term *)
|
wenzelm@4961
|
556 |
|
wenzelm@2979
|
557 |
(*check for duplicate TVars with distinct sorts*)
|
wenzelm@2979
|
558 |
fun nodup_TVars (tvars, T) =
|
wenzelm@2979
|
559 |
(case T of
|
wenzelm@2979
|
560 |
Type (_, Ts) => nodup_TVars_list (tvars, Ts)
|
wenzelm@2979
|
561 |
| TFree _ => tvars
|
wenzelm@2979
|
562 |
| TVar (v as (a, S)) =>
|
wenzelm@2979
|
563 |
(case assoc_string_int (tvars, a) of
|
wenzelm@2979
|
564 |
Some S' =>
|
wenzelm@2979
|
565 |
if S = S' then tvars
|
wenzelm@3791
|
566 |
else raise TYPE ("Type variable " ^ Syntax.string_of_vname a ^
|
wenzelm@3791
|
567 |
" has two distinct sorts", [TVar (a, S'), T], [])
|
wenzelm@2979
|
568 |
| None => v :: tvars))
|
wenzelm@2979
|
569 |
(*equivalent to foldl nodup_TVars_list, but 3X faster under Poly/ML*)
|
wenzelm@2979
|
570 |
and nodup_TVars_list (tvars, []) = tvars
|
wenzelm@2979
|
571 |
| nodup_TVars_list (tvars, T :: Ts) =
|
wenzelm@2979
|
572 |
nodup_TVars_list (nodup_TVars (tvars, T), Ts);
|
nipkow@1494
|
573 |
|
wenzelm@2979
|
574 |
(*check for duplicate Vars with distinct types*)
|
nipkow@1494
|
575 |
fun nodup_Vars tm =
|
wenzelm@2979
|
576 |
let
|
wenzelm@2979
|
577 |
fun nodups vars tvars tm =
|
wenzelm@2979
|
578 |
(case tm of
|
wenzelm@2979
|
579 |
Const (c, T) => (vars, nodup_TVars (tvars, T))
|
wenzelm@2979
|
580 |
| Free (a, T) => (vars, nodup_TVars (tvars, T))
|
wenzelm@2979
|
581 |
| Var (v as (ixn, T)) =>
|
wenzelm@2979
|
582 |
(case assoc_string_int (vars, ixn) of
|
wenzelm@2979
|
583 |
Some T' =>
|
wenzelm@2979
|
584 |
if T = T' then (vars, nodup_TVars (tvars, T))
|
wenzelm@3791
|
585 |
else raise TYPE ("Variable " ^ Syntax.string_of_vname ixn ^
|
wenzelm@3791
|
586 |
" has two distinct types", [T', T], [])
|
wenzelm@2979
|
587 |
| None => (v :: vars, tvars))
|
wenzelm@2979
|
588 |
| Bound _ => (vars, tvars)
|
wenzelm@3791
|
589 |
| Abs (_, T, t) => nodups vars (nodup_TVars (tvars, T)) t
|
wenzelm@2979
|
590 |
| s $ t =>
|
wenzelm@2979
|
591 |
let val (vars',tvars') = nodups vars tvars s in
|
wenzelm@2979
|
592 |
nodups vars' tvars' t
|
wenzelm@2979
|
593 |
end);
|
wenzelm@2979
|
594 |
in nodups [] [] tm; () end;
|
wenzelm@2979
|
595 |
|
wenzelm@4961
|
596 |
(*compute and check type of the term*)
|
wenzelm@4961
|
597 |
fun type_check sg tm =
|
wenzelm@4961
|
598 |
let
|
wenzelm@4961
|
599 |
val prt =
|
wenzelm@4961
|
600 |
setmp Syntax.show_brackets true
|
wenzelm@4961
|
601 |
(setmp long_names true (pretty_term sg));
|
wenzelm@4961
|
602 |
val prT = setmp long_names true (pretty_typ sg);
|
wenzelm@251
|
603 |
|
wenzelm@4961
|
604 |
fun err_appl why bs t T u U =
|
wenzelm@4961
|
605 |
let
|
wenzelm@4961
|
606 |
val xs = map Free bs; (*we do not rename here*)
|
wenzelm@4961
|
607 |
val t' = subst_bounds (xs, t);
|
wenzelm@4961
|
608 |
val u' = subst_bounds (xs, u);
|
wenzelm@4961
|
609 |
val text = cat_lines
|
wenzelm@4961
|
610 |
["Type error in application: " ^ why,
|
wenzelm@4961
|
611 |
"",
|
wenzelm@4961
|
612 |
Pretty.string_of (Pretty.block [Pretty.str "Operator:", Pretty.brk 2, prt t',
|
wenzelm@4961
|
613 |
Pretty.str " :: ", prT T]),
|
wenzelm@4961
|
614 |
Pretty.string_of (Pretty.block [Pretty.str "Operand:", Pretty.brk 3, prt u',
|
wenzelm@4961
|
615 |
Pretty.str " :: ", prT U]), ""];
|
wenzelm@4961
|
616 |
in raise TYPE (text, [T, U], [t', u']) end;
|
wenzelm@4961
|
617 |
|
wenzelm@4961
|
618 |
fun typ_of (_, Const (_, T)) = T
|
wenzelm@4961
|
619 |
| typ_of (_, Free (_, T)) = T
|
wenzelm@4961
|
620 |
| typ_of (_, Var (_, T)) = T
|
wenzelm@4961
|
621 |
| typ_of (bs, Bound i) = snd (nth_elem (i, bs) handle LIST _ =>
|
wenzelm@4961
|
622 |
raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
|
wenzelm@4961
|
623 |
| typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
|
wenzelm@4961
|
624 |
| typ_of (bs, t $ u) =
|
wenzelm@4961
|
625 |
let val T = typ_of (bs, t) and U = typ_of (bs, u) in
|
wenzelm@4961
|
626 |
(case T of
|
wenzelm@4961
|
627 |
Type ("fun", [T1, T2]) =>
|
wenzelm@4961
|
628 |
if T1 = U then T2 else err_appl "Incompatible operand type." bs t T u U
|
wenzelm@4961
|
629 |
| _ => err_appl "Operator not of function type." bs t T u U)
|
wenzelm@4961
|
630 |
end;
|
wenzelm@4961
|
631 |
|
wenzelm@4961
|
632 |
in typ_of ([], tm) end;
|
clasohm@0
|
633 |
|
wenzelm@2979
|
634 |
|
wenzelm@3975
|
635 |
fun certify_term sg tm =
|
wenzelm@251
|
636 |
let
|
wenzelm@3969
|
637 |
val _ = check_stale sg;
|
wenzelm@3975
|
638 |
val tsig = tsig_of sg;
|
wenzelm@3969
|
639 |
|
wenzelm@3975
|
640 |
fun show_const a T = quote a ^ " :: " ^ quote (string_of_typ sg T);
|
wenzelm@169
|
641 |
|
wenzelm@4961
|
642 |
fun atom_err (errs, Const (a, T)) =
|
wenzelm@3975
|
643 |
(case const_type sg a of
|
wenzelm@4961
|
644 |
None => ("Undeclared constant " ^ show_const a T) :: errs
|
wenzelm@3975
|
645 |
| Some U =>
|
wenzelm@4961
|
646 |
if Type.typ_instance (tsig, T, U) then errs
|
wenzelm@4961
|
647 |
else ("Illegal type for constant " ^ show_const a T) :: errs)
|
wenzelm@4961
|
648 |
| atom_err (errs, Var ((x, i), _)) =
|
wenzelm@4961
|
649 |
if i < 0 then ("Negative index for Var " ^ quote x) :: errs else errs
|
wenzelm@4961
|
650 |
| atom_err (errs, _) = errs;
|
wenzelm@251
|
651 |
|
wenzelm@251
|
652 |
val norm_tm =
|
wenzelm@2185
|
653 |
(case it_term_types (Type.typ_errors tsig) (tm, []) of
|
wenzelm@2185
|
654 |
[] => map_term_types (Type.norm_typ tsig) tm
|
wenzelm@3791
|
655 |
| errs => raise TYPE (cat_lines errs, [], [tm]));
|
nipkow@1494
|
656 |
val _ = nodup_Vars norm_tm;
|
wenzelm@251
|
657 |
in
|
wenzelm@4961
|
658 |
(case foldl_aterms atom_err ([], norm_tm) of
|
wenzelm@4961
|
659 |
[] => (norm_tm, type_check sg norm_tm, maxidx_of_term norm_tm)
|
wenzelm@3791
|
660 |
| errs => raise TYPE (cat_lines errs, [], [norm_tm]))
|
wenzelm@251
|
661 |
end;
|
wenzelm@251
|
662 |
|
wenzelm@251
|
663 |
|
wenzelm@251
|
664 |
|
wenzelm@583
|
665 |
(** infer_types **) (*exception ERROR*)
|
wenzelm@251
|
666 |
|
wenzelm@2979
|
667 |
(*
|
wenzelm@2979
|
668 |
def_type: partial map from indexnames to types (constrains Frees, Vars)
|
wenzelm@2979
|
669 |
def_sort: partial map from indexnames to sorts (constrains TFrees, TVars)
|
wenzelm@2979
|
670 |
used: list of already used type variables
|
wenzelm@2979
|
671 |
freeze: if true then generated parameters are turned into TFrees, else TVars
|
wenzelm@4249
|
672 |
|
wenzelm@4249
|
673 |
termss: lists of alternative parses (only one combination should be type-correct)
|
wenzelm@4249
|
674 |
typs: expected types
|
wenzelm@2979
|
675 |
*)
|
wenzelm@2979
|
676 |
|
wenzelm@4249
|
677 |
fun infer_types_simult sg def_type def_sort used freeze args =
|
wenzelm@251
|
678 |
let
|
wenzelm@3975
|
679 |
val tsig = tsig_of sg;
|
wenzelm@3810
|
680 |
val prt =
|
wenzelm@3810
|
681 |
setmp Syntax.show_brackets true
|
wenzelm@3810
|
682 |
(setmp long_names true (pretty_term sg));
|
wenzelm@3810
|
683 |
val prT = setmp long_names true (pretty_typ sg);
|
wenzelm@4249
|
684 |
|
wenzelm@4249
|
685 |
val termss = foldr multiply (map fst args, [[]]);
|
wenzelm@4249
|
686 |
val typs =
|
wenzelm@4249
|
687 |
map (fn (_, T) => certify_typ sg T handle TYPE (msg, _, _) => error msg) args;
|
wenzelm@169
|
688 |
|
wenzelm@4249
|
689 |
fun infer ts = OK
|
wenzelm@4249
|
690 |
(Type.infer_types prt prT tsig (const_type sg) def_type def_sort
|
wenzelm@4249
|
691 |
(intern_const sg) (intern_tycons sg) (intern_sort sg) used freeze typs ts)
|
wenzelm@4249
|
692 |
handle TYPE (msg, _, _) => Error msg;
|
clasohm@623
|
693 |
|
wenzelm@4249
|
694 |
val err_results = map infer termss;
|
wenzelm@4249
|
695 |
val errs = mapfilter get_error err_results;
|
wenzelm@4249
|
696 |
val results = mapfilter get_ok err_results;
|
wenzelm@4249
|
697 |
|
wenzelm@4249
|
698 |
val ambiguity = length termss; (* FIXME !? *)
|
wenzelm@4249
|
699 |
(* FIXME to syntax.ML!? *)
|
wenzelm@4249
|
700 |
fun ambig_msg () =
|
wenzelm@4249
|
701 |
if ambiguity > 1 andalso ambiguity <= ! Syntax.ambiguity_level
|
wenzelm@4249
|
702 |
then
|
wenzelm@4249
|
703 |
error_msg "Got more than one parse tree.\n\
|
wenzelm@3805
|
704 |
\Retry with smaller Syntax.ambiguity_level for more information."
|
nipkow@952
|
705 |
else ();
|
wenzelm@4249
|
706 |
in
|
wenzelm@4249
|
707 |
if null results then (ambig_msg (); error (cat_lines errs))
|
wenzelm@4249
|
708 |
else if length results = 1 then
|
wenzelm@4249
|
709 |
(if ambiguity > ! Syntax.ambiguity_level then
|
wenzelm@4249
|
710 |
warning "Fortunately, only one parse tree is type correct.\n\
|
wenzelm@4249
|
711 |
\You may still want to disambiguate your grammar or your input."
|
wenzelm@4249
|
712 |
else (); hd results)
|
wenzelm@4249
|
713 |
else (ambig_msg (); error ("More than one term is type correct:\n" ^
|
wenzelm@4249
|
714 |
(cat_lines (map (Pretty.string_of o prt) (flat (map fst results))))))
|
wenzelm@4249
|
715 |
end;
|
clasohm@623
|
716 |
|
wenzelm@4249
|
717 |
|
wenzelm@4249
|
718 |
fun infer_types sg def_type def_sort used freeze tsT =
|
wenzelm@4249
|
719 |
apfst hd (infer_types_simult sg def_type def_sort used freeze [tsT]);
|
wenzelm@251
|
720 |
|
wenzelm@251
|
721 |
|
wenzelm@2979
|
722 |
|
clasohm@623
|
723 |
(** extend signature **) (*exception ERROR*)
|
clasohm@623
|
724 |
|
wenzelm@620
|
725 |
(** signature extension functions **) (*exception ERROR*)
|
wenzelm@386
|
726 |
|
wenzelm@3791
|
727 |
fun decls_of path name_of mfixs =
|
wenzelm@3810
|
728 |
map (fn (x, y, mx) => (full path (name_of x mx), y)) mfixs;
|
wenzelm@3791
|
729 |
|
wenzelm@3791
|
730 |
fun no_read _ _ _ decl = decl;
|
wenzelm@386
|
731 |
|
wenzelm@386
|
732 |
|
wenzelm@386
|
733 |
(* add default sort *)
|
wenzelm@386
|
734 |
|
wenzelm@3967
|
735 |
fun ext_defsort int (syn, tsig, ctab, (path, spaces), data) S =
|
wenzelm@3791
|
736 |
(syn, Type.ext_tsig_defsort tsig (if int then intrn_sort spaces S else S),
|
wenzelm@3967
|
737 |
ctab, (path, spaces), data);
|
wenzelm@386
|
738 |
|
wenzelm@386
|
739 |
|
wenzelm@386
|
740 |
(* add type constructors *)
|
wenzelm@386
|
741 |
|
wenzelm@3967
|
742 |
fun ext_types (syn, tsig, ctab, (path, spaces), data) types =
|
wenzelm@3791
|
743 |
let val decls = decls_of path Syntax.type_name types in
|
wenzelm@3791
|
744 |
(Syntax.extend_type_gram syn types,
|
wenzelm@3791
|
745 |
Type.ext_tsig_types tsig decls, ctab,
|
wenzelm@3967
|
746 |
(path, add_names spaces typeK (map fst decls)), data)
|
wenzelm@3791
|
747 |
end;
|
wenzelm@386
|
748 |
|
wenzelm@4844
|
749 |
fun ext_nonterminals sg nonterms =
|
wenzelm@4844
|
750 |
ext_types sg (map (fn n => (n, 0, Syntax.NoSyn)) nonterms);
|
wenzelm@4844
|
751 |
|
wenzelm@386
|
752 |
|
wenzelm@386
|
753 |
(* add type abbreviations *)
|
wenzelm@386
|
754 |
|
wenzelm@3791
|
755 |
fun read_abbr syn tsig spaces (t, vs, rhs_src) =
|
wenzelm@4227
|
756 |
(t, vs, rd_raw_typ syn tsig spaces (K None) rhs_src)
|
wenzelm@386
|
757 |
handle ERROR => error ("in type abbreviation " ^ t);
|
wenzelm@386
|
758 |
|
wenzelm@3967
|
759 |
fun ext_abbrs rd_abbr (syn, tsig, ctab, (path, spaces), data) abbrs =
|
wenzelm@386
|
760 |
let
|
wenzelm@386
|
761 |
fun mfix_of (t, vs, _, mx) = (t, length vs, mx);
|
wenzelm@3791
|
762 |
val syn' = Syntax.extend_type_gram syn (map mfix_of abbrs);
|
wenzelm@386
|
763 |
|
wenzelm@3791
|
764 |
val abbrs' =
|
wenzelm@3791
|
765 |
map (fn (t, vs, rhs, mx) =>
|
wenzelm@3810
|
766 |
(full path (Syntax.type_name t mx), vs, rhs)) abbrs;
|
wenzelm@3805
|
767 |
val spaces' = add_names spaces typeK (map #1 abbrs');
|
wenzelm@3805
|
768 |
val decls = map (rd_abbr syn' tsig spaces') abbrs';
|
wenzelm@386
|
769 |
in
|
wenzelm@3967
|
770 |
(syn', Type.ext_tsig_abbrs tsig decls, ctab, (path, spaces'), data)
|
wenzelm@386
|
771 |
end;
|
wenzelm@386
|
772 |
|
wenzelm@3791
|
773 |
fun ext_tyabbrs abbrs = ext_abbrs read_abbr abbrs;
|
wenzelm@3791
|
774 |
fun ext_tyabbrs_i abbrs = ext_abbrs no_read abbrs;
|
wenzelm@386
|
775 |
|
wenzelm@386
|
776 |
|
wenzelm@386
|
777 |
(* add type arities *)
|
wenzelm@386
|
778 |
|
wenzelm@3967
|
779 |
fun ext_arities int (syn, tsig, ctab, (path, spaces), data) arities =
|
wenzelm@386
|
780 |
let
|
wenzelm@3791
|
781 |
fun intrn_arity (c, Ss, S) =
|
wenzelm@3791
|
782 |
(intrn spaces typeK c, map (intrn_sort spaces) Ss, intrn_sort spaces S);
|
wenzelm@3791
|
783 |
val intrn = if int then map intrn_arity else I;
|
wenzelm@3791
|
784 |
val tsig' = Type.ext_tsig_arities tsig (intrn arities);
|
wenzelm@3791
|
785 |
val log_types = Type.logical_types tsig';
|
wenzelm@386
|
786 |
in
|
wenzelm@3967
|
787 |
(Syntax.extend_log_types syn log_types, tsig', ctab, (path, spaces), data)
|
wenzelm@386
|
788 |
end;
|
wenzelm@386
|
789 |
|
wenzelm@386
|
790 |
|
wenzelm@386
|
791 |
(* add term constants and syntax *)
|
wenzelm@386
|
792 |
|
wenzelm@3805
|
793 |
fun const_name path c mx =
|
wenzelm@3810
|
794 |
full path (Syntax.const_name c mx);
|
wenzelm@3805
|
795 |
|
wenzelm@386
|
796 |
fun err_in_const c =
|
wenzelm@386
|
797 |
error ("in declaration of constant " ^ quote c);
|
wenzelm@386
|
798 |
|
wenzelm@386
|
799 |
fun err_dup_consts cs =
|
wenzelm@386
|
800 |
error ("Duplicate declaration of constant(s) " ^ commas_quote cs);
|
wenzelm@386
|
801 |
|
wenzelm@251
|
802 |
|
wenzelm@3805
|
803 |
fun read_const syn tsig (path, spaces) (c, ty_src, mx) =
|
wenzelm@4227
|
804 |
(c, rd_raw_typ syn tsig spaces (K None) ty_src, mx)
|
wenzelm@3805
|
805 |
handle ERROR => err_in_const (const_name path c mx);
|
wenzelm@386
|
806 |
|
wenzelm@3967
|
807 |
fun ext_cnsts rd_const syn_only prmode (syn, tsig, ctab, (path, spaces), data) raw_consts =
|
wenzelm@386
|
808 |
let
|
wenzelm@2979
|
809 |
fun prep_const (c, ty, mx) =
|
wenzelm@3791
|
810 |
(c, compress_type (Type.varifyT (Type.cert_typ tsig (Type.no_tvars ty))), mx)
|
wenzelm@3791
|
811 |
handle TYPE (msg, _, _) =>
|
wenzelm@3805
|
812 |
(error_msg msg; err_in_const (const_name path c mx));
|
wenzelm@386
|
813 |
|
wenzelm@3805
|
814 |
val consts = map (prep_const o rd_const syn tsig (path, spaces)) raw_consts;
|
wenzelm@386
|
815 |
val decls =
|
wenzelm@386
|
816 |
if syn_only then []
|
wenzelm@3791
|
817 |
else decls_of path Syntax.const_name consts;
|
wenzelm@386
|
818 |
in
|
wenzelm@2197
|
819 |
(Syntax.extend_const_gram syn prmode consts, tsig,
|
wenzelm@4489
|
820 |
Symtab.extend (ctab, decls)
|
wenzelm@3791
|
821 |
handle Symtab.DUPS cs => err_dup_consts cs,
|
wenzelm@3967
|
822 |
(path, add_names spaces constK (map fst decls)), data)
|
wenzelm@386
|
823 |
end;
|
wenzelm@386
|
824 |
|
wenzelm@4007
|
825 |
fun ext_consts_i sg = ext_cnsts no_read false ("", true) sg;
|
wenzelm@4007
|
826 |
fun ext_consts sg = ext_cnsts read_const false ("", true) sg;
|
wenzelm@4007
|
827 |
fun ext_syntax_i sg = ext_cnsts no_read true ("", true) sg;
|
wenzelm@4007
|
828 |
fun ext_syntax sg = ext_cnsts read_const true ("", true) sg;
|
wenzelm@3791
|
829 |
fun ext_modesyntax_i sg (prmode, consts) = ext_cnsts no_read true prmode sg consts;
|
wenzelm@2197
|
830 |
fun ext_modesyntax sg (prmode, consts) = ext_cnsts read_const true prmode sg consts;
|
wenzelm@386
|
831 |
|
wenzelm@386
|
832 |
|
wenzelm@386
|
833 |
(* add type classes *)
|
wenzelm@386
|
834 |
|
wenzelm@386
|
835 |
fun const_of_class c = c ^ "_class";
|
wenzelm@386
|
836 |
|
wenzelm@386
|
837 |
fun class_of_const c_class =
|
wenzelm@386
|
838 |
let
|
wenzelm@3791
|
839 |
val c = implode (take (size c_class - size "_class", explode c_class));
|
wenzelm@386
|
840 |
in
|
wenzelm@386
|
841 |
if const_of_class c = c_class then c
|
wenzelm@3791
|
842 |
else raise TERM ("class_of_const: bad name " ^ quote c_class, [])
|
wenzelm@386
|
843 |
end;
|
wenzelm@386
|
844 |
|
wenzelm@386
|
845 |
|
wenzelm@3967
|
846 |
fun ext_classes int (syn, tsig, ctab, (path, spaces), data) classes =
|
wenzelm@386
|
847 |
let
|
wenzelm@562
|
848 |
val names = map fst classes;
|
wenzelm@386
|
849 |
val consts =
|
wenzelm@386
|
850 |
map (fn c => (const_of_class c, a_itselfT --> propT, NoSyn)) names;
|
wenzelm@3791
|
851 |
|
wenzelm@3810
|
852 |
val full_names = map (full path) names;
|
wenzelm@3791
|
853 |
val spaces' = add_names spaces classK full_names;
|
wenzelm@3791
|
854 |
val intrn = if int then map (intrn_class spaces') else I;
|
wenzelm@3791
|
855 |
val classes' =
|
wenzelm@3791
|
856 |
ListPair.map (fn (c, (_, cs)) => (c, intrn cs)) (full_names, classes);
|
wenzelm@386
|
857 |
in
|
wenzelm@386
|
858 |
ext_consts_i
|
wenzelm@3791
|
859 |
(Syntax.extend_consts syn names,
|
wenzelm@3967
|
860 |
Type.ext_tsig_classes tsig classes', ctab, (path, spaces'), data)
|
wenzelm@3791
|
861 |
consts
|
wenzelm@386
|
862 |
end;
|
wenzelm@386
|
863 |
|
wenzelm@386
|
864 |
|
wenzelm@2963
|
865 |
(* add to classrel *)
|
wenzelm@421
|
866 |
|
wenzelm@3967
|
867 |
fun ext_classrel int (syn, tsig, ctab, (path, spaces), data) pairs =
|
wenzelm@3791
|
868 |
let val intrn = if int then map (pairself (intrn_class spaces)) else I in
|
wenzelm@3967
|
869 |
(syn, Type.ext_tsig_classrel tsig (intrn pairs), ctab, (path, spaces), data)
|
wenzelm@3791
|
870 |
end;
|
wenzelm@421
|
871 |
|
wenzelm@421
|
872 |
|
wenzelm@4619
|
873 |
(* add translation rules *)
|
wenzelm@4619
|
874 |
|
wenzelm@4619
|
875 |
fun ext_trrules (syn, tsig, ctab, (path, spaces), data) args =
|
wenzelm@4619
|
876 |
(Syntax.extend_trrules syn
|
wenzelm@4619
|
877 |
(map (Syntax.map_trrule (fn (root, str) => (intrn spaces typeK root, str))) args),
|
wenzelm@4619
|
878 |
tsig, ctab, (path, spaces), data);
|
wenzelm@4619
|
879 |
|
wenzelm@4619
|
880 |
|
wenzelm@1159
|
881 |
(* add to syntax *)
|
wenzelm@386
|
882 |
|
wenzelm@3967
|
883 |
fun ext_syn extfun (syn, tsig, ctab, names, data) args =
|
wenzelm@3967
|
884 |
(extfun syn args, tsig, ctab, names, data);
|
wenzelm@3791
|
885 |
|
wenzelm@3791
|
886 |
|
wenzelm@3791
|
887 |
(* add to path *)
|
wenzelm@3791
|
888 |
|
wenzelm@4844
|
889 |
fun ext_path (syn, tsig, ctab, (path, spaces), data) elems =
|
wenzelm@3791
|
890 |
let
|
wenzelm@3791
|
891 |
val path' =
|
wenzelm@4844
|
892 |
if elems = ".." andalso not (null path) then fst (split_last path)
|
wenzelm@4844
|
893 |
else if elems = "/" then []
|
wenzelm@4844
|
894 |
else path @ NameSpace.unpack elems;
|
wenzelm@3791
|
895 |
in
|
wenzelm@3967
|
896 |
(syn, tsig, ctab, (path', spaces), data)
|
wenzelm@3791
|
897 |
end;
|
wenzelm@3791
|
898 |
|
wenzelm@3791
|
899 |
|
wenzelm@3791
|
900 |
(* add to name space *)
|
wenzelm@3791
|
901 |
|
wenzelm@3967
|
902 |
fun ext_space (syn, tsig, ctab, (path, spaces), data) (kind, names) =
|
wenzelm@3967
|
903 |
(syn, tsig, ctab, (path, add_names spaces kind names), data);
|
wenzelm@386
|
904 |
|
wenzelm@386
|
905 |
|
wenzelm@3967
|
906 |
(* signature data *)
|
wenzelm@386
|
907 |
|
wenzelm@4256
|
908 |
fun ext_init_data sg (syn, tsig, ctab, names, data) (kind, (e, ext, mrg, prt)) =
|
wenzelm@4256
|
909 |
(syn, tsig, ctab, names, init_data_sg sg data kind e ext mrg prt);
|
wenzelm@386
|
910 |
|
wenzelm@4998
|
911 |
fun ext_put_data sg (syn, tsig, ctab, names, data) (kind, f, x) =
|
wenzelm@4998
|
912 |
(syn, tsig, ctab, names, put_data_sg sg data kind f x);
|
wenzelm@386
|
913 |
|
wenzelm@386
|
914 |
|
wenzelm@386
|
915 |
(* the external interfaces *)
|
wenzelm@386
|
916 |
|
wenzelm@4998
|
917 |
val add_classes = extend_sign true (ext_classes true) "#";
|
wenzelm@4998
|
918 |
val add_classes_i = extend_sign true (ext_classes false) "#";
|
wenzelm@4998
|
919 |
val add_classrel = extend_sign true (ext_classrel true) "#";
|
wenzelm@4998
|
920 |
val add_classrel_i = extend_sign true (ext_classrel false) "#";
|
wenzelm@4998
|
921 |
val add_defsort = extend_sign true (ext_defsort true) "#";
|
wenzelm@4998
|
922 |
val add_defsort_i = extend_sign true (ext_defsort false) "#";
|
wenzelm@4998
|
923 |
val add_types = extend_sign true ext_types "#";
|
wenzelm@4998
|
924 |
val add_nonterminals = extend_sign true ext_nonterminals "#";
|
wenzelm@4998
|
925 |
val add_tyabbrs = extend_sign true ext_tyabbrs "#";
|
wenzelm@4998
|
926 |
val add_tyabbrs_i = extend_sign true ext_tyabbrs_i "#";
|
wenzelm@4998
|
927 |
val add_arities = extend_sign true (ext_arities true) "#";
|
wenzelm@4998
|
928 |
val add_arities_i = extend_sign true (ext_arities false) "#";
|
wenzelm@4998
|
929 |
val add_consts = extend_sign true ext_consts "#";
|
wenzelm@4998
|
930 |
val add_consts_i = extend_sign true ext_consts_i "#";
|
wenzelm@4998
|
931 |
val add_syntax = extend_sign true ext_syntax "#";
|
wenzelm@4998
|
932 |
val add_syntax_i = extend_sign true ext_syntax_i "#";
|
wenzelm@4998
|
933 |
val add_modesyntax = extend_sign true ext_modesyntax "#";
|
wenzelm@4998
|
934 |
val add_modesyntax_i = extend_sign true ext_modesyntax_i "#";
|
wenzelm@4998
|
935 |
val add_trfuns = extend_sign true (ext_syn Syntax.extend_trfuns) "#";
|
wenzelm@4998
|
936 |
val add_trfunsT = extend_sign true (ext_syn Syntax.extend_trfunsT) "#";
|
wenzelm@4998
|
937 |
val add_tokentrfuns = extend_sign true (ext_syn Syntax.extend_tokentrfuns) "#";
|
wenzelm@4998
|
938 |
val add_trrules = extend_sign true ext_trrules "#";
|
wenzelm@4998
|
939 |
val add_trrules_i = extend_sign true (ext_syn Syntax.extend_trrules_i) "#";
|
wenzelm@4998
|
940 |
val add_path = extend_sign true ext_path "#";
|
wenzelm@4998
|
941 |
val add_space = extend_sign true ext_space "#";
|
wenzelm@4998
|
942 |
fun init_data arg sg = extend_sign true (ext_init_data sg) "#" arg sg;
|
wenzelm@4998
|
943 |
fun put_data k f x sg = extend_sign true (ext_put_data sg) "#" (k, f, x) sg;
|
wenzelm@4998
|
944 |
fun add_name name sg = extend_sign true K name () sg;
|
wenzelm@4998
|
945 |
fun prep_ext sg = extend_sign false K "#" () sg;
|
wenzelm@386
|
946 |
|
wenzelm@386
|
947 |
|
wenzelm@3867
|
948 |
|
wenzelm@4017
|
949 |
(** merge signatures **) (*exception TERM*)
|
wenzelm@3867
|
950 |
|
wenzelm@4228
|
951 |
(* merge_stamps *)
|
wenzelm@4228
|
952 |
|
wenzelm@4228
|
953 |
fun merge_stamps stamps1 stamps2 =
|
wenzelm@4228
|
954 |
let val stamps = merge_rev_lists stamps1 stamps2 in
|
wenzelm@4228
|
955 |
(case duplicates (map ! stamps) of
|
wenzelm@4228
|
956 |
[] => stamps
|
wenzelm@4228
|
957 |
| dups => raise TERM ("Attempt to merge different versions of theories "
|
wenzelm@4228
|
958 |
^ commas_quote dups, []))
|
wenzelm@4228
|
959 |
end;
|
wenzelm@4228
|
960 |
|
wenzelm@4228
|
961 |
|
wenzelm@4627
|
962 |
(* implicit merge -- trivial only *)
|
wenzelm@3877
|
963 |
|
wenzelm@4228
|
964 |
fun merge_refs (sgr1 as SgRef (Some (ref (sg1 as Sg ({stamps = s1, ...}, _)))),
|
wenzelm@4228
|
965 |
sgr2 as SgRef (Some (ref (sg2 as Sg ({stamps = s2, ...}, _))))) =
|
wenzelm@3967
|
966 |
if fast_subsig (sg2, sg1) then sgr1
|
wenzelm@3967
|
967 |
else if fast_subsig (sg1, sg2) then sgr2
|
wenzelm@3967
|
968 |
else if subsig (sg2, sg1) then sgr1
|
wenzelm@3967
|
969 |
else if subsig (sg1, sg2) then sgr2
|
wenzelm@4228
|
970 |
else (merge_stamps s1 s2; (*check for different versions*)
|
wenzelm@4228
|
971 |
raise TERM ("Attempt to do non-trivial merge of signatures", []))
|
wenzelm@3967
|
972 |
| merge_refs _ = sys_error "Sign.merge_refs";
|
wenzelm@3867
|
973 |
|
wenzelm@4627
|
974 |
val merge = deref o merge_refs o pairself self_ref;
|
wenzelm@4627
|
975 |
|
wenzelm@3867
|
976 |
|
wenzelm@3967
|
977 |
(* proper merge *)
|
wenzelm@143
|
978 |
|
wenzelm@3967
|
979 |
fun merge_aux (sg1, sg2) =
|
wenzelm@3967
|
980 |
if subsig (sg2, sg1) then sg1
|
wenzelm@251
|
981 |
else if subsig (sg1, sg2) then sg2
|
wenzelm@386
|
982 |
else if is_draft sg1 orelse is_draft sg2 then
|
wenzelm@3967
|
983 |
raise TERM ("Attempt to merge draft signatures", [])
|
wenzelm@251
|
984 |
else
|
wenzelm@251
|
985 |
(*neither is union already; must form union*)
|
wenzelm@251
|
986 |
let
|
wenzelm@3975
|
987 |
val Sg ({id = _, stamps = stamps1}, {self = _, tsig = tsig1, const_tab = const_tab1,
|
wenzelm@3975
|
988 |
syn = syn1, path = _, spaces = spaces1, data = data1}) = sg1;
|
wenzelm@3975
|
989 |
val Sg ({id = _, stamps = stamps2}, {self = _, tsig = tsig2, const_tab = const_tab2,
|
wenzelm@3975
|
990 |
syn = syn2, path = _, spaces = spaces2, data = data2}) = sg2;
|
wenzelm@386
|
991 |
|
wenzelm@3967
|
992 |
val id = ref "";
|
wenzelm@3975
|
993 |
val self_ref = ref sg1; (*dummy value*)
|
wenzelm@3967
|
994 |
val self = SgRef (Some self_ref);
|
wenzelm@402
|
995 |
|
wenzelm@4228
|
996 |
val stamps = merge_stamps stamps1 stamps2;
|
wenzelm@2185
|
997 |
val tsig = Type.merge_tsigs (tsig1, tsig2);
|
wenzelm@251
|
998 |
val const_tab = Symtab.merge (op =) (const_tab1, const_tab2)
|
wenzelm@386
|
999 |
handle Symtab.DUPS cs =>
|
wenzelm@3791
|
1000 |
raise TERM ("Incompatible types for constant(s) " ^ commas_quote cs, []);
|
wenzelm@386
|
1001 |
val syn = Syntax.merge_syntaxes syn1 syn2;
|
wenzelm@3791
|
1002 |
|
wenzelm@3967
|
1003 |
val path = [];
|
wenzelm@3791
|
1004 |
val kinds = distinct (map fst (spaces1 @ spaces2));
|
wenzelm@3791
|
1005 |
val spaces =
|
wenzelm@3791
|
1006 |
kinds ~~
|
wenzelm@3791
|
1007 |
ListPair.map NameSpace.merge
|
wenzelm@3791
|
1008 |
(map (space_of spaces1) kinds, map (space_of spaces2) kinds);
|
wenzelm@3867
|
1009 |
|
wenzelm@4256
|
1010 |
val data = merge_data (data1, data2);
|
wenzelm@3967
|
1011 |
|
wenzelm@3967
|
1012 |
val sign = make_sign (id, self, tsig, const_tab, syn, path, spaces, data, stamps);
|
wenzelm@251
|
1013 |
in
|
wenzelm@3967
|
1014 |
self_ref := sign; sign
|
wenzelm@251
|
1015 |
end;
|
wenzelm@143
|
1016 |
|
wenzelm@4627
|
1017 |
fun nontriv_merge sg1_sg2 =
|
wenzelm@3967
|
1018 |
(case handle_error merge_aux sg1_sg2 of
|
wenzelm@3805
|
1019 |
OK sg => sg
|
wenzelm@3805
|
1020 |
| Error msg => raise TERM (msg, []));
|
wenzelm@3805
|
1021 |
|
clasohm@0
|
1022 |
|
clasohm@0
|
1023 |
|
wenzelm@3995
|
1024 |
(** partial Pure signature **)
|
clasohm@0
|
1025 |
|
wenzelm@3967
|
1026 |
val dummy_sg = make_sign (ref "", SgRef None, Type.tsig0,
|
wenzelm@4489
|
1027 |
Symtab.empty, Syntax.pure_syn, [], [], empty_data, []);
|
wenzelm@3967
|
1028 |
|
wenzelm@3995
|
1029 |
val pre_pure =
|
wenzelm@3967
|
1030 |
create_sign (SgRef (Some (ref dummy_sg))) [] "#"
|
wenzelm@4489
|
1031 |
(Syntax.pure_syn, Type.tsig0, Symtab.empty, ([], []), empty_data);
|
clasohm@0
|
1032 |
|
wenzelm@3791
|
1033 |
|
clasohm@0
|
1034 |
end;
|
wenzelm@3791
|
1035 |
|
wenzelm@3791
|
1036 |
|
wenzelm@3791
|
1037 |
val long_names = Sign.long_names;
|