1 (* Title: Pure/Isar/code.ML
2 Author: Florian Haftmann, TU Muenchen
4 Abstract executable ingredients of theory. Management of data
5 dependent on executable ingredients as synchronized cache; purged
6 on any change of underlying executable ingredients.
12 val check_const: theory -> term -> string
13 val read_bare_const: theory -> string -> string * typ
14 val read_const: theory -> string -> string
15 val string_of_const: theory -> string -> string
16 val cert_signature: theory -> typ -> typ
17 val read_signature: theory -> string -> typ
18 val const_typ: theory -> string -> typ
19 val subst_signatures: theory -> term -> term
20 val args_number: theory -> string -> int
23 val constrset_of_consts: theory -> (string * typ) list
24 -> string * ((string * sort) list * (string * ((string * sort) list * typ list)) list)
26 (*code equations and certificates*)
27 val mk_eqn: theory -> thm * bool -> thm * bool
28 val mk_eqn_warning: theory -> thm -> (thm * bool) option
29 val mk_eqn_liberal: theory -> thm -> (thm * bool) option
30 val assert_eqn: theory -> thm * bool -> thm * bool
31 val const_typ_eqn: theory -> thm -> string * typ
32 val expand_eta: theory -> int -> thm -> thm
34 val empty_cert: theory -> string -> cert
35 val cert_of_eqns: theory -> string -> (thm * bool) list -> cert
36 val constrain_cert: theory -> sort list -> cert -> cert
37 val typargs_deps_of_cert: theory -> cert -> (string * sort) list * (string * typ list) list
38 val equations_of_cert: theory -> cert -> ((string * sort) list * typ)
39 * (((term * string option) list * (term * string option)) * (thm option * bool)) list
40 val bare_thms_of_cert: theory -> cert -> thm list
41 val pretty_cert: theory -> cert -> Pretty.T list
44 val add_type: string -> theory -> theory
45 val add_type_cmd: string -> theory -> theory
46 val add_signature: string * typ -> theory -> theory
47 val add_signature_cmd: string * string -> theory -> theory
48 val add_datatype: (string * typ) list -> theory -> theory
49 val add_datatype_cmd: string list -> theory -> theory
50 val datatype_interpretation:
51 (string * ((string * sort) list * (string * ((string * sort) list * typ list)) list)
52 -> theory -> theory) -> theory -> theory
53 val add_abstype: thm -> theory -> theory
54 val abstype_interpretation:
55 (string * ((string * sort) list * ((string * ((string * sort) list * typ)) * (string * thm)))
56 -> theory -> theory) -> theory -> theory
57 val add_eqn: thm -> theory -> theory
58 val add_nbe_eqn: thm -> theory -> theory
59 val add_default_eqn: thm -> theory -> theory
60 val add_default_eqn_attribute: attribute
61 val add_default_eqn_attrib: Attrib.src
62 val add_nbe_default_eqn: thm -> theory -> theory
63 val add_nbe_default_eqn_attribute: attribute
64 val add_nbe_default_eqn_attrib: Attrib.src
65 val del_eqn: thm -> theory -> theory
66 val del_eqns: string -> theory -> theory
67 val add_case: thm -> theory -> theory
68 val add_undefined: string -> theory -> theory
69 val get_type: theory -> string
70 -> ((string * sort) list * (string * ((string * sort) list * typ list)) list) * bool
71 val get_type_of_constr_or_abstr: theory -> string -> (string * bool) option
72 val is_constr: theory -> string -> bool
73 val is_abstr: theory -> string -> bool
74 val get_cert: theory -> ((thm * bool) list -> (thm * bool) list) -> string -> cert
75 val get_case_scheme: theory -> string -> (int * (int * string list)) option
76 val get_case_cong: theory -> string -> thm option
77 val undefineds: theory -> string list
78 val print_codesetup: theory -> unit
81 val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory
84 signature CODE_DATA_ARGS =
93 val change: theory option -> (T -> T) -> T
94 val change_yield: theory option -> (T -> 'a * T) -> 'a * T
97 signature PRIVATE_CODE =
100 val declare_data: Object.T -> serial
101 val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
102 -> theory -> ('a -> 'b * 'a) -> 'b * 'a
105 structure Code : PRIVATE_CODE =
112 fun string_of_typ thy =
113 Syntax.string_of_typ (Config.put show_sorts true (Syntax.init_pretty_global thy));
115 fun string_of_const thy c =
116 let val ctxt = Proof_Context.init_global thy in
117 case AxClass.inst_of_param thy c of
119 Proof_Context.extern_const ctxt c ^ " " ^ enclose "[" "]"
120 (Proof_Context.extern_type ctxt tyco)
121 | NONE => Proof_Context.extern_const ctxt c
127 fun typ_equiv tys = Type.raw_instance tys andalso Type.raw_instance (swap tys);
129 fun check_bare_const thy t = case try dest_Const t
131 | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
133 fun check_unoverload thy (c, ty) =
135 val c' = AxClass.unoverload_const thy (c, ty);
136 val ty_decl = Sign.the_const_type thy c';
137 in if Sign.typ_equiv thy
138 (Type.strip_sorts ty_decl, Type.strip_sorts (Logic.varifyT_global ty)) then c'
139 else error ("Type\n" ^ string_of_typ thy ty
140 ^ "\nof constant " ^ quote c
141 ^ "\nis too specific compared to declared type\n"
142 ^ string_of_typ thy ty_decl)
145 fun check_const thy = check_unoverload thy o check_bare_const thy;
147 fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
149 fun read_const thy = check_unoverload thy o read_bare_const thy;
156 datatype typ_spec = Constructors of (string * ((string * sort) list * typ list)) list
157 | Abstractor of (string * ((string * sort) list * typ)) * (string * thm);
159 fun constructors_of (Constructors cos) = (cos, false)
160 | constructors_of (Abstractor ((co, (vs, ty)), _)) = ([(co, (vs, [ty]))], true);
165 datatype fun_spec = Default of (thm * bool) list * (thm * bool) list lazy
166 | Eqns of (thm * bool) list
167 | Proj of term * string
168 | Abstr of thm * string;
170 val empty_fun_spec = Default ([], Lazy.value []);
172 fun is_default (Default _) = true
173 | is_default _ = false;
175 fun associated_abstype (Abstr (_, tyco)) = SOME tyco
176 | associated_abstype _ = NONE;
179 (* executable code data *)
181 datatype spec = Spec of {
182 history_concluded: bool,
183 signatures: int Symtab.table * typ Symtab.table,
184 functions: ((bool * fun_spec) * (serial * fun_spec) list) Symtab.table
185 (*with explicit history*),
186 types: ((serial * ((string * sort) list * typ_spec)) list) Symtab.table
187 (*with explicit history*),
188 cases: ((int * (int * string list)) * thm) Symtab.table * unit Symtab.table
191 fun make_spec (history_concluded, ((signatures, functions), (types, cases))) =
192 Spec { history_concluded = history_concluded,
193 signatures = signatures, functions = functions, types = types, cases = cases };
194 fun map_spec f (Spec { history_concluded = history_concluded, signatures = signatures,
195 functions = functions, types = types, cases = cases }) =
196 make_spec (f (history_concluded, ((signatures, functions), (types, cases))));
197 fun merge_spec (Spec { history_concluded = _, signatures = (tycos1, sigs1), functions = functions1,
198 types = types1, cases = (cases1, undefs1) },
199 Spec { history_concluded = _, signatures = (tycos2, sigs2), functions = functions2,
200 types = types2, cases = (cases2, undefs2) }) =
202 val signatures = (Symtab.merge (op =) (tycos1, tycos2),
203 Symtab.merge typ_equiv (sigs1, sigs2));
204 val types = Symtab.join (K (AList.merge (op =) (K true))) (types1, types2);
205 fun merge_functions ((_, history1), (_, history2)) =
207 val raw_history = AList.merge (op = : serial * serial -> bool)
208 (K true) (history1, history2);
209 val filtered_history = filter_out (is_default o snd) raw_history;
210 val history = if null filtered_history
211 then raw_history else filtered_history;
212 in ((false, (snd o hd) history), history) end;
213 val all_constructors =
214 maps (map fst o fst o constructors_of o snd o snd o hd o snd) (Symtab.dest types);
215 val functions = Symtab.join (K merge_functions) (functions1, functions2)
216 |> fold (fn c => Symtab.map_entry c (apfst (K (true, empty_fun_spec)))) all_constructors;
217 val cases = (Symtab.merge (K true) (cases1, cases2),
218 Symtab.merge (K true) (undefs1, undefs2));
219 in make_spec (false, ((signatures, functions), (types, cases))) end;
221 fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
222 fun the_signatures (Spec { signatures, ... }) = signatures;
223 fun the_functions (Spec { functions, ... }) = functions;
224 fun the_types (Spec { types, ... }) = types;
225 fun the_cases (Spec { cases, ... }) = cases;
226 val map_history_concluded = map_spec o apfst;
227 val map_signatures = map_spec o apsnd o apfst o apfst;
228 val map_functions = map_spec o apsnd o apfst o apsnd;
229 val map_typs = map_spec o apsnd o apsnd o apfst;
230 val map_cases = map_spec o apsnd o apsnd o apsnd;
233 (* data slots dependent on executable code *)
235 (*private copy avoids potential conflict of table exceptions*)
236 structure Datatab = Table(type key = int val ord = int_ord);
240 type kind = { empty: Object.T };
242 val kinds = Unsynchronized.ref (Datatab.empty: kind Datatab.table);
244 fun invoke f k = case Datatab.lookup (! kinds) k
245 of SOME kind => f kind
246 | NONE => raise Fail "Invalid code data identifier";
250 fun declare_data empty =
253 val kind = { empty = empty };
254 val _ = CRITICAL (fn () => Unsynchronized.change kinds (Datatab.update (k, kind)));
257 fun invoke_init k = invoke (fn kind => #empty kind) k;
266 type data = Object.T Datatab.table;
267 fun empty_dataref () = Synchronized.var "code data" (NONE : (data * theory_ref) option);
269 structure Code_Data = Theory_Data
271 type T = spec * (data * theory_ref) option Synchronized.var;
272 val empty = (make_spec (false, (((Symtab.empty, Symtab.empty), Symtab.empty),
273 (Symtab.empty, (Symtab.empty, Symtab.empty)))), empty_dataref ());
274 val extend = I (* FIXME empty_dataref!?! *)
275 fun merge ((spec1, _), (spec2, _)) =
276 (merge_spec (spec1, spec2), empty_dataref ());
282 (* access to executable code *)
284 val the_exec = fst o Code_Data.get;
286 fun map_exec_purge f = Code_Data.map (fn (exec, _) => (f exec, empty_dataref ()));
288 fun change_fun_spec delete c f = (map_exec_purge o map_functions
289 o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, empty_fun_spec), [])))
290 o apfst) (fn (_, spec) => (true, f spec));
293 (* tackling equation history *)
295 fun continue_history thy = if (history_concluded o the_exec) thy
297 |> (Code_Data.map o apfst o map_history_concluded) (K false)
301 fun conclude_history thy = if (history_concluded o the_exec) thy
304 |> (Code_Data.map o apfst)
305 ((map_functions o Symtab.map) (fn _ => fn ((changed, current), history) =>
307 if changed then (serial (), current) :: history else history))
308 #> map_history_concluded (K true))
311 val _ = Context.>> (Context.map_theory (Theory.at_begin continue_history #> Theory.at_end conclude_history));
314 (* access to data dependent on abstract executable code *)
316 fun change_yield_data (kind, mk, dest) theory f =
318 val dataref = (snd o Code_Data.get) theory;
319 val (datatab, thy_ref) = case Synchronized.value dataref
320 of SOME (datatab, thy_ref) => if Theory.eq_thy (theory, Theory.deref thy_ref)
321 then (datatab, thy_ref)
322 else (Datatab.empty, Theory.check_thy theory)
323 | NONE => (Datatab.empty, Theory.check_thy theory)
324 val data = case Datatab.lookup datatab kind
326 | NONE => invoke_init kind;
327 val result as (_, data') = f (dest data);
328 val _ = Synchronized.change dataref
329 ((K o SOME) (Datatab.update (kind, mk data') datatab, thy_ref));
339 fun arity_number thy tyco = case Symtab.lookup ((fst o the_signatures o the_exec) thy) tyco
341 | NONE => Sign.arity_number thy tyco;
345 val ctxt = Syntax.init_pretty_global thy;
346 val (tycos, _) = the_signatures (the_exec thy);
347 val decls = #types (Type.rep_tsig (Sign.tsig_of thy))
349 |> Symtab.fold (fn (tyco, n) =>
350 Symtab.update (tyco, Type.LogicalType n)) tycos;
353 |> Symtab.fold (fn (tyco, Type.LogicalType n) => Type.add_type ctxt Name_Space.default_naming
354 (Binding.qualified_name tyco, n) | _ => I) decls
357 fun cert_signature thy =
358 Logic.varifyT_global o Type.cert_typ (build_tsig thy) o Type.no_tvars;
360 fun read_signature thy =
361 cert_signature thy o Type.strip_sorts o Syntax.parse_typ (Proof_Context.init_global thy);
363 fun expand_signature thy = Type.cert_typ_mode Type.mode_syntax (Sign.tsig_of thy);
365 fun lookup_typ thy = Symtab.lookup ((snd o the_signatures o the_exec) thy);
367 fun const_typ thy c = case lookup_typ thy c
369 | NONE => (Type.strip_sorts o Sign.the_const_type thy) c;
371 fun args_number thy = length o binder_types o const_typ thy;
373 fun subst_signature thy c ty =
375 fun mk_subst (Type (_, tys1)) (Type (_, tys2)) =
376 fold2 mk_subst tys1 tys2
377 | mk_subst ty (TVar (v, _)) = Vartab.update (v, ([], ty))
378 in case lookup_typ thy c
379 of SOME ty' => Envir.subst_type (mk_subst ty (expand_signature thy ty') Vartab.empty) ty'
383 fun subst_signatures thy = map_aterms (fn Const (c, ty) => Const (c, subst_signature thy c ty) | t => t);
385 fun logical_typscheme thy (c, ty) =
386 (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
388 fun typscheme thy (c, ty) = logical_typscheme thy (c, subst_signature thy c ty);
393 fun no_constr thy s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c
394 ^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s);
396 fun analyze_constructor thy (c, raw_ty) =
398 val _ = Thm.cterm_of thy (Const (c, raw_ty));
399 val ty = subst_signature thy c raw_ty;
400 val ty_decl = (Logic.unvarifyT_global o const_typ thy) c;
401 fun last_typ c_ty ty =
403 val tfrees = Term.add_tfreesT ty [];
404 val (tyco, vs) = (apsnd o map) dest_TFree (dest_Type (body_type ty))
405 handle TYPE _ => no_constr thy "bad type" c_ty
406 val _ = if tyco = "fun" then no_constr thy "bad type" c_ty else ();
407 val _ = if has_duplicates (eq_fst (op =)) vs
408 then no_constr thy "duplicate type variables in datatype" c_ty else ();
409 val _ = if length tfrees <> length vs
410 then no_constr thy "type variables missing in datatype" c_ty else ();
412 val (tyco, _) = last_typ (c, ty) ty_decl;
413 val (_, vs) = last_typ (c, ty) ty;
414 in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
416 fun constrset_of_consts thy cs =
418 val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
419 then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
420 fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
422 val _ = if (tyco' : string) <> tyco
423 then error "Different type constructors in constructor set"
426 map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
427 in ((tyco, sorts''), c :: cs) end;
428 fun inst vs' (c, (vs, ty)) =
430 val the_v = the o AList.lookup (op =) (vs ~~ vs');
431 val ty' = map_type_tfree (fn (v, _) => TFree (the_v v)) ty;
432 val (vs'', _) = logical_typscheme thy (c, ty');
433 in (c, (vs'', binder_types ty')) end;
434 val c' :: cs' = map (analyze_constructor thy) cs;
435 val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
436 val vs = Name.names Name.context Name.aT sorts;
437 val cs''' = map (inst vs) cs'';
438 in (tyco, (vs, rev cs''')) end;
440 fun get_type_entry thy tyco = case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
441 of (_, entry) :: _ => SOME entry
444 fun get_type thy tyco = case get_type_entry thy tyco
445 of SOME (vs, spec) => apfst (pair vs) (constructors_of spec)
446 | NONE => arity_number thy tyco
447 |> Name.invents Name.context Name.aT
452 fun get_abstype_spec thy tyco = case get_type_entry thy tyco
453 of SOME (vs, Abstractor spec) => (vs, spec)
454 | _ => error ("Not an abstract type: " ^ tyco);
456 fun get_type_of_constr_or_abstr thy c =
457 case (body_type o const_typ thy) c
458 of Type (tyco, _) => let val ((_, cos), abstract) = get_type thy tyco
459 in if member (op =) (map fst cos) c then SOME (tyco, abstract) else NONE end
462 fun is_constr thy c = case get_type_of_constr_or_abstr thy c
463 of SOME (_, false) => true
466 fun is_abstr thy c = case get_type_of_constr_or_abstr thy c
467 of SOME (_, true) => true
471 (* bare code equations *)
473 (* convention for variables:
474 ?x ?'a for free-floating theorems (e.g. in the data store)
475 ?x 'a for certificates
476 x 'a for final representation of equations
479 exception BAD_THM of string;
480 fun bad_thm msg = raise BAD_THM msg;
481 fun error_thm f thm = f thm handle BAD_THM msg => error msg;
482 fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
483 fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
486 let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
487 in not (has_duplicates (op =) ((fold o fold_aterms)
488 (fn Var (v, _) => cons v | _ => I) args [])) end;
490 fun check_decl_ty thy (c, ty) =
492 val ty_decl = Sign.the_const_type thy c;
493 in if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty) then ()
494 else bad_thm ("Type\n" ^ string_of_typ thy ty
495 ^ "\nof constant " ^ quote c
496 ^ "\nis too specific compared to declared type\n"
497 ^ string_of_typ thy ty_decl)
500 fun check_eqn thy { allow_nonlinear, allow_consts, allow_pats } thm (lhs, rhs) =
502 fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
503 fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
504 | Free _ => bad "Illegal free variable in equation"
506 fun tvars_of t = fold_term_types (fn _ =>
507 fold_atyps (fn TVar (v, _) => insert (op =) v
508 | TFree _ => bad "Illegal free type variable in equation")) t [];
509 val lhs_vs = vars_of lhs;
510 val rhs_vs = vars_of rhs;
511 val lhs_tvs = tvars_of lhs;
512 val rhs_tvs = tvars_of rhs;
513 val _ = if null (subtract (op =) lhs_vs rhs_vs)
515 else bad "Free variables on right hand side of equation";
516 val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
518 else bad "Free type variables on right hand side of equation";
519 val (head, args) = strip_comb lhs;
520 val (c, ty) = case head
521 of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
522 | _ => bad "Equation not headed by constant";
523 fun check _ (Abs _) = bad "Abstraction on left hand side of equation"
524 | check 0 (Var _) = ()
525 | check _ (Var _) = bad "Variable with application on left hand side of equation"
526 | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
527 | check n (Const (c_ty as (c, ty))) =
528 if allow_pats then let
529 val c' = AxClass.unoverload_const thy c_ty
530 in if n = (length o binder_types o subst_signature thy c') ty
531 then if allow_consts orelse is_constr thy c'
533 else bad (quote c ^ " is not a constructor, on left hand side of equation")
534 else bad ("Partially applied constant " ^ quote c ^ " on left hand side of equation")
535 end else bad ("Pattern not allowed here, but constant " ^ quote c ^ " encountered on left hand side")
536 val _ = map (check 0) args;
537 val _ = if allow_nonlinear orelse is_linear thm then ()
538 else bad "Duplicate variables on left hand side of equation";
539 val _ = if (is_none o AxClass.class_of_param thy) c then ()
540 else bad "Overloaded constant as head in equation";
541 val _ = if not (is_constr thy c) then ()
542 else bad "Constructor as head in equation";
543 val _ = if not (is_abstr thy c) then ()
544 else bad "Abstractor as head in equation";
545 val _ = check_decl_ty thy (c, ty);
548 fun gen_assert_eqn thy check_patterns (thm, proper) =
550 fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
551 val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
552 handle TERM _ => bad "Not an equation"
553 | THM _ => bad "Not a proper equation";
554 val _ = check_eqn thy { allow_nonlinear = not proper,
555 allow_consts = not (proper andalso check_patterns), allow_pats = true } thm (lhs, rhs);
556 in (thm, proper) end;
558 fun assert_abs_eqn thy some_tyco thm =
560 fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
561 val (full_lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
562 handle TERM _ => bad "Not an equation"
563 | THM _ => bad "Not a proper equation";
564 val (rep, lhs) = dest_comb full_lhs
565 handle TERM _ => bad "Not an abstract equation";
566 val (rep_const, ty) = dest_Const rep;
567 val (tyco, Ts) = (dest_Type o domain_type) ty
568 handle TERM _ => bad "Not an abstract equation"
569 | TYPE _ => bad "Not an abstract equation";
570 val _ = case some_tyco of SOME tyco' => if tyco = tyco' then ()
571 else bad ("Abstract type mismatch:" ^ quote tyco ^ " vs. " ^ quote tyco')
573 val (vs', (_, (rep', _))) = get_abstype_spec thy tyco;
574 val _ = if rep_const = rep' then ()
575 else bad ("Projection mismatch: " ^ quote rep_const ^ " vs. " ^ quote rep');
576 val _ = check_eqn thy { allow_nonlinear = false,
577 allow_consts = false, allow_pats = false } thm (lhs, rhs);
578 val _ = if forall2 (fn T => fn (_, sort) => Sign.of_sort thy (T, sort)) Ts vs' then ()
579 else error ("Type arguments do not satisfy sort constraints of abstype certificate.");
582 fun assert_eqn thy = error_thm (gen_assert_eqn thy true);
584 fun meta_rewrite thy = Local_Defs.meta_rewrite_rule (Proof_Context.init_global thy);
586 fun mk_eqn thy = error_thm (gen_assert_eqn thy false) o
587 apfst (meta_rewrite thy);
589 fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
590 o warning_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
592 fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
593 o try_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
595 fun mk_abs_eqn thy = error_thm (assert_abs_eqn thy NONE) o meta_rewrite thy;
597 val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
599 fun const_typ_eqn thy thm =
601 val (c, ty) = head_eqn thm;
602 val c' = AxClass.unoverload_const thy (c, ty);
603 (*permissive wrt. to overloaded constants!*)
606 fun const_eqn thy = fst o const_typ_eqn thy;
608 fun const_abs_eqn thy = AxClass.unoverload_const thy o dest_Const o fst o strip_comb o snd
609 o dest_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
611 fun mk_proj tyco vs ty abs rep =
613 val ty_abs = Type (tyco, map TFree vs);
614 val xarg = Var (("x", 0), ty);
615 in Logic.mk_equals (Const (rep, ty_abs --> ty) $ (Const (abs, ty --> ty_abs) $ xarg), xarg) end;
618 (* technical transformations of code equations *)
620 fun expand_eta thy k thm =
622 val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm;
623 val (_, args) = strip_comb lhs;
625 then (length o fst o strip_abs) rhs
626 else Int.max (0, k - length args);
627 val (raw_vars, _) = Term.strip_abs_eta l rhs;
628 val vars = burrow_fst (Name.variant_list (map (fst o fst) (Term.add_vars lhs [])))
630 fun expand (v, ty) thm = Drule.fun_cong_rule thm
631 (Thm.cterm_of thy (Var ((v, 0), ty)));
635 |> Conv.fconv_rule Drule.beta_eta_conversion
638 fun same_arity thy thms =
640 val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals;
641 val k = fold (Integer.max o num_args_of o Thm.prop_of) thms 0;
642 in map (expand_eta thy k) thms end;
644 fun mk_desymbolization pre post mk vs =
646 val names = map (pre o fst o fst) vs
647 |> map (Name.desymbolize false)
648 |> Name.variant_list []
650 in map_filter (fn (((v, i), x), v') =>
651 if v = v' andalso i = 0 then NONE
652 else SOME (((v, i), x), mk ((v', 0), x))) (vs ~~ names)
655 fun desymbolize_tvars thms =
657 val tvs = fold (Term.add_tvars o Thm.prop_of) thms [];
658 val tvar_subst = mk_desymbolization (unprefix "'") (prefix "'") TVar tvs;
659 in map (Thm.certify_instantiate (tvar_subst, [])) thms end;
661 fun desymbolize_vars thm =
663 val vs = Term.add_vars (Thm.prop_of thm) [];
664 val var_subst = mk_desymbolization I I Var vs;
665 in Thm.certify_instantiate ([], var_subst) thm end;
667 fun canonize_thms thy = desymbolize_tvars #> same_arity thy #> map desymbolize_vars;
670 (* abstype certificates *)
672 fun check_abstype_cert thy proto_thm =
674 val thm = (AxClass.unoverload thy o meta_rewrite thy) proto_thm;
675 fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
676 val (lhs, rhs) = Logic.dest_equals (Thm.plain_prop_of thm)
677 handle TERM _ => bad "Not an equation"
678 | THM _ => bad "Not a proper equation";
679 val ((abs, raw_ty), ((rep, rep_ty), param)) = (apsnd (apfst dest_Const o dest_comb)
680 o apfst dest_Const o dest_comb) lhs
681 handle TERM _ => bad "Not an abstype certificate";
682 val _ = pairself (fn c => if (is_some o AxClass.class_of_param thy) c
683 then error ("Is a class parameter: " ^ string_of_const thy c) else ()) (abs, rep);
684 val _ = check_decl_ty thy (abs, raw_ty);
685 val _ = check_decl_ty thy (rep, rep_ty);
686 val _ = (fst o dest_Var) param
687 handle TERM _ => bad "Not an abstype certificate";
688 val _ = if param = rhs then () else bad "Not an abstype certificate";
689 val ((tyco, sorts), (abs, (vs, ty'))) = analyze_constructor thy (abs, Logic.unvarifyT_global raw_ty);
690 val ty = domain_type ty';
691 val (vs', _) = logical_typscheme thy (abs, ty');
692 in (tyco, (vs ~~ sorts, ((abs, (vs', ty)), (rep, thm)))) end;
695 (* code equation certificates *)
697 fun build_head thy (c, ty) =
698 Thm.cterm_of thy (Logic.mk_equals (Free ("HEAD", ty), Const (c, ty)));
700 fun get_head thy cert_thm =
702 val [head] = (#hyps o Thm.crep_thm) cert_thm;
703 val (_, Const (c, ty)) = (Logic.dest_equals o Thm.term_of) head;
704 in (typscheme thy (c, ty), head) end;
706 fun typscheme_projection thy =
707 typscheme thy o dest_Const o fst o dest_comb o fst o Logic.dest_equals;
709 fun typscheme_abs thy =
710 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;
712 fun constrain_thm thy vs sorts thm =
714 val mapping = map2 (fn (v, sort) => fn sort' =>
715 (v, Sorts.inter_sort (Sign.classes_of thy) (sort, sort'))) vs sorts;
716 val inst = map2 (fn (v, sort) => fn (_, sort') =>
717 (((v, 0), sort), TFree (v, sort'))) vs mapping;
718 val subst = (map_types o map_type_tfree)
719 (fn (v, _) => TFree (v, the (AList.lookup (op =) mapping v)));
722 |> Thm.varifyT_global
723 |> Thm.certify_instantiate (inst, [])
727 fun concretify_abs thy tyco abs_thm =
729 val (_, ((c, _), (_, cert))) = get_abstype_spec thy tyco;
730 val lhs = (fst o Logic.dest_equals o Thm.prop_of) abs_thm
731 val ty = fastype_of lhs;
732 val ty_abs = (fastype_of o snd o dest_comb) lhs;
733 val abs = Thm.cterm_of thy (Const (c, ty --> ty_abs));
734 val raw_concrete_thm = Drule.transitive_thm OF [Thm.symmetric cert, Thm.combination (Thm.reflexive abs) abs_thm];
735 in (c, (Thm.varifyT_global o zero_var_indexes) raw_concrete_thm) end;
737 fun add_rhss_of_eqn thy t =
739 val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy) t;
740 fun add_const (Const (c, ty)) = insert (op =) (c, Sign.const_typargs thy (c, ty))
742 val add_consts = fold_aterms add_const
743 in add_consts rhs o fold add_consts args end;
746 apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy o Logic.unvarify_global;
748 abstype cert = Equations of thm * bool list
749 | Projection of term * string
750 | Abstract of thm * string
753 fun empty_cert thy c =
755 val raw_ty = Logic.unvarifyT_global (const_typ thy c);
756 val (vs, _) = logical_typscheme thy (c, raw_ty);
757 val sortargs = case AxClass.class_of_param thy c
758 of SOME class => [[class]]
759 | NONE => (case get_type_of_constr_or_abstr thy c
760 of SOME (tyco, _) => (map snd o fst o the)
761 (AList.lookup (op =) ((snd o fst o get_type thy) tyco) c)
762 | NONE => replicate (length vs) []);
763 val the_sort = the o AList.lookup (op =) (map fst vs ~~ sortargs);
764 val ty = map_type_tfree (fn (v, _) => TFree (v, the_sort v)) raw_ty
765 val chead = build_head thy (c, ty);
766 in Equations (Thm.weaken chead Drule.dummy_thm, []) end;
768 fun cert_of_eqns thy c [] = empty_cert thy c
769 | cert_of_eqns thy c raw_eqns =
771 val eqns = burrow_fst (canonize_thms thy) raw_eqns;
772 val _ = map (assert_eqn thy) eqns;
773 val (thms, propers) = split_list eqns;
774 val _ = map (fn thm => if c = const_eqn thy thm then ()
775 else error ("Wrong head of code equation,\nexpected constant "
776 ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)) thms;
777 fun tvars_of T = rev (Term.add_tvarsT T []);
778 val vss = map (tvars_of o snd o head_eqn) thms;
780 fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
781 val sorts = map_transpose inter_sorts vss;
782 val vts = Name.names Name.context Name.aT sorts;
784 map2 (fn vs => Thm.certify_instantiate (vs ~~ map TFree vts, [])) vss thms;
785 val head_thm = Thm.symmetric (Thm.assume (build_head thy (head_eqn (hd thms'))));
786 fun head_conv ct = if can Thm.dest_comb ct
787 then Conv.fun_conv head_conv ct
788 else Conv.rewr_conv head_thm ct;
789 val rewrite_head = Conv.fconv_rule (Conv.arg1_conv head_conv);
790 val cert_thm = Conjunction.intr_balanced (map rewrite_head thms');
791 in Equations (cert_thm, propers) end;
793 fun cert_of_proj thy c tyco =
795 val (vs, ((abs, (_, ty)), (rep, _))) = get_abstype_spec thy tyco;
796 val _ = if c = rep then () else
797 error ("Wrong head of projection,\nexpected constant " ^ string_of_const thy rep);
798 in Projection (mk_proj tyco vs ty abs rep, tyco) end;
800 fun cert_of_abs thy tyco c raw_abs_thm =
802 val abs_thm = singleton (canonize_thms thy) raw_abs_thm;
803 val _ = assert_abs_eqn thy (SOME tyco) abs_thm;
804 val _ = if c = const_abs_eqn thy abs_thm then ()
805 else error ("Wrong head of abstract code equation,\nexpected constant "
806 ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy abs_thm);
807 in Abstract (Thm.legacy_freezeT abs_thm, tyco) end;
809 fun constrain_cert thy sorts (Equations (cert_thm, propers)) =
811 val ((vs, _), head) = get_head thy cert_thm;
812 val (subst, cert_thm') = cert_thm
813 |> Thm.implies_intr head
814 |> constrain_thm thy vs sorts;
815 val head' = Thm.term_of head
818 val cert_thm'' = cert_thm'
819 |> Thm.elim_implies (Thm.assume head');
820 in Equations (cert_thm'', propers) end
821 | constrain_cert thy _ (cert as Projection _) =
823 | constrain_cert thy sorts (Abstract (abs_thm, tyco)) =
824 Abstract (snd (constrain_thm thy (fst (typscheme_abs thy abs_thm)) sorts abs_thm), tyco);
826 fun typscheme_of_cert thy (Equations (cert_thm, _)) =
827 fst (get_head thy cert_thm)
828 | typscheme_of_cert thy (Projection (proj, _)) =
829 typscheme_projection thy proj
830 | typscheme_of_cert thy (Abstract (abs_thm, _)) =
831 typscheme_abs thy abs_thm;
833 fun typargs_deps_of_cert thy (Equations (cert_thm, propers)) =
835 val vs = (fst o fst) (get_head thy cert_thm);
836 val equations = if null propers then [] else
838 |> Logic.dest_conjunction_balanced (length propers);
839 in (vs, fold (add_rhss_of_eqn thy) equations []) end
840 | typargs_deps_of_cert thy (Projection (t, _)) =
841 (fst (typscheme_projection thy t), add_rhss_of_eqn thy t [])
842 | typargs_deps_of_cert thy (Abstract (abs_thm, tyco)) =
844 val vs = fst (typscheme_abs thy abs_thm);
845 val (_, concrete_thm) = concretify_abs thy tyco abs_thm;
846 in (vs, add_rhss_of_eqn thy (map_types Logic.unvarifyT_global (Thm.prop_of concrete_thm)) []) end;
848 fun equations_of_cert thy (cert as Equations (cert_thm, propers)) =
850 val tyscm = typscheme_of_cert thy cert;
851 val thms = if null propers then [] else
853 |> Local_Defs.expand [snd (get_head thy cert_thm)]
854 |> Thm.varifyT_global
855 |> Conjunction.elim_balanced (length propers);
856 fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, NONE));
857 in (tyscm, map (abstractions o dest_eqn thy o Thm.prop_of) thms ~~ (map SOME thms ~~ propers)) end
858 | equations_of_cert thy (Projection (t, tyco)) =
860 val (_, ((abs, _), _)) = get_abstype_spec thy tyco;
861 val tyscm = typscheme_projection thy t;
862 val t' = map_types Logic.varifyT_global t;
863 fun abstractions (args, rhs) = (map (rpair (SOME abs)) args, (rhs, NONE));
864 in (tyscm, [((abstractions o dest_eqn thy) t', (NONE, true))]) end
865 | equations_of_cert thy (Abstract (abs_thm, tyco)) =
867 val tyscm = typscheme_abs thy abs_thm;
868 val (abs, concrete_thm) = concretify_abs thy tyco abs_thm;
869 fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, (SOME abs)));
871 (tyscm, [((abstractions o dest_eqn thy o Thm.prop_of) concrete_thm,
872 (SOME (Thm.varifyT_global abs_thm), true))])
875 fun pretty_cert thy (cert as Equations _) =
876 (map_filter (Option.map (Display.pretty_thm_global thy o AxClass.overload thy) o fst o snd)
877 o snd o equations_of_cert thy) cert
878 | pretty_cert thy (Projection (t, _)) =
879 [Syntax.pretty_term_global thy (map_types Logic.varifyT_global t)]
880 | pretty_cert thy (Abstract (abs_thm, _)) =
881 [(Display.pretty_thm_global thy o AxClass.overload thy o Thm.varifyT_global) abs_thm];
883 fun bare_thms_of_cert thy (cert as Equations _) =
884 (map_filter (fn (_, (some_thm, proper)) => if proper then some_thm else NONE)
885 o snd o equations_of_cert thy) cert
886 | bare_thms_of_cert thy (Projection _) = []
887 | bare_thms_of_cert thy (Abstract (abs_thm, tyco)) =
888 [Thm.varifyT_global (snd (concretify_abs thy tyco abs_thm))];
893 (* code certificate access *)
895 fun retrieve_raw thy c =
896 Symtab.lookup ((the_functions o the_exec) thy) c
897 |> Option.map (snd o fst)
898 |> the_default empty_fun_spec
900 fun get_cert thy f c = case retrieve_raw thy c
901 of Default (_, eqns_lazy) => Lazy.force eqns_lazy
902 |> (map o apfst) (Thm.transfer thy)
904 |> (map o apfst) (AxClass.unoverload thy)
905 |> cert_of_eqns thy c
907 |> (map o apfst) (Thm.transfer thy)
909 |> (map o apfst) (AxClass.unoverload thy)
910 |> cert_of_eqns thy c
912 cert_of_proj thy c tyco
913 | Abstr (abs_thm, tyco) => abs_thm
915 |> AxClass.unoverload thy
916 |> cert_of_abs thy tyco c;
921 fun case_certificate thm =
923 val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
924 o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
925 val _ = case head of Free _ => true
927 | _ => raise TERM ("case_cert", []);
928 val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
929 val (Const (case_const, _), raw_params) = strip_comb case_expr;
930 val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
931 val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
932 val params = map (fst o dest_Var) (nth_drop n raw_params);
935 val (head' $ t_co, rhs) = Logic.dest_equals t;
936 val _ = if head' = head then () else raise TERM ("case_cert", []);
937 val (Const (co, _), args) = strip_comb t_co;
938 val (Var (param, _), args') = strip_comb rhs;
939 val _ = if args' = args then () else raise TERM ("case_cert", []);
941 fun analyze_cases cases =
943 val co_list = fold (AList.update (op =) o dest_case) cases [];
944 in map (the o AList.lookup (op =) co_list) params end;
947 val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
948 val _ = if head' = head then () else raise TERM ("case_cert", []);
949 val _ = if arg' = arg then () else raise TERM ("case_cert", []);
950 val _ = if [param'] = params then () else raise TERM ("case_cert", []);
952 fun analyze (cases as [let_case]) =
953 (analyze_cases cases handle Bind => analyze_let let_case)
954 | analyze cases = analyze_cases cases;
955 in (case_const, (n, analyze cases)) end;
957 fun case_cert thm = case_certificate thm
958 handle Bind => error "bad case certificate"
959 | TERM _ => error "bad case certificate";
961 fun get_case_scheme thy = Option.map fst o Symtab.lookup ((fst o the_cases o the_exec) thy);
962 fun get_case_cong thy = Option.map snd o Symtab.lookup ((fst o the_cases o the_exec) thy);
964 val undefineds = Symtab.keys o snd o the_cases o the_exec;
969 fun print_codesetup thy =
971 val ctxt = Proof_Context.init_global thy;
972 val exec = the_exec thy;
973 fun pretty_equations const thms =
974 (Pretty.block o Pretty.fbreaks) (
975 Pretty.str (string_of_const thy const) :: map (Display.pretty_thm ctxt) thms
977 fun pretty_function (const, Default (_, eqns_lazy)) = pretty_equations const (map fst (Lazy.force eqns_lazy))
978 | pretty_function (const, Eqns eqns) = pretty_equations const (map fst eqns)
979 | pretty_function (const, Proj (proj, _)) = Pretty.block
980 [Pretty.str (string_of_const thy const), Pretty.fbrk, Syntax.pretty_term ctxt proj]
981 | pretty_function (const, Abstr (thm, _)) = pretty_equations const [thm];
982 fun pretty_typ (tyco, vs) = Pretty.str
983 (string_of_typ thy (Type (tyco, map TFree vs)));
984 fun pretty_typspec (typ, (cos, abstract)) = if null cos
986 else (Pretty.block o Pretty.breaks) (
989 :: (if abstract then [Pretty.str "(abstract)"] else [])
990 @ separate (Pretty.str "|") (map (fn (c, (_, [])) => Pretty.str (string_of_const thy c)
992 (Pretty.block o Pretty.breaks)
993 (Pretty.str (string_of_const thy c)
995 :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
997 fun pretty_case (const, ((_, (_, [])), _)) = Pretty.str (string_of_const thy const)
998 | pretty_case (const, ((_, (_, cos)), _)) = (Pretty.block o Pretty.breaks) [
999 Pretty.str (string_of_const thy const), Pretty.str "with",
1000 (Pretty.block o Pretty.commas o map (Pretty.str o string_of_const thy)) cos];
1001 val functions = the_functions exec
1003 |> (map o apsnd) (snd o fst)
1004 |> sort (string_ord o pairself fst);
1005 val datatypes = the_types exec
1007 |> map (fn (tyco, (_, (vs, spec)) :: _) =>
1008 ((tyco, vs), constructors_of spec))
1009 |> sort (string_ord o pairself (fst o fst));
1010 val cases = Symtab.dest ((fst o the_cases o the_exec) thy);
1011 val undefineds = Symtab.keys ((snd o the_cases o the_exec) thy);
1013 (Pretty.writeln o Pretty.chunks) [
1015 Pretty.str "code equations:" :: Pretty.fbrk
1016 :: (Pretty.fbreaks o map pretty_function) functions
1019 Pretty.str "datatypes:" :: Pretty.fbrk
1020 :: (Pretty.fbreaks o map pretty_typspec) datatypes
1023 Pretty.str "cases:" :: Pretty.fbrk
1024 :: (Pretty.fbreaks o map pretty_case) cases
1027 Pretty.str "undefined:" :: Pretty.fbrk
1028 :: (Pretty.commas o map (Pretty.str o string_of_const thy)) undefineds
1034 (** declaring executable ingredients **)
1036 (* constant signatures *)
1038 fun add_type tyco thy =
1039 case Symtab.lookup ((snd o #types o Type.rep_tsig o Sign.tsig_of) thy) tyco
1040 of SOME (Type.Abbreviation (vs, _, _)) =>
1041 (map_exec_purge o map_signatures o apfst)
1042 (Symtab.update (tyco, length vs)) thy
1043 | _ => error ("No such type abbreviation: " ^ quote tyco);
1045 fun add_type_cmd s thy = add_type (Sign.intern_type thy s) thy;
1047 fun gen_add_signature prep_const prep_signature (raw_c, raw_ty) thy =
1049 val c = prep_const thy raw_c;
1050 val ty = prep_signature thy raw_ty;
1051 val ty' = expand_signature thy ty;
1052 val ty'' = Sign.the_const_type thy c;
1053 val _ = if typ_equiv (ty', ty'') then () else
1054 error ("Illegal constant signature: " ^ Syntax.string_of_typ_global thy ty);
1057 |> (map_exec_purge o map_signatures o apsnd) (Symtab.update (c, ty))
1060 val add_signature = gen_add_signature (K I) cert_signature;
1061 val add_signature_cmd = gen_add_signature read_const read_signature;
1064 (* code equations *)
1066 fun gen_add_eqn default (raw_thm, proper) thy =
1068 val thm = Thm.close_derivation raw_thm;
1069 val c = const_eqn thy thm;
1070 fun update_subsume thy (thm, proper) eqns =
1072 val args_of = snd o chop_while is_Var o rev o snd o strip_comb
1073 o map_types Type.strip_sorts o fst o Logic.dest_equals o Thm.plain_prop_of;
1074 val args = args_of thm;
1075 val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
1076 fun matches_args args' =
1078 val k = length args' - length args
1080 then Pattern.matchess thy (args, (map incr_idx o drop k) args')
1083 fun drop (thm', proper') = if (proper orelse not proper')
1084 andalso matches_args (args_of thm') then
1085 (warning ("Code generator: dropping subsumed code equation\n" ^
1086 Display.string_of_thm_global thy thm'); true)
1088 in (thm, proper) :: filter_out drop eqns end;
1089 fun natural_order thy_ref eqns =
1090 (eqns, Lazy.lazy (fn () => fold (update_subsume (Theory.deref thy_ref)) eqns []))
1091 fun add_eqn' true (Default (eqns, _)) =
1092 Default (natural_order (Theory.check_thy thy) ((thm, proper) :: eqns))
1093 (*this restores the natural order and drops syntactic redundancies*)
1094 | add_eqn' true fun_spec = fun_spec
1095 | add_eqn' false (Eqns eqns) = Eqns (update_subsume thy (thm, proper) eqns)
1096 | add_eqn' false _ = Eqns [(thm, proper)];
1097 in change_fun_spec false c (add_eqn' default) thy end;
1099 fun add_eqn thm thy =
1100 gen_add_eqn false (mk_eqn thy (thm, true)) thy;
1102 fun add_warning_eqn thm thy =
1103 case mk_eqn_warning thy thm
1104 of SOME eqn => gen_add_eqn false eqn thy
1107 fun add_nbe_eqn thm thy =
1108 gen_add_eqn false (mk_eqn thy (thm, false)) thy;
1110 fun add_default_eqn thm thy =
1111 case mk_eqn_liberal thy thm
1112 of SOME eqn => gen_add_eqn true eqn thy
1115 val add_default_eqn_attribute = Thm.declaration_attribute
1116 (fn thm => Context.mapping (add_default_eqn thm) I);
1117 val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
1119 fun add_nbe_default_eqn thm thy =
1120 gen_add_eqn true (mk_eqn thy (thm, false)) thy;
1122 val add_nbe_default_eqn_attribute = Thm.declaration_attribute
1123 (fn thm => Context.mapping (add_nbe_default_eqn thm) I);
1124 val add_nbe_default_eqn_attrib = Attrib.internal (K add_nbe_default_eqn_attribute);
1126 fun add_abs_eqn raw_thm thy =
1128 val (abs_thm, tyco) = (apfst Thm.close_derivation o mk_abs_eqn thy) raw_thm;
1129 val c = const_abs_eqn thy abs_thm;
1130 in change_fun_spec false c (K (Abstr (abs_thm, tyco))) thy end;
1132 fun del_eqn thm thy = case mk_eqn_liberal thy thm
1133 of SOME (thm, _) => let
1134 fun del_eqn' (Default _) = empty_fun_spec
1135 | del_eqn' (Eqns eqns) =
1136 Eqns (filter_out (fn (thm', _) => Thm.eq_thm_prop (thm, thm')) eqns)
1137 | del_eqn' spec = spec
1138 in change_fun_spec true (const_eqn thy thm) del_eqn' thy end
1141 fun del_eqns c = change_fun_spec true c (K empty_fun_spec);
1146 fun case_cong thy case_const (num_args, (pos, _)) =
1148 val ([x, y], ctxt) = fold_map Name.variant ["A", "A'"] Name.context;
1149 val (zs, _) = fold_map Name.variant (replicate (num_args - 1) "") ctxt;
1150 val (ws, vs) = chop pos zs;
1151 val T = Logic.unvarifyT_global (Sign.the_const_type thy case_const);
1152 val Ts = binder_types T;
1153 val T_cong = nth Ts pos;
1154 fun mk_prem z = Free (z, T_cong);
1155 fun mk_concl z = list_comb (Const (case_const, T), map2 (curry Free) (ws @ z :: vs) Ts);
1156 val (prem, concl) = pairself Logic.mk_equals (pairself mk_prem (x, y), pairself mk_concl (x, y));
1157 fun tac { context, prems } = Simplifier.rewrite_goals_tac prems
1158 THEN ALLGOALS (Proof_Context.fact_tac [Drule.reflexive_thm]);
1159 in Skip_Proof.prove_global thy (x :: y :: zs) [prem] concl tac end;
1161 fun add_case thm thy =
1163 val (case_const, (k, case_pats)) = case_cert thm;
1164 val _ = case filter_out (is_constr thy) case_pats
1166 | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
1167 val entry = (1 + Int.max (1, length case_pats), (k, case_pats));
1170 |> Theory.checkpoint
1171 |> `(fn thy => case_cong thy case_const entry)
1172 |-> (fn cong => (map_exec_purge o map_cases o apfst) (Symtab.update (case_const, (entry, cong))))
1175 fun add_undefined c thy =
1176 (map_exec_purge o map_cases o apsnd) (Symtab.update (c, ())) thy;
1181 fun register_type (tyco, vs_spec) thy =
1183 val (old_constrs, some_old_proj) =
1184 case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
1185 of (_, (_, Constructors cos)) :: _ => (map fst cos, NONE)
1186 | (_, (_, Abstractor ((co, _), (proj, _)))) :: _ => ([co], SOME proj)
1188 val outdated_funs = case some_old_proj
1189 of NONE => old_constrs
1190 | SOME old_proj => Symtab.fold
1191 (fn (c, ((_, spec), _)) =>
1192 if member (op =) (the_list (associated_abstype spec)) tyco
1193 then insert (op =) c else I)
1194 ((the_functions o the_exec) thy) (old_proj :: old_constrs);
1195 fun drop_outdated_cases cases = fold Symtab.delete_safe
1196 (Symtab.fold (fn (c, ((_, (_, cos)), _)) =>
1197 if exists (member (op =) old_constrs) cos
1198 then insert (op =) c else I) cases []) cases;
1201 |> fold del_eqns outdated_funs
1203 ((map_typs o Symtab.map_default (tyco, [])) (cons (serial (), vs_spec))
1204 #> (map_cases o apfst) drop_outdated_cases)
1207 fun unoverload_const_typ thy (c, ty) = (AxClass.unoverload_const thy (c, ty), ty);
1209 structure Datatype_Interpretation =
1210 Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
1212 fun datatype_interpretation f = Datatype_Interpretation.interpretation
1213 (fn (tyco, _) => fn thy => f (tyco, fst (get_type thy tyco)) thy);
1215 fun add_datatype proto_constrs thy =
1217 val constrs = map (unoverload_const_typ thy) proto_constrs;
1218 val (tyco, (vs, cos)) = constrset_of_consts thy constrs;
1221 |> fold (del_eqns o fst) constrs
1222 |> register_type (tyco, (vs, Constructors cos))
1223 |> Datatype_Interpretation.data (tyco, serial ())
1226 fun add_datatype_cmd raw_constrs thy =
1227 add_datatype (map (read_bare_const thy) raw_constrs) thy;
1229 structure Abstype_Interpretation =
1230 Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
1232 fun abstype_interpretation f = Abstype_Interpretation.interpretation
1233 (fn (tyco, _) => fn thy => f (tyco, get_abstype_spec thy tyco) thy);
1235 fun add_abstype proto_thm thy =
1237 val (tyco, (vs, (abs_ty as (abs, (_, ty)), (rep, cert)))) =
1238 error_thm (check_abstype_cert thy) proto_thm;
1242 |> register_type (tyco, (vs, Abstractor (abs_ty, (rep, cert))))
1243 |> change_fun_spec false rep ((K o Proj)
1244 (map_types Logic.varifyT_global (mk_proj tyco vs ty abs rep), tyco))
1245 |> Abstype_Interpretation.data (tyco, serial ())
1249 (** infrastructure **)
1251 (* cf. src/HOL/Tools/recfun_codegen.ML *)
1253 structure Code_Target_Attr = Theory_Data
1255 type T = (string -> thm -> theory -> theory) option;
1258 val merge = merge_options;
1261 fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
1263 fun code_target_attr prefix thm thy =
1265 val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
1266 in thy |> add_warning_eqn thm |> attr prefix thm end;
1271 val _ = Context.>> (Context.map_theory
1273 fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
1274 val code_attribute_parser =
1275 Args.del |-- Scan.succeed (mk_attribute del_eqn)
1276 || Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
1277 || Args.$$$ "abstype" |-- Scan.succeed (mk_attribute add_abstype)
1278 || Args.$$$ "abstract" |-- Scan.succeed (mk_attribute add_abs_eqn)
1279 || (Args.$$$ "target" |-- Args.colon |-- Args.name >>
1280 (mk_attribute o code_target_attr))
1281 || Scan.succeed (mk_attribute add_warning_eqn);
1283 Datatype_Interpretation.init
1284 #> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
1285 "declare theorems for code generation"
1291 (* type-safe interfaces for data dependent on executable code *)
1293 functor Code_Data(Data: CODE_DATA_ARGS): CODE_DATA =
1297 exception Data of T;
1298 fun dest (Data x) = x
1300 val kind = Code.declare_data (Data Data.empty);
1302 val data_op = (kind, Data, dest);
1304 fun change_yield (SOME thy) f = Code.change_yield_data data_op thy f
1305 | change_yield NONE f = f Data.empty
1307 fun change some_thy f = snd (change_yield some_thy (pair () o f));
1311 structure Code : CODE = struct open Code; end;