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