src/Pure/codegen.ML
author haftmann
Tue Aug 07 09:40:34 2007 +0200 (2007-08-07)
changeset 24166 7b28dc69bdbb
parent 24022 ab76c73b3b58
child 24219 e558fe311376
permissions -rw-r--r--
new nbe implementation
     1 (*  Title:      Pure/codegen.ML
     2     ID:         $Id$
     3     Author:     Stefan Berghofer, TU Muenchen
     4 
     5 Generic code generator.
     6 *)
     7 
     8 signature CODEGEN =
     9 sig
    10   val quiet_mode : bool ref
    11   val message : string -> unit
    12   val mode : string list ref
    13   val margin : int ref
    14 
    15   datatype 'a mixfix =
    16       Arg
    17     | Ignore
    18     | Module
    19     | Pretty of Pretty.T
    20     | Quote of 'a;
    21 
    22   type deftab
    23   type node
    24   type codegr
    25   type 'a codegen
    26 
    27   val add_codegen: string -> term codegen -> theory -> theory
    28   val add_tycodegen: string -> typ codegen -> theory -> theory
    29   val add_attribute: string -> (Args.T list -> attribute * Args.T list) -> 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     codegr * term -> codegr * Pretty.T
    51   val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
    52     codegr * typ -> codegr * Pretty.T
    53   val mk_id: string -> string
    54   val mk_qual_id: string -> string * string -> string
    55   val mk_const_id: string -> string -> codegr -> codegr * (string * string)
    56   val get_const_id: string -> codegr -> string * string
    57   val mk_type_id: string -> string -> codegr -> codegr * (string * string)
    58   val get_type_id: string -> codegr -> string * string
    59   val thyname_of_type: string -> theory -> string
    60   val thyname_of_const: string -> theory -> 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: theory -> typ -> typ -> bool
    69   val parens: Pretty.T -> Pretty.T
    70   val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
    71   val eta_expand: term -> term list -> int -> term
    72   val strip_tname: string -> string
    73   val mk_type: bool -> typ -> Pretty.T
    74   val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
    75   val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
    76   val test_fn: (int -> (string * term) list option) ref
    77   val test_term: theory -> int -> int -> term -> (string * term) list option
    78   val eval_result: term ref
    79   val eval_term: theory -> term -> term
    80   val evaluation_conv: cterm -> thm
    81   val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
    82   val quotes_of: 'a mixfix list -> 'a list
    83   val num_args_of: 'a mixfix list -> int
    84   val replace_quotes: 'b list -> 'a mixfix list -> 'b mixfix list
    85   val fillin_mixfix: ('a -> Pretty.T) -> 'a mixfix list -> 'a list -> Pretty.T
    86   val mk_deftab: theory -> deftab
    87   val add_unfold: thm -> theory -> theory
    88 
    89   val get_node: codegr -> string -> node
    90   val add_edge: string * string -> codegr -> codegr
    91   val add_edge_acyclic: string * string -> codegr -> codegr
    92   val del_nodes: string list -> codegr -> codegr
    93   val map_node: string -> (node -> node) -> codegr -> codegr
    94   val new_node: string * node -> codegr -> codegr
    95 end;
    96 
    97 structure Codegen : CODEGEN =
    98 struct
    99 
   100 val quiet_mode = ref true;
   101 fun message s = if !quiet_mode then () else writeln s;
   102 
   103 val mode = ref ([] : string list);
   104 
   105 val margin = ref 80;
   106 
   107 (**** Mixfix syntax ****)
   108 
   109 datatype 'a mixfix =
   110     Arg
   111   | Ignore
   112   | Module
   113   | Pretty of Pretty.T
   114   | Quote of 'a;
   115 
   116 fun is_arg Arg = true
   117   | is_arg Ignore = true
   118   | is_arg _ = false;
   119 
   120 fun quotes_of [] = []
   121   | quotes_of (Quote q :: ms) = q :: quotes_of ms
   122   | quotes_of (_ :: ms) = quotes_of ms;
   123 
   124 fun args_of [] xs = ([], xs)
   125   | args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
   126   | args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
   127   | args_of (_ :: ms) xs = args_of ms xs;
   128 
   129 fun num_args_of x = length (List.filter is_arg x);
   130 
   131 
   132 (**** theory data ****)
   133 
   134 (* preprocessed definition table *)
   135 
   136 type deftab =
   137   (typ *              (* type of constant *)
   138     (string *         (* name of theory containing definition of constant *)
   139       (term list *    (* parameters *)
   140        term)))        (* right-hand side *)
   141   list Symtab.table;
   142 
   143 (* code dependency graph *)
   144 
   145 type nametab = (string * string) Symtab.table * unit Symtab.table;
   146 
   147 fun merge_nametabs ((tab, used), (tab', used')) =
   148   (Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
   149 
   150 type node =
   151   (exn option *    (* slot for arbitrary data *)
   152    string *        (* name of structure containing piece of code *)
   153    string);        (* piece of code *)
   154 
   155 type codegr =
   156   node Graph.T *
   157   (nametab *       (* table for assigned constant names *)
   158    nametab);       (* table for assigned type names *)
   159 
   160 val emptygr : codegr = (Graph.empty,
   161   ((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
   162 
   163 (* type of code generators *)
   164 
   165 type 'a codegen =
   166   theory ->    (* theory in which generate_code was called *)
   167   deftab ->    (* definition table (for efficiency) *)
   168   codegr ->    (* code dependency graph *)
   169   string ->    (* node name of caller (for recording dependencies) *)
   170   string ->    (* module name of caller (for modular code generation) *)
   171   bool ->      (* whether to parenthesize generated expression *)
   172   'a ->        (* item to generate code from *)
   173   (codegr * Pretty.T) option;
   174 
   175 (* parameters for random testing *)
   176 
   177 type test_params =
   178   {size: int, iterations: int, default_type: typ option};
   179 
   180 fun merge_test_params
   181   {size = size1, iterations = iterations1, default_type = default_type1}
   182   {size = size2, iterations = iterations2, default_type = default_type2} =
   183   {size = Int.max (size1, size2),
   184    iterations = Int.max (iterations1, iterations2),
   185    default_type = case default_type1 of
   186        NONE => default_type2
   187      | _ => default_type1};
   188 
   189 val default_test_params : test_params =
   190   {size = 10, iterations = 100, default_type = NONE};
   191 
   192 fun set_size size ({iterations, default_type, ...} : test_params) =
   193   {size = size, iterations = iterations, default_type = default_type};
   194 
   195 fun set_iterations iterations ({size, default_type, ...} : test_params) =
   196   {size = size, iterations = iterations, default_type = default_type};
   197 
   198 fun set_default_type s thy ({size, iterations, ...} : test_params) =
   199   {size = size, iterations = iterations,
   200    default_type = SOME (Sign.read_typ thy s)};
   201 
   202 
   203 (* theory data *)
   204 
   205 structure CodeData = CodegenData;
   206 
   207 structure CodegenData = TheoryDataFun
   208 (
   209   type T =
   210     {codegens : (string * term codegen) list,
   211      tycodegens : (string * typ codegen) list,
   212      consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
   213      types : (string * (typ mixfix list * (string * string) list)) list,
   214      attrs: (string * (Args.T list -> attribute * Args.T list)) list,
   215      preprocs: (stamp * (theory -> thm list -> thm list)) list,
   216      modules: codegr Symtab.table,
   217      test_params: test_params};
   218 
   219   val empty =
   220     {codegens = [], tycodegens = [], consts = [], types = [], attrs = [],
   221      preprocs = [], modules = Symtab.empty, test_params = default_test_params};
   222   val copy = I;
   223   val extend = I;
   224 
   225   fun merge _
   226     ({codegens = codegens1, tycodegens = tycodegens1,
   227       consts = consts1, types = types1, attrs = attrs1,
   228       preprocs = preprocs1, modules = modules1, test_params = test_params1},
   229      {codegens = codegens2, tycodegens = tycodegens2,
   230       consts = consts2, types = types2, attrs = attrs2,
   231       preprocs = preprocs2, modules = modules2, test_params = test_params2}) =
   232     {codegens = AList.merge (op =) (K true) (codegens1, codegens2),
   233      tycodegens = AList.merge (op =) (K true) (tycodegens1, tycodegens2),
   234      consts = AList.merge (op =) (K true) (consts1, consts2),
   235      types = AList.merge (op =) (K true) (types1, types2),
   236      attrs = AList.merge (op =) (K true) (attrs1, attrs2),
   237      preprocs = AList.merge (op =) (K true) (preprocs1, preprocs2),
   238      modules = Symtab.merge (K true) (modules1, modules2),
   239      test_params = merge_test_params test_params1 test_params2};
   240 );
   241 
   242 fun print_codegens thy =
   243   let val {codegens, tycodegens, ...} = CodegenData.get thy in
   244     Pretty.writeln (Pretty.chunks
   245       [Pretty.strs ("term code generators:" :: map fst codegens),
   246        Pretty.strs ("type code generators:" :: map fst tycodegens)])
   247   end;
   248 
   249 
   250 
   251 (**** access parameters for random testing ****)
   252 
   253 fun get_test_params thy = #test_params (CodegenData.get thy);
   254 
   255 fun map_test_params f thy =
   256   let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   257     CodegenData.get thy;
   258   in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
   259     consts = consts, types = types, attrs = attrs, preprocs = preprocs,
   260     modules = modules, test_params = f test_params} thy
   261   end;
   262 
   263 
   264 (**** access modules ****)
   265 
   266 fun get_modules thy = #modules (CodegenData.get thy);
   267 
   268 fun map_modules f thy =
   269   let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   270     CodegenData.get thy;
   271   in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
   272     consts = consts, types = types, attrs = attrs, preprocs = preprocs,
   273     modules = f modules, test_params = test_params} thy
   274   end;
   275 
   276 
   277 (**** add new code generators to theory ****)
   278 
   279 fun add_codegen name f thy =
   280   let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   281     CodegenData.get thy
   282   in (case AList.lookup (op =) codegens name of
   283       NONE => CodegenData.put {codegens = (name, f) :: codegens,
   284         tycodegens = tycodegens, consts = consts, types = types,
   285         attrs = attrs, preprocs = preprocs, modules = modules,
   286         test_params = test_params} thy
   287     | SOME _ => error ("Code generator " ^ name ^ " already declared"))
   288   end;
   289 
   290 fun add_tycodegen name f thy =
   291   let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   292     CodegenData.get thy
   293   in (case AList.lookup (op =) tycodegens name of
   294       NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
   295         codegens = codegens, consts = consts, types = types,
   296         attrs = attrs, preprocs = preprocs, modules = modules,
   297         test_params = test_params} thy
   298     | SOME _ => error ("Code generator " ^ name ^ " already declared"))
   299   end;
   300 
   301 
   302 (**** preprocessors ****)
   303 
   304 fun add_preprocessor p thy =
   305   let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   306     CodegenData.get thy
   307   in CodegenData.put {tycodegens = tycodegens,
   308     codegens = codegens, consts = consts, types = types,
   309     attrs = attrs, preprocs = (stamp (), p) :: preprocs,
   310     modules = modules, test_params = test_params} thy
   311   end;
   312 
   313 fun preprocess thy =
   314   let val {preprocs, ...} = CodegenData.get thy
   315   in fold (fn (_, f) => f thy) preprocs end;
   316 
   317 fun preprocess_term thy t =
   318   let
   319     val x = Free (Name.variant (add_term_names (t, [])) "x", fastype_of t);
   320     (* fake definition *)
   321     val eq = setmp quick_and_dirty true (SkipProof.make_thm thy)
   322       (Logic.mk_equals (x, t));
   323     fun err () = error "preprocess_term: bad preprocessor"
   324   in case map prop_of (preprocess thy [eq]) of
   325       [Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
   326     | _ => err ()
   327   end;
   328 
   329 fun add_unfold eqn =
   330   let
   331     val thy = Thm.theory_of_thm eqn;
   332     val ctxt = ProofContext.init thy;
   333     val eqn' = LocalDefs.meta_rewrite_rule ctxt eqn;
   334     val names = term_consts (fst (Logic.dest_equals (prop_of eqn')));
   335     fun prep thy = map (fn th =>
   336       let val prop = prop_of th
   337       in
   338         if forall (fn name => exists_Const (equal name o fst) prop) names
   339         then rewrite_rule [eqn'] (Thm.transfer thy th)
   340         else th
   341       end)
   342   in add_preprocessor prep end;
   343 
   344 
   345 (**** code attribute ****)
   346 
   347 fun add_attribute name att thy =
   348   let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   349     CodegenData.get thy
   350   in (case AList.lookup (op =) attrs name of
   351       NONE => CodegenData.put {tycodegens = tycodegens,
   352         codegens = codegens, consts = consts, types = types,
   353         attrs = if name = "" then attrs @ [(name, att)] else (name, att) :: attrs,
   354         preprocs = preprocs, modules = modules,
   355         test_params = test_params} thy
   356     | SOME _ => error ("Code attribute " ^ name ^ " already declared"))
   357   end;
   358 
   359 fun mk_parser (a, p) = (if a = "" then Scan.succeed "" else Args.$$$ a) |-- p;
   360 
   361 val code_attr =
   362   Attrib.syntax (Scan.peek (fn context => List.foldr op || Scan.fail (map mk_parser
   363     (#attrs (CodegenData.get (Context.theory_of context))))));
   364 
   365 val _ = Context.add_setup
   366   (Attrib.add_attributes [("code", code_attr, "declare theorems for code generation")]);
   367 
   368 local
   369   fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
   370   fun add_simple_attribute (name, f) =
   371     add_attribute name (Scan.succeed (mk_attribute f));
   372   fun add_del_attribute (name, (add, del)) =
   373     add_attribute name (Args.del |-- Scan.succeed (mk_attribute del)
   374       || Scan.succeed (mk_attribute add))
   375 in
   376   val _ = Context.add_setup (add_simple_attribute ("unfold",
   377     fn thm => add_unfold thm #> CodeData.add_inline thm));
   378   val _ = map (Context.add_setup o add_del_attribute) [
   379     ("func", (CodeData.add_func true, CodeData.del_func)),
   380     ("inline", (CodeData.add_inline, CodeData.del_inline)),
   381     ("post", (CodeData.add_post, CodeData.del_post))
   382   ];
   383 end; (*local*)
   384 
   385 
   386 (**** associate constants with target language code ****)
   387 
   388 fun gen_assoc_const prep_const (raw_const, syn) thy =
   389   let
   390     val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   391       CodegenData.get thy;
   392     val (cname, T) = prep_const thy raw_const;
   393   in
   394     if num_args_of (fst syn) > length (binder_types T) then
   395       error ("More arguments than in corresponding type of " ^ cname)
   396     else case AList.lookup (op =) consts (cname, T) of
   397       NONE => CodegenData.put {codegens = codegens,
   398         tycodegens = tycodegens,
   399         consts = ((cname, T), syn) :: consts,
   400         types = types, attrs = attrs, preprocs = preprocs,
   401         modules = modules, test_params = test_params} thy
   402     | SOME _ => error ("Constant " ^ cname ^ " already associated with code")
   403   end;
   404 
   405 val assoc_const_i = gen_assoc_const (K I);
   406 val assoc_const = gen_assoc_const CodegenConsts.read_bare_const;
   407 
   408 
   409 (**** associate types with target language types ****)
   410 
   411 fun assoc_type (s, syn) thy =
   412   let
   413     val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
   414       CodegenData.get thy;
   415     val tc = Sign.intern_type thy s;
   416   in
   417     case Symtab.lookup (snd (#types (Type.rep_tsig (Sign.tsig_of thy)))) tc of
   418       SOME (Type.LogicalType i, _) =>
   419         if num_args_of (fst syn) > i then
   420           error ("More arguments than corresponding type constructor " ^ s)
   421         else (case AList.lookup (op =) types tc of
   422           NONE => CodegenData.put {codegens = codegens,
   423             tycodegens = tycodegens, consts = consts,
   424             types = (tc, syn) :: types, attrs = attrs,
   425             preprocs = preprocs, modules = modules, test_params = test_params} thy
   426         | SOME _ => error ("Type " ^ tc ^ " already associated with code"))
   427     | _ => error ("Not a type constructor: " ^ s)
   428   end;
   429 
   430 fun get_assoc_type thy = AList.lookup (op =) ((#types o CodegenData.get) thy);
   431 
   432 
   433 (**** make valid ML identifiers ****)
   434 
   435 fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
   436   Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
   437 
   438 fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of
   439     ("<" :: "^" :: xs, ">") => (true, implode xs)
   440   | ("<" :: xs, ">") => (false, implode xs)
   441   | _ => sys_error "dest_sym");
   442 
   443 fun mk_id s = if s = "" then "" else
   444   let
   445     fun check_str [] = []
   446       | check_str xs = (case take_prefix is_ascii_letdig xs of
   447           ([], " " :: zs) => check_str zs
   448         | ([], z :: zs) =>
   449           if size z = 1 then string_of_int (ord z) :: check_str zs
   450           else (case dest_sym z of
   451               (true, "isub") => check_str zs
   452             | (true, "isup") => "" :: check_str zs
   453             | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
   454         | (ys, zs) => implode ys :: check_str zs);
   455     val s' = space_implode "_" (maps (check_str o Symbol.explode) (NameSpace.explode s))
   456   in
   457     if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
   458   end;
   459 
   460 fun mk_long_id (p as (tab, used)) module s =
   461   let
   462     fun find_name [] = sys_error "mk_long_id"
   463       | find_name (ys :: yss) =
   464           let
   465             val s' = NameSpace.implode ys
   466             val s'' = NameSpace.append module s'
   467           in case Symtab.lookup used s'' of
   468               NONE => ((module, s'),
   469                 (Symtab.update_new (s, (module, s')) tab,
   470                  Symtab.update_new (s'', ()) used))
   471             | SOME _ => find_name yss
   472           end
   473   in case Symtab.lookup tab s of
   474       NONE => find_name (Library.suffixes1 (NameSpace.explode s))
   475     | SOME name => (name, p)
   476   end;
   477 
   478 (* module:  module name for caller                                        *)
   479 (* module': module name for callee                                        *)
   480 (* if caller and callee reside in different modules, use qualified access *)
   481 
   482 fun mk_qual_id module (module', s) =
   483   if module = module' orelse module' = "" then s else module' ^ "." ^ s;
   484 
   485 fun mk_const_id module cname (gr, (tab1, tab2)) =
   486   let
   487     val ((module, s), tab1') = mk_long_id tab1 module cname
   488     val s' = mk_id s;
   489     val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
   490   in ((gr, (tab1', tab2)), (module, s'')) end;
   491 
   492 fun get_const_id cname (gr, (tab1, tab2)) =
   493   case Symtab.lookup (fst tab1) cname of
   494     NONE => error ("get_const_id: no such constant: " ^ quote cname)
   495   | SOME (module, s) =>
   496       let
   497         val s' = mk_id s;
   498         val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
   499       in (module, s'') end;
   500 
   501 fun mk_type_id module tyname (gr, (tab1, tab2)) =
   502   let
   503     val ((module, s), tab2') = mk_long_id tab2 module tyname
   504     val s' = mk_id s;
   505     val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
   506   in ((gr, (tab1, tab2')), (module, s'')) end;
   507 
   508 fun get_type_id tyname (gr, (tab1, tab2)) =
   509   case Symtab.lookup (fst tab2) tyname of
   510     NONE => error ("get_type_id: no such type: " ^ quote tyname)
   511   | SOME (module, s) =>
   512       let
   513         val s' = mk_id s;
   514         val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
   515       in (module, s'') end;
   516 
   517 fun get_type_id' f tyname tab = apsnd f (get_type_id tyname tab);
   518 
   519 fun get_node (gr, x) k = Graph.get_node gr k;
   520 fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
   521 fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
   522 fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
   523 fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
   524 fun new_node p (gr, x) = (Graph.new_node p gr, x);
   525 
   526 fun theory_of_type s thy =
   527   if Sign.declared_tyname thy s
   528   then SOME (the_default thy (get_first (theory_of_type s) (Theory.parents_of thy)))
   529   else NONE;
   530 
   531 fun theory_of_const s thy =
   532   if Sign.declared_const thy s
   533   then SOME (the_default thy (get_first (theory_of_const s) (Theory.parents_of thy)))
   534   else NONE;
   535 
   536 fun thyname_of_type s thy = (case theory_of_type s thy of
   537     NONE => error ("thyname_of_type: no such type: " ^ quote s)
   538   | SOME thy' => Context.theory_name thy');
   539 
   540 fun thyname_of_const s thy = (case theory_of_const s thy of
   541     NONE => error ("thyname_of_const: no such constant: " ^ quote s)
   542   | SOME thy' => Context.theory_name thy');
   543 
   544 fun rename_terms ts =
   545   let
   546     val names = List.foldr add_term_names
   547       (map (fst o fst) (rev (fold Term.add_vars ts []))) ts;
   548     val reserved = filter ML_Syntax.is_reserved names;
   549     val (illegal, alt_names) = split_list (map_filter (fn s =>
   550       let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
   551     val ps = (reserved @ illegal) ~~
   552       Name.variant_list names (map (suffix "'") reserved @ alt_names);
   553 
   554     fun rename_id s = AList.lookup (op =) ps s |> the_default s;
   555 
   556     fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
   557       | rename (Free (a, T)) = Free (rename_id a, T)
   558       | rename (Abs (s, T, t)) = Abs (s, T, rename t)
   559       | rename (t $ u) = rename t $ rename u
   560       | rename t = t;
   561   in
   562     map rename ts
   563   end;
   564 
   565 val rename_term = hd o rename_terms o single;
   566 
   567 
   568 (**** retrieve definition of constant ****)
   569 
   570 fun is_instance thy T1 T2 =
   571   Sign.typ_instance thy (T1, Logic.legacy_varifyT T2);
   572 
   573 fun get_assoc_code thy (s, T) = Option.map snd (find_first (fn ((s', T'), _) =>
   574   s = s' andalso is_instance thy T T') (#consts (CodegenData.get thy)));
   575 
   576 fun get_aux_code xs = map_filter (fn (m, code) =>
   577   if m = "" orelse member (op =) (!mode) m then SOME code else NONE) xs;
   578 
   579 fun mk_deftab thy =
   580   let
   581     val axmss = map (fn thy' => (Context.theory_name thy', Theory.axiom_table thy'))
   582       (thy :: Theory.ancestors_of thy);
   583     fun prep_def def = (case preprocess thy [def] of
   584       [def'] => prop_of def' | _ => error "mk_deftab: bad preprocessor");
   585     fun dest t =
   586       let
   587         val (lhs, rhs) = Logic.dest_equals t;
   588         val (c, args) = strip_comb lhs;
   589         val (s, T) = dest_Const c
   590       in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
   591       end handle TERM _ => NONE;
   592     fun add_def thyname (name, t) = (case dest t of
   593         NONE => I
   594       | SOME _ => (case dest (prep_def (Thm.get_axiom thy name)) of
   595           NONE => I
   596         | SOME (s, (T, (args, rhs))) => Symtab.map_default (s, [])
   597             (cons (T, (thyname, split_last (rename_terms (args @ [rhs])))))))
   598   in
   599     fold (fn (thyname, axms) => Symtab.fold (add_def thyname) axms) axmss Symtab.empty
   600   end;
   601 
   602 fun get_defn thy defs s T = (case Symtab.lookup defs s of
   603     NONE => NONE
   604   | SOME ds =>
   605       let val i = find_index (is_instance thy T o fst) ds
   606       in if i >= 0 then
   607           SOME (List.nth (ds, i), if length ds = 1 then NONE else SOME i)
   608         else NONE
   609       end);
   610 
   611 
   612 (**** invoke suitable code generator for term / type ****)
   613 
   614 fun codegen_error (gr, _) dep s =
   615   error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
   616 
   617 fun invoke_codegen thy defs dep module brack (gr, t) = (case get_first
   618    (fn (_, f) => f thy defs gr dep module brack t) (#codegens (CodegenData.get thy)) of
   619       NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
   620         Sign.string_of_term thy t)
   621     | SOME x => x);
   622 
   623 fun invoke_tycodegen thy defs dep module brack (gr, T) = (case get_first
   624    (fn (_, f) => f thy defs gr dep module brack T) (#tycodegens (CodegenData.get thy)) of
   625       NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
   626         Sign.string_of_typ thy T)
   627     | SOME x => x);
   628 
   629 
   630 (**** code generator for mixfix expressions ****)
   631 
   632 fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"];
   633 
   634 fun pretty_fn [] p = [p]
   635   | pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") ::
   636       Pretty.brk 1 :: pretty_fn xs p;
   637 
   638 fun pretty_mixfix _ _ [] [] _ = []
   639   | pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
   640       p :: pretty_mixfix module module' ms ps qs
   641   | pretty_mixfix module module' (Ignore :: ms) ps qs =
   642       pretty_mixfix module module' ms ps qs
   643   | pretty_mixfix module module' (Module :: ms) ps qs =
   644       (if module <> module'
   645        then cons (Pretty.str (module' ^ ".")) else I)
   646       (pretty_mixfix module module' ms ps qs)
   647   | pretty_mixfix module module' (Pretty p :: ms) ps qs =
   648       p :: pretty_mixfix module module' ms ps qs
   649   | pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
   650       q :: pretty_mixfix module module' ms ps qs;
   651 
   652 fun replace_quotes [] [] = []
   653   | replace_quotes xs (Arg :: ms) =
   654       Arg :: replace_quotes xs ms
   655   | replace_quotes xs (Ignore :: ms) =
   656       Ignore :: replace_quotes xs ms
   657   | replace_quotes xs (Module :: ms) =
   658       Module :: replace_quotes xs ms
   659   | replace_quotes xs (Pretty p :: ms) =
   660       Pretty p :: replace_quotes xs ms
   661   | replace_quotes (x::xs) (Quote _ :: ms) =
   662       Quote x :: replace_quotes xs ms;
   663 
   664 fun fillin_mixfix f ms args =
   665   let
   666     fun fillin [] [] =
   667          []
   668       | fillin (Arg :: ms) (a :: args) =
   669           f a :: fillin ms args
   670       | fillin (Ignore :: ms) args =
   671           fillin ms args
   672       | fillin (Module :: ms) args =
   673           fillin ms args
   674       | fillin (Pretty p :: ms) args =
   675           p :: fillin ms args
   676       | fillin (Quote q :: ms) args =
   677           f q :: fillin ms args
   678   in Pretty.block (fillin ms args) end;
   679 
   680 
   681 (**** default code generators ****)
   682 
   683 fun eta_expand t ts i =
   684   let
   685     val (Ts, _) = strip_type (fastype_of t);
   686     val j = i - length ts
   687   in
   688     List.foldr (fn (T, t) => Abs ("x", T, t))
   689       (list_comb (t, ts @ map Bound (j-1 downto 0))) (Library.take (j, Ts))
   690   end;
   691 
   692 fun mk_app _ p [] = p
   693   | mk_app brack p ps = if brack then
   694        Pretty.block (Pretty.str "(" ::
   695          separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"])
   696      else Pretty.block (separate (Pretty.brk 1) (p :: ps));
   697 
   698 fun new_names t xs = Name.variant_list
   699   (map (fst o fst o dest_Var) (term_vars t) union
   700     add_term_names (t, ML_Syntax.reserved_names)) (map mk_id xs);
   701 
   702 fun new_name t x = hd (new_names t [x]);
   703 
   704 fun if_library x y = if member (op =) (!mode) "library" then x else y;
   705 
   706 fun default_codegen thy defs gr dep module brack t =
   707   let
   708     val (u, ts) = strip_comb t;
   709     fun codegens brack = foldl_map (invoke_codegen thy defs dep module brack)
   710   in (case u of
   711       Var ((s, i), T) =>
   712         let
   713           val (gr', ps) = codegens true (gr, ts);
   714           val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
   715         in SOME (gr'', mk_app brack (Pretty.str (s ^
   716            (if i=0 then "" else string_of_int i))) ps)
   717         end
   718 
   719     | Free (s, T) =>
   720         let
   721           val (gr', ps) = codegens true (gr, ts);
   722           val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
   723         in SOME (gr'', mk_app brack (Pretty.str s) ps) end
   724 
   725     | Const (s, T) =>
   726       (case get_assoc_code thy (s, T) of
   727          SOME (ms, aux) =>
   728            let val i = num_args_of ms
   729            in if length ts < i then
   730                default_codegen thy defs gr dep module brack (eta_expand u ts i)
   731              else
   732                let
   733                  val (ts1, ts2) = args_of ms ts;
   734                  val (gr1, ps1) = codegens false (gr, ts1);
   735                  val (gr2, ps2) = codegens true (gr1, ts2);
   736                  val (gr3, ps3) = codegens false (gr2, quotes_of ms);
   737                  val (gr4, _) = invoke_tycodegen thy defs dep module false
   738                    (gr3, funpow (length ts) (hd o tl o snd o dest_Type) T);
   739                  val (module', suffix) = (case get_defn thy defs s T of
   740                      NONE => (if_library (thyname_of_const s thy) module, "")
   741                    | SOME ((U, (module', _)), NONE) =>
   742                        (if_library module' module, "")
   743                    | SOME ((U, (module', _)), SOME i) =>
   744                        (if_library module' module, " def" ^ string_of_int i));
   745                  val node_id = s ^ suffix;
   746                  fun p module' = mk_app brack (Pretty.block
   747                    (pretty_mixfix module module' ms ps1 ps3)) ps2
   748                in SOME (case try (get_node gr4) node_id of
   749                    NONE => (case get_aux_code aux of
   750                        [] => (gr4, p module)
   751                      | xs => (add_edge (node_id, dep) (new_node
   752                          (node_id, (NONE, module', space_implode "\n" xs ^ "\n")) gr4),
   753                            p module'))
   754                  | SOME (_, module'', _) =>
   755                      (add_edge (node_id, dep) gr4, p module''))
   756                end
   757            end
   758        | NONE => (case get_defn thy defs s T of
   759            NONE => NONE
   760          | SOME ((U, (thyname, (args, rhs))), k) =>
   761              let
   762                val module' = if_library thyname module;
   763                val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
   764                val node_id = s ^ suffix;
   765                val (gr', (ps, def_id)) = codegens true (gr, ts) |>>>
   766                  mk_const_id module' (s ^ suffix);
   767                val p = mk_app brack (Pretty.str (mk_qual_id module def_id)) ps
   768              in SOME (case try (get_node gr') node_id of
   769                  NONE =>
   770                    let
   771                      val _ = message ("expanding definition of " ^ s);
   772                      val (Ts, _) = strip_type U;
   773                      val (args', rhs') =
   774                        if not (null args) orelse null Ts then (args, rhs) else
   775                          let val v = Free (new_name rhs "x", hd Ts)
   776                          in ([v], betapply (rhs, v)) end;
   777                      val (gr1, p') = invoke_codegen thy defs node_id module' false
   778                        (add_edge (node_id, dep)
   779                           (new_node (node_id, (NONE, "", "")) gr'), rhs');
   780                      val (gr2, xs) = codegens false (gr1, args');
   781                      val (gr3, _) = invoke_tycodegen thy defs dep module false (gr2, T);
   782                      val (gr4, ty) = invoke_tycodegen thy defs node_id module' false (gr3, U);
   783                    in (map_node node_id (K (NONE, module', Pretty.string_of
   784                        (Pretty.block (separate (Pretty.brk 1)
   785                          (if null args' then
   786                             [Pretty.str ("val " ^ snd def_id ^ " :"), ty]
   787                           else Pretty.str ("fun " ^ snd def_id) :: xs) @
   788                         [Pretty.str " =", Pretty.brk 1, p', Pretty.str ";"])) ^ "\n\n")) gr4,
   789                      p)
   790                    end
   791                | SOME _ => (add_edge (node_id, dep) gr', p))
   792              end))
   793 
   794     | Abs _ =>
   795       let
   796         val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
   797         val t = strip_abs_body u
   798         val bs' = new_names t bs;
   799         val (gr1, ps) = codegens true (gr, ts);
   800         val (gr2, p) = invoke_codegen thy defs dep module false
   801           (gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t));
   802       in
   803         SOME (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @
   804           [Pretty.str ")"])) ps)
   805       end
   806 
   807     | _ => NONE)
   808   end;
   809 
   810 fun default_tycodegen thy defs gr dep module brack (TVar ((s, i), _)) =
   811       SOME (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i)))
   812   | default_tycodegen thy defs gr dep module brack (TFree (s, _)) =
   813       SOME (gr, Pretty.str s)
   814   | default_tycodegen thy defs gr dep module brack (Type (s, Ts)) =
   815       (case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
   816          NONE => NONE
   817        | SOME (ms, aux) =>
   818            let
   819              val (gr', ps) = foldl_map
   820                (invoke_tycodegen thy defs dep module false)
   821                (gr, fst (args_of ms Ts));
   822              val (gr'', qs) = foldl_map
   823                (invoke_tycodegen thy defs dep module false)
   824                (gr', quotes_of ms);
   825              val module' = if_library (thyname_of_type s thy) module;
   826              val node_id = s ^ " (type)";
   827              fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
   828            in SOME (case try (get_node gr'') node_id of
   829                NONE => (case get_aux_code aux of
   830                    [] => (gr'', p module')
   831                  | xs => (fst (mk_type_id module' s
   832                        (add_edge (node_id, dep) (new_node (node_id,
   833                          (NONE, module', space_implode "\n" xs ^ "\n")) gr''))),
   834                      p module'))
   835              | SOME (_, module'', _) =>
   836                  (add_edge (node_id, dep) gr'', p module''))
   837            end);
   838 
   839 val _ = Context.add_setup
   840  (add_codegen "default" default_codegen #>
   841   add_tycodegen "default" default_tycodegen);
   842 
   843 
   844 fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
   845 
   846 fun add_to_module name s = AList.map_entry (op =) name (suffix s);
   847 
   848 fun output_code gr module xs =
   849   let
   850     val code = map_filter (fn s =>
   851       let val c as (_, module', _) = Graph.get_node gr s
   852       in if module = "" orelse module = module' then SOME (s, c) else NONE end)
   853         (rev (Graph.all_preds gr xs));
   854     fun string_of_cycle (a :: b :: cs) =
   855           let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
   856             if a = a' then Option.map (pair x)
   857               (find_first (equal b o #2 o Graph.get_node gr)
   858                 (Graph.imm_succs gr x))
   859             else NONE) code
   860           in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
   861       | string_of_cycle _ = ""
   862   in
   863     if module = "" then
   864       let
   865         val modules = distinct (op =) (map (#2 o snd) code);
   866         val mod_gr = fold_rev Graph.add_edge_acyclic
   867           (maps (fn (s, (_, module, _)) => map (pair module)
   868             (filter_out (equal module) (map (#2 o Graph.get_node gr)
   869               (Graph.imm_succs gr s)))) code)
   870           (fold_rev (Graph.new_node o rpair ()) modules Graph.empty);
   871         val modules' =
   872           rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
   873       in
   874         List.foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
   875           (map (rpair "") modules') code
   876       end handle Graph.CYCLES (cs :: _) =>
   877         error ("Cyclic dependency of modules:\n" ^ commas cs ^
   878           "\n" ^ string_of_cycle cs)
   879     else [(module, implode (map (#3 o snd) code))]
   880   end;
   881 
   882 fun gen_generate_code prep_term thy modules module =
   883   PrintMode.with_default (Pretty.setmp_margin (!margin) (fn xs =>
   884   let
   885     val _ = (module <> "" orelse
   886         member (op =) (!mode) "library" andalso forall (equal "" o fst) xs)
   887       orelse error "missing module name";
   888     val graphs = get_modules thy;
   889     val defs = mk_deftab thy;
   890     val gr = new_node ("<Top>", (NONE, module, ""))
   891       (List.foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
   892         (Graph.merge (fn ((_, module, _), (_, module', _)) =>
   893            module = module') (gr, gr'),
   894          (merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
   895            (map (fn s => case Symtab.lookup graphs s of
   896                 NONE => error ("Undefined code module: " ^ s)
   897               | SOME gr => gr) modules))
   898       handle Graph.DUP k => error ("Duplicate code for " ^ k);
   899     fun expand (t as Abs _) = t
   900       | expand t = (case fastype_of t of
   901           Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
   902     val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s)
   903       (invoke_codegen thy defs "<Top>" module false (gr, t)))
   904         (gr, map (apsnd (expand o preprocess_term thy o prep_term thy)) xs);
   905     val code = map_filter
   906       (fn ("", _) => NONE
   907         | (s', p) => SOME (Pretty.string_of (Pretty.block
   908           [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"]))) ps;
   909     val code' = space_implode "\n\n" code ^ "\n\n";
   910     val code'' =
   911       map_filter (fn (name, s) =>
   912           if member (op =) (!mode) "library" andalso name = module andalso null code
   913           then NONE
   914           else SOME (name, mk_struct name s))
   915         ((if null code then I
   916           else add_to_module module code')
   917            (output_code (fst gr') (if_library "" module) ["<Top>"]))
   918   in
   919     (code'', del_nodes ["<Top>"] gr')
   920   end));
   921 
   922 val generate_code_i = gen_generate_code Sign.cert_term;
   923 val generate_code = gen_generate_code Sign.read_term;
   924 
   925 
   926 (**** Reflection ****)
   927 
   928 val strip_tname = implode o tl o explode;
   929 
   930 fun pretty_list xs = Pretty.block (Pretty.str "[" ::
   931   flat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
   932   [Pretty.str "]"]);
   933 
   934 fun mk_type p (TVar ((s, i), _)) = Pretty.str
   935       (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
   936   | mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T")
   937   | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
   938       [Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","),
   939        Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]);
   940 
   941 fun mk_term_of gr module p (TVar ((s, i), _)) = Pretty.str
   942       (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
   943   | mk_term_of gr module p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F")
   944   | mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
   945       (Pretty.block (separate (Pretty.brk 1)
   946         (Pretty.str (mk_qual_id module
   947           (get_type_id' (fn s' => "term_of_" ^ s') s gr)) ::
   948         maps (fn T =>
   949           [mk_term_of gr module true T, mk_type true T]) Ts)));
   950 
   951 
   952 (**** Test data generators ****)
   953 
   954 fun mk_gen gr module p xs a (TVar ((s, i), _)) = Pretty.str
   955       (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
   956   | mk_gen gr module p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G")
   957   | mk_gen gr module p xs a (Type (s, Ts)) = (if p then parens else I)
   958       (Pretty.block (separate (Pretty.brk 1)
   959         (Pretty.str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') s gr) ^
   960           (if member (op =) xs s then "'" else "")) ::
   961          map (mk_gen gr module true xs a) Ts @
   962          (if member (op =) xs s then [Pretty.str a] else []))));
   963 
   964 val test_fn : (int -> (string * term) list option) ref = ref (fn _ => NONE);
   965 
   966 fun test_term thy sz i t =
   967   let
   968     val _ = (null (term_tvars t) andalso null (term_tfrees t)) orelse
   969       error "Term to be tested contains type variables";
   970     val _ = null (term_vars t) orelse
   971       error "Term to be tested contains schematic variables";
   972     val frees = map dest_Free (term_frees t);
   973     val frees' = frees ~~
   974       map (fn i => "arg" ^ string_of_int i) (1 upto length frees);
   975     val (code, gr) = setmp mode ["term_of", "test"]
   976       (generate_code_i thy [] "Generated") [("testf", list_abs_free (frees, t))];
   977     val s = PrintMode.with_default (fn () => "structure TestTerm =\nstruct\n\n" ^
   978       space_implode "\n" (map snd code) ^
   979       "\nopen Generated;\n\n" ^ Pretty.string_of
   980         (Pretty.block [Pretty.str "val () = Codegen.test_fn :=",
   981           Pretty.brk 1, Pretty.str ("(fn i =>"), Pretty.brk 1,
   982           Pretty.blk (0, [Pretty.str "let", Pretty.brk 1,
   983             Pretty.blk (0, separate Pretty.fbrk (map (fn ((s, T), s') =>
   984               Pretty.block [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1,
   985               mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
   986               Pretty.str "i;"]) frees')),
   987             Pretty.brk 1, Pretty.str "in", Pretty.brk 1,
   988             Pretty.block [Pretty.str "if ",
   989               mk_app false (Pretty.str "testf") (map (Pretty.str o snd) frees'),
   990               Pretty.brk 1, Pretty.str "then NONE",
   991               Pretty.brk 1, Pretty.str "else ",
   992               Pretty.block [Pretty.str "SOME ", Pretty.block (Pretty.str "[" ::
   993                 flat (separate [Pretty.str ",", Pretty.brk 1]
   994                   (map (fn ((s, T), s') => [Pretty.block
   995                     [Pretty.str ("(" ^ quote (Symbol.escape s) ^ ","), Pretty.brk 1,
   996                      mk_app false (mk_term_of gr "Generated" false T)
   997                        [Pretty.str s'], Pretty.str ")"]]) frees')) @
   998                   [Pretty.str "]"])]],
   999             Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^
  1000       "\n\nend;\n") ();
  1001     val _ = use_text "" Output.ml_output false s;
  1002     fun iter f k = if k > i then NONE
  1003       else (case (f () handle Match =>
  1004           (warning "Exception Match raised in generated code"; NONE)) of
  1005         NONE => iter f (k+1) | SOME x => SOME x);
  1006     fun test k = if k > sz then NONE
  1007       else (priority ("Test data size: " ^ string_of_int k);
  1008         case iter (fn () => !test_fn k) 1 of
  1009           NONE => test (k+1) | SOME x => SOME x);
  1010   in test 0 end;
  1011 
  1012 fun test_goal ({size, iterations, default_type}, tvinsts) i st =
  1013   let
  1014     val thy = Toplevel.theory_of st;
  1015     fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t
  1016       | strip t = t;
  1017     val (gi, frees) = Logic.goal_params
  1018       (prop_of (snd (snd (Proof.get_goal (Toplevel.proof_of st))))) i;
  1019     val gi' = ObjectLogic.atomize_term thy (map_types
  1020       (map_type_tfree (fn p as (s, _) =>
  1021         the_default (the_default (TFree p) default_type)
  1022           (AList.lookup (op =) tvinsts s))) (subst_bounds (frees, strip gi)));
  1023   in case test_term (Toplevel.theory_of st) size iterations gi' of
  1024       NONE => writeln "No counterexamples found."
  1025     | SOME cex => writeln ("Counterexample found:\n" ^
  1026         Pretty.string_of (Pretty.chunks (map (fn (s, t) =>
  1027           Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1,
  1028             Sign.pretty_term thy t]) cex)))
  1029   end;
  1030 
  1031 
  1032 (**** Evaluator for terms ****)
  1033 
  1034 val eval_result = ref (Bound 0);
  1035 
  1036 fun eval_term thy = PrintMode.with_default (fn t =>
  1037   let
  1038     val _ = (null (term_tvars t) andalso null (term_tfrees t)) orelse
  1039       error "Term to be evaluated contains type variables";
  1040     val _ = (null (term_vars t) andalso null (term_frees t)) orelse
  1041       error "Term to be evaluated contains variables";
  1042     val (code, gr) = setmp mode ["term_of"]
  1043       (generate_code_i thy [] "Generated") [("result", t)];
  1044     val s = "structure EvalTerm =\nstruct\n\n" ^
  1045       space_implode "\n" (map snd code) ^
  1046       "\nopen Generated;\n\n" ^ Pretty.string_of
  1047         (Pretty.block [Pretty.str "val () = Codegen.eval_result :=",
  1048           Pretty.brk 1,
  1049           mk_app false (mk_term_of gr "Generated" false (fastype_of t))
  1050             [Pretty.str "result"],
  1051           Pretty.str ";"])  ^
  1052       "\n\nend;\n";
  1053     val _ = use_text "" Output.ml_output false s
  1054   in !eval_result end);
  1055 
  1056 fun print_evaluated_term s = Toplevel.keep (fn state =>
  1057   let
  1058     val ctxt = Toplevel.context_of state;
  1059     val thy = ProofContext.theory_of ctxt;
  1060     val t = eval_term thy (ProofContext.read_term ctxt s);
  1061     val T = Term.type_of t;
  1062   in
  1063     writeln (Pretty.string_of
  1064       (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
  1065         Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)]))
  1066   end);
  1067 
  1068 exception Evaluation of term;
  1069 
  1070 fun evaluation_oracle (thy, Evaluation t) =
  1071   Logic.mk_equals (t, eval_term thy t);
  1072 
  1073 fun evaluation_conv ct =
  1074   let val {thy, t, ...} = rep_cterm ct
  1075   in Thm.invoke_oracle_i thy "Pure.evaluation" (thy, Evaluation t) end;
  1076 
  1077 val _ = Context.add_setup
  1078   (Theory.add_oracle ("evaluation", evaluation_oracle));
  1079 
  1080 (**** Interface ****)
  1081 
  1082 val str = PrintMode.with_default Pretty.str;
  1083 
  1084 fun parse_mixfix rd s =
  1085   (case Scan.finite Symbol.stopper (Scan.repeat
  1086      (   $$ "_" >> K Arg
  1087       || $$ "?" >> K Ignore
  1088       || $$ "\\<module>" >> K Module
  1089       || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
  1090       || $$ "{" |-- $$ "*" |-- Scan.repeat1
  1091            (   $$ "'" |-- Scan.one Symbol.is_regular
  1092             || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.is_regular)) --|
  1093          $$ "*" --| $$ "}" >> (Quote o rd o implode)
  1094       || Scan.repeat1
  1095            (   $$ "'" |-- Scan.one Symbol.is_regular
  1096             || Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
  1097                  (Scan.one Symbol.is_regular)) >> (Pretty o str o implode)))
  1098        (Symbol.explode s) of
  1099      (p, []) => p
  1100    | _ => error ("Malformed annotation: " ^ quote s));
  1101 
  1102 val _ = Context.add_setup
  1103   (fold assoc_type [("fun", (parse_mixfix (K dummyT) "(_ ->/ _)",
  1104      [("term_of",
  1105        "fun term_of_fun_type _ T _ U _ = Free (\"<function>\", T --> U);\n"),
  1106       ("test",
  1107        "fun gen_fun_type _ G i =\n\
  1108        \  let\n\
  1109        \    val f = ref (fn x => raise Match);\n\
  1110        \    val _ = (f := (fn x =>\n\
  1111        \      let\n\
  1112        \        val y = G i;\n\
  1113        \        val f' = !f\n\
  1114        \      in (f := (fn x' => if x = x' then y else f' x'); y) end))\n\
  1115        \  in (fn x => !f x) end;\n")]))]);
  1116 
  1117 
  1118 structure P = OuterParse and K = OuterKeyword;
  1119 
  1120 fun strip_whitespace s = implode (fst (take_suffix (equal "\n" orf equal " ")
  1121   (snd (take_prefix (equal "\n" orf equal " ") (explode s))))) ^ "\n";
  1122 
  1123 val parse_attach = Scan.repeat (P.$$$ "attach" |--
  1124   Scan.optional (P.$$$ "(" |-- P.xname --| P.$$$ ")") "" --
  1125     (P.verbatim >> strip_whitespace));
  1126 
  1127 val assoc_typeP =
  1128   OuterSyntax.command "types_code"
  1129   "associate types with target language types" K.thy_decl
  1130     (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
  1131      (fn xs => Toplevel.theory (fn thy => fold (assoc_type o
  1132        (fn ((name, mfx), aux) => (name, (parse_mixfix
  1133          (Sign.read_typ thy) mfx, aux)))) xs thy)));
  1134 
  1135 val assoc_constP =
  1136   OuterSyntax.command "consts_code"
  1137   "associate constants with target language code" K.thy_decl
  1138     (Scan.repeat1
  1139        (P.term --|
  1140         P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
  1141      (fn xs => Toplevel.theory (fn thy => fold (assoc_const o 
  1142        (fn ((const, mfx), aux) =>
  1143          (const, (parse_mixfix (Sign.read_term thy) mfx, aux)))) xs thy)));
  1144 
  1145 fun parse_code lib =
  1146   Scan.optional (P.$$$ "(" |-- P.enum "," P.xname --| P.$$$ ")") (!mode) --
  1147   (if lib then Scan.optional P.name "" else P.name) --
  1148   Scan.option (P.$$$ "file" |-- P.name) --
  1149   (if lib then Scan.succeed []
  1150    else Scan.optional (P.$$$ "imports" |-- Scan.repeat1 P.name) []) --|
  1151   P.$$$ "contains" --
  1152   (   Scan.repeat1 (P.name --| P.$$$ "=" -- P.term)
  1153    || Scan.repeat1 (P.term >> pair "")) >>
  1154   (fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
  1155      let
  1156        val mode'' = (if lib then insert (op =) "library" else I) (remove (op =) "library" mode');
  1157        val (code, gr) = setmp mode mode'' (generate_code thy modules module) xs
  1158      in ((case opt_fname of
  1159          NONE => use_text "" Output.ml_output false
  1160            (space_implode "\n" (map snd code))
  1161        | SOME fname =>
  1162            if lib then
  1163              app (fn (name, s) => File.write
  1164                  (Path.append (Path.explode fname) (Path.basic (name ^ ".ML"))) s)
  1165                (("ROOT", implode (map (fn (name, _) =>
  1166                    "use \"" ^ name ^ ".ML\";\n") code)) :: code)
  1167            else File.write (Path.explode fname) (snd (hd code)));
  1168            if lib then thy
  1169            else map_modules (Symtab.update (module, gr)) thy)
  1170      end));
  1171 
  1172 val code_libraryP =
  1173   OuterSyntax.command "code_library"
  1174     "generates code for terms (one structure for each theory)" K.thy_decl
  1175     (parse_code true);
  1176 
  1177 val code_moduleP =
  1178   OuterSyntax.command "code_module"
  1179     "generates code for terms (single structure, incremental)" K.thy_decl
  1180     (parse_code false);
  1181 
  1182 val params =
  1183   [("size", P.nat >> (K o set_size)),
  1184    ("iterations", P.nat >> (K o set_iterations)),
  1185    ("default_type", P.typ >> set_default_type)];
  1186 
  1187 val parse_test_params = P.short_ident :|-- (fn s =>
  1188   P.$$$ "=" |-- (AList.lookup (op =) params s |> the_default Scan.fail));
  1189 
  1190 fun parse_tyinst xs =
  1191   (P.type_ident --| P.$$$ "=" -- P.typ >> (fn (v, s) => fn thy =>
  1192     fn (x, ys) => (x, (v, Sign.read_typ thy s) :: ys))) xs;
  1193 
  1194 fun app [] x = x
  1195   | app (f :: fs) x = app fs (f x);
  1196 
  1197 val test_paramsP =
  1198   OuterSyntax.command "quickcheck_params" "set parameters for random testing" K.thy_decl
  1199     (P.$$$ "[" |-- P.list1 parse_test_params --| P.$$$ "]" >>
  1200       (fn fs => Toplevel.theory (fn thy =>
  1201          map_test_params (app (map (fn f => f thy) fs)) thy)));
  1202 
  1203 val testP =
  1204   OuterSyntax.command "quickcheck" "try to find counterexample for subgoal" K.diag
  1205   (Scan.option (P.$$$ "[" |-- P.list1
  1206     (   parse_test_params >> (fn f => fn thy => apfst (f thy))
  1207      || parse_tyinst) --| P.$$$ "]") -- Scan.optional P.nat 1 >>
  1208     (fn (ps, g) => Toplevel.keep (fn st =>
  1209       test_goal (app (the_default [] (Option.map (map (fn f => f (Toplevel.theory_of st))) ps))
  1210         (get_test_params (Toplevel.theory_of st), [])) g st)));
  1211 
  1212 val valueP =
  1213   OuterSyntax.improper_command "value" "read, evaluate and print term" K.diag
  1214     (P.term >> (Toplevel.no_timing oo print_evaluated_term));
  1215 
  1216 val _ = OuterSyntax.add_keywords ["attach", "file", "contains"];
  1217 
  1218 val _ = OuterSyntax.add_parsers
  1219   [assoc_typeP, assoc_constP, code_libraryP, code_moduleP, test_paramsP, testP, valueP];
  1220 
  1221 end;