src/Pure/codegen.ML
author wenzelm
Sun Mar 08 17:26:14 2009 +0100 (2009-03-08)
changeset 30364 577edc39b501
parent 30288 a32700e45ab3
child 31125 80218ee73167
permissions -rw-r--r--
moved basic algebra of long names from structure NameSpace to Long_Name;
     1 (*  Title:      Pure/codegen.ML
     2     Author:     Stefan Berghofer, TU Muenchen
     3 
     4 Generic code generator.
     5 *)
     6 
     7 signature CODEGEN =
     8 sig
     9   val quiet_mode : bool ref
    10   val message : string -> unit
    11   val mode : string list ref
    12   val margin : int ref
    13   val string_of : Pretty.T -> string
    14   val str : string -> Pretty.T
    15 
    16   datatype 'a mixfix =
    17       Arg
    18     | Ignore
    19     | Module
    20     | Pretty of Pretty.T
    21     | Quote of 'a;
    22 
    23   type deftab
    24   type node
    25   type codegr
    26   type 'a codegen
    27 
    28   val add_codegen: string -> term codegen -> theory -> theory
    29   val add_tycodegen: string -> typ codegen -> theory -> theory
    30   val add_preprocessor: (theory -> thm list -> thm list) -> theory -> theory
    31   val preprocess: theory -> thm list -> thm list
    32   val preprocess_term: theory -> term -> term
    33   val print_codegens: theory -> unit
    34   val generate_code: theory -> string list -> string -> (string * string) list ->
    35     (string * string) list * codegr
    36   val generate_code_i: theory -> string list -> string -> (string * term) list ->
    37     (string * string) list * codegr
    38   val assoc_const: string * (term mixfix list *
    39     (string * string) list) -> theory -> theory
    40   val assoc_const_i: (string * typ) * (term mixfix list *
    41     (string * string) list) -> theory -> theory
    42   val assoc_type: xstring * (typ mixfix list *
    43     (string * string) list) -> theory -> theory
    44   val get_assoc_code: theory -> string * typ ->
    45     (term mixfix list * (string * string) list) option
    46   val get_assoc_type: theory -> string ->
    47     (typ mixfix list * (string * string) list) option
    48   val codegen_error: codegr -> string -> string -> 'a
    49   val invoke_codegen: theory -> deftab -> string -> string -> bool ->
    50     term -> codegr -> Pretty.T * codegr
    51   val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
    52     typ -> codegr -> Pretty.T * codegr
    53   val mk_id: string -> string
    54   val mk_qual_id: string -> string * string -> string
    55   val mk_const_id: string -> string -> codegr -> (string * string) * codegr
    56   val get_const_id: codegr -> string -> string * string
    57   val mk_type_id: string -> string -> codegr -> (string * string) * codegr
    58   val get_type_id: codegr -> string -> string * string
    59   val thyname_of_type: theory -> string -> string
    60   val thyname_of_const: theory -> string -> string
    61   val rename_terms: term list -> term list
    62   val rename_term: term -> term
    63   val new_names: term -> string list -> string list
    64   val new_name: term -> string -> string
    65   val if_library: 'a -> 'a -> 'a
    66   val get_defn: theory -> deftab -> string -> typ ->
    67     ((typ * (string * (term list * term))) * int option) option
    68   val is_instance: typ -> typ -> bool
    69   val parens: Pretty.T -> Pretty.T
    70   val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
    71   val mk_tuple: Pretty.T list -> Pretty.T
    72   val mk_let: (Pretty.T * Pretty.T) list -> Pretty.T -> Pretty.T
    73   val eta_expand: term -> term list -> int -> term
    74   val strip_tname: string -> string
    75   val mk_type: bool -> typ -> Pretty.T
    76   val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
    77   val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
    78   val test_fn: (int -> (string * term) list option) ref
    79   val test_term: Proof.context -> term -> int -> term list option
    80   val eval_result: (unit -> term) ref
    81   val eval_term: theory -> term -> term
    82   val evaluation_conv: cterm -> thm
    83   val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
    84   val quotes_of: 'a mixfix list -> 'a list
    85   val num_args_of: 'a mixfix list -> int
    86   val replace_quotes: 'b list -> 'a mixfix list -> 'b mixfix list
    87   val mk_deftab: theory -> deftab
    88   val add_unfold: thm -> theory -> theory
    89 
    90   val get_node: codegr -> string -> node
    91   val add_edge: string * string -> codegr -> codegr
    92   val add_edge_acyclic: string * string -> codegr -> codegr
    93   val del_nodes: string list -> codegr -> codegr
    94   val map_node: string -> (node -> node) -> codegr -> codegr
    95   val new_node: string * node -> codegr -> codegr
    96 
    97   val setup: theory -> theory
    98 end;
    99 
   100 structure Codegen : CODEGEN =
   101 struct
   102 
   103 val quiet_mode = ref true;
   104 fun message s = if !quiet_mode then () else writeln s;
   105 
   106 val mode = ref ([] : string list);
   107 
   108 val margin = ref 80;
   109 
   110 fun string_of p = (Pretty.string_of |>
   111   PrintMode.setmp [] |>
   112   Pretty.setmp_margin (!margin)) p;
   113 
   114 val str = PrintMode.setmp [] Pretty.str;
   115 
   116 (**** Mixfix syntax ****)
   117 
   118 datatype 'a mixfix =
   119     Arg
   120   | Ignore
   121   | Module
   122   | Pretty of Pretty.T
   123   | Quote of 'a;
   124 
   125 fun is_arg Arg = true
   126   | is_arg Ignore = true
   127   | is_arg _ = false;
   128 
   129 fun quotes_of [] = []
   130   | quotes_of (Quote q :: ms) = q :: quotes_of ms
   131   | quotes_of (_ :: ms) = quotes_of ms;
   132 
   133 fun args_of [] xs = ([], xs)
   134   | args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
   135   | args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
   136   | args_of (_ :: ms) xs = args_of ms xs;
   137 
   138 fun num_args_of x = length (List.filter is_arg x);
   139 
   140 
   141 (**** theory data ****)
   142 
   143 (* preprocessed definition table *)
   144 
   145 type deftab =
   146   (typ *              (* type of constant *)
   147     (string *         (* name of theory containing definition of constant *)
   148       (term list *    (* parameters *)
   149        term)))        (* right-hand side *)
   150   list Symtab.table;
   151 
   152 (* code dependency graph *)
   153 
   154 type nametab = (string * string) Symtab.table * unit Symtab.table;
   155 
   156 fun merge_nametabs ((tab, used) : nametab, (tab', used')) =
   157   (Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
   158 
   159 type node =
   160   (exn option *    (* slot for arbitrary data *)
   161    string *        (* name of structure containing piece of code *)
   162    string);        (* piece of code *)
   163 
   164 type codegr =
   165   node Graph.T *
   166   (nametab *       (* table for assigned constant names *)
   167    nametab);       (* table for assigned type names *)
   168 
   169 val emptygr : codegr = (Graph.empty,
   170   ((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
   171 
   172 (* type of code generators *)
   173 
   174 type 'a codegen =
   175   theory ->    (* theory in which generate_code was called *)
   176   deftab ->    (* definition table (for efficiency) *)
   177   string ->    (* node name of caller (for recording dependencies) *)
   178   string ->    (* module name of caller (for modular code generation) *)
   179   bool ->      (* whether to parenthesize generated expression *)
   180   'a ->        (* item to generate code from *)
   181   codegr ->    (* code dependency graph *)
   182   (Pretty.T * codegr) option;
   183 
   184 
   185 (* theory data *)
   186 
   187 structure CodegenData = TheoryDataFun
   188 (
   189   type T =
   190     {codegens : (string * term codegen) list,
   191      tycodegens : (string * typ codegen) list,
   192      consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
   193      types : (string * (typ mixfix list * (string * string) list)) list,
   194      preprocs: (stamp * (theory -> thm list -> thm list)) list,
   195      modules: codegr Symtab.table};
   196 
   197   val empty =
   198     {codegens = [], tycodegens = [], consts = [], types = [],
   199      preprocs = [], modules = Symtab.empty};
   200   val copy = I;
   201   val extend = I;
   202 
   203   fun merge _
   204     ({codegens = codegens1, tycodegens = tycodegens1,
   205       consts = consts1, types = types1,
   206       preprocs = preprocs1, modules = modules1} : T,
   207      {codegens = codegens2, tycodegens = tycodegens2,
   208       consts = consts2, types = types2,
   209       preprocs = preprocs2, modules = modules2}) =
   210     {codegens = AList.merge (op =) (K true) (codegens1, codegens2),
   211      tycodegens = AList.merge (op =) (K true) (tycodegens1, tycodegens2),
   212      consts = AList.merge (op =) (K true) (consts1, consts2),
   213      types = AList.merge (op =) (K true) (types1, types2),
   214      preprocs = AList.merge (op =) (K true) (preprocs1, preprocs2),
   215      modules = Symtab.merge (K true) (modules1, modules2)};
   216 );
   217 
   218 fun print_codegens thy =
   219   let val {codegens, tycodegens, ...} = CodegenData.get thy in
   220     Pretty.writeln (Pretty.chunks
   221       [Pretty.strs ("term code generators:" :: map fst codegens),
   222        Pretty.strs ("type code generators:" :: map fst tycodegens)])
   223   end;
   224 
   225 
   226 
   227 (**** access modules ****)
   228 
   229 fun get_modules thy = #modules (CodegenData.get thy);
   230 
   231 fun map_modules f thy =
   232   let val {codegens, tycodegens, consts, types, preprocs, modules} =
   233     CodegenData.get thy;
   234   in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
   235     consts = consts, types = types, preprocs = preprocs,
   236     modules = f modules} thy
   237   end;
   238 
   239 
   240 (**** add new code generators to theory ****)
   241 
   242 fun add_codegen name f thy =
   243   let val {codegens, tycodegens, consts, types, preprocs, modules} =
   244     CodegenData.get thy
   245   in (case AList.lookup (op =) codegens name of
   246       NONE => CodegenData.put {codegens = (name, f) :: codegens,
   247         tycodegens = tycodegens, consts = consts, types = types,
   248         preprocs = preprocs, modules = modules} thy
   249     | SOME _ => error ("Code generator " ^ name ^ " already declared"))
   250   end;
   251 
   252 fun add_tycodegen name f thy =
   253   let val {codegens, tycodegens, consts, types, preprocs, modules} =
   254     CodegenData.get thy
   255   in (case AList.lookup (op =) tycodegens name of
   256       NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
   257         codegens = codegens, consts = consts, types = types,
   258         preprocs = preprocs, modules = modules} thy
   259     | SOME _ => error ("Code generator " ^ name ^ " already declared"))
   260   end;
   261 
   262 
   263 (**** preprocessors ****)
   264 
   265 fun add_preprocessor p thy =
   266   let val {codegens, tycodegens, consts, types, preprocs, modules} =
   267     CodegenData.get thy
   268   in CodegenData.put {tycodegens = tycodegens,
   269     codegens = codegens, consts = consts, types = types,
   270     preprocs = (stamp (), p) :: preprocs,
   271     modules = modules} thy
   272   end;
   273 
   274 fun preprocess thy =
   275   let val {preprocs, ...} = CodegenData.get thy
   276   in fold (fn (_, f) => f thy) preprocs end;
   277 
   278 fun preprocess_term thy t =
   279   let
   280     val x = Free (Name.variant (OldTerm.add_term_names (t, [])) "x", fastype_of t);
   281     (* fake definition *)
   282     val eq = setmp quick_and_dirty true (SkipProof.make_thm thy)
   283       (Logic.mk_equals (x, t));
   284     fun err () = error "preprocess_term: bad preprocessor"
   285   in case map prop_of (preprocess thy [eq]) of
   286       [Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
   287     | _ => err ()
   288   end;
   289 
   290 structure UnfoldData = TheoryDataFun
   291 (
   292   type T = simpset;
   293   val empty = empty_ss;
   294   val copy = I;
   295   val extend = I;
   296   fun merge _ = merge_ss;
   297 );
   298 
   299 fun add_unfold eqn =
   300   let
   301     val ctxt = ProofContext.init (Thm.theory_of_thm eqn);
   302     val eqn' = LocalDefs.meta_rewrite_rule ctxt eqn;
   303   in
   304     UnfoldData.map (fn ss => ss addsimps [eqn'])
   305   end;
   306 
   307 fun unfold_preprocessor thy =
   308   let val ss = Simplifier.theory_context thy (UnfoldData.get thy)
   309   in map (Thm.transfer thy #> Simplifier.full_simplify ss) end;
   310 
   311 
   312 (**** associate constants with target language code ****)
   313 
   314 fun gen_assoc_const prep_const (raw_const, syn) thy =
   315   let
   316     val {codegens, tycodegens, consts, types, preprocs, modules} =
   317       CodegenData.get thy;
   318     val (cname, T) = prep_const thy raw_const;
   319   in
   320     if num_args_of (fst syn) > length (binder_types T) then
   321       error ("More arguments than in corresponding type of " ^ cname)
   322     else case AList.lookup (op =) consts (cname, T) of
   323       NONE => CodegenData.put {codegens = codegens,
   324         tycodegens = tycodegens,
   325         consts = ((cname, T), syn) :: consts,
   326         types = types, preprocs = preprocs,
   327         modules = modules} thy
   328     | SOME _ => error ("Constant " ^ cname ^ " already associated with code")
   329   end;
   330 
   331 val assoc_const_i = gen_assoc_const (K I);
   332 val assoc_const = gen_assoc_const Code_Unit.read_bare_const;
   333 
   334 
   335 (**** associate types with target language types ****)
   336 
   337 fun assoc_type (s, syn) thy =
   338   let
   339     val {codegens, tycodegens, consts, types, preprocs, modules} =
   340       CodegenData.get thy;
   341     val tc = Sign.intern_type thy s;
   342   in
   343     case Symtab.lookup (snd (#types (Type.rep_tsig (Sign.tsig_of thy)))) tc of
   344       SOME ((Type.LogicalType i, _), _) =>
   345         if num_args_of (fst syn) > i then
   346           error ("More arguments than corresponding type constructor " ^ s)
   347         else (case AList.lookup (op =) types tc of
   348           NONE => CodegenData.put {codegens = codegens,
   349             tycodegens = tycodegens, consts = consts,
   350             types = (tc, syn) :: types,
   351             preprocs = preprocs, modules = modules} thy
   352         | SOME _ => error ("Type " ^ tc ^ " already associated with code"))
   353     | _ => error ("Not a type constructor: " ^ s)
   354   end;
   355 
   356 fun get_assoc_type thy = AList.lookup (op =) ((#types o CodegenData.get) thy);
   357 
   358 
   359 (**** make valid ML identifiers ****)
   360 
   361 fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
   362   Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
   363 
   364 fun dest_sym s = (case split_last (snd (take_prefix (fn c => c = "\\") (explode s))) of
   365     ("<" :: "^" :: xs, ">") => (true, implode xs)
   366   | ("<" :: xs, ">") => (false, implode xs)
   367   | _ => sys_error "dest_sym");
   368 
   369 fun mk_id s = if s = "" then "" else
   370   let
   371     fun check_str [] = []
   372       | check_str xs = (case take_prefix is_ascii_letdig xs of
   373           ([], " " :: zs) => check_str zs
   374         | ([], z :: zs) =>
   375           if size z = 1 then string_of_int (ord z) :: check_str zs
   376           else (case dest_sym z of
   377               (true, "isub") => check_str zs
   378             | (true, "isup") => "" :: check_str zs
   379             | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
   380         | (ys, zs) => implode ys :: check_str zs);
   381     val s' = space_implode "_" (maps (check_str o Symbol.explode) (Long_Name.explode s))
   382   in
   383     if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
   384   end;
   385 
   386 fun mk_long_id (p as (tab, used)) module s =
   387   let
   388     fun find_name [] = sys_error "mk_long_id"
   389       | find_name (ys :: yss) =
   390           let
   391             val s' = Long_Name.implode ys
   392             val s'' = Long_Name.append module s'
   393           in case Symtab.lookup used s'' of
   394               NONE => ((module, s'),
   395                 (Symtab.update_new (s, (module, s')) tab,
   396                  Symtab.update_new (s'', ()) used))
   397             | SOME _ => find_name yss
   398           end
   399   in case Symtab.lookup tab s of
   400       NONE => find_name (Library.suffixes1 (Long_Name.explode s))
   401     | SOME name => (name, p)
   402   end;
   403 
   404 (* module:  module name for caller                                        *)
   405 (* module': module name for callee                                        *)
   406 (* if caller and callee reside in different modules, use qualified access *)
   407 
   408 fun mk_qual_id module (module', s) =
   409   if module = module' orelse module' = "" then s else module' ^ "." ^ s;
   410 
   411 fun mk_const_id module cname (gr, (tab1, tab2)) =
   412   let
   413     val ((module, s), tab1') = mk_long_id tab1 module cname
   414     val s' = mk_id s;
   415     val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
   416   in (((module, s'')), (gr, (tab1', tab2))) end;
   417 
   418 fun get_const_id (gr, (tab1, tab2)) cname =
   419   case Symtab.lookup (fst tab1) cname of
   420     NONE => error ("get_const_id: no such constant: " ^ quote cname)
   421   | SOME (module, s) =>
   422       let
   423         val s' = mk_id s;
   424         val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
   425       in (module, s'') end;
   426 
   427 fun mk_type_id module tyname (gr, (tab1, tab2)) =
   428   let
   429     val ((module, s), tab2') = mk_long_id tab2 module tyname
   430     val s' = mk_id s;
   431     val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
   432   in ((module, s''), (gr, (tab1, tab2'))) end;
   433 
   434 fun get_type_id (gr, (tab1, tab2)) tyname =
   435   case Symtab.lookup (fst tab2) tyname of
   436     NONE => error ("get_type_id: no such type: " ^ quote tyname)
   437   | SOME (module, s) =>
   438       let
   439         val s' = mk_id s;
   440         val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
   441       in (module, s'') end;
   442 
   443 fun get_type_id' f tab tyname = apsnd f (get_type_id tab tyname);
   444 
   445 fun get_node (gr, x) k = Graph.get_node gr k;
   446 fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
   447 fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
   448 fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
   449 fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
   450 fun new_node p (gr, x) = (Graph.new_node p gr, x);
   451 
   452 fun thyname_of thy f x = the (AList.lookup (op =) (f x) Markup.theory_nameN);
   453 
   454 fun thyname_of_type thy =
   455   thyname_of thy (Type.the_tags (Sign.tsig_of thy));
   456 
   457 fun thyname_of_const thy =
   458   thyname_of thy (Consts.the_tags (Sign.consts_of thy));
   459 
   460 fun rename_terms ts =
   461   let
   462     val names = List.foldr OldTerm.add_term_names
   463       (map (fst o fst) (rev (fold Term.add_vars ts []))) ts;
   464     val reserved = filter ML_Syntax.is_reserved names;
   465     val (illegal, alt_names) = split_list (map_filter (fn s =>
   466       let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
   467     val ps = (reserved @ illegal) ~~
   468       Name.variant_list names (map (suffix "'") reserved @ alt_names);
   469 
   470     fun rename_id s = AList.lookup (op =) ps s |> the_default s;
   471 
   472     fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
   473       | rename (Free (a, T)) = Free (rename_id a, T)
   474       | rename (Abs (s, T, t)) = Abs (s, T, rename t)
   475       | rename (t $ u) = rename t $ rename u
   476       | rename t = t;
   477   in
   478     map rename ts
   479   end;
   480 
   481 val rename_term = hd o rename_terms o single;
   482 
   483 
   484 (**** retrieve definition of constant ****)
   485 
   486 fun is_instance T1 T2 =
   487   Type.raw_instance (T1, if null (OldTerm.typ_tfrees T2) then T2 else Logic.varifyT T2);
   488 
   489 fun get_assoc_code thy (s, T) = Option.map snd (find_first (fn ((s', T'), _) =>
   490   s = s' andalso is_instance T T') (#consts (CodegenData.get thy)));
   491 
   492 fun get_aux_code xs = map_filter (fn (m, code) =>
   493   if m = "" orelse member (op =) (!mode) m then SOME code else NONE) xs;
   494 
   495 fun mk_deftab thy =
   496   let
   497     val axmss = map (fn thy' => (Context.theory_name thy', Theory.axiom_table thy'))
   498       (thy :: Theory.ancestors_of thy);
   499     fun prep_def def = (case preprocess thy [def] of
   500       [def'] => prop_of def' | _ => error "mk_deftab: bad preprocessor");
   501     fun dest t =
   502       let
   503         val (lhs, rhs) = Logic.dest_equals t;
   504         val (c, args) = strip_comb lhs;
   505         val (s, T) = dest_Const c
   506       in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
   507       end handle TERM _ => NONE;
   508     fun add_def thyname (name, t) = (case dest t of
   509         NONE => I
   510       | SOME _ => (case dest (prep_def (Thm.axiom thy name)) of
   511           NONE => I
   512         | SOME (s, (T, (args, rhs))) => Symtab.map_default (s, [])
   513             (cons (T, (thyname, split_last (rename_terms (args @ [rhs])))))))
   514   in
   515     fold (fn (thyname, axms) => Symtab.fold (add_def thyname) axms) axmss Symtab.empty
   516   end;
   517 
   518 fun get_defn thy defs s T = (case Symtab.lookup defs s of
   519     NONE => NONE
   520   | SOME ds =>
   521       let val i = find_index (is_instance T o fst) ds
   522       in if i >= 0 then
   523           SOME (List.nth (ds, i), if length ds = 1 then NONE else SOME i)
   524         else NONE
   525       end);
   526 
   527 
   528 (**** invoke suitable code generator for term / type ****)
   529 
   530 fun codegen_error (gr, _) dep s =
   531   error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
   532 
   533 fun invoke_codegen thy defs dep module brack t gr = (case get_first
   534    (fn (_, f) => f thy defs dep module brack t gr) (#codegens (CodegenData.get thy)) of
   535       NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
   536         Syntax.string_of_term_global thy t)
   537     | SOME x => x);
   538 
   539 fun invoke_tycodegen thy defs dep module brack T gr = (case get_first
   540    (fn (_, f) => f thy defs dep module brack T gr ) (#tycodegens (CodegenData.get thy)) of
   541       NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
   542         Syntax.string_of_typ_global thy T)
   543     | SOME x => x);
   544 
   545 
   546 (**** code generator for mixfix expressions ****)
   547 
   548 fun parens p = Pretty.block [str "(", p, str ")"];
   549 
   550 fun pretty_fn [] p = [p]
   551   | pretty_fn (x::xs) p = str ("fn " ^ x ^ " =>") ::
   552       Pretty.brk 1 :: pretty_fn xs p;
   553 
   554 fun pretty_mixfix _ _ [] [] _ = []
   555   | pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
   556       p :: pretty_mixfix module module' ms ps qs
   557   | pretty_mixfix module module' (Ignore :: ms) ps qs =
   558       pretty_mixfix module module' ms ps qs
   559   | pretty_mixfix module module' (Module :: ms) ps qs =
   560       (if module <> module'
   561        then cons (str (module' ^ ".")) else I)
   562       (pretty_mixfix module module' ms ps qs)
   563   | pretty_mixfix module module' (Pretty p :: ms) ps qs =
   564       p :: pretty_mixfix module module' ms ps qs
   565   | pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
   566       q :: pretty_mixfix module module' ms ps qs;
   567 
   568 fun replace_quotes [] [] = []
   569   | replace_quotes xs (Arg :: ms) =
   570       Arg :: replace_quotes xs ms
   571   | replace_quotes xs (Ignore :: ms) =
   572       Ignore :: replace_quotes xs ms
   573   | replace_quotes xs (Module :: ms) =
   574       Module :: replace_quotes xs ms
   575   | replace_quotes xs (Pretty p :: ms) =
   576       Pretty p :: replace_quotes xs ms
   577   | replace_quotes (x::xs) (Quote _ :: ms) =
   578       Quote x :: replace_quotes xs ms;
   579 
   580 
   581 (**** default code generators ****)
   582 
   583 fun eta_expand t ts i =
   584   let
   585     val k = length ts;
   586     val Ts = Library.drop (k, binder_types (fastype_of t));
   587     val j = i - k
   588   in
   589     List.foldr (fn (T, t) => Abs ("x", T, t))
   590       (list_comb (t, ts @ map Bound (j-1 downto 0))) (Library.take (j, Ts))
   591   end;
   592 
   593 fun mk_app _ p [] = p
   594   | mk_app brack p ps = if brack then
   595        Pretty.block (str "(" ::
   596          separate (Pretty.brk 1) (p :: ps) @ [str ")"])
   597      else Pretty.block (separate (Pretty.brk 1) (p :: ps));
   598 
   599 fun new_names t xs = Name.variant_list
   600   (map (fst o fst o dest_Var) (OldTerm.term_vars t) union
   601     OldTerm.add_term_names (t, ML_Syntax.reserved_names)) (map mk_id xs);
   602 
   603 fun new_name t x = hd (new_names t [x]);
   604 
   605 fun if_library x y = if member (op =) (!mode) "library" then x else y;
   606 
   607 fun default_codegen thy defs dep module brack t gr =
   608   let
   609     val (u, ts) = strip_comb t;
   610     fun codegens brack = fold_map (invoke_codegen thy defs dep module brack)
   611   in (case u of
   612       Var ((s, i), T) =>
   613         let
   614           val (ps, gr') = codegens true ts gr;
   615           val (_, gr'') = invoke_tycodegen thy defs dep module false T gr'
   616         in SOME (mk_app brack (str (s ^
   617            (if i=0 then "" else string_of_int i))) ps, gr'')
   618         end
   619 
   620     | Free (s, T) =>
   621         let
   622           val (ps, gr') = codegens true ts gr;
   623           val (_, gr'') = invoke_tycodegen thy defs dep module false T gr'
   624         in SOME (mk_app brack (str s) ps, gr'') end
   625 
   626     | Const (s, T) =>
   627       (case get_assoc_code thy (s, T) of
   628          SOME (ms, aux) =>
   629            let val i = num_args_of ms
   630            in if length ts < i then
   631                default_codegen thy defs dep module brack (eta_expand u ts i) gr 
   632              else
   633                let
   634                  val (ts1, ts2) = args_of ms ts;
   635                  val (ps1, gr1) = codegens false ts1 gr;
   636                  val (ps2, gr2) = codegens true ts2 gr1;
   637                  val (ps3, gr3) = codegens false (quotes_of ms) gr2;
   638                  val (_, gr4) = invoke_tycodegen thy defs dep module false
   639                    (funpow (length ts) (hd o tl o snd o dest_Type) T) gr3;
   640                  val (module', suffix) = (case get_defn thy defs s T of
   641                      NONE => (if_library (thyname_of_const thy s) module, "")
   642                    | SOME ((U, (module', _)), NONE) =>
   643                        (if_library module' module, "")
   644                    | SOME ((U, (module', _)), SOME i) =>
   645                        (if_library module' module, " def" ^ string_of_int i));
   646                  val node_id = s ^ suffix;
   647                  fun p module' = mk_app brack (Pretty.block
   648                    (pretty_mixfix module module' ms ps1 ps3)) ps2
   649                in SOME (case try (get_node gr4) node_id of
   650                    NONE => (case get_aux_code aux of
   651                        [] => (p module, gr4)
   652                      | xs => (p module', add_edge (node_id, dep) (new_node
   653                          (node_id, (NONE, module', cat_lines xs ^ "\n")) gr4)))
   654                  | SOME (_, module'', _) =>
   655                      (p module'', add_edge (node_id, dep) gr4))
   656                end
   657            end
   658        | NONE => (case get_defn thy defs s T of
   659            NONE => NONE
   660          | SOME ((U, (thyname, (args, rhs))), k) =>
   661              let
   662                val module' = if_library thyname module;
   663                val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
   664                val node_id = s ^ suffix;
   665                val ((ps, def_id), gr') = gr |> codegens true ts
   666                  ||>> mk_const_id module' (s ^ suffix);
   667                val p = mk_app brack (str (mk_qual_id module def_id)) ps
   668              in SOME (case try (get_node gr') node_id of
   669                  NONE =>
   670                    let
   671                      val _ = message ("expanding definition of " ^ s);
   672                      val (Ts, _) = strip_type U;
   673                      val (args', rhs') =
   674                        if not (null args) orelse null Ts then (args, rhs) else
   675                          let val v = Free (new_name rhs "x", hd Ts)
   676                          in ([v], betapply (rhs, v)) end;
   677                      val (p', gr1) = invoke_codegen thy defs node_id module' false
   678                        rhs' (add_edge (node_id, dep)
   679                           (new_node (node_id, (NONE, "", "")) gr'));
   680                      val (xs, gr2) = codegens false args' gr1;
   681                      val (_, gr3) = invoke_tycodegen thy defs dep module false T gr2;
   682                      val (ty, gr4) = invoke_tycodegen thy defs node_id module' false U gr3;
   683                    in (p, map_node node_id (K (NONE, module', string_of
   684                        (Pretty.block (separate (Pretty.brk 1)
   685                          (if null args' then
   686                             [str ("val " ^ snd def_id ^ " :"), ty]
   687                           else str ("fun " ^ snd def_id) :: xs) @
   688                         [str " =", Pretty.brk 1, p', str ";"])) ^ "\n\n")) gr4)
   689                    end
   690                | SOME _ => (p, add_edge (node_id, dep) gr'))
   691              end))
   692 
   693     | Abs _ =>
   694       let
   695         val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
   696         val t = strip_abs_body u
   697         val bs' = new_names t bs;
   698         val (ps, gr1) = codegens true ts gr;
   699         val (p, gr2) = invoke_codegen thy defs dep module false
   700           (subst_bounds (map Free (rev (bs' ~~ Ts)), t)) gr1;
   701       in
   702         SOME (mk_app brack (Pretty.block (str "(" :: pretty_fn bs' p @
   703           [str ")"])) ps, gr2)
   704       end
   705 
   706     | _ => NONE)
   707   end;
   708 
   709 fun default_tycodegen thy defs dep module brack (TVar ((s, i), _)) gr =
   710       SOME (str (s ^ (if i = 0 then "" else string_of_int i)), gr)
   711   | default_tycodegen thy defs dep module brack (TFree (s, _)) gr =
   712       SOME (str s, gr)
   713   | default_tycodegen thy defs dep module brack (Type (s, Ts)) gr =
   714       (case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
   715          NONE => NONE
   716        | SOME (ms, aux) =>
   717            let
   718              val (ps, gr') = fold_map
   719                (invoke_tycodegen thy defs dep module false)
   720                (fst (args_of ms Ts)) gr;
   721              val (qs, gr'') = fold_map
   722                (invoke_tycodegen thy defs dep module false)
   723                (quotes_of ms) gr';
   724              val module' = if_library (thyname_of_type thy s) module;
   725              val node_id = s ^ " (type)";
   726              fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
   727            in SOME (case try (get_node gr'') node_id of
   728                NONE => (case get_aux_code aux of
   729                    [] => (p module', gr'')
   730                  | xs => (p module', snd (mk_type_id module' s
   731                        (add_edge (node_id, dep) (new_node (node_id,
   732                          (NONE, module', cat_lines xs ^ "\n")) gr'')))))
   733              | SOME (_, module'', _) =>
   734                  (p module'', add_edge (node_id, dep) gr''))
   735            end);
   736 
   737 fun mk_tuple [p] = p
   738   | mk_tuple ps = Pretty.block (str "(" ::
   739       List.concat (separate [str ",", Pretty.brk 1] (map single ps)) @
   740         [str ")"]);
   741 
   742 fun mk_let bindings body =
   743   Pretty.blk (0, [str "let", Pretty.brk 1,
   744     Pretty.blk (0, separate Pretty.fbrk (map (fn (pat, rhs) =>
   745       Pretty.block [str "val ", pat, str " =", Pretty.brk 1,
   746       rhs, str ";"]) bindings)),
   747     Pretty.brk 1, str "in", Pretty.brk 1, body,
   748     Pretty.brk 1, str "end"]);
   749 
   750 fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
   751 
   752 fun add_to_module name s = AList.map_entry (op =) (name : string) (suffix s);
   753 
   754 fun output_code gr module xs =
   755   let
   756     val code = map_filter (fn s =>
   757       let val c as (_, module', _) = Graph.get_node gr s
   758       in if module = "" orelse module = module' then SOME (s, c) else NONE end)
   759         (rev (Graph.all_preds gr xs));
   760     fun string_of_cycle (a :: b :: cs) =
   761           let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
   762             if a = a' then Option.map (pair x)
   763               (find_first ((fn (_, b', _) => b' = b) o Graph.get_node gr)
   764                 (Graph.imm_succs gr x))
   765             else NONE) code
   766           in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
   767       | string_of_cycle _ = ""
   768   in
   769     if module = "" then
   770       let
   771         val modules = distinct (op =) (map (#2 o snd) code);
   772         val mod_gr = fold_rev Graph.add_edge_acyclic
   773           (maps (fn (s, (_, module, _)) => map (pair module)
   774             (filter_out (fn s => s = module) (map (#2 o Graph.get_node gr)
   775               (Graph.imm_succs gr s)))) code)
   776           (fold_rev (Graph.new_node o rpair ()) modules Graph.empty);
   777         val modules' =
   778           rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
   779       in
   780         List.foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
   781           (map (rpair "") modules') code
   782       end handle Graph.CYCLES (cs :: _) =>
   783         error ("Cyclic dependency of modules:\n" ^ commas cs ^
   784           "\n" ^ string_of_cycle cs)
   785     else [(module, implode (map (#3 o snd) code))]
   786   end;
   787 
   788 fun gen_generate_code prep_term thy modules module xs =
   789   let
   790     val _ = (module <> "" orelse
   791         member (op =) (!mode) "library" andalso forall (fn (s, _) => s = "") xs)
   792       orelse error "missing module name";
   793     val graphs = get_modules thy;
   794     val defs = mk_deftab thy;
   795     val gr = new_node ("<Top>", (NONE, module, ""))
   796       (List.foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
   797         (Graph.merge (fn ((_, module, _), (_, module', _)) =>
   798            module = module') (gr, gr'),
   799          (merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
   800            (map (fn s => case Symtab.lookup graphs s of
   801                 NONE => error ("Undefined code module: " ^ s)
   802               | SOME gr => gr) modules))
   803       handle Graph.DUP k => error ("Duplicate code for " ^ k);
   804     fun expand (t as Abs _) = t
   805       | expand t = (case fastype_of t of
   806           Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
   807     val (ps, gr') = fold_map (fn (s, t) => fn gr => apfst (pair s)
   808       (invoke_codegen thy defs "<Top>" module false t gr))
   809         (map (apsnd (expand o preprocess_term thy o prep_term thy)) xs) gr;
   810     val code = map_filter
   811       (fn ("", _) => NONE
   812         | (s', p) => SOME (string_of (Pretty.block
   813           [str ("val " ^ s' ^ " ="), Pretty.brk 1, p, str ";"]))) ps;
   814     val code' = space_implode "\n\n" code ^ "\n\n";
   815     val code'' =
   816       map_filter (fn (name, s) =>
   817           if member (op =) (!mode) "library" andalso name = module andalso null code
   818           then NONE
   819           else SOME (name, mk_struct name s))
   820         ((if null code then I
   821           else add_to_module module code')
   822            (output_code (fst gr') (if_library "" module) ["<Top>"]))
   823   in
   824     (code'', del_nodes ["<Top>"] gr')
   825   end;
   826 
   827 val generate_code_i = gen_generate_code Sign.cert_term;
   828 val generate_code = gen_generate_code OldGoals.read_term;
   829 
   830 
   831 (**** Reflection ****)
   832 
   833 val strip_tname = implode o tl o explode;
   834 
   835 fun pretty_list xs = Pretty.block (str "[" ::
   836   flat (separate [str ",", Pretty.brk 1] (map single xs)) @
   837   [str "]"]);
   838 
   839 fun mk_type p (TVar ((s, i), _)) = str
   840       (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
   841   | mk_type p (TFree (s, _)) = str (strip_tname s ^ "T")
   842   | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
   843       [str "Type", Pretty.brk 1, str ("(\"" ^ s ^ "\","),
   844        Pretty.brk 1, pretty_list (map (mk_type false) Ts), str ")"]);
   845 
   846 fun mk_term_of gr module p (TVar ((s, i), _)) = str
   847       (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
   848   | mk_term_of gr module p (TFree (s, _)) = str (strip_tname s ^ "F")
   849   | mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
   850       (Pretty.block (separate (Pretty.brk 1)
   851         (str (mk_qual_id module
   852           (get_type_id' (fn s' => "term_of_" ^ s') gr s)) ::
   853         maps (fn T =>
   854           [mk_term_of gr module true T, mk_type true T]) Ts)));
   855 
   856 
   857 (**** Test data generators ****)
   858 
   859 fun mk_gen gr module p xs a (TVar ((s, i), _)) = str
   860       (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
   861   | mk_gen gr module p xs a (TFree (s, _)) = str (strip_tname s ^ "G")
   862   | mk_gen gr module p xs a (Type (tyc as (s, Ts))) = (if p then parens else I)
   863       (Pretty.block (separate (Pretty.brk 1)
   864         (str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') gr s) ^
   865           (if member (op =) xs s then "'" else "")) ::
   866          (case tyc of
   867             ("fun", [T, U]) =>
   868               [mk_term_of gr module true T, mk_type true T,
   869                mk_gen gr module true xs a U, mk_type true U]
   870           | _ => maps (fn T =>
   871               [mk_gen gr module true xs a T, mk_type true T]) Ts) @
   872          (if member (op =) xs s then [str a] else []))));
   873 
   874 val test_fn : (int -> (string * term) list option) ref = ref (fn _ => NONE);
   875 
   876 fun test_term ctxt t =
   877   let
   878     val thy = ProofContext.theory_of ctxt;
   879     val (code, gr) = setmp mode ["term_of", "test"]
   880       (generate_code_i thy [] "Generated") [("testf", t)];
   881     val frees = Name.names Name.context "a" ((map snd o fst o strip_abs) t);
   882     val frees' = frees ~~
   883       map (fn i => "arg" ^ string_of_int i) (1 upto length frees);
   884     val s = "structure TestTerm =\nstruct\n\n" ^
   885       cat_lines (map snd code) ^
   886       "\nopen Generated;\n\n" ^ string_of
   887         (Pretty.block [str "val () = Codegen.test_fn :=",
   888           Pretty.brk 1, str ("(fn i =>"), Pretty.brk 1,
   889           mk_let (map (fn ((s, T), s') =>
   890               (mk_tuple [str s', str (s' ^ "_t")],
   891                Pretty.block [mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
   892                  str "(i + 1)"])) frees')
   893             (Pretty.block [str "if ",
   894               mk_app false (str "testf") (map (str o snd) frees'),
   895               Pretty.brk 1, str "then NONE",
   896               Pretty.brk 1, str "else ",
   897               Pretty.block [str "SOME ", Pretty.block (str "[" ::
   898                 flat (separate [str ",", Pretty.brk 1]
   899                   (map (fn ((s, T), s') => [Pretty.block
   900                     [str ("(" ^ quote (Symbol.escape s) ^ ","), Pretty.brk 1,
   901                      str (s' ^ "_t ())")]]) frees')) @
   902                   [str "]"])]]),
   903           str ");"]) ^
   904       "\n\nend;\n";
   905     val _ = ML_Context.eval_in (SOME ctxt) false Position.none s;
   906   in ! test_fn #> (Option.map o map) snd end;
   907 
   908 
   909 
   910 (**** Evaluator for terms ****)
   911 
   912 val eval_result = ref (fn () => Bound 0);
   913 
   914 fun eval_term thy t =
   915   let
   916     val ctxt = ProofContext.init thy;
   917     val e =
   918       let
   919         val _ = (null (Term.add_tvars t []) andalso null (Term.add_tfrees t [])) orelse
   920           error "Term to be evaluated contains type variables";
   921         val _ = (null (Term.add_vars t []) andalso null (Term.add_frees t [])) orelse
   922           error "Term to be evaluated contains variables";
   923         val (code, gr) = setmp mode ["term_of"]
   924           (generate_code_i thy [] "Generated")
   925           [("result", Abs ("x", TFree ("'a", []), t))];
   926         val s = "structure EvalTerm =\nstruct\n\n" ^
   927           cat_lines (map snd code) ^
   928           "\nopen Generated;\n\n" ^ string_of
   929             (Pretty.block [str "val () = Codegen.eval_result := (fn () =>",
   930               Pretty.brk 1,
   931               mk_app false (mk_term_of gr "Generated" false (fastype_of t))
   932                 [str "(result ())"],
   933               str ");"]) ^
   934           "\n\nend;\n";
   935         val _ = NAMED_CRITICAL "codegen" (fn () =>
   936           ML_Context.eval_in (SOME ctxt) false Position.none s);
   937       in !eval_result end;
   938   in e () end;
   939 
   940 val (_, evaluation_conv) = Context.>>> (Context.map_theory_result
   941   (Thm.add_oracle (Binding.name "evaluation", fn ct =>
   942     let
   943       val thy = Thm.theory_of_cterm ct;
   944       val t = Thm.term_of ct;
   945     in Thm.cterm_of thy (Logic.mk_equals (t, eval_term thy t)) end)));
   946 
   947 
   948 (**** Interface ****)
   949 
   950 fun parse_mixfix rd s =
   951   (case Scan.finite Symbol.stopper (Scan.repeat
   952      (   $$ "_" >> K Arg
   953       || $$ "?" >> K Ignore
   954       || $$ "\\<module>" >> K Module
   955       || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
   956       || $$ "{" |-- $$ "*" |-- Scan.repeat1
   957            (   $$ "'" |-- Scan.one Symbol.is_regular
   958             || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.is_regular)) --|
   959          $$ "*" --| $$ "}" >> (Quote o rd o implode)
   960       || Scan.repeat1
   961            (   $$ "'" |-- Scan.one Symbol.is_regular
   962             || Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
   963                  (Scan.one Symbol.is_regular)) >> (Pretty o str o implode)))
   964        (Symbol.explode s) of
   965      (p, []) => p
   966    | _ => error ("Malformed annotation: " ^ quote s));
   967 
   968 
   969 structure P = OuterParse and K = OuterKeyword;
   970 
   971 val _ = List.app OuterKeyword.keyword ["attach", "file", "contains"];
   972 
   973 fun strip_whitespace s = implode (fst (take_suffix (fn c => c = "\n" orelse c = " ")
   974   (snd (take_prefix (fn c => c = "\n" orelse c = " ") (explode s))))) ^ "\n";
   975 
   976 val parse_attach = Scan.repeat (P.$$$ "attach" |--
   977   Scan.optional (P.$$$ "(" |-- P.xname --| P.$$$ ")") "" --
   978     (P.verbatim >> strip_whitespace));
   979 
   980 val _ =
   981   OuterSyntax.command "types_code"
   982   "associate types with target language types" K.thy_decl
   983     (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
   984      (fn xs => Toplevel.theory (fn thy => fold (assoc_type o
   985        (fn ((name, mfx), aux) => (name, (parse_mixfix
   986          (Syntax.read_typ_global thy) mfx, aux)))) xs thy)));
   987 
   988 val _ =
   989   OuterSyntax.command "consts_code"
   990   "associate constants with target language code" K.thy_decl
   991     (Scan.repeat1
   992        (P.term --|
   993         P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
   994      (fn xs => Toplevel.theory (fn thy => fold (assoc_const o
   995        (fn ((const, mfx), aux) =>
   996          (const, (parse_mixfix (Syntax.read_term_global thy) mfx, aux)))) xs thy)));
   997 
   998 fun parse_code lib =
   999   Scan.optional (P.$$$ "(" |-- P.enum "," P.xname --| P.$$$ ")") (!mode) --
  1000   (if lib then Scan.optional P.name "" else P.name) --
  1001   Scan.option (P.$$$ "file" |-- P.name) --
  1002   (if lib then Scan.succeed []
  1003    else Scan.optional (P.$$$ "imports" |-- Scan.repeat1 P.name) []) --|
  1004   P.$$$ "contains" --
  1005   (   Scan.repeat1 (P.name --| P.$$$ "=" -- P.term)
  1006    || Scan.repeat1 (P.term >> pair "")) >>
  1007   (fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
  1008     let
  1009       val mode'' = (if lib then insert (op =) "library" else I) (remove (op =) "library" mode');
  1010       val (code, gr) = setmp mode mode'' (generate_code thy modules module) xs;
  1011       val thy' = thy |> Context.theory_map (ML_Context.exec (fn () =>
  1012         (case opt_fname of
  1013           NONE => ML_Context.eval false Position.none (cat_lines (map snd code))
  1014         | SOME fname =>
  1015             if lib then app (fn (name, s) => File.write
  1016                 (Path.append (Path.explode fname) (Path.basic (name ^ ".ML"))) s)
  1017               (("ROOT", implode (map (fn (name, _) =>
  1018                   "use \"" ^ name ^ ".ML\";\n") code)) :: code)
  1019             else File.write (Path.explode fname) (snd (hd code)))));
  1020     in
  1021       if lib then thy'
  1022       else map_modules (Symtab.update (module, gr)) thy'
  1023     end));
  1024 
  1025 val setup = add_codegen "default" default_codegen
  1026   #> add_tycodegen "default" default_tycodegen
  1027   #> Code.add_attribute ("unfold", Scan.succeed (Thm.declaration_attribute
  1028        (fn thm => Context.mapping (add_unfold thm #> Code.add_inline thm) I)))
  1029   #> add_preprocessor unfold_preprocessor;
  1030 
  1031 val _ =
  1032   OuterSyntax.command "code_library"
  1033     "generates code for terms (one structure for each theory)" K.thy_decl
  1034     (parse_code true);
  1035 
  1036 val _ =
  1037   OuterSyntax.command "code_module"
  1038     "generates code for terms (single structure, incremental)" K.thy_decl
  1039     (parse_code false);
  1040 
  1041 end;