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