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