src/HOL/Tools/recfun_codegen.ML
author haftmann
Tue, 09 May 2006 10:10:12 +0200
changeset 19600 2d969d9a233b
parent 19575 2d9940cd52d3
child 19788 be3a84d22a58
permissions -rw-r--r--
adaption to CodegenTheorems
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     1
(*  Title:      HOL/recfun_codegen.ML
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     2
    ID:         $Id$
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     3
    Author:     Stefan Berghofer, TU Muenchen
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     4
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     5
Code generator for recursive functions.
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     6
*)
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     7
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     8
signature RECFUN_CODEGEN =
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
     9
sig
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    10
  val add: string option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    11
  val del: attribute
18702
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    12
  val get_thm_equations: theory -> string * typ -> (thm list * typ) option
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
    13
  val setup: theory -> theory
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    14
end;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    15
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    16
structure RecfunCodegen : RECFUN_CODEGEN =
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    17
struct
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    18
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    19
open Codegen;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    20
16424
18a07ad8fea8 accomodate change of TheoryDataFun;
wenzelm
parents: 15700
diff changeset
    21
structure CodegenData = TheoryDataFun
18a07ad8fea8 accomodate change of TheoryDataFun;
wenzelm
parents: 15700
diff changeset
    22
(struct
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    23
  val name = "HOL/recfun_codegen";
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    24
  type T = (thm * string option) list Symtab.table;
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    25
  val empty = Symtab.empty;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    26
  val copy = I;
16424
18a07ad8fea8 accomodate change of TheoryDataFun;
wenzelm
parents: 15700
diff changeset
    27
  val extend = I;
18931
427df66052a1 TableFun: renamed xxx_multi to xxx_list;
wenzelm
parents: 18728
diff changeset
    28
  fun merge _ = Symtab.merge_list (Drule.eq_thm_prop o pairself fst);
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    29
  fun print _ _ = ();
16424
18a07ad8fea8 accomodate change of TheoryDataFun;
wenzelm
parents: 15700
diff changeset
    30
end);
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    31
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    32
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    33
val dest_eqn = HOLogic.dest_eq o HOLogic.dest_Trueprop;
15321
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    34
val lhs_of = fst o dest_eqn o prop_of;
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    35
val const_of = dest_Const o head_of o fst o dest_eqn;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    36
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    37
fun warn thm = warning ("RecfunCodegen: Not a proper equation:\n" ^
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    38
  string_of_thm thm);
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    39
19344
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    40
fun add optmod = Thm.declaration_attribute (fn thm => Context.map_theory
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    41
  let
19344
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    42
    fun add thm =
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    43
      if Pattern.pattern (lhs_of thm) then
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    44
        CodegenData.map
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    45
          (Symtab.update_list ((fst o const_of o prop_of) thm, (thm, optmod)))
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    46
      else tap (fn _ => warn thm)
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    47
      handle TERM _ => tap (fn _ => warn thm);
15321
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    48
  in
19344
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    49
    add thm
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    50
    #> CodegenTheorems.add_fun thm
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    51
  end);
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    52
19344
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    53
fun del_thm thm thy =
14196
be5e838f37bd Added "del" attribute for deleting equations.
berghofe
parents: 13105
diff changeset
    54
  let
be5e838f37bd Added "del" attribute for deleting equations.
berghofe
parents: 13105
diff changeset
    55
    val tab = CodegenData.get thy;
be5e838f37bd Added "del" attribute for deleting equations.
berghofe
parents: 13105
diff changeset
    56
    val (s, _) = const_of (prop_of thm);
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17261
diff changeset
    57
  in case Symtab.lookup tab s of
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    58
      NONE => thy
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    59
    | SOME thms =>
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
    60
        CodegenData.put (Symtab.update (s, gen_rem (eq_thm o apfst fst) (thms, thm)) tab) thy
19344
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    61
  end handle TERM _ => (warn thm; thy);
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    62
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
    63
