1 (* Title: Tools/code/code_thingol.ML
3 Author: Florian Haftmann, TU Muenchen
5 Intermediate language ("Thin-gol") representing executable code.
6 Representation and translation.
15 signature BASIC_CODE_THINGOL =
19 DictConst of string * dict list list
20 | DictVar of string list * (vname * (int * int));
22 `%% of string * itype list
24 type const = string * (dict list list * itype list (*types of arguments*))
29 | `|-> of (vname * itype) * iterm
30 | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
31 (*((term, type), [(selector pattern, body term )]), primitive term)*)
32 val `$$ : iterm * iterm list -> iterm;
33 val `|--> : (vname * itype) list * iterm -> iterm;
34 type typscheme = (vname * sort) list * itype;
37 signature CODE_THINGOL =
39 include BASIC_CODE_THINGOL
40 val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list
41 val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a
42 val unfold_fun: itype -> itype list * itype
43 val unfold_app: iterm -> iterm * iterm list
44 val split_abs: iterm -> (((vname * iterm option) * itype) * iterm) option
45 val unfold_abs: iterm -> ((vname * iterm option) * itype) list * iterm
46 val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option
47 val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm
48 val unfold_const_app: iterm ->
49 ((string * (dict list list * itype list)) * iterm list) option
50 val collapse_let: ((vname * itype) * iterm) * iterm
51 -> (iterm * itype) * (iterm * iterm) list
52 val eta_expand: int -> (string * (dict list list * itype list)) * iterm list -> iterm
53 val contains_dictvar: iterm -> bool
54 val locally_monomorphic: iterm -> bool
55 val fold_constnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
56 val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
57 val fold_unbound_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
60 val empty_naming: naming
61 val lookup_class: naming -> class -> string option
62 val lookup_classrel: naming -> class * class -> string option
63 val lookup_tyco: naming -> string -> string option
64 val lookup_instance: naming -> class * string -> string option
65 val lookup_const: naming -> string -> string option
69 | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
70 | Datatype of string * ((vname * sort) list * (string * itype list) list)
71 | Datatypecons of string * string
72 | Class of class * (vname * ((class * string) list * (string * itype) list))
73 | Classrel of class * class
74 | Classparam of string * class
75 | Classinst of (class * (string * (vname * sort) list))
76 * ((class * (string * (string * dict list list))) list
77 * ((string * const) * (thm * bool)) list)
78 type program = stmt Graph.T
79 val empty_funs: program -> string list
80 val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm
81 val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt
82 val is_cons: program -> string -> bool
83 val contr_classparam_typs: program -> string -> itype option list
85 val consts_program: theory -> string list -> string list * (naming * program)
86 val cached_program: theory -> naming * program
88 -> (term -> term * (naming -> program -> typscheme * iterm -> string list -> thm))
91 -> (term -> term * (naming -> program -> typscheme * iterm -> string list -> 'a))
95 structure Code_Thingol: CODE_THINGOL =
104 let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end;
110 let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end;
113 (** language core - types, patterns, expressions **)
118 DictConst of string * dict list list
119 | DictVar of string list * (vname * (int * int));
122 `%% of string * itype list
125 type const = string * (dict list list * itype list (*types of arguments*))
130 | `$ of iterm * iterm
131 | `|-> of (vname * itype) * iterm
132 | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
133 (*see also signature*)
136 variable naming conventions
141 type constructor names tyco
143 const names (general) c (const)
145 class parameter names classparam
148 v, c, co, classparam also annotated with types etc.
157 instance (class, tyco) inst
160 val op `$$ = Library.foldl (op `$);
161 val op `|--> = Library.foldr (op `|->);
163 val unfold_app = unfoldl
164 (fn op `$ t => SOME t
168 (fn (v, ty) `|-> (t as ICase (((IVar w, _), [(p, t')]), _)) =>
169 if v = w then SOME (((v, SOME p), ty), t') else SOME (((v, NONE), ty), t)
170 | (v, ty) `|-> t => SOME (((v, NONE), ty), t)
173 val unfold_abs = unfoldr split_abs;
176 (fn ICase (((td, ty), [(p, t)]), _) => SOME (((p, ty), td), t)
179 val unfold_let = unfoldr split_let;
181 fun unfold_const_app t =
183 of (IConst c, ts) => SOME (c, ts)
186 fun fold_aiterms f (t as IConst _) = f t
187 | fold_aiterms f (t as IVar _) = f t
188 | fold_aiterms f (t1 `$ t2) = fold_aiterms f t1 #> fold_aiterms f t2
189 | fold_aiterms f (t as _ `|-> t') = f t #> fold_aiterms f t'
190 | fold_aiterms f (ICase (_, t)) = fold_aiterms f t;
192 fun fold_constnames f =
194 fun add (IConst (c, _)) = f c
196 in fold_aiterms add end;
198 fun fold_varnames f =
200 fun add (IVar v) = f v
201 | add ((v, _) `|-> _) = f v
203 in fold_aiterms add end;
205 fun fold_unbound_varnames f =
207 fun add _ (IConst _) = I
208 | add vs (IVar v) = if not (member (op =) vs v) then f v else I
209 | add vs (t1 `$ t2) = add vs t1 #> add vs t2
210 | add vs ((v, _) `|-> t) = add (insert (op =) v vs) t
211 | add vs (ICase (_, t)) = add vs t;
214 fun collapse_let (((v, ty), se), be as ICase (((IVar w, _), ds), _)) =
216 fun exists_v t = fold_unbound_varnames (fn w => fn b =>
217 b orelse v = w) t false;
218 in if v = w andalso forall (fn (t1, t2) =>
219 exists_v t1 orelse not (exists_v t2)) ds
221 else ((se, ty), [(IVar v, be)])
223 | collapse_let (((v, ty), se), be) =
224 ((se, ty), [(IVar v, be)])
226 fun eta_expand k (c as (_, (_, tys)), ts) =
230 val ctxt = (fold o fold_varnames) Name.declare ts Name.context;
231 val vs_tys = Name.names ctxt "a" ((curry Library.take l o curry Library.drop j) tys);
232 in vs_tys `|--> IConst c `$$ ts @ map (fn (v, _) => IVar v) vs_tys end;
234 fun contains_dictvar t =
236 fun contains (DictConst (_, dss)) = (fold o fold) contains dss
237 | contains (DictVar _) = K true;
240 (fn IConst (_, (dss, _)) => (fold o fold) contains dss | _ => I) t false
243 fun locally_monomorphic (IConst _) = false
244 | locally_monomorphic (IVar _) = true
245 | locally_monomorphic (t `$ _) = locally_monomorphic t
246 | locally_monomorphic (_ `|-> t) = locally_monomorphic t
247 | locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds;
255 fun thyname_of thy f x = the (AList.lookup (op =) (f x) Markup.theory_nameN);
256 fun thyname_of_class thy =
257 thyname_of thy (ProofContext.query_class (ProofContext.init thy));
258 fun thyname_of_tyco thy =
259 thyname_of thy (Type.the_tags (Sign.tsig_of thy));
260 fun thyname_of_instance thy inst = case AxClass.arity_property thy inst Markup.theory_nameN
261 of [] => error ("no such instance: " ^ quote (snd inst ^ " :: " ^ fst inst))
262 | thyname :: _ => thyname;
263 fun thyname_of_const thy c = case AxClass.class_of_param thy c
264 of SOME class => thyname_of_class thy class
265 | NONE => (case Code.get_datatype_of_constr thy c
266 of SOME dtco => thyname_of_tyco thy dtco
267 | NONE => thyname_of thy (Consts.the_tags (Sign.consts_of thy)) c);
268 fun namify thy get_basename get_thyname name =
270 val prefix = get_thyname thy name;
271 val base = (Code_Name.purify_base true o get_basename) name;
272 in NameSpace.append prefix base end;
275 fun namify_class thy = namify thy NameSpace.base thyname_of_class;
276 fun namify_classrel thy = namify thy (fn (class1, class2) =>
277 NameSpace.base class2 ^ "_" ^ NameSpace.base class1) (fn thy => thyname_of_class thy o fst);
278 (*order fits nicely with composed projections*)
279 fun namify_tyco thy "fun" = "Pure.fun"
280 | namify_tyco thy tyco = namify thy NameSpace.base thyname_of_tyco tyco;
281 fun namify_instance thy = namify thy (fn (class, tyco) =>
282 NameSpace.base class ^ "_" ^ NameSpace.base tyco) thyname_of_instance;
283 fun namify_const thy = namify thy NameSpace.base thyname_of_const;
290 structure StringPairTab = Code_Name.StringPairTab;
292 datatype naming = Naming of {
293 class: class Symtab.table * Name.context,
294 classrel: string StringPairTab.table * Name.context,
295 tyco: string Symtab.table * Name.context,
296 instance: string StringPairTab.table * Name.context,
297 const: string Symtab.table * Name.context
300 fun dest_Naming (Naming naming) = naming;
302 val empty_naming = Naming {
303 class = (Symtab.empty, Name.context),
304 classrel = (StringPairTab.empty, Name.context),
305 tyco = (Symtab.empty, Name.context),
306 instance = (StringPairTab.empty, Name.context),
307 const = (Symtab.empty, Name.context)
311 fun mk_naming (class, classrel, tyco, instance, const) =
312 Naming { class = class, classrel = classrel,
313 tyco = tyco, instance = instance, const = const };
314 fun map_naming f (Naming { class, classrel, tyco, instance, const }) =
315 mk_naming (f (class, classrel, tyco, instance, const));
317 fun map_class f = map_naming
318 (fn (class, classrel, tyco, inst, const) =>
319 (f class, classrel, tyco, inst, const));
320 fun map_classrel f = map_naming
321 (fn (class, classrel, tyco, inst, const) =>
322 (class, f classrel, tyco, inst, const));
323 fun map_tyco f = map_naming
324 (fn (class, classrel, tyco, inst, const) =>
325 (class, classrel, f tyco, inst, const));
326 fun map_instance f = map_naming
327 (fn (class, classrel, tyco, inst, const) =>
328 (class, classrel, tyco, f inst, const));
329 fun map_const f = map_naming
330 (fn (class, classrel, tyco, inst, const) =>
331 (class, classrel, tyco, inst, f const));
334 fun add_variant update (thing, name) (tab, used) =
336 val (name', used') = yield_singleton Name.variants name used;
337 val tab' = update (thing, name') tab;
338 in (tab', used') end;
340 fun declare thy mapp lookup update namify thing =
341 mapp (add_variant update (thing, namify thy thing))
342 #> `(fn naming => the (lookup naming thing));
345 (* lookup and declare *)
349 val suffix_class = "class";
350 val suffix_classrel = "classrel"
351 val suffix_tyco = "tyco";
352 val suffix_instance = "inst";
353 val suffix_const = "const";
355 fun add_suffix nsp NONE = NONE
356 | add_suffix nsp (SOME name) = SOME (NameSpace.append name nsp);
360 val lookup_class = add_suffix suffix_class
361 oo Symtab.lookup o fst o #class o dest_Naming;
362 val lookup_classrel = add_suffix suffix_classrel
363 oo StringPairTab.lookup o fst o #classrel o dest_Naming;
364 val lookup_tyco = add_suffix suffix_tyco
365 oo Symtab.lookup o fst o #tyco o dest_Naming;
366 val lookup_instance = add_suffix suffix_instance
367 oo StringPairTab.lookup o fst o #instance o dest_Naming;
368 val lookup_const = add_suffix suffix_const
369 oo Symtab.lookup o fst o #const o dest_Naming;
371 fun declare_class thy = declare thy map_class
372 lookup_class Symtab.update_new namify_class;
373 fun declare_classrel thy = declare thy map_classrel
374 lookup_classrel StringPairTab.update_new namify_classrel;
375 fun declare_tyco thy = declare thy map_tyco
376 lookup_tyco Symtab.update_new namify_tyco;
377 fun declare_instance thy = declare thy map_instance
378 lookup_instance StringPairTab.update_new namify_instance;
379 fun declare_const thy = declare thy map_const
380 lookup_const Symtab.update_new namify_const;
382 val unfold_fun = unfoldr
383 (fn "Pure.fun.tyco" `%% [ty1, ty2] => SOME (ty1, ty2)
384 | _ => NONE); (*depends on suffix_tyco and namify_tyco!*)
389 (** statements, abstract programs **)
391 type typscheme = (vname * sort) list * itype;
394 | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
395 | Datatype of string * ((vname * sort) list * (string * itype list) list)
396 | Datatypecons of string * string
397 | Class of class * (vname * ((class * string) list * (string * itype) list))
398 | Classrel of class * class
399 | Classparam of string * class
400 | Classinst of (class * (string * (vname * sort) list))
401 * ((class * (string * (string * dict list list))) list
402 * ((string * const) * (thm * bool)) list);
404 type program = stmt Graph.T;
406 fun empty_funs program =
407 Graph.fold (fn (name, (Fun (c, (_, [])), _)) => cons c
408 | _ => I) program [];
410 fun map_terms_bottom_up f (t as IConst _) = f t
411 | map_terms_bottom_up f (t as IVar _) = f t
412 | map_terms_bottom_up f (t1 `$ t2) = f
413 (map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2)
414 | map_terms_bottom_up f ((v, ty) `|-> t) = f
415 ((v, ty) `|-> map_terms_bottom_up f t)
416 | map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f
417 (ICase (((map_terms_bottom_up f t, ty), (map o pairself)
418 (map_terms_bottom_up f) ps), map_terms_bottom_up f t0));
420 fun map_terms_stmt f NoStmt = NoStmt
421 | map_terms_stmt f (Fun (c, (tysm, eqs))) = Fun (c, (tysm, (map o apfst)
422 (fn (ts, t) => (map f ts, f t)) eqs))
423 | map_terms_stmt f (stmt as Datatype _) = stmt
424 | map_terms_stmt f (stmt as Datatypecons _) = stmt
425 | map_terms_stmt f (stmt as Class _) = stmt
426 | map_terms_stmt f (stmt as Classrel _) = stmt
427 | map_terms_stmt f (stmt as Classparam _) = stmt
428 | map_terms_stmt f (Classinst (arity, (superarities, classparms))) =
429 Classinst (arity, (superarities, (map o apfst o apsnd) (fn const =>
430 case f (IConst const) of IConst const' => const') classparms));
432 fun is_cons program name = case Graph.get_node program name
433 of Datatypecons _ => true
436 fun contr_classparam_typs program name = case Graph.get_node program name
437 of Classparam (_, class) => let
438 val Class (_, (_, (_, params))) = Graph.get_node program class;
439 val SOME ty = AList.lookup (op =) params name;
440 val (tys, res_ty) = unfold_fun ty;
441 fun no_tyvar (_ `%% tys) = forall no_tyvar tys
442 | no_tyvar (ITyVar _) = false;
443 in if no_tyvar res_ty
444 then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys
450 (** translation kernel **)
452 fun ensure_stmt lookup declare generate thing (dep, (naming, program)) =
454 fun add_dep name = case dep of NONE => I
455 | SOME dep => Graph.add_edge (dep, name);
456 val (name, naming') = case lookup naming thing
457 of SOME name => (name, naming)
458 | NONE => declare thing naming;
459 in case try (Graph.get_node program) name
460 of SOME stmt => program
466 |> Graph.default_node (name, NoStmt)
469 |> curry generate (SOME name)
471 |-> (fn stmt => (apsnd o Graph.map_node name) (K stmt))
476 fun not_wellsorted thy thm ty sort e =
478 val err_class = Sorts.class_error (Syntax.pp_global thy) e;
479 val err_thm = case thm
480 of SOME thm => "\n(in defining equation " ^ Display.string_of_thm thm ^ ")" | NONE => "";
481 val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort "
482 ^ Syntax.string_of_sort_global thy sort;
483 in error ("Wellsortedness error" ^ err_thm ^ ":\n" ^ err_typ ^ "\n" ^ err_class) end;
485 fun ensure_class thy (algbr as (_, algebra)) funcgr class =
487 val superclasses = (Sorts.certify_sort algebra o Sorts.super_classes algebra) class;
488 val cs = #params (AxClass.get_info thy class);
490 fold_map (fn superclass => ensure_class thy algbr funcgr superclass
491 ##>> ensure_classrel thy algbr funcgr (class, superclass)) superclasses
492 ##>> fold_map (fn (c, ty) => ensure_const thy algbr funcgr c
493 ##>> translate_typ thy algbr funcgr ty) cs
494 #>> (fn info => Class (class, (unprefix "'" Name.aT, info)))
495 in ensure_stmt lookup_class (declare_class thy) stmt_class class end
496 and ensure_classrel thy algbr funcgr (subclass, superclass) =
499 ensure_class thy algbr funcgr subclass
500 ##>> ensure_class thy algbr funcgr superclass
502 in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (subclass, superclass) end
503 and ensure_tyco thy algbr funcgr tyco =
507 val (vs, cos) = Code.get_datatype thy tyco;
509 fold_map (translate_tyvar_sort thy algbr funcgr) vs
510 ##>> fold_map (fn (c, tys) =>
511 ensure_const thy algbr funcgr c
512 ##>> fold_map (translate_typ thy algbr funcgr) tys) cos
513 #>> (fn info => Datatype (tyco, info))
515 in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end
516 and translate_tyvar_sort thy (algbr as (proj_sort, _)) funcgr (v, sort) =
517 fold_map (ensure_class thy algbr funcgr) (proj_sort sort)
518 #>> (fn sort => (unprefix "'" v, sort))
519 and translate_typ thy algbr funcgr (TFree v_sort) =
520 translate_tyvar_sort thy algbr funcgr v_sort
521 #>> (fn (v, sort) => ITyVar v)
522 | translate_typ thy algbr funcgr (Type (tyco, tys)) =
523 ensure_tyco thy algbr funcgr tyco
524 ##>> fold_map (translate_typ thy algbr funcgr) tys
525 #>> (fn (tyco, tys) => tyco `%% tys)
526 and translate_dicts thy (algbr as (proj_sort, algebra)) funcgr thm (ty, sort) =
528 val pp = Syntax.pp_global thy;
530 Global of (class * string) * typarg list list
531 | Local of (class * class) list * (string * (int * sort));
532 fun class_relation (Global ((_, tyco), yss), _) class =
533 Global ((class, tyco), yss)
534 | class_relation (Local (classrels, v), subclass) superclass =
535 Local ((subclass, superclass) :: classrels, v);
536 fun type_constructor tyco yss class =
537 Global ((class, tyco), (map o map) fst yss);
538 fun type_variable (TFree (v, sort)) =
540 val sort' = proj_sort sort;
541 in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end;
542 val typargs = Sorts.of_sort_derivation pp algebra
543 {class_relation = class_relation, type_constructor = type_constructor,
544 type_variable = type_variable} (ty, proj_sort sort)
545 handle Sorts.CLASS_ERROR e => not_wellsorted thy thm ty sort e;
546 fun mk_dict (Global (inst, yss)) =
547 ensure_inst thy algbr funcgr inst
548 ##>> (fold_map o fold_map) mk_dict yss
549 #>> (fn (inst, dss) => DictConst (inst, dss))
550 | mk_dict (Local (classrels, (v, (k, sort)))) =
551 fold_map (ensure_classrel thy algbr funcgr) classrels
552 #>> (fn classrels => DictVar (classrels, (unprefix "'" v, (k, length sort))))
553 in fold_map mk_dict typargs end
554 and translate_eq thy algbr funcgr (thm, linear) =
556 val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals
557 o Logic.unvarify o prop_of) thm;
559 fold_map (translate_term thy algbr funcgr (SOME thm)) args
560 ##>> translate_term thy algbr funcgr (SOME thm) rhs
561 #>> rpair (thm, linear)
563 and ensure_inst thy (algbr as (_, algebra)) funcgr (class, tyco) =
565 val superclasses = (Sorts.certify_sort algebra o Sorts.super_classes algebra) class;
566 val classparams = these (try (#params o AxClass.get_info thy) class);
567 val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]);
568 val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class];
569 val vs' = map2 (fn (v, sort1) => fn sort2 => (v,
570 Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts';
571 val arity_typ = Type (tyco, map TFree vs);
572 val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs');
573 fun translate_superarity superclass =
574 ensure_class thy algbr funcgr superclass
575 ##>> ensure_classrel thy algbr funcgr (class, superclass)
576 ##>> translate_dicts thy algbr funcgr NONE (arity_typ, [superclass])
577 #>> (fn ((superclass, classrel), [DictConst (inst, dss)]) =>
578 (superclass, (classrel, (inst, dss))));
579 fun translate_classparam_inst (c, ty) =
581 val c_inst = Const (c, map_type_tfree (K arity_typ') ty);
582 val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy c_inst);
583 val c_ty = (apsnd Logic.unvarifyT o dest_Const o snd
584 o Logic.dest_equals o Thm.prop_of) thm;
586 ensure_const thy algbr funcgr c
587 ##>> translate_const thy algbr funcgr (SOME thm) c_ty
588 #>> (fn (c, IConst c_inst) => ((c, c_inst), (thm, true)))
591 ensure_class thy algbr funcgr class
592 ##>> ensure_tyco thy algbr funcgr tyco
593 ##>> fold_map (translate_tyvar_sort thy algbr funcgr) vs
594 ##>> fold_map translate_superarity superclasses
595 ##>> fold_map translate_classparam_inst classparams
596 #>> (fn ((((class, tyco), arity), superarities), classparams) =>
597 Classinst ((class, (tyco, arity)), (superarities, classparams)));
598 in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end
599 and ensure_const thy algbr funcgr c =
601 fun stmt_datatypecons tyco =
602 ensure_tyco thy algbr funcgr tyco
603 #>> (fn tyco => Datatypecons (c, tyco));
604 fun stmt_classparam class =
605 ensure_class thy algbr funcgr class
606 #>> (fn class => Classparam (c, class));
607 fun stmt_fun ((vs, raw_ty), raw_thms) =
609 val ty = Logic.unvarifyT raw_ty;
610 val thms = if (null o Term.typ_tfrees) ty orelse (null o fst o strip_type) ty
612 else (map o apfst) (Code_Unit.expand_eta thy 1) raw_thms;
614 fold_map (translate_tyvar_sort thy algbr funcgr) vs
615 ##>> translate_typ thy algbr funcgr ty
616 ##>> fold_map (translate_eq thy algbr funcgr) thms
617 #>> (fn info => Fun (c, info))
619 val stmt_const = case Code.get_datatype_of_constr thy c
620 of SOME tyco => stmt_datatypecons tyco
621 | NONE => (case AxClass.class_of_param thy c
622 of SOME class => stmt_classparam class
623 | NONE => stmt_fun (Code_Funcgr.typ funcgr c, Code_Funcgr.eqns funcgr c))
624 in ensure_stmt lookup_const (declare_const thy) stmt_const c end
625 and translate_term thy algbr funcgr thm (Const (c, ty)) =
626 translate_app thy algbr funcgr thm ((c, ty), [])
627 | translate_term thy algbr funcgr thm (Free (v, _)) =
629 | translate_term thy algbr funcgr thm (Abs (abs as (_, ty, _))) =
631 val (v, t) = Syntax.variant_abs abs;
633 translate_typ thy algbr funcgr ty
634 ##>> translate_term thy algbr funcgr thm t
635 #>> (fn (ty, t) => (v, ty) `|-> t)
637 | translate_term thy algbr funcgr thm (t as _ $ _) =
639 of (Const (c, ty), ts) =>
640 translate_app thy algbr funcgr thm ((c, ty), ts)
642 translate_term thy algbr funcgr thm t'
643 ##>> fold_map (translate_term thy algbr funcgr thm) ts
644 #>> (fn (t, ts) => t `$$ ts)
645 and translate_const thy algbr funcgr thm (c, ty) =
647 val tys = Sign.const_typargs thy (c, ty);
648 val sorts = (map snd o fst o Code_Funcgr.typ funcgr) c;
649 val tys_args = (fst o Term.strip_type) ty;
651 ensure_const thy algbr funcgr c
652 ##>> fold_map (translate_dicts thy algbr funcgr thm) (tys ~~ sorts)
653 ##>> fold_map (translate_typ thy algbr funcgr) tys_args
654 #>> (fn ((c, iss), tys) => IConst (c, (iss, tys)))
656 and translate_app_default thy algbr funcgr thm (c_ty, ts) =
657 translate_const thy algbr funcgr thm c_ty
658 ##>> fold_map (translate_term thy algbr funcgr thm) ts
659 #>> (fn (t, ts) => t `$$ ts)
660 and translate_case thy algbr funcgr thm n cases (app as ((c, ty), ts)) =
663 (chop (1 + (if null cases then 1 else length cases)) o fst o strip_type) ty;
666 fun is_undefined (Const (c, _)) = Code.is_undefined thy c
667 | is_undefined _ = false;
668 fun mk_case (co, n) t =
670 val (vs, body) = Term.strip_abs_eta n t;
671 val selector = list_comb (Const (co, map snd vs ---> dty), map Free vs);
672 in if is_undefined body then NONE else SOME (selector, body) end;
675 val ([v_ty], body) = Term.strip_abs_eta 1 (the_single (nth_drop n ts))
676 in [(Free v_ty, body)] end
677 | mk_ds cases = map_filter (uncurry mk_case)
678 (AList.make (Code_Unit.no_args thy) cases ~~ nth_drop n ts);
680 translate_term thy algbr funcgr thm dt
681 ##>> translate_typ thy algbr funcgr dty
682 ##>> fold_map (fn (pat, body) => translate_term thy algbr funcgr thm pat
683 ##>> translate_term thy algbr funcgr thm body) (mk_ds cases)
684 ##>> translate_app_default thy algbr funcgr thm app
685 #>> (fn (((dt, dty), ds), t0) => ICase (((dt, dty), ds), t0))
687 and translate_app thy algbr funcgr thm ((c, ty), ts) = case Code.get_case_data thy c
688 of SOME (n, cases) => let val i = 1 + (if null cases then 1 else length cases) in
689 if length ts < i then
692 val tys = (curry Library.take (i - k) o curry Library.drop k o fst o strip_type) ty;
693 val ctxt = (fold o fold_aterms)
694 (fn Free (v, _) => Name.declare v | _ => I) ts Name.context;
695 val vs = Name.names ctxt "a" tys;
697 fold_map (translate_typ thy algbr funcgr) tys
698 ##>> translate_case thy algbr funcgr thm n cases ((c, ty), ts @ map Free vs)
699 #>> (fn (tys, t) => map2 (fn (v, _) => pair v) vs tys `|--> t)
701 else if length ts > i then
702 translate_case thy algbr funcgr thm n cases ((c, ty), Library.take (i, ts))
703 ##>> fold_map (translate_term thy algbr funcgr thm) (Library.drop (i, ts))
704 #>> (fn (t, ts) => t `$$ ts)
706 translate_case thy algbr funcgr thm n cases ((c, ty), ts)
708 | NONE => translate_app_default thy algbr funcgr thm ((c, ty), ts);
711 (** generated programs **)
715 structure Program = CodeDataFun
717 type T = naming * program;
718 val empty = (empty_naming, Graph.empty);
719 fun purge thy cs (naming, program) =
721 val names_delete = cs
722 |> map_filter (lookup_const naming)
723 |> filter (can (Graph.get_node program))
724 |> Graph.all_preds program;
725 val program' = Graph.del_nodes names_delete program;
726 in (naming, program') end;
729 val cached_program = Program.get;
731 fun generate thy funcgr f name =
732 Program.change_yield thy (fn naming_program => (NONE, naming_program)
733 |> f thy (Code.operational_algebra thy) funcgr name
734 |-> (fn name => fn (_, naming_program) => (name, naming_program)));
737 (* program generation *)
739 fun consts_program thy cs =
741 fun project_consts cs (naming, program) =
743 val cs_all = Graph.all_succs program cs;
744 in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end;
745 fun generate_consts thy algebra funcgr =
746 fold_map (ensure_const thy algebra funcgr);
748 generate thy (Code_Funcgr.make thy cs) generate_consts cs
753 (* value evaluation *)
755 fun ensure_value thy algbr funcgr t =
757 val ty = fastype_of t;
758 val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =)
759 o dest_TFree))) t [];
761 fold_map (translate_tyvar_sort thy algbr funcgr) vs
762 ##>> translate_typ thy algbr funcgr ty
763 ##>> translate_term thy algbr funcgr NONE t
764 #>> (fn ((vs, ty), t) => Fun
765 (Term.dummy_patternN, ((vs, ty), [(([], t), (Drule.dummy_thm, true))])));
766 fun term_value (dep, (naming, program1)) =
768 val Fun (_, ((vs, ty), [(([], t), _)])) =
769 Graph.get_node program1 Term.dummy_patternN;
770 val deps = Graph.imm_succs program1 Term.dummy_patternN;
771 val program2 = Graph.del_nodes [Term.dummy_patternN] program1;
772 val deps_all = Graph.all_succs program2 deps;
773 val program3 = Graph.subgraph (member (op =) deps_all) program2;
774 in (((naming, program3), (((vs, ty), t), deps)), (dep, (naming, program2))) end;
776 ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN
781 fun eval eval_kind thy evaluator =
783 fun evaluator'' evaluator''' funcgr t =
785 val (((naming, program), (vs_ty_t, deps)), _) = generate thy funcgr ensure_value t;
786 in evaluator''' naming program vs_ty_t deps end;
789 val (t', evaluator''') = evaluator t;
790 in (t', evaluator'' evaluator''') end;
791 in eval_kind thy evaluator' end
793 fun eval_conv thy = eval Code_Funcgr.eval_conv thy;
794 fun eval_term thy = eval Code_Funcgr.eval_term thy;
799 structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol;