haftmann@24219
|
1 |
(* Title: Pure/Isar/code.ML
|
haftmann@24219
|
2 |
Author: Florian Haftmann, TU Muenchen
|
haftmann@24219
|
3 |
|
haftmann@34160
|
4 |
Abstract executable ingredients of theory. Management of data
|
haftmann@34160
|
5 |
dependent on executable ingredients as synchronized cache; purged
|
haftmann@34160
|
6 |
on any change of underlying executable ingredients.
|
haftmann@24219
|
7 |
*)
|
haftmann@24219
|
8 |
|
haftmann@24219
|
9 |
signature CODE =
|
haftmann@24219
|
10 |
sig
|
haftmann@31957
|
11 |
(*constants*)
|
haftmann@31957
|
12 |
val check_const: theory -> term -> string
|
haftmann@31957
|
13 |
val read_bare_const: theory -> string -> string * typ
|
haftmann@31957
|
14 |
val read_const: theory -> string -> string
|
haftmann@31962
|
15 |
val string_of_const: theory -> string -> string
|
haftmann@33906
|
16 |
val cert_signature: theory -> typ -> typ
|
haftmann@33906
|
17 |
val read_signature: theory -> string -> typ
|
haftmann@33906
|
18 |
val const_typ: theory -> string -> typ
|
haftmann@33906
|
19 |
val subst_signatures: theory -> term -> term
|
haftmann@31962
|
20 |
val args_number: theory -> string -> int
|
haftmann@31957
|
21 |
|
haftmann@31156
|
22 |
(*constructor sets*)
|
haftmann@31156
|
23 |
val constrset_of_consts: theory -> (string * typ) list
|
haftmann@31156
|
24 |
-> string * ((string * sort) list * (string * typ list) list)
|
haftmann@31156
|
25 |
|
haftmann@34313
|
26 |
(*code equations and certificates*)
|
haftmann@31962
|
27 |
val mk_eqn: theory -> thm * bool -> thm * bool
|
haftmann@31962
|
28 |
val mk_eqn_warning: theory -> thm -> (thm * bool) option
|
haftmann@31962
|
29 |
val mk_eqn_liberal: theory -> thm -> (thm * bool) option
|
haftmann@31156
|
30 |
val assert_eqn: theory -> thm * bool -> thm * bool
|
haftmann@31957
|
31 |
val const_typ_eqn: theory -> thm -> string * typ
|
haftmann@34895
|
32 |
val expand_eta: theory -> int -> thm -> thm
|
haftmann@34895
|
33 |
type cert
|
haftmann@34891
|
34 |
val empty_cert: theory -> string -> cert
|
haftmann@34891
|
35 |
val cert_of_eqns: theory -> string -> (thm * bool) list -> cert
|
haftmann@34313
|
36 |
val constrain_cert: theory -> sort list -> cert -> cert
|
haftmann@35226
|
37 |
val typargs_deps_of_cert: theory -> cert -> (string * sort) list * (string * typ list) list
|
haftmann@36209
|
38 |
val equations_of_cert: theory -> cert -> ((string * sort) list * typ)
|
haftmann@36209
|
39 |
* (((term * string option) list * (term * string option)) * (thm option * bool)) list
|
haftmann@35226
|
40 |
val bare_thms_of_cert: theory -> cert -> thm list
|
haftmann@34895
|
41 |
val pretty_cert: theory -> cert -> Pretty.T list
|
haftmann@31156
|
42 |
|
haftmann@31962
|
43 |
(*executable code*)
|
haftmann@33906
|
44 |
val add_type: string -> theory -> theory
|
haftmann@33906
|
45 |
val add_type_cmd: string -> theory -> theory
|
haftmann@33906
|
46 |
val add_signature: string * typ -> theory -> theory
|
haftmann@33906
|
47 |
val add_signature_cmd: string * string -> theory -> theory
|
haftmann@31156
|
48 |
val add_datatype: (string * typ) list -> theory -> theory
|
haftmann@31156
|
49 |
val add_datatype_cmd: string list -> theory -> theory
|
haftmann@35299
|
50 |
val datatype_interpretation:
|
haftmann@35299
|
51 |
(string * ((string * sort) list * (string * typ list) list)
|
haftmann@35299
|
52 |
-> theory -> theory) -> theory -> theory
|
haftmann@36112
|
53 |
val add_abstype: thm -> theory -> theory
|
haftmann@35299
|
54 |
val abstype_interpretation:
|
haftmann@35299
|
55 |
(string * ((string * sort) list * ((string * typ) * (string * thm)))
|
haftmann@31156
|
56 |
-> theory -> theory) -> theory -> theory
|
haftmann@28368
|
57 |
val add_eqn: thm -> theory -> theory
|
haftmann@31088
|
58 |
val add_nbe_eqn: thm -> theory -> theory
|
haftmann@28368
|
59 |
val add_default_eqn: thm -> theory -> theory
|
haftmann@28703
|
60 |
val add_default_eqn_attribute: attribute
|
haftmann@28703
|
61 |
val add_default_eqn_attrib: Attrib.src
|
haftmann@37400
|
62 |
val add_nbe_default_eqn: thm -> theory -> theory
|
haftmann@37400
|
63 |
val add_nbe_default_eqn_attribute: attribute
|
haftmann@37400
|
64 |
val add_nbe_default_eqn_attrib: Attrib.src
|
haftmann@28368
|
65 |
val del_eqn: thm -> theory -> theory
|
haftmann@28368
|
66 |
val del_eqns: string -> theory -> theory
|
haftmann@24844
|
67 |
val add_case: thm -> theory -> theory
|
haftmann@24844
|
68 |
val add_undefined: string -> theory -> theory
|
haftmann@37423
|
69 |
val get_type: theory -> string -> ((string * sort) list * ((string * string list) * typ list) list)
|
haftmann@35299
|
70 |
val get_type_of_constr_or_abstr: theory -> string -> (string * bool) option
|
haftmann@35226
|
71 |
val is_constr: theory -> string -> bool
|
haftmann@35226
|
72 |
val is_abstr: theory -> string -> bool
|
haftmann@34891
|
73 |
val get_cert: theory -> ((thm * bool) list -> (thm * bool) list) -> string -> cert
|
haftmann@29960
|
74 |
val get_case_scheme: theory -> string -> (int * (int * string list)) option
|
haftmann@37413
|
75 |
val get_case_cong: theory -> string -> thm option
|
haftmann@31890
|
76 |
val undefineds: theory -> string list
|
haftmann@24219
|
77 |
val print_codesetup: theory -> unit
|
haftmann@31957
|
78 |
|
haftmann@31957
|
79 |
(*infrastructure*)
|
haftmann@31998
|
80 |
val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory
|
haftmann@24219
|
81 |
end;
|
haftmann@24219
|
82 |
|
haftmann@24219
|
83 |
signature CODE_DATA_ARGS =
|
haftmann@24219
|
84 |
sig
|
haftmann@24219
|
85 |
type T
|
haftmann@24219
|
86 |
val empty: T
|
haftmann@24219
|
87 |
end;
|
haftmann@24219
|
88 |
|
haftmann@24219
|
89 |
signature CODE_DATA =
|
haftmann@24219
|
90 |
sig
|
haftmann@24219
|
91 |
type T
|
haftmann@39641
|
92 |
val change: theory option -> (T -> T) -> T
|
haftmann@39641
|
93 |
val change_yield: theory option -> (T -> 'a * T) -> 'a * T
|
haftmann@24219
|
94 |
end;
|
haftmann@24219
|
95 |
|
haftmann@24219
|
96 |
signature PRIVATE_CODE =
|
haftmann@24219
|
97 |
sig
|
haftmann@24219
|
98 |
include CODE
|
haftmann@34160
|
99 |
val declare_data: Object.T -> serial
|
haftmann@24219
|
100 |
val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
|
haftmann@34246
|
101 |
-> theory -> ('a -> 'b * 'a) -> 'b * 'a
|
haftmann@24219
|
102 |
end;
|
haftmann@24219
|
103 |
|
haftmann@24219
|
104 |
structure Code : PRIVATE_CODE =
|
haftmann@24219
|
105 |
struct
|
haftmann@24219
|
106 |
|
haftmann@31962
|
107 |
(** auxiliary **)
|
haftmann@31962
|
108 |
|
haftmann@31962
|
109 |
(* printing *)
|
haftmann@31156
|
110 |
|
wenzelm@39393
|
111 |
fun string_of_typ thy =
|
wenzelm@39393
|
112 |
Syntax.string_of_typ (Config.put show_sorts true (Syntax.init_pretty_global thy));
|
haftmann@31962
|
113 |
|
haftmann@31156
|
114 |
fun string_of_const thy c = case AxClass.inst_of_param thy c
|
haftmann@31156
|
115 |
of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco)
|
haftmann@31156
|
116 |
| NONE => Sign.extern_const thy c;
|
haftmann@31156
|
117 |
|
haftmann@31156
|
118 |
|
haftmann@31962
|
119 |
(* constants *)
|
haftmann@31156
|
120 |
|
haftmann@33906
|
121 |
fun typ_equiv tys = Type.raw_instance tys andalso Type.raw_instance (swap tys);
|
haftmann@33906
|
122 |
|
haftmann@31962
|
123 |
fun check_bare_const thy t = case try dest_Const t
|
haftmann@31962
|
124 |
of SOME c_ty => c_ty
|
haftmann@31962
|
125 |
| NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
|
haftmann@31962
|
126 |
|
haftmann@31962
|
127 |
fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy;
|
haftmann@31962
|
128 |
|
haftmann@31962
|
129 |
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
|
haftmann@31962
|
130 |
|
haftmann@31962
|
131 |
fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy;
|
haftmann@31156
|
132 |
|
haftmann@32872
|
133 |
|
haftmann@31962
|
134 |
(** data store **)
|
haftmann@31962
|
135 |
|
haftmann@35226
|
136 |
(* datatypes *)
|
haftmann@31962
|
137 |
|
haftmann@35226
|
138 |
datatype typ_spec = Constructors of (string * typ list) list
|
haftmann@35226
|
139 |
| Abstractor of (string * typ) * (string * thm);
|
haftmann@31962
|
140 |
|
haftmann@35226
|
141 |
fun constructors_of (Constructors cos) = (cos, false)
|
haftmann@35226
|
142 |
| constructors_of (Abstractor ((co, ty), _)) = ([(co, [ty])], true);
|
haftmann@31962
|
143 |
|
haftmann@31962
|
144 |
|
haftmann@35226
|
145 |
(* functions *)
|
haftmann@35226
|
146 |
|
haftmann@37435
|
147 |
datatype fun_spec = Default of (thm * bool) list * (thm * bool) list lazy
|
haftmann@35226
|
148 |
| Eqns of (thm * bool) list
|
haftmann@35226
|
149 |
| Proj of term * string
|
haftmann@35226
|
150 |
| Abstr of thm * string;
|
haftmann@35226
|
151 |
|
haftmann@37435
|
152 |
val empty_fun_spec = Default ([], Lazy.value []);
|
haftmann@35226
|
153 |
|
haftmann@35226
|
154 |
fun is_default (Default _) = true
|
haftmann@35226
|
155 |
| is_default _ = false;
|
haftmann@35226
|
156 |
|
haftmann@35226
|
157 |
fun associated_abstype (Abstr (_, tyco)) = SOME tyco
|
haftmann@35226
|
158 |
| associated_abstype _ = NONE;
|
haftmann@31962
|
159 |
|
haftmann@31962
|
160 |
|
haftmann@31962
|
161 |
(* executable code data *)
|
haftmann@31962
|
162 |
|
haftmann@31962
|
163 |
datatype spec = Spec of {
|
haftmann@31962
|
164 |
history_concluded: bool,
|
haftmann@33906
|
165 |
signatures: int Symtab.table * typ Symtab.table,
|
haftmann@35226
|
166 |
functions: ((bool * fun_spec) * (serial * fun_spec) list) Symtab.table
|
haftmann@31962
|
167 |
(*with explicit history*),
|
haftmann@35299
|
168 |
types: ((serial * ((string * sort) list * typ_spec)) list) Symtab.table
|
haftmann@31962
|
169 |
(*with explicit history*),
|
haftmann@37413
|
170 |
cases: ((int * (int * string list)) * thm) Symtab.table * unit Symtab.table
|
haftmann@31962
|
171 |
};
|
haftmann@31962
|
172 |
|
haftmann@35299
|
173 |
fun make_spec (history_concluded, ((signatures, functions), (types, cases))) =
|
haftmann@33906
|
174 |
Spec { history_concluded = history_concluded,
|
haftmann@35299
|
175 |
signatures = signatures, functions = functions, types = types, cases = cases };
|
haftmann@33906
|
176 |
fun map_spec f (Spec { history_concluded = history_concluded, signatures = signatures,
|
haftmann@35299
|
177 |
functions = functions, types = types, cases = cases }) =
|
haftmann@35299
|
178 |
make_spec (f (history_concluded, ((signatures, functions), (types, cases))));
|
haftmann@35226
|
179 |
fun merge_spec (Spec { history_concluded = _, signatures = (tycos1, sigs1), functions = functions1,
|
haftmann@35299
|
180 |
types = types1, cases = (cases1, undefs1) },
|
haftmann@35226
|
181 |
Spec { history_concluded = _, signatures = (tycos2, sigs2), functions = functions2,
|
haftmann@35299
|
182 |
types = types2, cases = (cases2, undefs2) }) =
|
haftmann@31962
|
183 |
let
|
haftmann@33906
|
184 |
val signatures = (Symtab.merge (op =) (tycos1, tycos2),
|
haftmann@33906
|
185 |
Symtab.merge typ_equiv (sigs1, sigs2));
|
haftmann@35226
|
186 |
fun merge_functions ((_, history1), (_, history2)) =
|
haftmann@31962
|
187 |
let
|
haftmann@31962
|
188 |
val raw_history = AList.merge (op = : serial * serial -> bool)
|
haftmann@35226
|
189 |
(K true) (history1, history2);
|
haftmann@35226
|
190 |
val filtered_history = filter_out (is_default o snd) raw_history;
|
haftmann@31962
|
191 |
val history = if null filtered_history
|
haftmann@31962
|
192 |
then raw_history else filtered_history;
|
haftmann@31962
|
193 |
in ((false, (snd o hd) history), history) end;
|
haftmann@35226
|
194 |
val functions = Symtab.join (K merge_functions) (functions1, functions2);
|
haftmann@35299
|
195 |
val types = Symtab.join (K (AList.merge (op =) (K true))) (types1, types2);
|
haftmann@31962
|
196 |
val cases = (Symtab.merge (K true) (cases1, cases2),
|
haftmann@31962
|
197 |
Symtab.merge (K true) (undefs1, undefs2));
|
haftmann@35299
|
198 |
in make_spec (false, ((signatures, functions), (types, cases))) end;
|
haftmann@31962
|
199 |
|
haftmann@31962
|
200 |
fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
|
haftmann@33906
|
201 |
fun the_signatures (Spec { signatures, ... }) = signatures;
|
haftmann@35226
|
202 |
fun the_functions (Spec { functions, ... }) = functions;
|
haftmann@35299
|
203 |
fun the_types (Spec { types, ... }) = types;
|
haftmann@31962
|
204 |
fun the_cases (Spec { cases, ... }) = cases;
|
haftmann@32544
|
205 |
val map_history_concluded = map_spec o apfst;
|
haftmann@33906
|
206 |
val map_signatures = map_spec o apsnd o apfst o apfst;
|
haftmann@35226
|
207 |
val map_functions = map_spec o apsnd o apfst o apsnd;
|
haftmann@35226
|
208 |
val map_typs = map_spec o apsnd o apsnd o apfst;
|
haftmann@31962
|
209 |
val map_cases = map_spec o apsnd o apsnd o apsnd;
|
haftmann@31962
|
210 |
|
haftmann@31962
|
211 |
|
haftmann@31962
|
212 |
(* data slots dependent on executable code *)
|
haftmann@31962
|
213 |
|
haftmann@31962
|
214 |
(*private copy avoids potential conflict of table exceptions*)
|
wenzelm@31972
|
215 |
structure Datatab = Table(type key = int val ord = int_ord);
|
haftmann@31962
|
216 |
|
haftmann@31962
|
217 |
local
|
haftmann@31962
|
218 |
|
haftmann@34160
|
219 |
type kind = { empty: Object.T };
|
haftmann@31962
|
220 |
|
wenzelm@32738
|
221 |
val kinds = Unsynchronized.ref (Datatab.empty: kind Datatab.table);
|
haftmann@31962
|
222 |
|
haftmann@31962
|
223 |
fun invoke f k = case Datatab.lookup (! kinds) k
|
haftmann@31962
|
224 |
of SOME kind => f kind
|
haftmann@31962
|
225 |
| NONE => sys_error "Invalid code data identifier";
|
haftmann@31962
|
226 |
|
haftmann@31962
|
227 |
in
|
haftmann@31962
|
228 |
|
haftmann@34160
|
229 |
fun declare_data empty =
|
haftmann@31962
|
230 |
let
|
haftmann@31962
|
231 |
val k = serial ();
|
haftmann@34160
|
232 |
val kind = { empty = empty };
|
haftmann@34160
|
233 |
val _ = CRITICAL (fn () => Unsynchronized.change kinds (Datatab.update (k, kind)));
|
haftmann@31962
|
234 |
in k end;
|
haftmann@31962
|
235 |
|
haftmann@31962
|
236 |
fun invoke_init k = invoke (fn kind => #empty kind) k;
|
haftmann@31962
|
237 |
|
haftmann@31962
|
238 |
end; (*local*)
|
haftmann@31962
|
239 |
|
haftmann@31962
|
240 |
|
haftmann@31962
|
241 |
(* theory store *)
|
haftmann@31962
|
242 |
|
haftmann@31962
|
243 |
local
|
haftmann@31962
|
244 |
|
haftmann@31962
|
245 |
type data = Object.T Datatab.table;
|
haftmann@34239
|
246 |
fun empty_dataref () = Synchronized.var "code data" (NONE : (data * theory_ref) option);
|
haftmann@31962
|
247 |
|
haftmann@34239
|
248 |
structure Code_Data = Theory_Data
|
haftmann@31962
|
249 |
(
|
haftmann@34239
|
250 |
type T = spec * (data * theory_ref) option Synchronized.var;
|
haftmann@33906
|
251 |
val empty = (make_spec (false, (((Symtab.empty, Symtab.empty), Symtab.empty),
|
haftmann@34239
|
252 |
(Symtab.empty, (Symtab.empty, Symtab.empty)))), empty_dataref ());
|
haftmann@34239
|
253 |
val extend = I
|
haftmann@34239
|
254 |
fun merge ((spec1, _), (spec2, _)) =
|
haftmann@34239
|
255 |
(merge_spec (spec1, spec2), empty_dataref ());
|
haftmann@31962
|
256 |
);
|
haftmann@31962
|
257 |
|
haftmann@31962
|
258 |
in
|
haftmann@31962
|
259 |
|
haftmann@35226
|
260 |
|
haftmann@31962
|
261 |
(* access to executable code *)
|
haftmann@31962
|
262 |
|
haftmann@31962
|
263 |
val the_exec = fst o Code_Data.get;
|
haftmann@31962
|
264 |
|
haftmann@34239
|
265 |
fun map_exec_purge f = Code_Data.map (fn (exec, _) => (f exec, empty_dataref ()));
|
haftmann@31962
|
266 |
|
haftmann@35226
|
267 |
fun change_fun_spec delete c f = (map_exec_purge o map_functions
|
haftmann@35226
|
268 |
o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, empty_fun_spec), [])))
|
haftmann@35226
|
269 |
o apfst) (fn (_, spec) => (true, f spec));
|
haftmann@31962
|
270 |
|
haftmann@31962
|
271 |
|
haftmann@31962
|
272 |
(* tackling equation history *)
|
haftmann@31962
|
273 |
|
haftmann@31962
|
274 |
fun continue_history thy = if (history_concluded o the_exec) thy
|
haftmann@31962
|
275 |
then thy
|
haftmann@31962
|
276 |
|> (Code_Data.map o apfst o map_history_concluded) (K false)
|
haftmann@31962
|
277 |
|> SOME
|
haftmann@31962
|
278 |
else NONE;
|
haftmann@31962
|
279 |
|
haftmann@31962
|
280 |
fun conclude_history thy = if (history_concluded o the_exec) thy
|
haftmann@31962
|
281 |
then NONE
|
haftmann@31962
|
282 |
else thy
|
haftmann@31962
|
283 |
|> (Code_Data.map o apfst)
|
haftmann@39264
|
284 |
((map_functions o Symtab.map) (fn _ => fn ((changed, current), history) =>
|
haftmann@31962
|
285 |
((false, current),
|
haftmann@31962
|
286 |
if changed then (serial (), current) :: history else history))
|
haftmann@31962
|
287 |
#> map_history_concluded (K true))
|
haftmann@31962
|
288 |
|> SOME;
|
haftmann@31962
|
289 |
|
haftmann@34239
|
290 |
val _ = Context.>> (Context.map_theory (Theory.at_begin continue_history #> Theory.at_end conclude_history));
|
haftmann@31962
|
291 |
|
haftmann@31962
|
292 |
|
haftmann@31962
|
293 |
(* access to data dependent on abstract executable code *)
|
haftmann@31962
|
294 |
|
haftmann@34239
|
295 |
fun change_yield_data (kind, mk, dest) theory f =
|
haftmann@31962
|
296 |
let
|
haftmann@34239
|
297 |
val dataref = (snd o Code_Data.get) theory;
|
haftmann@34246
|
298 |
val (datatab, thy_ref) = case Synchronized.value dataref
|
haftmann@34246
|
299 |
of SOME (datatab, thy_ref) => if Theory.eq_thy (theory, Theory.deref thy_ref)
|
haftmann@34246
|
300 |
then (datatab, thy_ref)
|
haftmann@34246
|
301 |
else (Datatab.empty, Theory.check_thy theory)
|
haftmann@34246
|
302 |
| NONE => (Datatab.empty, Theory.check_thy theory)
|
haftmann@34239
|
303 |
val data = case Datatab.lookup datatab kind
|
haftmann@34239
|
304 |
of SOME data => data
|
haftmann@34239
|
305 |
| NONE => invoke_init kind;
|
haftmann@34246
|
306 |
val result as (x, data') = f (dest data);
|
haftmann@34239
|
307 |
val _ = Synchronized.change dataref
|
haftmann@34239
|
308 |
((K o SOME) (Datatab.update (kind, mk data') datatab, thy_ref));
|
haftmann@34239
|
309 |
in result end;
|
haftmann@31962
|
310 |
|
haftmann@31962
|
311 |
end; (*local*)
|
haftmann@31962
|
312 |
|
haftmann@31962
|
313 |
|
haftmann@31962
|
314 |
(** foundation **)
|
haftmann@31962
|
315 |
|
haftmann@31962
|
316 |
(* constants *)
|
haftmann@31962
|
317 |
|
haftmann@33906
|
318 |
fun arity_number thy tyco = case Symtab.lookup ((fst o the_signatures o the_exec) thy) tyco
|
haftmann@33906
|
319 |
of SOME n => n
|
haftmann@33906
|
320 |
| NONE => Sign.arity_number thy tyco;
|
haftmann@33906
|
321 |
|
haftmann@33906
|
322 |
fun build_tsig thy =
|
haftmann@33906
|
323 |
let
|
haftmann@33906
|
324 |
val (tycos, _) = (the_signatures o the_exec) thy;
|
haftmann@33906
|
325 |
val decls = (#types o Type.rep_tsig o Sign.tsig_of) thy
|
haftmann@34265
|
326 |
|> snd
|
haftmann@34265
|
327 |
|> Symtab.fold (fn (tyco, n) =>
|
haftmann@34265
|
328 |
Symtab.update (tyco, Type.LogicalType n)) tycos;
|
haftmann@34265
|
329 |
in
|
haftmann@34265
|
330 |
Type.empty_tsig
|
haftmann@34265
|
331 |
|> Symtab.fold (fn (tyco, Type.LogicalType n) => Type.add_type Name_Space.default_naming
|
haftmann@34265
|
332 |
(Binding.qualified_name tyco, n) | _ => I) decls
|
haftmann@34265
|
333 |
end;
|
haftmann@33906
|
334 |
|
wenzelm@35845
|
335 |
fun cert_signature thy = Logic.varifyT_global o Type.cert_typ (build_tsig thy) o Type.no_tvars;
|
haftmann@33906
|
336 |
|
haftmann@33906
|
337 |
fun read_signature thy = cert_signature thy o Type.strip_sorts
|
wenzelm@36633
|
338 |
o Syntax.parse_typ (ProofContext.init_global thy);
|
haftmann@33906
|
339 |
|
haftmann@33906
|
340 |
fun expand_signature thy = Type.cert_typ_mode Type.mode_syntax (Sign.tsig_of thy);
|
haftmann@33906
|
341 |
|
haftmann@33906
|
342 |
fun lookup_typ thy = Symtab.lookup ((snd o the_signatures o the_exec) thy);
|
haftmann@33906
|
343 |
|
haftmann@33906
|
344 |
fun const_typ thy c = case lookup_typ thy c
|
haftmann@33906
|
345 |
of SOME ty => ty
|
haftmann@33906
|
346 |
| NONE => (Type.strip_sorts o Sign.the_const_type thy) c;
|
haftmann@33906
|
347 |
|
haftmann@33906
|
348 |
fun subst_signature thy c ty =
|
haftmann@33906
|
349 |
let
|
haftmann@33906
|
350 |
fun mk_subst (Type (tyco, tys1)) (ty2 as Type (tyco2, tys2)) =
|
haftmann@33906
|
351 |
fold2 mk_subst tys1 tys2
|
haftmann@33906
|
352 |
| mk_subst ty (TVar (v, sort)) = Vartab.update (v, ([], ty))
|
haftmann@33906
|
353 |
in case lookup_typ thy c
|
haftmann@33906
|
354 |
of SOME ty' => Envir.subst_type (mk_subst ty (expand_signature thy ty') Vartab.empty) ty'
|
haftmann@33906
|
355 |
| NONE => ty
|
haftmann@33906
|
356 |
end;
|
haftmann@33906
|
357 |
|
haftmann@33906
|
358 |
fun subst_signatures thy = map_aterms (fn Const (c, ty) => Const (c, subst_signature thy c ty) | t => t);
|
haftmann@33906
|
359 |
|
haftmann@33906
|
360 |
fun args_number thy = length o fst o strip_type o const_typ thy;
|
haftmann@31962
|
361 |
|
haftmann@31962
|
362 |
|
haftmann@31962
|
363 |
(* datatypes *)
|
haftmann@31156
|
364 |
|
haftmann@35226
|
365 |
fun no_constr thy s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c
|
haftmann@35226
|
366 |
^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s);
|
haftmann@35226
|
367 |
|
haftmann@35226
|
368 |
fun ty_sorts thy (c, raw_ty) =
|
haftmann@35226
|
369 |
let
|
haftmann@35226
|
370 |
val _ = Thm.cterm_of thy (Const (c, raw_ty));
|
haftmann@35226
|
371 |
val ty = subst_signature thy c raw_ty;
|
wenzelm@35845
|
372 |
val ty_decl = (Logic.unvarifyT_global o const_typ thy) c;
|
haftmann@35226
|
373 |
fun last_typ c_ty ty =
|
haftmann@35226
|
374 |
let
|
haftmann@35226
|
375 |
val tfrees = Term.add_tfreesT ty [];
|
haftmann@35226
|
376 |
val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty
|
haftmann@35226
|
377 |
handle TYPE _ => no_constr thy "bad type" c_ty
|
haftmann@36112
|
378 |
val _ = if tyco = "fun" then no_constr thy "bad type" c_ty else ();
|
haftmann@35226
|
379 |
val _ = if has_duplicates (eq_fst (op =)) vs
|
haftmann@35226
|
380 |
then no_constr thy "duplicate type variables in datatype" c_ty else ();
|
haftmann@35226
|
381 |
val _ = if length tfrees <> length vs
|
haftmann@35226
|
382 |
then no_constr thy "type variables missing in datatype" c_ty else ();
|
haftmann@35226
|
383 |
in (tyco, vs) end;
|
haftmann@35226
|
384 |
val (tyco, _) = last_typ (c, ty) ty_decl;
|
haftmann@35226
|
385 |
val (_, vs) = last_typ (c, ty) ty;
|
haftmann@35226
|
386 |
in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
|
haftmann@35226
|
387 |
|
haftmann@31156
|
388 |
fun constrset_of_consts thy cs =
|
haftmann@31156
|
389 |
let
|
haftmann@31156
|
390 |
val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
|
haftmann@31156
|
391 |
then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
|
haftmann@31156
|
392 |
fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
|
haftmann@31156
|
393 |
let
|
haftmann@31998
|
394 |
val _ = if (tyco' : string) <> tyco
|
haftmann@31156
|
395 |
then error "Different type constructors in constructor set"
|
haftmann@31156
|
396 |
else ();
|
haftmann@31156
|
397 |
val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
|
haftmann@31156
|
398 |
in ((tyco, sorts), c :: cs) end;
|
haftmann@31156
|
399 |
fun inst vs' (c, (vs, ty)) =
|
haftmann@31156
|
400 |
let
|
haftmann@31156
|
401 |
val the_v = the o AList.lookup (op =) (vs ~~ vs');
|
haftmann@31156
|
402 |
val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty;
|
haftmann@31156
|
403 |
in (c, (fst o strip_type) ty') end;
|
haftmann@35226
|
404 |
val c' :: cs' = map (ty_sorts thy) cs;
|
haftmann@31156
|
405 |
val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
|
haftmann@31156
|
406 |
val vs = Name.names Name.context Name.aT sorts;
|
haftmann@31156
|
407 |
val cs''' = map (inst vs) cs'';
|
haftmann@31156
|
408 |
in (tyco, (vs, rev cs''')) end;
|
haftmann@31156
|
409 |
|
haftmann@35299
|
410 |
fun get_type_entry thy tyco = case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
|
haftmann@35226
|
411 |
of (_, entry) :: _ => SOME entry
|
haftmann@35226
|
412 |
| _ => NONE;
|
haftmann@35226
|
413 |
|
haftmann@35299
|
414 |
fun get_type_spec thy tyco = case get_type_entry thy tyco
|
haftmann@35226
|
415 |
of SOME (vs, spec) => apfst (pair vs) (constructors_of spec)
|
haftmann@35226
|
416 |
| NONE => arity_number thy tyco
|
haftmann@35226
|
417 |
|> Name.invents Name.context Name.aT
|
haftmann@35226
|
418 |
|> map (rpair [])
|
haftmann@35226
|
419 |
|> rpair []
|
haftmann@35226
|
420 |
|> rpair false;
|
haftmann@35226
|
421 |
|
haftmann@35299
|
422 |
fun get_abstype_spec thy tyco = case get_type_entry thy tyco
|
haftmann@35226
|
423 |
of SOME (vs, Abstractor spec) => (vs, spec)
|
haftmann@36122
|
424 |
| _ => error ("Not an abstract type: " ^ tyco);
|
haftmann@35226
|
425 |
|
haftmann@37423
|
426 |
fun get_type thy tyco =
|
haftmann@37423
|
427 |
let
|
haftmann@37423
|
428 |
val ((vs, cos), _) = get_type_spec thy tyco;
|
haftmann@37423
|
429 |
fun args_of c tys = map (fst o dest_TFree)
|
haftmann@37423
|
430 |
(Sign.const_typargs thy (c, tys ---> Type (tyco, map TFree vs)));
|
haftmann@37423
|
431 |
fun add_typargs (c, tys) = ((c, args_of c tys), tys);
|
haftmann@37423
|
432 |
in (vs, map add_typargs cos) end;
|
haftmann@35226
|
433 |
|
haftmann@35299
|
434 |
fun get_type_of_constr_or_abstr thy c =
|
haftmann@33906
|
435 |
case (snd o strip_type o const_typ thy) c
|
haftmann@35299
|
436 |
of Type (tyco, _) => let val ((vs, cos), abstract) = get_type_spec thy tyco
|
haftmann@35226
|
437 |
in if member (op =) (map fst cos) c then SOME (tyco, abstract) else NONE end
|
haftmann@31962
|
438 |
| _ => NONE;
|
haftmann@31962
|
439 |
|
haftmann@35299
|
440 |
fun is_constr thy c = case get_type_of_constr_or_abstr thy c
|
haftmann@35226
|
441 |
of SOME (_, false) => true
|
haftmann@35226
|
442 |
| _ => false;
|
haftmann@35226
|
443 |
|
haftmann@35299
|
444 |
fun is_abstr thy c = case get_type_of_constr_or_abstr thy c
|
haftmann@35226
|
445 |
of SOME (_, true) => true
|
haftmann@35226
|
446 |
| _ => false;
|
haftmann@31962
|
447 |
|
haftmann@31156
|
448 |
|
haftmann@34313
|
449 |
(* bare code equations *)
|
haftmann@31156
|
450 |
|
haftmann@35226
|
451 |
(* convention for variables:
|
haftmann@35226
|
452 |
?x ?'a for free-floating theorems (e.g. in the data store)
|
haftmann@35226
|
453 |
?x 'a for certificates
|
haftmann@35226
|
454 |
x 'a for final representation of equations
|
haftmann@35226
|
455 |
*)
|
haftmann@35226
|
456 |
|
haftmann@31156
|
457 |
exception BAD_THM of string;
|
haftmann@31156
|
458 |
fun bad_thm msg = raise BAD_THM msg;
|
haftmann@31156
|
459 |
fun error_thm f thm = f thm handle BAD_THM msg => error msg;
|
haftmann@31642
|
460 |
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
|
haftmann@31156
|
461 |
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
|
haftmann@31156
|
462 |
|
haftmann@31156
|
463 |
fun is_linear thm =
|
haftmann@31156
|
464 |
let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
|
haftmann@31156
|
465 |
in not (has_duplicates (op =) ((fold o fold_aterms)
|
haftmann@31156
|
466 |
(fn Var (v, _) => cons v | _ => I) args [])) end;
|
haftmann@31156
|
467 |
|
haftmann@36209
|
468 |
fun check_decl_ty thy (c, ty) =
|
haftmann@36209
|
469 |
let
|
haftmann@36209
|
470 |
val ty_decl = Sign.the_const_type thy c;
|
haftmann@36209
|
471 |
in if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty) then ()
|
haftmann@36209
|
472 |
else bad_thm ("Type\n" ^ string_of_typ thy ty
|
haftmann@36209
|
473 |
^ "\nof constant " ^ quote c
|
haftmann@36209
|
474 |
^ "\nis incompatible with declared type\n"
|
haftmann@36209
|
475 |
^ string_of_typ thy ty_decl)
|
haftmann@36209
|
476 |
end;
|
haftmann@36209
|
477 |
|
haftmann@35226
|
478 |
fun check_eqn thy { allow_nonlinear, allow_consts, allow_pats } thm (lhs, rhs) =
|
haftmann@31156
|
479 |
let
|
haftmann@34894
|
480 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
|
haftmann@31156
|
481 |
fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
|
haftmann@34894
|
482 |
| Free _ => bad "Illegal free variable in equation"
|
haftmann@31156
|
483 |
| _ => I) t [];
|
haftmann@31156
|
484 |
fun tvars_of t = fold_term_types (fn _ =>
|
haftmann@31156
|
485 |
fold_atyps (fn TVar (v, _) => insert (op =) v
|
haftmann@34894
|
486 |
| TFree _ => bad "Illegal free type variable in equation")) t [];
|
haftmann@31156
|
487 |
val lhs_vs = vars_of lhs;
|
haftmann@31156
|
488 |
val rhs_vs = vars_of rhs;
|
haftmann@31156
|
489 |
val lhs_tvs = tvars_of lhs;
|
haftmann@31156
|
490 |
val rhs_tvs = tvars_of rhs;
|
haftmann@31156
|
491 |
val _ = if null (subtract (op =) lhs_vs rhs_vs)
|
haftmann@31156
|
492 |
then ()
|
haftmann@34894
|
493 |
else bad "Free variables on right hand side of equation";
|
haftmann@31156
|
494 |
val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
|
haftmann@31156
|
495 |
then ()
|
haftmann@34894
|
496 |
else bad "Free type variables on right hand side of equation";
|
haftmann@34894
|
497 |
val (head, args) = strip_comb lhs;
|
haftmann@31156
|
498 |
val (c, ty) = case head
|
haftmann@31156
|
499 |
of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
|
haftmann@34894
|
500 |
| _ => bad "Equation not headed by constant";
|
haftmann@34894
|
501 |
fun check _ (Abs _) = bad "Abstraction on left hand side of equation"
|
haftmann@31156
|
502 |
| check 0 (Var _) = ()
|
haftmann@34894
|
503 |
| check _ (Var _) = bad "Variable with application on left hand side of equation"
|
haftmann@31156
|
504 |
| check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
|
haftmann@34894
|
505 |
| check n (Const (c_ty as (c, ty))) =
|
haftmann@35226
|
506 |
if allow_pats then let
|
haftmann@33906
|
507 |
val c' = AxClass.unoverload_const thy c_ty
|
haftmann@33906
|
508 |
in if n = (length o fst o strip_type o subst_signature thy c') ty
|
haftmann@35226
|
509 |
then if allow_consts orelse is_constr thy c'
|
haftmann@33906
|
510 |
then ()
|
haftmann@34894
|
511 |
else bad (quote c ^ " is not a constructor, on left hand side of equation")
|
haftmann@34894
|
512 |
else bad ("Partially applied constant " ^ quote c ^ " on left hand side of equation")
|
haftmann@36209
|
513 |
end else bad ("Pattern not allowed here, but constant " ^ quote c ^ " encountered on left hand side")
|
haftmann@31156
|
514 |
val _ = map (check 0) args;
|
haftmann@35226
|
515 |
val _ = if allow_nonlinear orelse is_linear thm then ()
|
haftmann@34894
|
516 |
else bad "Duplicate variables on left hand side of equation";
|
haftmann@34894
|
517 |
val _ = if (is_none o AxClass.class_of_param thy) c then ()
|
haftmann@34894
|
518 |
else bad "Overloaded constant as head in equation";
|
haftmann@34894
|
519 |
val _ = if not (is_constr thy c) then ()
|
haftmann@34894
|
520 |
else bad "Constructor as head in equation";
|
haftmann@35226
|
521 |
val _ = if not (is_abstr thy c) then ()
|
haftmann@35226
|
522 |
else bad "Abstractor as head in equation";
|
haftmann@36209
|
523 |
val _ = check_decl_ty thy (c, ty);
|
haftmann@35226
|
524 |
in () end;
|
haftmann@35226
|
525 |
|
haftmann@35226
|
526 |
fun gen_assert_eqn thy check_patterns (thm, proper) =
|
haftmann@35226
|
527 |
let
|
haftmann@35226
|
528 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
|
haftmann@35226
|
529 |
val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
|
haftmann@35226
|
530 |
handle TERM _ => bad "Not an equation"
|
haftmann@35226
|
531 |
| THM _ => bad "Not a proper equation";
|
haftmann@35226
|
532 |
val _ = check_eqn thy { allow_nonlinear = not proper,
|
haftmann@35226
|
533 |
allow_consts = not (proper andalso check_patterns), allow_pats = true } thm (lhs, rhs);
|
haftmann@31156
|
534 |
in (thm, proper) end;
|
haftmann@31156
|
535 |
|
haftmann@35226
|
536 |
fun assert_abs_eqn thy some_tyco thm =
|
haftmann@35226
|
537 |
let
|
haftmann@35226
|
538 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
|
haftmann@35226
|
539 |
val (full_lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
|
haftmann@35226
|
540 |
handle TERM _ => bad "Not an equation"
|
haftmann@35226
|
541 |
| THM _ => bad "Not a proper equation";
|
haftmann@35226
|
542 |
val (rep, lhs) = dest_comb full_lhs
|
haftmann@35226
|
543 |
handle TERM _ => bad "Not an abstract equation";
|
haftmann@36202
|
544 |
val (rep_const, ty) = dest_Const rep;
|
haftmann@36202
|
545 |
val (tyco, sorts) = ((apsnd o map) (snd o dest_TVar) o dest_Type o domain_type) ty
|
haftmann@39774
|
546 |
handle TERM _ => bad "Not an abstract equation"
|
haftmann@39774
|
547 |
| TYPE _ => bad "Not an abstract equation";
|
haftmann@35226
|
548 |
val _ = case some_tyco of SOME tyco' => if tyco = tyco' then ()
|
haftmann@35226
|
549 |
else bad ("Abstract type mismatch:" ^ quote tyco ^ " vs. " ^ quote tyco')
|
haftmann@35226
|
550 |
| NONE => ();
|
haftmann@36202
|
551 |
val (vs', (_, (rep', _))) = get_abstype_spec thy tyco;
|
haftmann@35226
|
552 |
val _ = if rep_const = rep' then ()
|
haftmann@35226
|
553 |
else bad ("Projection mismatch: " ^ quote rep_const ^ " vs. " ^ quote rep');
|
haftmann@35226
|
554 |
val _ = check_eqn thy { allow_nonlinear = false,
|
haftmann@35226
|
555 |
allow_consts = false, allow_pats = false } thm (lhs, rhs);
|
haftmann@36202
|
556 |
val _ = if forall (Sign.subsort thy) (sorts ~~ map snd vs') then ()
|
haftmann@36202
|
557 |
else error ("Sort constraints on type arguments are weaker than in abstype certificate.")
|
haftmann@35226
|
558 |
in (thm, tyco) end;
|
haftmann@35226
|
559 |
|
haftmann@34894
|
560 |
fun assert_eqn thy = error_thm (gen_assert_eqn thy true);
|
haftmann@31156
|
561 |
|
wenzelm@36633
|
562 |
fun meta_rewrite thy = Local_Defs.meta_rewrite_rule (ProofContext.init_global thy);
|
haftmann@31962
|
563 |
|
haftmann@34894
|
564 |
fun mk_eqn thy = error_thm (gen_assert_eqn thy false) o
|
haftmann@31962
|
565 |
apfst (meta_rewrite thy);
|
haftmann@31962
|
566 |
|
haftmann@31962
|
567 |
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
|
haftmann@34894
|
568 |
o warning_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
|
haftmann@31962
|
569 |
|
haftmann@31962
|
570 |
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
|
haftmann@34894
|
571 |
o try_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
|
haftmann@31156
|
572 |
|
haftmann@35226
|
573 |
fun mk_abs_eqn thy = error_thm (assert_abs_eqn thy NONE) o meta_rewrite thy;
|
haftmann@35226
|
574 |
|
haftmann@33906
|
575 |
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
|
haftmann@31156
|
576 |
|
haftmann@31957
|
577 |
fun const_typ_eqn thy thm =
|
haftmann@31156
|
578 |
let
|
haftmann@32640
|
579 |
val (c, ty) = head_eqn thm;
|
haftmann@31156
|
580 |
val c' = AxClass.unoverload_const thy (c, ty);
|
haftmann@33906
|
581 |
(*permissive wrt. to overloaded constants!*)
|
haftmann@31156
|
582 |
in (c', ty) end;
|
haftmann@33906
|
583 |
|
haftmann@31957
|
584 |
fun const_eqn thy = fst o const_typ_eqn thy;
|
haftmann@31156
|
585 |
|
haftmann@35226
|
586 |
fun const_abs_eqn thy = AxClass.unoverload_const thy o dest_Const o fst o strip_comb o snd
|
haftmann@35226
|
587 |
o dest_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
|
haftmann@35226
|
588 |
|
haftmann@34313
|
589 |
fun logical_typscheme thy (c, ty) =
|
haftmann@32873
|
590 |
(map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
|
haftmann@33906
|
591 |
|
haftmann@34313
|
592 |
fun typscheme thy (c, ty) = logical_typscheme thy (c, subst_signature thy c ty);
|
haftmann@33906
|
593 |
|
haftmann@35226
|
594 |
fun mk_proj tyco vs ty abs rep =
|
haftmann@35226
|
595 |
let
|
haftmann@35226
|
596 |
val ty_abs = Type (tyco, map TFree vs);
|
haftmann@35226
|
597 |
val xarg = Var (("x", 0), ty);
|
haftmann@35226
|
598 |
in Logic.mk_equals (Const (rep, ty_abs --> ty) $ (Const (abs, ty --> ty_abs) $ xarg), xarg) end;
|
haftmann@35226
|
599 |
|
haftmann@34895
|
600 |
|
haftmann@34895
|
601 |
(* technical transformations of code equations *)
|
haftmann@34895
|
602 |
|
haftmann@34895
|
603 |
fun expand_eta thy k thm =
|
haftmann@31962
|
604 |
let
|
haftmann@34895
|
605 |
val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm;
|
haftmann@34895
|
606 |
val (_, args) = strip_comb lhs;
|
haftmann@34895
|
607 |
val l = if k = ~1
|
haftmann@34895
|
608 |
then (length o fst o strip_abs) rhs
|
haftmann@34895
|
609 |
else Int.max (0, k - length args);
|
haftmann@34895
|
610 |
val (raw_vars, _) = Term.strip_abs_eta l rhs;
|
haftmann@34895
|
611 |
val vars = burrow_fst (Name.variant_list (map (fst o fst) (Term.add_vars lhs [])))
|
haftmann@34895
|
612 |
raw_vars;
|
haftmann@34895
|
613 |
fun expand (v, ty) thm = Drule.fun_cong_rule thm
|
haftmann@34895
|
614 |
(Thm.cterm_of thy (Var ((v, 0), ty)));
|
haftmann@34895
|
615 |
in
|
haftmann@34895
|
616 |
thm
|
haftmann@34895
|
617 |
|> fold expand vars
|
haftmann@34895
|
618 |
|> Conv.fconv_rule Drule.beta_eta_conversion
|
haftmann@34895
|
619 |
end;
|
haftmann@34895
|
620 |
|
haftmann@34895
|
621 |
fun same_arity thy thms =
|
haftmann@34895
|
622 |
let
|
haftmann@34895
|
623 |
val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals;
|
haftmann@34895
|
624 |
val k = fold (Integer.max o num_args_of o Thm.prop_of) thms 0;
|
haftmann@34895
|
625 |
in map (expand_eta thy k) thms end;
|
haftmann@34895
|
626 |
|
haftmann@34895
|
627 |
fun mk_desymbolization pre post mk vs =
|
haftmann@34895
|
628 |
let
|
haftmann@34895
|
629 |
val names = map (pre o fst o fst) vs
|
haftmann@34895
|
630 |
|> map (Name.desymbolize false)
|
haftmann@34895
|
631 |
|> Name.variant_list []
|
haftmann@34895
|
632 |
|> map post;
|
haftmann@34895
|
633 |
in map_filter (fn (((v, i), x), v') =>
|
haftmann@34895
|
634 |
if v = v' andalso i = 0 then NONE
|
haftmann@34895
|
635 |
else SOME (((v, i), x), mk ((v', 0), x))) (vs ~~ names)
|
haftmann@34895
|
636 |
end;
|
haftmann@34895
|
637 |
|
haftmann@34895
|
638 |
fun desymbolize_tvars thy thms =
|
haftmann@34895
|
639 |
let
|
haftmann@34895
|
640 |
val tvs = fold (Term.add_tvars o Thm.prop_of) thms [];
|
haftmann@34895
|
641 |
val tvar_subst = mk_desymbolization (unprefix "'") (prefix "'") TVar tvs;
|
haftmann@34895
|
642 |
in map (Thm.certify_instantiate (tvar_subst, [])) thms end;
|
haftmann@34895
|
643 |
|
haftmann@34895
|
644 |
fun desymbolize_vars thy thm =
|
haftmann@34895
|
645 |
let
|
haftmann@34895
|
646 |
val vs = Term.add_vars (Thm.prop_of thm) [];
|
haftmann@34895
|
647 |
val var_subst = mk_desymbolization I I Var vs;
|
haftmann@34895
|
648 |
in Thm.certify_instantiate ([], var_subst) thm end;
|
haftmann@34895
|
649 |
|
haftmann@34895
|
650 |
fun canonize_thms thy = desymbolize_tvars thy #> same_arity thy #> map (desymbolize_vars thy);
|
haftmann@31156
|
651 |
|
haftmann@34313
|
652 |
|
haftmann@36112
|
653 |
(* abstype certificates *)
|
haftmann@36112
|
654 |
|
haftmann@36112
|
655 |
fun check_abstype_cert thy proto_thm =
|
haftmann@36112
|
656 |
let
|
haftmann@36209
|
657 |
val thm = (AxClass.unoverload thy o meta_rewrite thy) proto_thm;
|
haftmann@36112
|
658 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
|
haftmann@36112
|
659 |
val (lhs, rhs) = Logic.dest_equals (Thm.plain_prop_of thm)
|
haftmann@36112
|
660 |
handle TERM _ => bad "Not an equation"
|
haftmann@36112
|
661 |
| THM _ => bad "Not a proper equation";
|
haftmann@36209
|
662 |
val ((abs, raw_ty), ((rep, rep_ty), param)) = (apsnd (apfst dest_Const o dest_comb)
|
haftmann@36112
|
663 |
o apfst dest_Const o dest_comb) lhs
|
haftmann@36112
|
664 |
handle TERM _ => bad "Not an abstype certificate";
|
haftmann@36209
|
665 |
val _ = pairself (fn c => if (is_some o AxClass.class_of_param thy) c
|
haftmann@36209
|
666 |
then error ("Is a class parameter: " ^ string_of_const thy c) else ()) (abs, rep);
|
haftmann@36209
|
667 |
val _ = check_decl_ty thy (abs, raw_ty);
|
haftmann@36209
|
668 |
val _ = check_decl_ty thy (rep, rep_ty);
|
haftmann@36112
|
669 |
val var = (fst o dest_Var) param
|
haftmann@36112
|
670 |
handle TERM _ => bad "Not an abstype certificate";
|
haftmann@36112
|
671 |
val _ = if param = rhs then () else bad "Not an abstype certificate";
|
haftmann@36112
|
672 |
val ((tyco, sorts), (abs, (vs, ty'))) = ty_sorts thy (abs, Logic.unvarifyT_global raw_ty);
|
haftmann@36112
|
673 |
val ty = domain_type ty';
|
haftmann@36112
|
674 |
val ty_abs = range_type ty';
|
haftmann@36112
|
675 |
in (tyco, (vs ~~ sorts, ((abs, ty), (rep, thm)))) end;
|
haftmann@36112
|
676 |
|
haftmann@36112
|
677 |
|
haftmann@34313
|
678 |
(* code equation certificates *)
|
haftmann@34313
|
679 |
|
haftmann@34895
|
680 |
fun build_head thy (c, ty) =
|
haftmann@34895
|
681 |
Thm.cterm_of thy (Logic.mk_equals (Free ("HEAD", ty), Const (c, ty)));
|
haftmann@34313
|
682 |
|
haftmann@34895
|
683 |
fun get_head thy cert_thm =
|
haftmann@34895
|
684 |
let
|
haftmann@34895
|
685 |
val [head] = (#hyps o Thm.crep_thm) cert_thm;
|
haftmann@34895
|
686 |
val (_, Const (c, ty)) = (Logic.dest_equals o Thm.term_of) head;
|
haftmann@34895
|
687 |
in (typscheme thy (c, ty), head) end;
|
haftmann@34895
|
688 |
|
haftmann@35226
|
689 |
fun typscheme_projection thy =
|
haftmann@35226
|
690 |
typscheme thy o dest_Const o fst o dest_comb o fst o Logic.dest_equals;
|
haftmann@35226
|
691 |
|
haftmann@35226
|
692 |
fun typscheme_abs thy =
|
haftmann@35226
|
693 |
typscheme thy o dest_Const o fst o strip_comb o snd o dest_comb o fst o Logic.dest_equals o Thm.prop_of;
|
haftmann@35226
|
694 |
|
haftmann@35226
|
695 |
fun constrain_thm thy vs sorts thm =
|
haftmann@35226
|
696 |
let
|
haftmann@35226
|
697 |
val mapping = map2 (fn (v, sort) => fn sort' =>
|
haftmann@35226
|
698 |
(v, Sorts.inter_sort (Sign.classes_of thy) (sort, sort'))) vs sorts;
|
haftmann@35226
|
699 |
val inst = map2 (fn (v, sort) => fn (_, sort') =>
|
haftmann@35226
|
700 |
(((v, 0), sort), TFree (v, sort'))) vs mapping;
|
haftmann@35226
|
701 |
val subst = (map_types o map_atyps)
|
haftmann@35226
|
702 |
(fn TFree (v, _) => TFree (v, the (AList.lookup (op =) mapping v)));
|
haftmann@35226
|
703 |
in
|
haftmann@35226
|
704 |
thm
|
wenzelm@35845
|
705 |
|> Thm.varifyT_global
|
haftmann@35226
|
706 |
|> Thm.certify_instantiate (inst, [])
|
haftmann@35226
|
707 |
|> pair subst
|
haftmann@35226
|
708 |
end;
|
haftmann@35226
|
709 |
|
haftmann@35226
|
710 |
fun concretify_abs thy tyco abs_thm =
|
haftmann@35226
|
711 |
let
|
haftmann@35226
|
712 |
val (vs, ((c, _), (_, cert))) = get_abstype_spec thy tyco;
|
haftmann@35226
|
713 |
val lhs = (fst o Logic.dest_equals o Thm.prop_of) abs_thm
|
haftmann@35226
|
714 |
val ty = fastype_of lhs;
|
haftmann@35226
|
715 |
val ty_abs = (fastype_of o snd o dest_comb) lhs;
|
haftmann@35226
|
716 |
val abs = Thm.cterm_of thy (Const (c, ty --> ty_abs));
|
haftmann@35226
|
717 |
val raw_concrete_thm = Drule.transitive_thm OF [Thm.symmetric cert, Thm.combination (Thm.reflexive abs) abs_thm];
|
wenzelm@35845
|
718 |
in (c, (Thm.varifyT_global o zero_var_indexes) raw_concrete_thm) end;
|
haftmann@35226
|
719 |
|
haftmann@35226
|
720 |
fun add_rhss_of_eqn thy t =
|
haftmann@35226
|
721 |
let
|
haftmann@35226
|
722 |
val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy) t;
|
haftmann@35226
|
723 |
fun add_const (Const (c, ty)) = insert (op =) (c, Sign.const_typargs thy (c, ty))
|
haftmann@35226
|
724 |
| add_const _ = I
|
haftmann@39810
|
725 |
val add_consts = fold_aterms add_const
|
haftmann@39810
|
726 |
in add_consts rhs o fold add_consts args end;
|
haftmann@35226
|
727 |
|
wenzelm@35845
|
728 |
fun dest_eqn thy =
|
wenzelm@35845
|
729 |
apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy o Logic.unvarify_global;
|
haftmann@35226
|
730 |
|
haftmann@35226
|
731 |
abstype cert = Equations of thm * bool list
|
haftmann@35226
|
732 |
| Projection of term * string
|
haftmann@35226
|
733 |
| Abstract of thm * string
|
haftmann@35226
|
734 |
with
|
haftmann@34891
|
735 |
|
haftmann@34891
|
736 |
fun empty_cert thy c =
|
haftmann@34891
|
737 |
let
|
haftmann@34891
|
738 |
val raw_ty = const_typ thy c;
|
haftmann@34891
|
739 |
val tvars = Term.add_tvar_namesT raw_ty [];
|
haftmann@34891
|
740 |
val tvars' = case AxClass.class_of_param thy c
|
haftmann@34891
|
741 |
of SOME class => [TFree (Name.aT, [class])]
|
haftmann@34891
|
742 |
| NONE => Name.invent_list [] Name.aT (length tvars)
|
haftmann@34891
|
743 |
|> map (fn v => TFree (v, []));
|
haftmann@34891
|
744 |
val ty = typ_subst_TVars (tvars ~~ tvars') raw_ty;
|
haftmann@34895
|
745 |
val chead = build_head thy (c, ty);
|
haftmann@35226
|
746 |
in Equations (Thm.weaken chead Drule.dummy_thm, []) end;
|
haftmann@34891
|
747 |
|
haftmann@34891
|
748 |
fun cert_of_eqns thy c [] = empty_cert thy c
|
haftmann@34895
|
749 |
| cert_of_eqns thy c raw_eqns =
|
haftmann@34313
|
750 |
let
|
haftmann@34895
|
751 |
val eqns = burrow_fst (canonize_thms thy) raw_eqns;
|
haftmann@34895
|
752 |
val _ = map (assert_eqn thy) eqns;
|
haftmann@34891
|
753 |
val (thms, propers) = split_list eqns;
|
haftmann@34895
|
754 |
val _ = map (fn thm => if c = const_eqn thy thm then ()
|
haftmann@34895
|
755 |
else error ("Wrong head of code equation,\nexpected constant "
|
haftmann@34895
|
756 |
^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)) thms;
|
haftmann@34891
|
757 |
fun tvars_of T = rev (Term.add_tvarsT T []);
|
haftmann@34891
|
758 |
val vss = map (tvars_of o snd o head_eqn) thms;
|
haftmann@34891
|
759 |
fun inter_sorts vs =
|
haftmann@34891
|
760 |
fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
|
haftmann@34891
|
761 |
val sorts = map_transpose inter_sorts vss;
|
haftmann@34891
|
762 |
val vts = Name.names Name.context Name.aT sorts;
|
haftmann@34891
|
763 |
val thms as thm :: _ =
|
haftmann@34891
|
764 |
map2 (fn vs => Thm.certify_instantiate (vs ~~ map TFree vts, [])) vss thms;
|
haftmann@34895
|
765 |
val head_thm = Thm.symmetric (Thm.assume (build_head thy (head_eqn (hd thms))));
|
haftmann@34313
|
766 |
fun head_conv ct = if can Thm.dest_comb ct
|
haftmann@34313
|
767 |
then Conv.fun_conv head_conv ct
|
haftmann@34313
|
768 |
else Conv.rewr_conv head_thm ct;
|
haftmann@34313
|
769 |
val rewrite_head = Conv.fconv_rule (Conv.arg1_conv head_conv);
|
haftmann@34891
|
770 |
val cert_thm = Conjunction.intr_balanced (map rewrite_head thms);
|
haftmann@35226
|
771 |
in Equations (cert_thm, propers) end;
|
haftmann@34313
|
772 |
|
haftmann@35226
|
773 |
fun cert_of_proj thy c tyco =
|
haftmann@34313
|
774 |
let
|
haftmann@35226
|
775 |
val (vs, ((abs, ty), (rep, cert))) = get_abstype_spec thy tyco;
|
haftmann@35226
|
776 |
val _ = if c = rep then () else
|
haftmann@35226
|
777 |
error ("Wrong head of projection,\nexpected constant " ^ string_of_const thy rep);
|
haftmann@35226
|
778 |
in Projection (mk_proj tyco vs ty abs rep, tyco) end;
|
haftmann@34313
|
779 |
|
haftmann@35226
|
780 |
fun cert_of_abs thy tyco c raw_abs_thm =
|
haftmann@35226
|
781 |
let
|
haftmann@35226
|
782 |
val abs_thm = singleton (canonize_thms thy) raw_abs_thm;
|
haftmann@35226
|
783 |
val _ = assert_abs_eqn thy (SOME tyco) abs_thm;
|
haftmann@35226
|
784 |
val _ = if c = const_abs_eqn thy abs_thm then ()
|
haftmann@35226
|
785 |
else error ("Wrong head of abstract code equation,\nexpected constant "
|
haftmann@35226
|
786 |
^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy abs_thm);
|
wenzelm@36638
|
787 |
in Abstract (Thm.legacy_freezeT abs_thm, tyco) end;
|
haftmann@34895
|
788 |
|
haftmann@35226
|
789 |
fun constrain_cert thy sorts (Equations (cert_thm, propers)) =
|
haftmann@35226
|
790 |
let
|
haftmann@35226
|
791 |
val ((vs, _), head) = get_head thy cert_thm;
|
haftmann@35226
|
792 |
val (subst, cert_thm') = cert_thm
|
haftmann@35226
|
793 |
|> Thm.implies_intr head
|
haftmann@35226
|
794 |
|> constrain_thm thy vs sorts;
|
haftmann@35226
|
795 |
val head' = Thm.term_of head
|
haftmann@35226
|
796 |
|> subst
|
haftmann@35226
|
797 |
|> Thm.cterm_of thy;
|
haftmann@35226
|
798 |
val cert_thm'' = cert_thm'
|
haftmann@35226
|
799 |
|> Thm.elim_implies (Thm.assume head');
|
haftmann@35226
|
800 |
in Equations (cert_thm'', propers) end
|
haftmann@35226
|
801 |
| constrain_cert thy _ (cert as Projection _) =
|
haftmann@35226
|
802 |
cert
|
haftmann@35226
|
803 |
| constrain_cert thy sorts (Abstract (abs_thm, tyco)) =
|
haftmann@35226
|
804 |
Abstract (snd (constrain_thm thy (fst (typscheme_abs thy abs_thm)) sorts abs_thm), tyco);
|
haftmann@34895
|
805 |
|
haftmann@35226
|
806 |
fun typscheme_of_cert thy (Equations (cert_thm, _)) =
|
haftmann@35226
|
807 |
fst (get_head thy cert_thm)
|
haftmann@35226
|
808 |
| typscheme_of_cert thy (Projection (proj, _)) =
|
haftmann@35226
|
809 |
typscheme_projection thy proj
|
haftmann@35226
|
810 |
| typscheme_of_cert thy (Abstract (abs_thm, _)) =
|
haftmann@35226
|
811 |
typscheme_abs thy abs_thm;
|
haftmann@34895
|
812 |
|
haftmann@35226
|
813 |
fun typargs_deps_of_cert thy (Equations (cert_thm, propers)) =
|
haftmann@35226
|
814 |
let
|
haftmann@35226
|
815 |
val vs = (fst o fst) (get_head thy cert_thm);
|
haftmann@35226
|
816 |
val equations = if null propers then [] else
|
haftmann@35226
|
817 |
Thm.prop_of cert_thm
|
haftmann@35226
|
818 |
|> Logic.dest_conjunction_balanced (length propers);
|
haftmann@35226
|
819 |
in (vs, fold (add_rhss_of_eqn thy) equations []) end
|
haftmann@35226
|
820 |
| typargs_deps_of_cert thy (Projection (t, tyco)) =
|
haftmann@35226
|
821 |
(fst (typscheme_projection thy t), add_rhss_of_eqn thy t [])
|
haftmann@35226
|
822 |
| typargs_deps_of_cert thy (Abstract (abs_thm, tyco)) =
|
haftmann@35226
|
823 |
let
|
haftmann@35226
|
824 |
val vs = fst (typscheme_abs thy abs_thm);
|
haftmann@35226
|
825 |
val (_, concrete_thm) = concretify_abs thy tyco abs_thm;
|
haftmann@36202
|
826 |
in (vs, add_rhss_of_eqn thy (map_types Logic.unvarifyT_global (Thm.prop_of concrete_thm)) []) end;
|
haftmann@35226
|
827 |
|
haftmann@35226
|
828 |
fun equations_of_cert thy (cert as Equations (cert_thm, propers)) =
|
haftmann@35226
|
829 |
let
|
haftmann@35226
|
830 |
val tyscm = typscheme_of_cert thy cert;
|
haftmann@35226
|
831 |
val thms = if null propers then [] else
|
haftmann@35226
|
832 |
cert_thm
|
wenzelm@35624
|
833 |
|> Local_Defs.expand [snd (get_head thy cert_thm)]
|
wenzelm@35845
|
834 |
|> Thm.varifyT_global
|
haftmann@35226
|
835 |
|> Conjunction.elim_balanced (length propers);
|
haftmann@36209
|
836 |
fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, NONE));
|
haftmann@36209
|
837 |
in (tyscm, map (abstractions o dest_eqn thy o Thm.prop_of) thms ~~ (map SOME thms ~~ propers)) end
|
haftmann@35226
|
838 |
| equations_of_cert thy (Projection (t, tyco)) =
|
haftmann@35226
|
839 |
let
|
haftmann@35226
|
840 |
val (_, ((abs, _), _)) = get_abstype_spec thy tyco;
|
haftmann@35226
|
841 |
val tyscm = typscheme_projection thy t;
|
wenzelm@35845
|
842 |
val t' = map_types Logic.varifyT_global t;
|
haftmann@36209
|
843 |
fun abstractions (args, rhs) = (map (rpair (SOME abs)) args, (rhs, NONE));
|
haftmann@36209
|
844 |
in (tyscm, [((abstractions o dest_eqn thy) t', (NONE, true))]) end
|
haftmann@35226
|
845 |
| equations_of_cert thy (Abstract (abs_thm, tyco)) =
|
haftmann@35226
|
846 |
let
|
haftmann@35226
|
847 |
val tyscm = typscheme_abs thy abs_thm;
|
haftmann@35226
|
848 |
val (abs, concrete_thm) = concretify_abs thy tyco abs_thm;
|
haftmann@36209
|
849 |
fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, (SOME abs)));
|
wenzelm@35845
|
850 |
in
|
haftmann@36209
|
851 |
(tyscm, [((abstractions o dest_eqn thy o Thm.prop_of) concrete_thm,
|
haftmann@36209
|
852 |
(SOME (Thm.varifyT_global abs_thm), true))])
|
wenzelm@35845
|
853 |
end;
|
haftmann@35226
|
854 |
|
haftmann@35226
|
855 |
fun pretty_cert thy (cert as Equations _) =
|
haftmann@35226
|
856 |
(map_filter (Option.map (Display.pretty_thm_global thy o AxClass.overload thy) o fst o snd)
|
haftmann@35226
|
857 |
o snd o equations_of_cert thy) cert
|
haftmann@35226
|
858 |
| pretty_cert thy (Projection (t, _)) =
|
wenzelm@35845
|
859 |
[Syntax.pretty_term_global thy (map_types Logic.varifyT_global t)]
|
haftmann@35226
|
860 |
| pretty_cert thy (Abstract (abs_thm, tyco)) =
|
wenzelm@35845
|
861 |
[(Display.pretty_thm_global thy o AxClass.overload thy o Thm.varifyT_global) abs_thm];
|
haftmann@35226
|
862 |
|
haftmann@35226
|
863 |
fun bare_thms_of_cert thy (cert as Equations _) =
|
haftmann@35226
|
864 |
(map_filter (fn (_, (some_thm, proper)) => if proper then some_thm else NONE)
|
haftmann@35226
|
865 |
o snd o equations_of_cert thy) cert
|
haftmann@35376
|
866 |
| bare_thms_of_cert thy (Projection _) = []
|
haftmann@35376
|
867 |
| bare_thms_of_cert thy (Abstract (abs_thm, tyco)) =
|
wenzelm@35845
|
868 |
[Thm.varifyT_global (snd (concretify_abs thy tyco abs_thm))];
|
haftmann@34895
|
869 |
|
haftmann@34895
|
870 |
end;
|
haftmann@34891
|
871 |
|
haftmann@34313
|
872 |
|
haftmann@35226
|
873 |
(* code certificate access *)
|
haftmann@34313
|
874 |
|
haftmann@35226
|
875 |
fun retrieve_raw thy c =
|
haftmann@35226
|
876 |
Symtab.lookup ((the_functions o the_exec) thy) c
|
haftmann@35226
|
877 |
|> Option.map (snd o fst)
|
haftmann@37435
|
878 |
|> the_default empty_fun_spec
|
haftmann@35226
|
879 |
|
haftmann@35226
|
880 |
fun get_cert thy f c = case retrieve_raw thy c
|
haftmann@37435
|
881 |
of Default (_, eqns_lazy) => Lazy.force eqns_lazy
|
haftmann@35226
|
882 |
|> (map o apfst) (Thm.transfer thy)
|
haftmann@35226
|
883 |
|> f
|
haftmann@35226
|
884 |
|> (map o apfst) (AxClass.unoverload thy)
|
haftmann@35226
|
885 |
|> cert_of_eqns thy c
|
haftmann@35226
|
886 |
| Eqns eqns => eqns
|
haftmann@35226
|
887 |
|> (map o apfst) (Thm.transfer thy)
|
haftmann@35226
|
888 |
|> f
|
haftmann@35226
|
889 |
|> (map o apfst) (AxClass.unoverload thy)
|
haftmann@35226
|
890 |
|> cert_of_eqns thy c
|
haftmann@35226
|
891 |
| Proj (_, tyco) =>
|
haftmann@35226
|
892 |
cert_of_proj thy c tyco
|
haftmann@35226
|
893 |
| Abstr (abs_thm, tyco) => abs_thm
|
haftmann@35226
|
894 |
|> Thm.transfer thy
|
haftmann@35226
|
895 |
|> AxClass.unoverload thy
|
haftmann@35226
|
896 |
|> cert_of_abs thy tyco c;
|
haftmann@31962
|
897 |
|
haftmann@31962
|
898 |
|
haftmann@31962
|
899 |
(* cases *)
|
haftmann@31156
|
900 |
|
haftmann@31156
|
901 |
fun case_certificate thm =
|
haftmann@31156
|
902 |
let
|
haftmann@31156
|
903 |
val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
|
haftmann@32640
|
904 |
o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
|
haftmann@31156
|
905 |
val _ = case head of Free _ => true
|
haftmann@31156
|
906 |
| Var _ => true
|
haftmann@31156
|
907 |
| _ => raise TERM ("case_cert", []);
|
haftmann@31156
|
908 |
val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
|
haftmann@31156
|
909 |
val (Const (case_const, _), raw_params) = strip_comb case_expr;
|
haftmann@31156
|
910 |
val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
|
haftmann@31156
|
911 |
val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
|
haftmann@31156
|
912 |
val params = map (fst o dest_Var) (nth_drop n raw_params);
|
haftmann@31156
|
913 |
fun dest_case t =
|
haftmann@31156
|
914 |
let
|
haftmann@31156
|
915 |
val (head' $ t_co, rhs) = Logic.dest_equals t;
|
haftmann@31156
|
916 |
val _ = if head' = head then () else raise TERM ("case_cert", []);
|
haftmann@31156
|
917 |
val (Const (co, _), args) = strip_comb t_co;
|
haftmann@31156
|
918 |
val (Var (param, _), args') = strip_comb rhs;
|
haftmann@31156
|
919 |
val _ = if args' = args then () else raise TERM ("case_cert", []);
|
haftmann@31156
|
920 |
in (param, co) end;
|
haftmann@31156
|
921 |
fun analyze_cases cases =
|
haftmann@31156
|
922 |
let
|
haftmann@31156
|
923 |
val co_list = fold (AList.update (op =) o dest_case) cases [];
|
haftmann@31156
|
924 |
in map (the o AList.lookup (op =) co_list) params end;
|
haftmann@31156
|
925 |
fun analyze_let t =
|
haftmann@31156
|
926 |
let
|
haftmann@31156
|
927 |
val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
|
haftmann@31156
|
928 |
val _ = if head' = head then () else raise TERM ("case_cert", []);
|
haftmann@31156
|
929 |
val _ = if arg' = arg then () else raise TERM ("case_cert", []);
|
haftmann@31156
|
930 |
val _ = if [param'] = params then () else raise TERM ("case_cert", []);
|
haftmann@31156
|
931 |
in [] end;
|
haftmann@31156
|
932 |
fun analyze (cases as [let_case]) =
|
haftmann@31156
|
933 |
(analyze_cases cases handle Bind => analyze_let let_case)
|
haftmann@31156
|
934 |
| analyze cases = analyze_cases cases;
|
haftmann@31156
|
935 |
in (case_const, (n, analyze cases)) end;
|
haftmann@31156
|
936 |
|
haftmann@31156
|
937 |
fun case_cert thm = case_certificate thm
|
haftmann@31156
|
938 |
handle Bind => error "bad case certificate"
|
haftmann@31156
|
939 |
| TERM _ => error "bad case certificate";
|
haftmann@31156
|
940 |
|
haftmann@37413
|
941 |
fun get_case_scheme thy = Option.map fst o Symtab.lookup ((fst o the_cases o the_exec) thy);
|
haftmann@37413
|
942 |
fun get_case_cong thy = Option.map snd o Symtab.lookup ((fst o the_cases o the_exec) thy);
|
haftmann@31156
|
943 |
|
haftmann@31962
|
944 |
val undefineds = Symtab.keys o snd o the_cases o the_exec;
|
haftmann@24219
|
945 |
|
haftmann@25312
|
946 |
|
haftmann@31962
|
947 |
(* diagnostic *)
|
haftmann@24219
|
948 |
|
haftmann@24219
|
949 |
fun print_codesetup thy =
|
haftmann@24219
|
950 |
let
|
wenzelm@36633
|
951 |
val ctxt = ProofContext.init_global thy;
|
haftmann@24844
|
952 |
val exec = the_exec thy;
|
haftmann@35226
|
953 |
fun pretty_equations const thms =
|
haftmann@24219
|
954 |
(Pretty.block o Pretty.fbreaks) (
|
haftmann@35226
|
955 |
Pretty.str (string_of_const thy const) :: map (Display.pretty_thm ctxt) thms
|
haftmann@24219
|
956 |
);
|
haftmann@37435
|
957 |
fun pretty_function (const, Default (_, eqns_lazy)) = pretty_equations const (map fst (Lazy.force eqns_lazy))
|
haftmann@35226
|
958 |
| pretty_function (const, Eqns eqns) = pretty_equations const (map fst eqns)
|
haftmann@35226
|
959 |
| pretty_function (const, Proj (proj, _)) = Pretty.block
|
haftmann@35226
|
960 |
[Pretty.str (string_of_const thy const), Pretty.fbrk, Syntax.pretty_term ctxt proj]
|
haftmann@35226
|
961 |
| pretty_function (const, Abstr (thm, _)) = pretty_equations const [thm];
|
haftmann@35226
|
962 |
fun pretty_typ (tyco, vs) = Pretty.str
|
haftmann@35226
|
963 |
(string_of_typ thy (Type (tyco, map TFree vs)));
|
haftmann@35226
|
964 |
fun pretty_typspec (typ, (cos, abstract)) = if null cos
|
haftmann@35226
|
965 |
then pretty_typ typ
|
haftmann@35226
|
966 |
else (Pretty.block o Pretty.breaks) (
|
haftmann@35226
|
967 |
pretty_typ typ
|
haftmann@35226
|
968 |
:: Pretty.str "="
|
haftmann@35226
|
969 |
:: (if abstract then [Pretty.str "(abstract)"] else [])
|
haftmann@35226
|
970 |
@ separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
|
haftmann@35226
|
971 |
| (c, tys) =>
|
haftmann@35226
|
972 |
(Pretty.block o Pretty.breaks)
|
haftmann@35226
|
973 |
(Pretty.str (string_of_const thy c)
|
haftmann@35226
|
974 |
:: Pretty.str "of"
|
haftmann@35226
|
975 |
:: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
|
haftmann@35226
|
976 |
);
|
haftmann@37413
|
977 |
fun pretty_case (const, ((_, (_, [])), _)) = Pretty.str (string_of_const thy const)
|
haftmann@37413
|
978 |
| pretty_case (const, ((_, (_, cos)), _)) = (Pretty.block o Pretty.breaks) [
|
haftmann@34901
|
979 |
Pretty.str (string_of_const thy const), Pretty.str "with",
|
haftmann@34901
|
980 |
(Pretty.block o Pretty.commas o map (Pretty.str o string_of_const thy)) cos];
|
haftmann@35226
|
981 |
val functions = the_functions exec
|
haftmann@24423
|
982 |
|> Symtab.dest
|
haftmann@28695
|
983 |
|> (map o apsnd) (snd o fst)
|
haftmann@24219
|
984 |
|> sort (string_ord o pairself fst);
|
haftmann@35299
|
985 |
val datatypes = the_types exec
|
haftmann@24219
|
986 |
|> Symtab.dest
|
haftmann@35226
|
987 |
|> map (fn (tyco, (_, (vs, spec)) :: _) =>
|
haftmann@35226
|
988 |
((tyco, vs), constructors_of spec))
|
haftmann@35226
|
989 |
|> sort (string_ord o pairself (fst o fst));
|
haftmann@34901
|
990 |
val cases = Symtab.dest ((fst o the_cases o the_exec) thy);
|
haftmann@34901
|
991 |
val undefineds = Symtab.keys ((snd o the_cases o the_exec) thy);
|
haftmann@24219
|
992 |
in
|
haftmann@24219
|
993 |
(Pretty.writeln o Pretty.chunks) [
|
haftmann@24219
|
994 |
Pretty.block (
|
haftmann@34901
|
995 |
Pretty.str "code equations:" :: Pretty.fbrk
|
haftmann@35226
|
996 |
:: (Pretty.fbreaks o map pretty_function) functions
|
haftmann@24219
|
997 |
),
|
haftmann@25968
|
998 |
Pretty.block (
|
haftmann@34901
|
999 |
Pretty.str "datatypes:" :: Pretty.fbrk
|
haftmann@35226
|
1000 |
:: (Pretty.fbreaks o map pretty_typspec) datatypes
|
haftmann@34901
|
1001 |
),
|
haftmann@34901
|
1002 |
Pretty.block (
|
haftmann@34901
|
1003 |
Pretty.str "cases:" :: Pretty.fbrk
|
haftmann@34901
|
1004 |
:: (Pretty.fbreaks o map pretty_case) cases
|
haftmann@34901
|
1005 |
),
|
haftmann@34901
|
1006 |
Pretty.block (
|
haftmann@34901
|
1007 |
Pretty.str "undefined:" :: Pretty.fbrk
|
haftmann@34901
|
1008 |
:: (Pretty.commas o map (Pretty.str o string_of_const thy)) undefineds
|
haftmann@24219
|
1009 |
)
|
haftmann@24219
|
1010 |
]
|
haftmann@24219
|
1011 |
end;
|
haftmann@24219
|
1012 |
|
haftmann@24219
|
1013 |
|
haftmann@31962
|
1014 |
(** declaring executable ingredients **)
|
haftmann@24219
|
1015 |
|
haftmann@33906
|
1016 |
(* constant signatures *)
|
haftmann@33906
|
1017 |
|
haftmann@33906
|
1018 |
fun add_type tyco thy =
|
haftmann@33906
|
1019 |
case Symtab.lookup ((snd o #types o Type.rep_tsig o Sign.tsig_of) thy) tyco
|
haftmann@33906
|
1020 |
of SOME (Type.Abbreviation (vs, _, _)) =>
|
haftmann@34160
|
1021 |
(map_exec_purge o map_signatures o apfst)
|
haftmann@33906
|
1022 |
(Symtab.update (tyco, length vs)) thy
|
haftmann@33906
|
1023 |
| _ => error ("No such type abbreviation: " ^ quote tyco);
|
haftmann@33906
|
1024 |
|
haftmann@33906
|
1025 |
fun add_type_cmd s thy = add_type (Sign.intern_type thy s) thy;
|
haftmann@33906
|
1026 |
|
haftmann@33906
|
1027 |
fun gen_add_signature prep_const prep_signature (raw_c, raw_ty) thy =
|
haftmann@33906
|
1028 |
let
|
haftmann@33906
|
1029 |
val c = prep_const thy raw_c;
|
haftmann@33906
|
1030 |
val ty = prep_signature thy raw_ty;
|
haftmann@33906
|
1031 |
val ty' = expand_signature thy ty;
|
haftmann@33906
|
1032 |
val ty'' = Sign.the_const_type thy c;
|
haftmann@33906
|
1033 |
val _ = if typ_equiv (ty', ty'') then () else
|
haftmann@33906
|
1034 |
error ("Illegal constant signature: " ^ Syntax.string_of_typ_global thy ty);
|
haftmann@33906
|
1035 |
in
|
haftmann@33906
|
1036 |
thy
|
haftmann@34160
|
1037 |
|> (map_exec_purge o map_signatures o apsnd) (Symtab.update (c, ty))
|
haftmann@33906
|
1038 |
end;
|
haftmann@33906
|
1039 |
|
haftmann@33906
|
1040 |
val add_signature = gen_add_signature (K I) cert_signature;
|
haftmann@33906
|
1041 |
val add_signature_cmd = gen_add_signature read_const read_signature;
|
haftmann@33906
|
1042 |
|
haftmann@33906
|
1043 |
|
haftmann@31962
|
1044 |
(* code equations *)
|
haftmann@31962
|
1045 |
|
haftmann@35226
|
1046 |
fun gen_add_eqn default (raw_thm, proper) thy =
|
haftmann@33075
|
1047 |
let
|
haftmann@35226
|
1048 |
val thm = Thm.close_derivation raw_thm;
|
haftmann@35226
|
1049 |
val c = const_eqn thy thm;
|
haftmann@37435
|
1050 |
fun update_subsume thy (thm, proper) eqns =
|
haftmann@37435
|
1051 |
let
|
haftmann@40057
|
1052 |
val args_of = snd o chop_while is_Var o rev o snd o strip_comb
|
haftmann@40037
|
1053 |
o map_types Type.strip_sorts o fst o Logic.dest_equals o Thm.plain_prop_of;
|
haftmann@37435
|
1054 |
val args = args_of thm;
|
haftmann@37435
|
1055 |
val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
|
haftmann@40040
|
1056 |
fun matches_args args' =
|
haftmann@40040
|
1057 |
let
|
haftmann@40040
|
1058 |
val k = length args' - length args
|
haftmann@40040
|
1059 |
in if k >= 0
|
haftmann@40040
|
1060 |
then Pattern.matchess thy (args, (map incr_idx o drop k) args')
|
haftmann@40040
|
1061 |
else false
|
haftmann@40040
|
1062 |
end;
|
haftmann@37435
|
1063 |
fun drop (thm', proper') = if (proper orelse not proper')
|
haftmann@37435
|
1064 |
andalso matches_args (args_of thm') then
|
haftmann@37435
|
1065 |
(warning ("Code generator: dropping subsumed code equation\n" ^
|
haftmann@37435
|
1066 |
Display.string_of_thm_global thy thm'); true)
|
haftmann@37435
|
1067 |
else false;
|
haftmann@37435
|
1068 |
in (thm, proper) :: filter_out drop eqns end;
|
haftmann@37435
|
1069 |
fun natural_order thy_ref eqns =
|
haftmann@37435
|
1070 |
(eqns, Lazy.lazy (fn () => fold (update_subsume (Theory.deref thy_ref)) eqns []))
|
haftmann@37435
|
1071 |
fun add_eqn' true (Default (eqns, _)) =
|
haftmann@37435
|
1072 |
Default (natural_order (Theory.check_thy thy) ((thm, proper) :: eqns))
|
haftmann@37435
|
1073 |
(*this restores the natural order and drops syntactic redundancies*)
|
haftmann@40040
|
1074 |
| add_eqn' true fun_spec = fun_spec
|
haftmann@40040
|
1075 |
| add_eqn' false (Eqns eqns) = Eqns (update_subsume thy (thm, proper) eqns)
|
haftmann@35226
|
1076 |
| add_eqn' false _ = Eqns [(thm, proper)];
|
haftmann@35226
|
1077 |
in change_fun_spec false c (add_eqn' default) thy end;
|
haftmann@31962
|
1078 |
|
haftmann@31962
|
1079 |
fun add_eqn thm thy =
|
haftmann@31962
|
1080 |
gen_add_eqn false (mk_eqn thy (thm, true)) thy;
|
haftmann@31962
|
1081 |
|
haftmann@31962
|
1082 |
fun add_warning_eqn thm thy =
|
haftmann@31962
|
1083 |
case mk_eqn_warning thy thm
|
haftmann@31962
|
1084 |
of SOME eqn => gen_add_eqn false eqn thy
|
haftmann@31962
|
1085 |
| NONE => thy;
|
haftmann@31962
|
1086 |
|
haftmann@37400
|
1087 |
fun add_nbe_eqn thm thy =
|
haftmann@37400
|
1088 |
gen_add_eqn false (mk_eqn thy (thm, false)) thy;
|
haftmann@37400
|
1089 |
|
haftmann@31962
|
1090 |
fun add_default_eqn thm thy =
|
haftmann@31962
|
1091 |
case mk_eqn_liberal thy thm
|
haftmann@31962
|
1092 |
of SOME eqn => gen_add_eqn true eqn thy
|
haftmann@31962
|
1093 |
| NONE => thy;
|
haftmann@31962
|
1094 |
|
haftmann@31962
|
1095 |
val add_default_eqn_attribute = Thm.declaration_attribute
|
haftmann@31962
|
1096 |
(fn thm => Context.mapping (add_default_eqn thm) I);
|
haftmann@31962
|
1097 |
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
|
haftmann@31962
|
1098 |
|
haftmann@37400
|
1099 |
fun add_nbe_default_eqn thm thy =
|
haftmann@37400
|
1100 |
gen_add_eqn true (mk_eqn thy (thm, false)) thy;
|
haftmann@37400
|
1101 |
|
haftmann@37400
|
1102 |
val add_nbe_default_eqn_attribute = Thm.declaration_attribute
|
haftmann@37400
|
1103 |
(fn thm => Context.mapping (add_nbe_default_eqn thm) I);
|
haftmann@37400
|
1104 |
val add_nbe_default_eqn_attrib = Attrib.internal (K add_nbe_default_eqn_attribute);
|
haftmann@37400
|
1105 |
|
haftmann@35226
|
1106 |
fun add_abs_eqn raw_thm thy =
|
haftmann@35226
|
1107 |
let
|
haftmann@35226
|
1108 |
val (abs_thm, tyco) = (apfst Thm.close_derivation o mk_abs_eqn thy) raw_thm;
|
haftmann@35226
|
1109 |
val c = const_abs_eqn thy abs_thm;
|
haftmann@35226
|
1110 |
in change_fun_spec false c (K (Abstr (abs_thm, tyco))) thy end;
|
haftmann@35226
|
1111 |
|
haftmann@31962
|
1112 |
fun del_eqn thm thy = case mk_eqn_liberal thy thm
|
haftmann@35226
|
1113 |
of SOME (thm, _) => let
|
haftmann@35226
|
1114 |
fun del_eqn' (Default eqns) = empty_fun_spec
|
haftmann@35226
|
1115 |
| del_eqn' (Eqns eqns) =
|
haftmann@35226
|
1116 |
Eqns (filter_out (fn (thm', _) => Thm.eq_thm_prop (thm, thm')) eqns)
|
haftmann@35226
|
1117 |
| del_eqn' spec = spec
|
haftmann@35226
|
1118 |
in change_fun_spec true (const_eqn thy thm) del_eqn' thy end
|
haftmann@31962
|
1119 |
| NONE => thy;
|
haftmann@31962
|
1120 |
|
haftmann@35226
|
1121 |
fun del_eqns c = change_fun_spec true c (K empty_fun_spec);
|
haftmann@34239
|
1122 |
|
haftmann@34239
|
1123 |
|
haftmann@34239
|
1124 |
(* cases *)
|
haftmann@34239
|
1125 |
|
haftmann@37413
|
1126 |
fun case_cong thy case_const (num_args, (pos, constrs)) =
|
haftmann@37413
|
1127 |
let
|
haftmann@37413
|
1128 |
val ([x, y], ctxt) = Name.variants ["A", "A'"] Name.context;
|
haftmann@37413
|
1129 |
val (zs, _) = Name.variants (replicate (num_args - 1) "") ctxt;
|
haftmann@37413
|
1130 |
val (ws, vs) = chop pos zs;
|
haftmann@37423
|
1131 |
val T = Logic.unvarifyT_global (Sign.the_const_type thy case_const);
|
haftmann@37413
|
1132 |
val Ts = (fst o strip_type) T;
|
haftmann@37413
|
1133 |
val T_cong = nth Ts pos;
|
haftmann@37413
|
1134 |
fun mk_prem z = Free (z, T_cong);
|
haftmann@37413
|
1135 |
fun mk_concl z = list_comb (Const (case_const, T), map2 (curry Free) (ws @ z :: vs) Ts);
|
haftmann@37413
|
1136 |
val (prem, concl) = pairself Logic.mk_equals (pairself mk_prem (x, y), pairself mk_concl (x, y));
|
haftmann@37521
|
1137 |
fun tac { context, prems } = Simplifier.rewrite_goals_tac prems
|
haftmann@37413
|
1138 |
THEN ALLGOALS (ProofContext.fact_tac [Drule.reflexive_thm]);
|
haftmann@37413
|
1139 |
in Skip_Proof.prove_global thy (x :: y :: zs) [prem] concl tac end;
|
haftmann@37413
|
1140 |
|
haftmann@34239
|
1141 |
fun add_case thm thy =
|
haftmann@34239
|
1142 |
let
|
haftmann@37413
|
1143 |
val (case_const, (k, case_pats)) = case_cert thm;
|
haftmann@34239
|
1144 |
val _ = case filter_out (is_constr thy) case_pats
|
haftmann@34239
|
1145 |
of [] => ()
|
haftmann@34239
|
1146 |
| cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
|
haftmann@37413
|
1147 |
val entry = (1 + Int.max (1, length case_pats), (k, case_pats));
|
haftmann@37413
|
1148 |
in
|
haftmann@37413
|
1149 |
thy
|
haftmann@37413
|
1150 |
|> Theory.checkpoint
|
haftmann@37413
|
1151 |
|> `(fn thy => case_cong thy case_const entry)
|
haftmann@37413
|
1152 |
|-> (fn cong => (map_exec_purge o map_cases o apfst) (Symtab.update (case_const, (entry, cong))))
|
haftmann@37413
|
1153 |
end;
|
haftmann@34239
|
1154 |
|
haftmann@34239
|
1155 |
fun add_undefined c thy =
|
haftmann@34239
|
1156 |
(map_exec_purge o map_cases o apsnd) (Symtab.update (c, ())) thy;
|
haftmann@34239
|
1157 |
|
haftmann@34239
|
1158 |
|
haftmann@35299
|
1159 |
(* types *)
|
haftmann@34239
|
1160 |
|
haftmann@35299
|
1161 |
fun register_type (tyco, vs_spec) thy =
|
haftmann@34239
|
1162 |
let
|
haftmann@35226
|
1163 |
val (old_constrs, some_old_proj) =
|
haftmann@35299
|
1164 |
case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
|
haftmann@35226
|
1165 |
of (_, (_, Constructors cos)) :: _ => (map fst cos, NONE)
|
haftmann@36209
|
1166 |
| (_, (_, Abstractor ((co, _), (proj, _)))) :: _ => ([co], SOME proj)
|
haftmann@35226
|
1167 |
| [] => ([], NONE)
|
haftmann@35226
|
1168 |
val outdated_funs = case some_old_proj
|
haftmann@35304
|
1169 |
of NONE => old_constrs
|
haftmann@35226
|
1170 |
| SOME old_proj => Symtab.fold
|
haftmann@36209
|
1171 |
(fn (c, ((_, spec), _)) =>
|
haftmann@36209
|
1172 |
if member (op =) (the_list (associated_abstype spec)) tyco
|
haftmann@35226
|
1173 |
then insert (op =) c else I)
|
haftmann@35304
|
1174 |
((the_functions o the_exec) thy) (old_proj :: old_constrs);
|
haftmann@34239
|
1175 |
fun drop_outdated_cases cases = fold Symtab.delete_safe
|
haftmann@37413
|
1176 |
(Symtab.fold (fn (c, ((_, (_, cos)), _)) =>
|
haftmann@35226
|
1177 |
if exists (member (op =) old_constrs) cos
|
haftmann@34239
|
1178 |
then insert (op =) c else I) cases []) cases;
|
haftmann@34239
|
1179 |
in
|
haftmann@34239
|
1180 |
thy
|
haftmann@35226
|
1181 |
|> fold del_eqns outdated_funs
|
haftmann@34239
|
1182 |
|> map_exec_purge
|
haftmann@35226
|
1183 |
((map_typs o Symtab.map_default (tyco, [])) (cons (serial (), vs_spec))
|
haftmann@34239
|
1184 |
#> (map_cases o apfst) drop_outdated_cases)
|
haftmann@34239
|
1185 |
end;
|
haftmann@34239
|
1186 |
|
haftmann@35299
|
1187 |
fun unoverload_const_typ thy (c, ty) = (AxClass.unoverload_const thy (c, ty), ty);
|
haftmann@34239
|
1188 |
|
haftmann@35299
|
1189 |
structure Datatype_Interpretation =
|
haftmann@35299
|
1190 |
Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
|
haftmann@35299
|
1191 |
|
haftmann@35299
|
1192 |
fun datatype_interpretation f = Datatype_Interpretation.interpretation
|
haftmann@37423
|
1193 |
(fn (tyco, _) => fn thy => f (tyco, fst (get_type_spec thy tyco)) thy);
|
haftmann@35226
|
1194 |
|
haftmann@35226
|
1195 |
fun add_datatype proto_constrs thy =
|
haftmann@34239
|
1196 |
let
|
haftmann@35226
|
1197 |
val constrs = map (unoverload_const_typ thy) proto_constrs;
|
haftmann@35226
|
1198 |
val (tyco, (vs, cos)) = constrset_of_consts thy constrs;
|
haftmann@35226
|
1199 |
in
|
haftmann@35226
|
1200 |
thy
|
haftmann@35226
|
1201 |
|> fold (del_eqns o fst) constrs
|
haftmann@35299
|
1202 |
|> register_type (tyco, (vs, Constructors cos))
|
haftmann@35299
|
1203 |
|> Datatype_Interpretation.data (tyco, serial ())
|
haftmann@35226
|
1204 |
end;
|
haftmann@34239
|
1205 |
|
haftmann@35226
|
1206 |
fun add_datatype_cmd raw_constrs thy =
|
haftmann@35226
|
1207 |
add_datatype (map (read_bare_const thy) raw_constrs) thy;
|
haftmann@35226
|
1208 |
|
haftmann@35299
|
1209 |
structure Abstype_Interpretation =
|
haftmann@35299
|
1210 |
Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
|
haftmann@35299
|
1211 |
|
haftmann@35299
|
1212 |
fun abstype_interpretation f = Abstype_Interpretation.interpretation
|
haftmann@35299
|
1213 |
(fn (tyco, _) => fn thy => f (tyco, get_abstype_spec thy tyco) thy);
|
haftmann@35299
|
1214 |
|
haftmann@36112
|
1215 |
fun add_abstype proto_thm thy =
|
haftmann@35226
|
1216 |
let
|
haftmann@36112
|
1217 |
val (tyco, (vs, (abs_ty as (abs, ty), (rep, cert)))) =
|
haftmann@36209
|
1218 |
error_thm (check_abstype_cert thy) proto_thm;
|
haftmann@35226
|
1219 |
in
|
haftmann@35226
|
1220 |
thy
|
haftmann@36112
|
1221 |
|> del_eqns abs
|
haftmann@36112
|
1222 |
|> register_type (tyco, (vs, Abstractor (abs_ty, (rep, cert))))
|
haftmann@36112
|
1223 |
|> change_fun_spec false rep ((K o Proj)
|
haftmann@36112
|
1224 |
(map_types Logic.varifyT_global (mk_proj tyco vs ty abs rep), tyco))
|
haftmann@36112
|
1225 |
|> Abstype_Interpretation.data (tyco, serial ())
|
haftmann@35226
|
1226 |
end;
|
haftmann@35226
|
1227 |
|
haftmann@35226
|
1228 |
|
haftmann@35226
|
1229 |
(** infrastructure **)
|
haftmann@34239
|
1230 |
|
haftmann@32062
|
1231 |
(* c.f. src/HOL/Tools/recfun_codegen.ML *)
|
haftmann@32062
|
1232 |
|
wenzelm@33522
|
1233 |
structure Code_Target_Attr = Theory_Data
|
wenzelm@33522
|
1234 |
(
|
haftmann@31998
|
1235 |
type T = (string -> thm -> theory -> theory) option;
|
haftmann@31998
|
1236 |
val empty = NONE;
|
haftmann@31998
|
1237 |
val extend = I;
|
wenzelm@33522
|
1238 |
fun merge (f1, f2) = if is_some f1 then f1 else f2;
|
haftmann@31998
|
1239 |
);
|
haftmann@31998
|
1240 |
|
haftmann@32062
|
1241 |
fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
|
haftmann@32062
|
1242 |
|
haftmann@32062
|
1243 |
fun code_target_attr prefix thm thy =
|
haftmann@32062
|
1244 |
let
|
haftmann@32062
|
1245 |
val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
|
haftmann@32062
|
1246 |
in thy |> add_warning_eqn thm |> attr prefix thm end;
|
haftmann@35226
|
1247 |
|
haftmann@35226
|
1248 |
|
haftmann@32062
|
1249 |
(* setup *)
|
haftmann@31998
|
1250 |
|
haftmann@31962
|
1251 |
val _ = Context.>> (Context.map_theory
|
haftmann@31962
|
1252 |
(let
|
haftmann@31962
|
1253 |
fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
|
haftmann@31998
|
1254 |
val code_attribute_parser =
|
haftmann@31998
|
1255 |
Args.del |-- Scan.succeed (mk_attribute del_eqn)
|
haftmann@31998
|
1256 |
|| Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
|
haftmann@36112
|
1257 |
|| Args.$$$ "abstype" |-- Scan.succeed (mk_attribute add_abstype)
|
haftmann@35226
|
1258 |
|| Args.$$$ "abstract" |-- Scan.succeed (mk_attribute add_abs_eqn)
|
haftmann@31998
|
1259 |
|| (Args.$$$ "target" |-- Args.colon |-- Args.name >>
|
haftmann@32062
|
1260 |
(mk_attribute o code_target_attr))
|
haftmann@31998
|
1261 |
|| Scan.succeed (mk_attribute add_warning_eqn);
|
haftmann@31962
|
1262 |
in
|
haftmann@35299
|
1263 |
Datatype_Interpretation.init
|
haftmann@31998
|
1264 |
#> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
|
haftmann@31998
|
1265 |
"declare theorems for code generation"
|
haftmann@31962
|
1266 |
end));
|
haftmann@31962
|
1267 |
|
haftmann@24219
|
1268 |
end; (*struct*)
|
haftmann@24219
|
1269 |
|
haftmann@24219
|
1270 |
|
haftmann@35226
|
1271 |
(* type-safe interfaces for data dependent on executable code *)
|
haftmann@24219
|
1272 |
|
haftmann@34160
|
1273 |
functor Code_Data(Data: CODE_DATA_ARGS): CODE_DATA =
|
haftmann@24219
|
1274 |
struct
|
haftmann@24219
|
1275 |
|
haftmann@24219
|
1276 |
type T = Data.T;
|
haftmann@24219
|
1277 |
exception Data of T;
|
haftmann@24219
|
1278 |
fun dest (Data x) = x
|
haftmann@24219
|
1279 |
|
haftmann@34160
|
1280 |
val kind = Code.declare_data (Data Data.empty);
|
haftmann@24219
|
1281 |
|
haftmann@24219
|
1282 |
val data_op = (kind, Data, dest);
|
haftmann@24219
|
1283 |
|
haftmann@39641
|
1284 |
fun change_yield (SOME thy) f = Code.change_yield_data data_op thy f
|
haftmann@39641
|
1285 |
| change_yield NONE f = f Data.empty
|
haftmann@39641
|
1286 |
|
haftmann@39641
|
1287 |
fun change some_thy f = snd (change_yield some_thy (pair () o f));
|
haftmann@24219
|
1288 |
|
haftmann@24219
|
1289 |
end;
|
haftmann@24219
|
1290 |
|
haftmann@28143
|
1291 |
structure Code : CODE = struct open Code; end;
|