val del = Thm.declaration_attribute
19600
2d969d9a233b adaption to CodegenTheorems
haftmann
parents: 19575
diff changeset
    64
  (fn thm => Context.map_theory (del_thm thm #> CodegenTheorems.del_fun thm))
14196
be5e838f37bd Added "del" attribute for deleting equations.
berghofe
parents: 13105
diff changeset
    65
15321
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    66
fun del_redundant thy eqs [] = eqs
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    67
  | del_redundant thy eqs (eq :: eqs') =
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    68
    let
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    69
      val matches = curry
17203
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17144
diff changeset
    70
        (Pattern.matches thy o pairself (lhs_of o fst))
15321
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    71
    in del_redundant thy (eq :: eqs) (filter_out (matches eq) eqs') end;
694f9d3ce90d Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents: 15257
diff changeset
    72
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    73
fun get_equations thy defs (s, T) =
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17261
diff changeset
    74
  (case Symtab.lookup (CodegenData.get thy) s of
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    75
     NONE => ([], "")
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    76
   | SOME thms => 
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    77
       let val thms' = del_redundant thy []
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    78
         (List.filter (fn (thm, _) => is_instance thy T
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    79
           (snd (const_of (prop_of thm)))) thms)
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    80
       in if null thms' then ([], "")
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    81
         else (preprocess thy (map fst thms'),
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    82
           case snd (snd (split_last thms')) of
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    83
               NONE => (case get_defn thy defs s T of
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    84
                   NONE => thyname_of_const s thy
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    85
                 | SOME ((_, (thyname, _)), _) => thyname)
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    86
             | SOME thyname => thyname)
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
    87
       end);
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
    88
18702
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    89
fun get_thm_equations thy (c, ty) =
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    90
  Symtab.lookup (CodegenData.get thy) c
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    91
  |> Option.map (fn thms => 
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    92
       List.filter (fn (thm, _) => is_instance thy ty ((snd o const_of o prop_of) thm)) thms
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    93
       |> del_redundant thy [])
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    94
  |> Option.mapPartial (fn thms => if null thms then NONE else SOME thms)
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    95
  |> Option.map (fn thms =>
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    96
       (preprocess thy (map fst thms),
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    97
          (snd o const_of o prop_of o fst o hd) thms))
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    98
  |> (Option.map o apfst o map) (fn thm => thm RS HOL.eq_reflection);
7dc7dcd63224 substantial improvements in code generator
haftmann
parents: 18220
diff changeset
    99
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   100
fun mk_suffix thy defs (s, T) = (case get_defn thy defs s T of
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   101
  SOME (_, SOME i) => " def" ^ string_of_int i | _ => "");
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   102
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   103
exception EQN of string * typ * string;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   104
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   105
fun cycle g (xs, x) =
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   106
  if x mem xs then xs
19575
2d9940cd52d3 replaced Graph.find_paths by Graph.irreducible_paths;
wenzelm
parents: 19344
diff changeset
   107
  else Library.foldl (cycle g) (x :: xs, List.concat (Graph.irreducible_paths (fst g) (x, x)));
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   108
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   109
fun add_rec_funs thy defs gr dep eqs module =
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   110
  let
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   111
    fun dest_eq t = (fst (const_of t) ^ mk_suffix thy defs (const_of t),
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   112
      dest_eqn (rename_term t));
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   113
    val eqs' = map dest_eq eqs;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   114
    val (dname, _) :: _ = eqs';
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   115
    val (s, T) = const_of (hd eqs);
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   116
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   117
    fun mk_fundef module fname prfx gr [] = (gr, [])
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   118
      | mk_fundef module fname prfx gr ((fname', (lhs, rhs)) :: xs) =
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   119
      let
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   120
        val (gr1, pl) = invoke_codegen thy defs dname module false (gr, lhs);
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   121
        val (gr2, pr) = invoke_codegen thy defs dname module false (gr1, rhs);
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   122
        val (gr3, rest) = mk_fundef module fname' "and " gr2 xs
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   123
      in
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   124
        (gr3, Pretty.blk (4, [Pretty.str (if fname = fname' then "  | " else prfx),
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   125
           pl, Pretty.str " =", Pretty.brk 1, pr]) :: rest)
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   126
      end;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   127
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   128
    fun put_code module fundef = map_node dname
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   129
      (K (SOME (EQN ("", dummyT, dname)), module, Pretty.string_of (Pretty.blk (0,
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   130
      separate Pretty.fbrk fundef @ [Pretty.str ";"])) ^ "\n\n"));
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   131
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   132
  in
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   133
    (case try (get_node gr) dname of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15321
diff changeset
   134
       NONE =>
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   135
         let
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   136
           val gr1 = add_edge (dname, dep)
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   137
             (new_node (dname, (SOME (EQN (s, T, "")), module, "")) gr);
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   138
           val (gr2, fundef) = mk_fundef module "" "fun " gr1 eqs';
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   139
           val xs = cycle gr2 ([], dname);
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   140
           val cs = map (fn x => case get_node gr2 x of
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   141
               (SOME (EQN (s, T, _)), _, _) => (s, T)
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   142
             | _ => error ("RecfunCodegen: illegal cyclic dependencies:\n" ^
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   143
                implode (separate ", " xs))) xs
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   144
         in (case xs of
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   145
             [_] => (put_code module fundef gr2, module)
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   146
           | _ =>
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   147
             if not (dep mem xs) then
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   148
               let
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   149
                 val thmss as (_, thyname) :: _ = map (get_equations thy defs) cs;
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   150
                 val module' = if_library thyname module;
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   151
                 val eqs'' = map (dest_eq o prop_of) (List.concat (map fst thmss));
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   152
                 val (gr3, fundef') = mk_fundef module' "" "fun "
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   153
                   (add_edge (dname, dep)
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   154
                     (foldr (uncurry new_node) (del_nodes xs gr2)
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   155
                       (map (fn k =>
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   156
                         (k, (SOME (EQN ("", dummyT, dname)), module', ""))) xs))) eqs''
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   157
               in (put_code module' fundef' gr3, module') end
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   158
             else (gr2, module))
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   159
         end
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   160
     | SOME (SOME (EQN (_, _, s)), module', _) =>
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   161
         (if s = "" then
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   162
            if dname = dep then gr else add_edge (dname, dep) gr
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   163
          else if s = dep then gr else add_edge (s, dep) gr,
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   164
          module'))
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   165
  end;
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   166
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   167
fun recfun_codegen thy defs gr dep module brack t = (case strip_comb t of
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   168
    (Const (p as (s, T)), ts) => (case (get_equations thy defs p, get_assoc_code thy s T) of
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   169
       (([], _), _) => NONE
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15321
diff changeset
   170
     | (_, SOME _) => NONE
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   171
     | ((eqns, thyname), NONE) =>
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   172
        let
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   173
          val module' = if_library thyname module;
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 16424
diff changeset
   174
          val (gr', ps) = foldl_map
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   175
            (invoke_codegen thy defs dep module true) (gr, ts);
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   176
          val suffix = mk_suffix thy defs p;
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   177
          val (gr'', module'') =
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   178
            add_rec_funs thy defs gr' dep (map prop_of eqns) module';
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   179
          val (gr''', fname) = mk_const_id module'' (s ^ suffix) gr''
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   180
        in
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   181
          SOME (gr''', mk_app brack (Pretty.str (mk_qual_id module fname)) ps)
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   182
        end)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15321
diff changeset
   183
  | _ => NONE);
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   184
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   185
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
   186
val setup =
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
   187
  CodegenData.init #>
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
   188
  add_codegen "recfun" recfun_codegen #>
18220
43cf5767f992 added codegenerator
haftmann
parents: 17412
diff changeset
   189
  add_attribute ""
19344
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
   190
    (Args.del |-- Scan.succeed del
b4e00947c8a1 added hook for codegen_theorems.ML
haftmann
parents: 19202
diff changeset
   191
     || Scan.option (Args.$$$ "target" |-- Args.colon |-- Args.name) >> add);
12447
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   192
e752c9aecdec Code generator for recursive functions.
berghofe
parents:
diff changeset
   193
end;