1 (* Title: Tools/code/code_thingol.ML
2 Author: Florian Haftmann, TU Muenchen
4 Intermediate language ("Thin-gol") representing executable code.
5 Representation and translation.
14 signature BASIC_CODE_THINGOL =
18 DictConst of string * dict list list
19 | DictVar of string list * (vname * (int * int));
21 `%% of string * itype list
23 type const = string * (dict list list * itype list (*types of arguments*))
28 | `|-> of (vname * itype) * iterm
29 | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
30 (*((term, type), [(selector pattern, body term )]), primitive term)*)
31 val `$$ : iterm * iterm list -> iterm;
32 val `|--> : (vname * itype) list * iterm -> iterm;
33 type typscheme = (vname * sort) list * itype;
36 signature CODE_THINGOL =
38 include BASIC_CODE_THINGOL
39 val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list
40 val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a
41 val unfold_fun: itype -> itype list * itype
42 val unfold_app: iterm -> iterm * iterm list
43 val split_abs: iterm -> (((vname * iterm option) * itype) * iterm) option
44 val unfold_abs: iterm -> ((vname * iterm option) * itype) list * iterm
45 val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option
46 val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm
47 val unfold_const_app: iterm ->
48 ((string * (dict list list * itype list)) * iterm list) option
49 val collapse_let: ((vname * itype) * iterm) * iterm
50 -> (iterm * itype) * (iterm * iterm) list
51 val eta_expand: int -> (string * (dict list list * itype list)) * iterm list -> iterm
52 val contains_dictvar: iterm -> bool
53 val locally_monomorphic: iterm -> bool
54 val fold_constnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
55 val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
56 val fold_unbound_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
59 val empty_naming: naming
60 val lookup_class: naming -> class -> string option
61 val lookup_classrel: naming -> class * class -> string option
62 val lookup_tyco: naming -> string -> string option
63 val lookup_instance: naming -> class * string -> string option
64 val lookup_const: naming -> string -> string option
68 | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
69 | Datatype of string * ((vname * sort) list * (string * itype list) list)
70 | Datatypecons of string * string
71 | Class of class * (vname * ((class * string) list * (string * itype) list))
72 | Classrel of class * class
73 | Classparam of string * class
74 | Classinst of (class * (string * (vname * sort) list))
75 * ((class * (string * (string * dict list list))) list
76 * ((string * const) * (thm * bool)) list)
77 type program = stmt Graph.T
78 val empty_funs: program -> string list
79 val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm
80 val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt
81 val is_cons: program -> string -> bool
82 val contr_classparam_typs: program -> string -> itype option list
84 val consts_program: theory -> string list -> string list * (naming * program)
85 val cached_program: theory -> naming * program
87 -> (term -> term * (naming -> program -> typscheme * iterm -> string list -> thm))
90 -> (term -> term * (naming -> program -> typscheme * iterm -> string list -> 'a))
94 structure Code_Thingol: CODE_THINGOL =
103 let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end;
109 let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end;
112 (** language core - types, patterns, expressions **)
117 DictConst of string * dict list list
118 | DictVar of string list * (vname * (int * int));
121 `%% of string * itype list
124 type const = string * (dict list list * itype list (*types of arguments*))
129 | `$ of iterm * iterm
130 | `|-> of (vname * itype) * iterm
131 | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
132 (*see also signature*)
135 variable naming conventions
140 type constructor names tyco
142 const names (general) c (const)
144 class parameter names classparam
147 v, c, co, classparam also annotated with types etc.
156 instance (class, tyco) inst
159 val op `$$ = Library.foldl (op `$);
160 val op `|--> = Library.foldr (op `|->);
162 val unfold_app = unfoldl
163 (fn op `$ t => SOME t
167 (fn (v, ty) `|-> (t as ICase (((IVar w, _), [(p, t')]), _)) =>
168 if v = w then SOME (((v, SOME p), ty), t') else SOME (((v, NONE), ty), t)
169 | (v, ty) `|-> t => SOME (((v, NONE), ty), t)
172 val unfold_abs = unfoldr split_abs;
175 (fn ICase (((td, ty), [(p, t)]), _) => SOME (((p, ty), td), t)
178 val unfold_let = unfoldr split_let;
180 fun unfold_const_app t =
182 of (IConst c, ts) => SOME (c, ts)
185 fun fold_aiterms f (t as IConst _) = f t
186 | fold_aiterms f (t as IVar _) = f t
187 | fold_aiterms f (t1 `$ t2) = fold_aiterms f t1 #> fold_aiterms f t2
188 | fold_aiterms f (t as _ `|-> t') = f t #> fold_aiterms f t'
189 | fold_aiterms f (ICase (_, t)) = fold_aiterms f t;
191 fun fold_constnames f =
193 fun add (IConst (c, _)) = f c
195 in fold_aiterms add end;
197 fun fold_varnames f =
199 fun add (IVar v) = f v
200 | add ((v, _) `|-> _) = f v
202 in fold_aiterms add end;
204 fun fold_unbound_varnames f =
206 fun add _ (IConst _) = I
207 | add vs (IVar v) = if not (member (op =) vs v) then f v else I
208 | add vs (t1 `$ t2) = add vs t1 #> add vs t2
209 | add vs ((v, _) `|-> t) = add (insert (op =) v vs) t
210 | add vs (ICase (_, t)) = add vs t;
213 fun collapse_let (((v, ty), se), be as ICase (((IVar w, _), ds), _)) =
215 fun exists_v t = fold_unbound_varnames (fn w => fn b =>
216 b orelse v = w) t false;
217 in if v = w andalso forall (fn (t1, t2) =>
218 exists_v t1 orelse not (exists_v t2)) ds
220 else ((se, ty), [(IVar v, be)])
222 | collapse_let (((v, ty), se), be) =
223 ((se, ty), [(IVar v, be)])
225 fun eta_expand k (c as (_, (_, tys)), ts) =
229 val ctxt = (fold o fold_varnames) Name.declare ts Name.context;
230 val vs_tys = Name.names ctxt "a" ((curry Library.take l o curry Library.drop j) tys);
231 in vs_tys `|--> IConst c `$$ ts @ map (fn (v, _) => IVar v) vs_tys end;
233 fun contains_dictvar t =
235 fun contains (DictConst (_, dss)) = (fold o fold) contains dss
236 | contains (DictVar _) = K true;
239 (fn IConst (_, (dss, _)) => (fold o fold) contains dss | _ => I) t false
242 fun locally_monomorphic (IConst _) = false
243 | locally_monomorphic (IVar _) = true
244 | locally_monomorphic (t `$ _) = locally_monomorphic t
245 | locally_monomorphic (_ `|-> t) = locally_monomorphic t
246 | locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds;
254 fun thyname_of thy f x = the (AList.lookup (op =) (f x) Markup.theory_nameN);
255 fun thyname_of_class thy =
256 thyname_of thy (ProofContext.query_class (ProofContext.init thy));
257 fun thyname_of_tyco thy =
258 thyname_of thy (Type.the_tags (Sign.tsig_of thy));
259 fun thyname_of_instance thy inst = case AxClass.arity_property thy inst Markup.theory_nameN
260 of [] => error ("no such instance: " ^ quote (snd inst ^ " :: " ^ fst inst))
261 | thyname :: _ => thyname;
262 fun thyname_of_const thy c = case AxClass.class_of_param thy c
263 of SOME class => thyname_of_class thy class
264 | NONE => (case Code.get_datatype_of_constr thy c
265 of SOME dtco => thyname_of_tyco thy dtco
266 | NONE => thyname_of thy (Consts.the_tags (Sign.consts_of thy)) c);
267 fun namify thy get_basename get_thyname name =
269 val prefix = get_thyname thy name;
270 val base = (Code_Name.purify_base true o get_basename) name;
271 in NameSpace.append prefix base end;
274 fun namify_class thy = namify thy NameSpace.base thyname_of_class;
275 fun namify_classrel thy = namify thy (fn (class1, class2) =>
276 NameSpace.base class2 ^ "_" ^ NameSpace.base class1) (fn thy => thyname_of_class thy o fst);
277 (*order fits nicely with composed projections*)
278 fun namify_tyco thy "fun" = "Pure.fun"
279 | namify_tyco thy tyco = namify thy NameSpace.base thyname_of_tyco tyco;
280 fun namify_instance thy = namify thy (fn (class, tyco) =>
281 NameSpace.base class ^ "_" ^ NameSpace.base tyco) thyname_of_instance;
282 fun namify_const thy = namify thy NameSpace.base thyname_of_const;
289 structure StringPairTab = Code_Name.StringPairTab;
291 datatype naming = Naming of {
292 class: class Symtab.table * Name.context,
293 classrel: string StringPairTab.table * Name.context,
294 tyco: string Symtab.table * Name.context,
295 instance: string StringPairTab.table * Name.context,
296 const: string Symtab.table * Name.context
299 fun dest_Naming (Naming naming) = naming;
301 val empty_naming = Naming {
302 class = (Symtab.empty, Name.context),
303 classrel = (StringPairTab.empty, Name.context),
304 tyco = (Symtab.empty, Name.context),
305 instance = (StringPairTab.empty, Name.context),
306 const = (Symtab.empty, Name.context)
310 fun mk_naming (class, classrel, tyco, instance, const) =
311 Naming { class = class, classrel = classrel,
312 tyco = tyco, instance = instance, const = const };
313 fun map_naming f (Naming { class, classrel, tyco, instance, const }) =
314 mk_naming (f (class, classrel, tyco, instance, const));
316 fun map_class f = map_naming
317 (fn (class, classrel, tyco, inst, const) =>
318 (f class, classrel, tyco, inst, const));
319 fun map_classrel f = map_naming
320 (fn (class, classrel, tyco, inst, const) =>
321 (class, f classrel, tyco, inst, const));
322 fun map_tyco f = map_naming
323 (fn (class, classrel, tyco, inst, const) =>
324 (class, classrel, f tyco, inst, const));
325 fun map_instance f = map_naming
326 (fn (class, classrel, tyco, inst, const) =>
327 (class, classrel, tyco, f inst, const));
328 fun map_const f = map_naming
329 (fn (class, classrel, tyco, inst, const) =>
330 (class, classrel, tyco, inst, f const));
333 fun add_variant update (thing, name) (tab, used) =
335 val (name', used') = yield_singleton Name.variants name used;
336 val tab' = update (thing, name') tab;
337 in (tab', used') end;
339 fun declare thy mapp lookup update namify thing =
340 mapp (add_variant update (thing, namify thy thing))
341 #> `(fn naming => the (lookup naming thing));
344 (* lookup and declare *)
348 val suffix_class = "class";
349 val suffix_classrel = "classrel"
350 val suffix_tyco = "tyco";
351 val suffix_instance = "inst";
352 val suffix_const = "const";
354 fun add_suffix nsp NONE = NONE
355 | add_suffix nsp (SOME name) = SOME (NameSpace.append name nsp);
359 val lookup_class = add_suffix suffix_class
360 oo Symtab.lookup o fst o #class o dest_Naming;
361 val lookup_classrel = add_suffix suffix_classrel
362 oo StringPairTab.lookup o fst o #classrel o dest_Naming;
363 val lookup_tyco = add_suffix suffix_tyco
364 oo Symtab.lookup o fst o #tyco o dest_Naming;
365 val lookup_instance = add_suffix suffix_instance
366 oo StringPairTab.lookup o fst o #instance o dest_Naming;
367 val lookup_const = add_suffix suffix_const
368 oo Symtab.lookup o fst o #const o dest_Naming;
370 fun declare_class thy = declare thy map_class
371 lookup_class Symtab.update_new namify_class;
372 fun declare_classrel thy = declare thy map_classrel
373 lookup_classrel StringPairTab.update_new namify_classrel;
374 fun declare_tyco thy = declare thy map_tyco
375 lookup_tyco Symtab.update_new namify_tyco;
376 fun declare_instance thy = declare thy map_instance
377 lookup_instance StringPairTab.update_new namify_instance;
378 fun declare_const thy = declare thy map_const
379 lookup_const Symtab.update_new namify_const;
381 val unfold_fun = unfoldr
382 (fn "Pure.fun.tyco" `%% [ty1, ty2] => SOME (ty1, ty2)
383 | _ => NONE); (*depends on suffix_tyco and namify_tyco!*)
388 (** statements, abstract programs **)
390 type typscheme = (vname * sort) list * itype;
393 | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
394 | Datatype of string * ((vname * sort) list * (string * itype list) list)
395 | Datatypecons of string * string
396 | Class of class * (vname * ((class * string) list * (string * itype) list))
397 | Classrel of class * class
398 | Classparam of string * class
399 | Classinst of (class * (string * (vname * sort) list))
400 * ((class * (string * (string * dict list list))) list
401 * ((string * const) * (thm * bool)) list);
403 type program = stmt Graph.T;
405 fun empty_funs program =
406 Graph.fold (fn (name, (Fun (c, (_, [])), _)) => cons c
407 | _ => I) program [];
409 fun map_terms_bottom_up f (t as IConst _) = f t
410 | map_terms_bottom_up f (t as IVar _) = f t
411 | map_terms_bottom_up f (t1 `$ t2) = f
412 (map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2)
413 | map_terms_bottom_up f ((v, ty) `|-> t) = f
414 ((v, ty) `|-> map_terms_bottom_up f t)
415 | map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f
416 (ICase (((map_terms_bottom_up f t, ty), (map o pairself)
417 (map_terms_bottom_up f) ps), map_terms_bottom_up f t0));
419 fun map_terms_stmt f NoStmt = NoStmt
420 | map_terms_stmt f (Fun (c, (tysm, eqs))) = Fun (c, (tysm, (map o apfst)
421 (fn (ts, t) => (map f ts, f t)) eqs))
422 | map_terms_stmt f (stmt as Datatype _) = stmt
423 | map_terms_stmt f (stmt as Datatypecons _) = stmt
424 | map_terms_stmt f (stmt as Class _) = stmt
425 | map_terms_stmt f (stmt as Classrel _) = stmt
426 | map_terms_stmt f (stmt as Classparam _) = stmt
427 | map_terms_stmt f (Classinst (arity, (superarities, classparms))) =
428 Classinst (arity, (superarities, (map o apfst o apsnd) (fn const =>
429 case f (IConst const) of IConst const' => const') classparms));
431 fun is_cons program name = case Graph.get_node program name
432 of Datatypecons _ => true
435 fun contr_classparam_typs program name = case Graph.get_node program name
436 of Classparam (_, class) => let
437 val Class (_, (_, (_, params))) = Graph.get_node program class;
438 val SOME ty = AList.lookup (op =) params name;
439 val (tys, res_ty) = unfold_fun ty;
440 fun no_tyvar (_ `%% tys) = forall no_tyvar tys
441 | no_tyvar (ITyVar _) = false;
442 in if no_tyvar res_ty
443 then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys
449 (** translation kernel **)
451 (* generic mechanisms *)
453 fun ensure_stmt lookup declare generate thing (dep, (naming, program)) =
455 fun add_dep name = case dep of NONE => I
456 | SOME dep => Graph.add_edge (dep, name);
457 val (name, naming') = case lookup naming thing
458 of SOME name => (name, naming)
459 | NONE => declare thing naming;
460 in case try (Graph.get_node program) name
461 of SOME stmt => program
467 |> Graph.default_node (name, NoStmt)
470 |> curry generate (SOME name)
472 |-> (fn stmt => (apsnd o Graph.map_node name) (K stmt))
477 fun not_wellsorted thy thm ty sort e =
479 val err_class = Sorts.class_error (Syntax.pp_global thy) e;
480 val err_thm = case thm
481 of SOME thm => "\n(in defining equation " ^ Display.string_of_thm thm ^ ")" | NONE => "";
482 val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort "
483 ^ Syntax.string_of_sort_global thy sort;
484 in error ("Wellsortedness error" ^ err_thm ^ ":\n" ^ err_typ ^ "\n" ^ err_class) end;
489 fun ensure_class thy (algbr as (_, algebra)) funcgr class =
491 val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
492 val cs = #params (AxClass.get_info thy class);
494 fold_map (fn superclass => ensure_class thy algbr funcgr superclass
495 ##>> ensure_classrel thy algbr funcgr (class, superclass)) superclasses
496 ##>> fold_map (fn (c, ty) => ensure_const thy algbr funcgr c
497 ##>> translate_typ thy algbr funcgr ty) cs
498 #>> (fn info => Class (class, (unprefix "'" Name.aT, info)))
499 in ensure_stmt lookup_class (declare_class thy) stmt_class class end
500 and ensure_classrel thy algbr funcgr (subclass, superclass) =
503 ensure_class thy algbr funcgr subclass
504 ##>> ensure_class thy algbr funcgr superclass
506 in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (subclass, superclass) end
507 and ensure_tyco thy algbr funcgr tyco =
511 val (vs, cos) = Code.get_datatype thy tyco;
513 fold_map (translate_tyvar_sort thy algbr funcgr) vs
514 ##>> fold_map (fn (c, tys) =>
515 ensure_const thy algbr funcgr c
516 ##>> fold_map (translate_typ thy algbr funcgr) tys) cos
517 #>> (fn info => Datatype (tyco, info))
519 in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end
520 and translate_tyvar_sort thy (algbr as (proj_sort, _)) funcgr (v, sort) =
521 fold_map (ensure_class thy algbr funcgr) (proj_sort sort)
522 #>> (fn sort => (unprefix "'" v, sort))
523 and translate_typ thy algbr funcgr (TFree v_sort) =
524 translate_tyvar_sort thy algbr funcgr v_sort
525 #>> (fn (v, sort) => ITyVar v)
526 | translate_typ thy algbr funcgr (Type (tyco, tys)) =
527 ensure_tyco thy algbr funcgr tyco
528 ##>> fold_map (translate_typ thy algbr funcgr) tys
529 #>> (fn (tyco, tys) => tyco `%% tys)
530 and translate_dicts thy (algbr as (proj_sort, algebra)) funcgr thm (ty, sort) =
532 val pp = Syntax.pp_global thy;
534 Global of (class * string) * typarg list list
535 | Local of (class * class) list * (string * (int * sort));
536 fun class_relation (Global ((_, tyco), yss), _) class =
537 Global ((class, tyco), yss)
538 | class_relation (Local (classrels, v), subclass) superclass =
539 Local ((subclass, superclass) :: classrels, v);
540 fun norm_typargs ys =
542 val raw_sort = map snd ys;
543 val sort = Sorts.minimize_sort algebra raw_sort;
545 map_filter (fn (y, class) =>
546 if member (op =) sort class then SOME y else NONE) ys
548 fun type_constructor tyco yss class =
549 Global ((class, tyco), map norm_typargs yss);
550 fun type_variable (TFree (v, sort)) =
552 val sort' = proj_sort sort;
553 in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end;
554 val typargs = Sorts.of_sort_derivation pp algebra
555 {class_relation = class_relation, type_constructor = type_constructor,
556 type_variable = type_variable} (ty, proj_sort sort)
557 handle Sorts.CLASS_ERROR e => not_wellsorted thy thm ty sort e;
558 fun mk_dict (Global (inst, yss)) =
559 ensure_inst thy algbr funcgr inst
560 ##>> (fold_map o fold_map) mk_dict yss
561 #>> (fn (inst, dss) => DictConst (inst, dss))
562 | mk_dict (Local (classrels, (v, (k, sort)))) =
563 fold_map (ensure_classrel thy algbr funcgr) classrels
564 #>> (fn classrels => DictVar (classrels, (unprefix "'" v, (k, length sort))))
565 in fold_map mk_dict typargs end
566 and translate_eq thy algbr funcgr (thm, linear) =
568 val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals
569 o Logic.unvarify o prop_of) thm;
571 fold_map (translate_term thy algbr funcgr (SOME thm)) args
572 ##>> translate_term thy algbr funcgr (SOME thm) rhs
573 #>> rpair (thm, linear)
575 and ensure_inst thy (algbr as (_, algebra)) funcgr (class, tyco) =
577 val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
578 val classparams = these (try (#params o AxClass.get_info thy) class);
579 val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]);
580 val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class];
581 val vs' = map2 (fn (v, sort1) => fn sort2 => (v,
582 Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts';
583 val arity_typ = Type (tyco, map TFree vs);
584 val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs');
585 fun translate_superarity superclass =
586 ensure_class thy algbr funcgr superclass
587 ##>> ensure_classrel thy algbr funcgr (class, superclass)
588 ##>> translate_dicts thy algbr funcgr NONE (arity_typ, [superclass])
589 #>> (fn ((superclass, classrel), [DictConst (inst, dss)]) =>
590 (superclass, (classrel, (inst, dss))));
591 fun translate_classparam_inst (c, ty) =
593 val c_inst = Const (c, map_type_tfree (K arity_typ') ty);
594 val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy c_inst);
595 val c_ty = (apsnd Logic.unvarifyT o dest_Const o snd
596 o Logic.dest_equals o Thm.prop_of) thm;
598 ensure_const thy algbr funcgr c
599 ##>> translate_const thy algbr funcgr (SOME thm) c_ty
600 #>> (fn (c, IConst c_inst) => ((c, c_inst), (thm, true)))
603 ensure_class thy algbr funcgr class
604 ##>> ensure_tyco thy algbr funcgr tyco
605 ##>> fold_map (translate_tyvar_sort thy algbr funcgr) vs
606 ##>> fold_map translate_superarity superclasses
607 ##>> fold_map translate_classparam_inst classparams
608 #>> (fn ((((class, tyco), arity), superarities), classparams) =>
609 Classinst ((class, (tyco, arity)), (superarities, classparams)));
610 in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end
611 and ensure_const thy algbr funcgr c =
613 fun stmt_datatypecons tyco =
614 ensure_tyco thy algbr funcgr tyco
615 #>> (fn tyco => Datatypecons (c, tyco));
616 fun stmt_classparam class =
617 ensure_class thy algbr funcgr class
618 #>> (fn class => Classparam (c, class));
619 fun stmt_fun ((vs, raw_ty), raw_thms) =
621 val ty = Logic.unvarifyT raw_ty;
622 val thms = if null (Term.add_tfreesT ty []) orelse (null o fst o strip_type) ty
624 else (map o apfst) (Code_Unit.expand_eta thy 1) raw_thms;
626 fold_map (translate_tyvar_sort thy algbr funcgr) vs
627 ##>> translate_typ thy algbr funcgr ty
628 ##>> fold_map (translate_eq thy algbr funcgr) thms
629 #>> (fn info => Fun (c, info))
631 val stmt_const = case Code.get_datatype_of_constr thy c
632 of SOME tyco => stmt_datatypecons tyco
633 | NONE => (case AxClass.class_of_param thy c
634 of SOME class => stmt_classparam class
635 | NONE => stmt_fun (Code_Funcgr.typ funcgr c, Code_Funcgr.eqns funcgr c))
636 in ensure_stmt lookup_const (declare_const thy) stmt_const c end
637 and translate_term thy algbr funcgr thm (Const (c, ty)) =
638 translate_app thy algbr funcgr thm ((c, ty), [])
639 | translate_term thy algbr funcgr thm (Free (v, _)) =
641 | translate_term thy algbr funcgr thm (Abs (abs as (_, ty, _))) =
643 val (v, t) = Syntax.variant_abs abs;
645 translate_typ thy algbr funcgr ty
646 ##>> translate_term thy algbr funcgr thm t
647 #>> (fn (ty, t) => (v, ty) `|-> t)
649 | translate_term thy algbr funcgr thm (t as _ $ _) =
651 of (Const (c, ty), ts) =>
652 translate_app thy algbr funcgr thm ((c, ty), ts)
654 translate_term thy algbr funcgr thm t'
655 ##>> fold_map (translate_term thy algbr funcgr thm) ts
656 #>> (fn (t, ts) => t `$$ ts)
657 and translate_const thy algbr funcgr thm (c, ty) =
659 val tys = Sign.const_typargs thy (c, ty);
660 val sorts = (map snd o fst o Code_Funcgr.typ funcgr) c;
661 val tys_args = (fst o Term.strip_type) ty;
663 ensure_const thy algbr funcgr c
664 ##>> fold_map (translate_dicts thy algbr funcgr thm) (tys ~~ sorts)
665 ##>> fold_map (translate_typ thy algbr funcgr) tys_args
666 #>> (fn ((c, iss), tys) => IConst (c, (iss, tys)))
668 and translate_app_default thy algbr funcgr thm (c_ty, ts) =
669 translate_const thy algbr funcgr thm c_ty
670 ##>> fold_map (translate_term thy algbr funcgr thm) ts
671 #>> (fn (t, ts) => t `$$ ts)
672 and translate_case thy algbr funcgr thm n cases (app as ((c, ty), ts)) =
675 (chop (1 + (if null cases then 1 else length cases)) o fst o strip_type) ty;
678 fun is_undefined (Const (c, _)) = Code.is_undefined thy c
679 | is_undefined _ = false;
680 fun mk_case (co, n) t =
682 val _ = if (is_some o Code.get_datatype_of_constr thy) co then ()
683 else error ("Non-constructor " ^ quote co
684 ^ " encountered in case pattern"
685 ^ (case thm of NONE => ""
686 | SOME thm => ", in equation\n" ^ Display.string_of_thm thm))
687 val (vs, body) = Term.strip_abs_eta n t;
688 val selector = list_comb (Const (co, map snd vs ---> dty), map Free vs);
689 in if is_undefined body then NONE else SOME (selector, body) end;
692 val ([v_ty], body) = Term.strip_abs_eta 1 (the_single (nth_drop n ts))
693 in [(Free v_ty, body)] end
694 | mk_ds cases = map_filter (uncurry mk_case)
695 (AList.make (Code_Unit.no_args thy) cases ~~ nth_drop n ts);
697 translate_term thy algbr funcgr thm dt
698 ##>> translate_typ thy algbr funcgr dty
699 ##>> fold_map (fn (pat, body) => translate_term thy algbr funcgr thm pat
700 ##>> translate_term thy algbr funcgr thm body) (mk_ds cases)
701 ##>> translate_app_default thy algbr funcgr thm app
702 #>> (fn (((dt, dty), ds), t0) => ICase (((dt, dty), ds), t0))
704 and translate_app thy algbr funcgr thm ((c, ty), ts) = case Code.get_case_data thy c
705 of SOME (n, cases) => let val i = 1 + (if null cases then 1 else length cases) in
706 if length ts < i then
709 val tys = (curry Library.take (i - k) o curry Library.drop k o fst o strip_type) ty;
710 val ctxt = (fold o fold_aterms)
711 (fn Free (v, _) => Name.declare v | _ => I) ts Name.context;
712 val vs = Name.names ctxt "a" tys;
714 fold_map (translate_typ thy algbr funcgr) tys
715 ##>> translate_case thy algbr funcgr thm n cases ((c, ty), ts @ map Free vs)
716 #>> (fn (tys, t) => map2 (fn (v, _) => pair v) vs tys `|--> t)
718 else if length ts > i then
719 translate_case thy algbr funcgr thm n cases ((c, ty), Library.take (i, ts))
720 ##>> fold_map (translate_term thy algbr funcgr thm) (Library.drop (i, ts))
721 #>> (fn (t, ts) => t `$$ ts)
723 translate_case thy algbr funcgr thm n cases ((c, ty), ts)
725 | NONE => translate_app_default thy algbr funcgr thm ((c, ty), ts);
730 structure Program = CodeDataFun
732 type T = naming * program;
733 val empty = (empty_naming, Graph.empty);
734 fun purge thy cs (naming, program) =
736 val names_delete = cs
737 |> map_filter (lookup_const naming)
738 |> filter (can (Graph.get_node program))
739 |> Graph.all_preds program;
740 val program' = Graph.del_nodes names_delete program;
741 in (naming, program') end;
744 val cached_program = Program.get;
746 fun invoke_generation thy (algebra, funcgr) f name =
747 Program.change_yield thy (fn naming_program => (NONE, naming_program)
748 |> f thy algebra funcgr name
749 |-> (fn name => fn (_, naming_program) => (name, naming_program)));
752 (* program generation *)
754 fun consts_program thy cs =
756 fun project_consts cs (naming, program) =
758 val cs_all = Graph.all_succs program cs;
759 in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end;
760 fun generate_consts thy algebra funcgr =
761 fold_map (ensure_const thy algebra funcgr);
763 invoke_generation thy (Code_Funcgr.make thy cs) generate_consts cs
768 (* value evaluation *)
770 fun ensure_value thy algbr funcgr t =
772 val ty = fastype_of t;
773 val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =)
774 o dest_TFree))) t [];
776 fold_map (translate_tyvar_sort thy algbr funcgr) vs
777 ##>> translate_typ thy algbr funcgr ty
778 ##>> translate_term thy algbr funcgr NONE t
779 #>> (fn ((vs, ty), t) => Fun
780 (Term.dummy_patternN, ((vs, ty), [(([], t), (Drule.dummy_thm, true))])));
781 fun term_value (dep, (naming, program1)) =
783 val Fun (_, ((vs, ty), [(([], t), _)])) =
784 Graph.get_node program1 Term.dummy_patternN;
785 val deps = Graph.imm_succs program1 Term.dummy_patternN;
786 val program2 = Graph.del_nodes [Term.dummy_patternN] program1;
787 val deps_all = Graph.all_succs program2 deps;
788 val program3 = Graph.subgraph (member (op =) deps_all) program2;
789 in (((naming, program3), (((vs, ty), t), deps)), (dep, (naming, program2))) end;
791 ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN
796 fun eval thy evaluator t =
798 val (t', evaluator'') = evaluator t;
799 fun evaluator' algebra funcgr =
801 val (((naming, program), (vs_ty_t, deps)), _) =
802 invoke_generation thy (algebra, funcgr) ensure_value t';
803 in evaluator'' naming program vs_ty_t deps end;
804 in (t', evaluator') end
806 fun eval_conv thy = Code_Funcgr.eval_conv thy o eval thy;
807 fun eval_term thy = Code_Funcgr.eval_term thy o eval thy;
812 structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol;