src/HOL/Tools/datatype_codegen.ML
author haftmann
Wed, 14 Jun 2006 12:12:01 +0200
changeset 19886 6bec6daac280
parent 19818 5c5c1208a3fa
child 20071 8f3e1ddb50e6
permissions -rw-r--r--
added hook for case const defs
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
12446
86887b40aeb1 Tuned header.
berghofe
parents: 12445
diff changeset
     1
(*  Title:      HOL/datatype_codegen.ML
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     2
    ID:         $Id$
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     3
    Author:     Stefan Berghofer, TU Muenchen
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     4
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     5
Code generator for inductive datatypes.
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     6
*)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     7
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     8
signature DATATYPE_CODEGEN =
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
     9
sig
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
    10
  val get_datatype_spec_thms: theory -> string
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
    11
    -> (((string * sort) list * (string * typ list) list) * tactic) option
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
    12
  val get_all_datatype_cons: theory -> (string * string) list
19886
6bec6daac280 added hook for case const defs
haftmann
parents: 19818
diff changeset
    13
  val add_datatype_case_const: string -> theory -> theory
6bec6daac280 added hook for case const defs
haftmann
parents: 19818
diff changeset
    14
  val add_datatype_case_defs: string -> theory -> theory
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
    15
  val setup: theory -> theory
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    16
end;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    17
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    18
structure DatatypeCodegen : DATATYPE_CODEGEN =
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    19
struct
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    20
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    21
open Codegen;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    22
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    23
fun mk_tuple [p] = p
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    24
  | mk_tuple ps = Pretty.block (Pretty.str "(" ::
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    25
      List.concat (separate [Pretty.str ",", Pretty.brk 1] (map single ps)) @
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    26
        [Pretty.str ")"]);
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    27
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    28
(**** datatype definition ****)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    29
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    30
(* find shortest path to constructor with no recursive arguments *)
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    31
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    32
fun find_nonempty (descr: DatatypeAux.descr) is i =
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    33
  let
17521
0f1c48de39f5 introduced AList module in favor of assoc etc.
haftmann
parents: 17412
diff changeset
    34
    val (_, _, constrs) = valOf (AList.lookup (op =) descr i);
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
    35
    fun arg_nonempty (_, DatatypeAux.DtRec i) = if i mem is then NONE
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    36
          else Option.map (curry op + 1 o snd) (find_nonempty descr (i::is) i)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
    37
      | arg_nonempty _ = SOME 0;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    38
    fun max xs = Library.foldl
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
    39
      (fn (NONE, _) => NONE
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
    40
        | (SOME i, SOME j) => SOME (Int.max (i, j))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
    41
        | (_, NONE) => NONE) (SOME 0, xs);
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    42
    val xs = sort (int_ord o pairself snd)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    43
      (List.mapPartial (fn (s, dts) => Option.map (pair s)
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    44
        (max (map (arg_nonempty o DatatypeAux.strip_dtyp) dts))) constrs)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
    45
  in case xs of [] => NONE | x :: _ => SOME x end;
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    46
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    47
fun add_dt_defs thy defs dep module gr (descr: DatatypeAux.descr) =
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    48
  let
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    49
    val sg = sign_of thy;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    50
    val tab = DatatypePackage.get_datatypes thy;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    51
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    52
    val descr' = List.filter (can (map DatatypeAux.dest_DtTFree o #2 o snd)) descr;
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    53
    val rtnames = map (#1 o snd) (List.filter (fn (_, (_, _, cs)) =>
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
    54
      exists (exists DatatypeAux.is_rec_type o snd) cs) descr');
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    55
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    56
    val (_, (tname, _, _)) :: _ = descr';
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    57
    val node_id = tname ^ " (type)";
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    58
    val module' = if_library (thyname_of_type tname thy) module;
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    59
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    60
    fun mk_dtdef gr prfx [] = (gr, [])
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    61
      | mk_dtdef gr prfx ((_, (tname, dts, cs))::xs) =
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    62
          let
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    63
            val tvs = map DatatypeAux.dest_DtTFree dts;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    64
            val sorts = map (rpair []) tvs;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    65
            val cs' = map (apsnd (map (DatatypeAux.typ_of_dtyp descr sorts))) cs;
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    66
            val (gr', (_, type_id)) = mk_type_id module' tname gr;
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    67
            val (gr'', ps) =
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    68
              foldl_map (fn (gr, (cname, cargs)) =>
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    69
                foldl_map (invoke_tycodegen thy defs node_id module' false)
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    70
                  (gr, cargs) |>>>
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    71
                mk_const_id module' cname) (gr', cs');
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    72
            val (gr''', rest) = mk_dtdef gr'' "and " xs
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    73
          in
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    74
            (gr''',
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    75
             Pretty.block (Pretty.str prfx ::
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    76
               (if null tvs then [] else
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    77
                  [mk_tuple (map Pretty.str tvs), Pretty.str " "]) @
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    78
               [Pretty.str (type_id ^ " ="), Pretty.brk 1] @
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    79
               List.concat (separate [Pretty.brk 1, Pretty.str "| "]
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    80
                 (map (fn (ps', (_, cname)) => [Pretty.block
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    81
                   (Pretty.str cname ::
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    82
                    (if null ps' then [] else
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
    83
                     List.concat ([Pretty.str " of", Pretty.brk 1] ::
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    84
                       separate [Pretty.str " *", Pretty.brk 1]
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
    85
                         (map single ps'))))]) ps))) :: rest)
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    86
          end;
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    87
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    88
    fun mk_term_of_def gr prfx [] = []
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    89
      | mk_term_of_def gr prfx ((_, (tname, dts, cs)) :: xs) =
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    90
          let
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    91
            val tvs = map DatatypeAux.dest_DtTFree dts;
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    92
            val sorts = map (rpair []) tvs;
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    93
            val cs' = map (apsnd (map (DatatypeAux.typ_of_dtyp descr sorts))) cs;
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    94
            val dts' = map (DatatypeAux.typ_of_dtyp descr sorts) dts;
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    95
            val T = Type (tname, dts');
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
    96
            val rest = mk_term_of_def gr "and " xs;
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    97
            val (_, eqs) = foldl_map (fn (prfx, (cname, Ts)) =>
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    98
              let val args = map (fn i =>
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
    99
                Pretty.str ("x" ^ string_of_int i)) (1 upto length Ts)
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   100
              in ("  | ", Pretty.blk (4,
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   101
                [Pretty.str prfx, mk_term_of gr module' false T, Pretty.brk 1,
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   102
                 if null Ts then Pretty.str (snd (get_const_id cname gr))
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   103
                 else parens (Pretty.block
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   104
                   [Pretty.str (snd (get_const_id cname gr)),
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   105
                    Pretty.brk 1, mk_tuple args]),
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   106
                 Pretty.str " =", Pretty.brk 1] @
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   107
                 List.concat (separate [Pretty.str " $", Pretty.brk 1]
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   108
                   ([Pretty.str ("Const (\"" ^ cname ^ "\","), Pretty.brk 1,
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   109
                     mk_type false (Ts ---> T), Pretty.str ")"] ::
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   110
                    map (fn (x, U) => [Pretty.block [mk_term_of gr module' false U,
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   111
                      Pretty.brk 1, x]]) (args ~~ Ts)))))
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   112
              end) (prfx, cs')
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   113
          in eqs @ rest end;
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   114
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   115
    fun mk_gen_of_def gr prfx [] = []
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   116
      | mk_gen_of_def gr prfx ((i, (tname, dts, cs)) :: xs) =
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   117
          let
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   118
            val tvs = map DatatypeAux.dest_DtTFree dts;
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   119
            val sorts = map (rpair []) tvs;
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   120
            val (cs1, cs2) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   121
              List.partition (exists DatatypeAux.is_rec_type o snd) cs;
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   122
            val SOME (cname, _) = find_nonempty descr [i] i;
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   123
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   124
            fun mk_delay p = Pretty.block
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   125
              [Pretty.str "fn () =>", Pretty.brk 1, p];
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   126
15397
5260ac75e07c Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents: 14981
diff changeset
   127
            fun mk_constr s b (cname, dts) =
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   128
              let
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   129
                val gs = map (fn dt => mk_app false (mk_gen gr module' false rtnames s
15397
5260ac75e07c Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents: 14981
diff changeset
   130
                    (DatatypeAux.typ_of_dtyp descr sorts dt))
5260ac75e07c Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents: 14981
diff changeset
   131
                  [Pretty.str (if b andalso DatatypeAux.is_rec_type dt then "0"
5260ac75e07c Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents: 14981
diff changeset
   132
                     else "j")]) dts;
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   133
                val (_, id) = get_const_id cname gr
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   134
              in case gs of
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   135
                  _ :: _ :: _ => Pretty.block
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   136
                    [Pretty.str id, Pretty.brk 1, mk_tuple gs]
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   137
                | _ => mk_app false (Pretty.str id) (map parens gs)
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   138
              end;
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   139
15397
5260ac75e07c Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents: 14981
diff changeset
   140
            fun mk_choice [c] = mk_constr "(i-1)" false c
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   141
              | mk_choice cs = Pretty.block [Pretty.str "one_of",
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   142
                  Pretty.brk 1, Pretty.blk (1, Pretty.str "[" ::
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   143
                  List.concat (separate [Pretty.str ",", Pretty.fbrk]
15397
5260ac75e07c Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents: 14981
diff changeset
   144
                    (map (single o mk_delay o mk_constr "(i-1)" false) cs)) @
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   145
                  [Pretty.str "]"]), Pretty.brk 1, Pretty.str "()"];
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   146
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   147
            val gs = map (Pretty.str o suffix "G" o strip_tname) tvs;
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   148
            val gen_name = "gen_" ^ snd (get_type_id tname gr)
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   149
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   150
          in
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   151
            Pretty.blk (4, separate (Pretty.brk 1) 
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   152
                (Pretty.str (prfx ^ gen_name ^
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   153
                   (if null cs1 then "" else "'")) :: gs @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   154
                 (if null cs1 then [] else [Pretty.str "i"]) @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   155
                 [Pretty.str "j"]) @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   156
              [Pretty.str " =", Pretty.brk 1] @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   157
              (if not (null cs1) andalso not (null cs2)
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   158
               then [Pretty.str "frequency", Pretty.brk 1,
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   159
                 Pretty.blk (1, [Pretty.str "[",
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   160
                   mk_tuple [Pretty.str "i", mk_delay (mk_choice cs1)],
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   161
                   Pretty.str ",", Pretty.fbrk,
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   162
                   mk_tuple [Pretty.str "1", mk_delay (mk_choice cs2)],
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   163
                   Pretty.str "]"]), Pretty.brk 1, Pretty.str "()"]
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   164
               else if null cs2 then
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   165
                 [Pretty.block [Pretty.str "(case", Pretty.brk 1,
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   166
                   Pretty.str "i", Pretty.brk 1, Pretty.str "of",
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   167
                   Pretty.brk 1, Pretty.str "0 =>", Pretty.brk 1,
17521
0f1c48de39f5 introduced AList module in favor of assoc etc.
haftmann
parents: 17412
diff changeset
   168
                   mk_constr "0" true (cname, valOf (AList.lookup (op =) cs cname)),
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   169
                   Pretty.brk 1, Pretty.str "| _ =>", Pretty.brk 1,
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   170
                   mk_choice cs1, Pretty.str ")"]]
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   171
               else [mk_choice cs2])) ::
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   172
            (if null cs1 then []
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   173
             else [Pretty.blk (4, separate (Pretty.brk 1) 
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   174
                 (Pretty.str ("and " ^ gen_name) :: gs @ [Pretty.str "i"]) @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   175
               [Pretty.str " =", Pretty.brk 1] @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   176
               separate (Pretty.brk 1) (Pretty.str (gen_name ^ "'") :: gs @
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   177
                 [Pretty.str "i", Pretty.str "i"]))]) @
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   178
            mk_gen_of_def gr "and " xs
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   179
          end
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   180
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   181
  in
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   182
    (add_edge_acyclic (node_id, dep) gr
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   183
        handle Graph.CYCLES _ => gr) handle Graph.UNDEF _ =>
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   184
         let
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   185
           val gr1 = add_edge (node_id, dep)
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   186
             (new_node (node_id, (NONE, "", "")) gr);
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   187
           val (gr2, dtdef) = mk_dtdef gr1 "datatype " descr';
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   188
         in
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   189
           map_node node_id (K (NONE, module',
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   190
             Pretty.string_of (Pretty.blk (0, separate Pretty.fbrk dtdef @
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   191
               [Pretty.str ";"])) ^ "\n\n" ^
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   192
             (if "term_of" mem !mode then
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   193
                Pretty.string_of (Pretty.blk (0, separate Pretty.fbrk
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   194
                  (mk_term_of_def gr2 "fun " descr') @ [Pretty.str ";"])) ^ "\n\n"
14104
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   195
              else "") ^
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   196
             (if "test" mem !mode then
29f726e36e5c Added generator for test case generators.
berghofe
parents: 13754
diff changeset
   197
                Pretty.string_of (Pretty.blk (0, separate Pretty.fbrk
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   198
                  (mk_gen_of_def gr2 "fun " descr') @ [Pretty.str ";"])) ^ "\n\n"
13754
021cf00435a9 Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents: 12890
diff changeset
   199
              else ""))) gr2
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   200
         end
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   201
  end;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   202
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   203
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   204
(**** case expressions ****)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   205
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   206
fun pretty_case thy defs gr dep module brack constrs (c as Const (_, T)) ts =
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   207
  let val i = length constrs
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   208
  in if length ts <= i then
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   209
       invoke_codegen thy defs dep module brack (gr, eta_expand c ts (i+1))
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   210
    else
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   211
      let
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   212
        val ts1 = Library.take (i, ts);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   213
        val t :: ts2 = Library.drop (i, ts);
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   214
        val names = foldr add_term_names
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   215
          (map (fst o fst o dest_Var) (foldr add_term_vars [] ts1)) ts1;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   216
        val (Ts, dT) = split_last (Library.take (i+1, fst (strip_type T)));
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   217
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   218
        fun pcase gr [] [] [] = ([], gr)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   219
          | pcase gr ((cname, cargs)::cs) (t::ts) (U::Us) =
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   220
              let
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   221
                val j = length cargs;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   222
                val xs = variantlist (replicate j "x", names);
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   223
                val Us' = Library.take (j, fst (strip_type U));
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   224
                val frees = map Free (xs ~~ Us');
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   225
                val (gr0, cp) = invoke_codegen thy defs dep module false
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   226
                  (gr, list_comb (Const (cname, Us' ---> dT), frees));
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   227
                val t' = Envir.beta_norm (list_comb (t, frees));
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   228
                val (gr1, p) = invoke_codegen thy defs dep module false (gr0, t');
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   229
                val (ps, gr2) = pcase gr1 cs ts Us;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   230
              in
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   231
                ([Pretty.block [cp, Pretty.str " =>", Pretty.brk 1, p]] :: ps, gr2)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   232
              end;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   233
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   234
        val (ps1, gr1) = pcase gr constrs ts1 Ts;
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   235
        val ps = List.concat (separate [Pretty.brk 1, Pretty.str "| "] ps1);
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   236
        val (gr2, p) = invoke_codegen thy defs dep module false (gr1, t);
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   237
        val (gr3, ps2) = foldl_map (invoke_codegen thy defs dep module true) (gr2, ts2)
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   238
      in (gr3, (if not (null ts2) andalso brack then parens else I)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   239
        (Pretty.block (separate (Pretty.brk 1)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   240
          (Pretty.block ([Pretty.str "(case ", p, Pretty.str " of",
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   241
             Pretty.brk 1] @ ps @ [Pretty.str ")"]) :: ps2))))
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   242
      end
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   243
  end;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   244
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   245
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   246
(**** constructors ****)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   247
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   248
fun pretty_constr thy defs gr dep module brack args (c as Const (s, T)) ts =
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   249
  let val i = length args
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   250
  in if i > 1 andalso length ts < i then
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   251
      invoke_codegen thy defs dep module brack (gr, eta_expand c ts i)
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   252
     else
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   253
       let
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   254
         val id = mk_qual_id module (get_const_id s gr);
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   255
         val (gr', ps) = foldl_map
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   256
           (invoke_codegen thy defs dep module (i = 1)) (gr, ts);
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   257
       in (case args of
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   258
          _ :: _ :: _ => (gr', (if brack then parens else I)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   259
            (Pretty.block [Pretty.str id, Pretty.brk 1, mk_tuple ps]))
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   260
        | _ => (gr', mk_app brack (Pretty.str id) ps))
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   261
       end
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   262
  end;
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   263
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   264
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   265
(**** code generators for terms and types ****)
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   266
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   267
fun datatype_codegen thy defs gr dep module brack t = (case strip_comb t of
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   268
   (c as Const (s, T), ts) =>
18247
b17724cae935 code generator: case expressions, improved name resolving
haftmann
parents: 18220
diff changeset
   269
       (case Library.find_first (fn (_, {index, descr, case_name, ...}) =>
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   270
         s = case_name orelse
17521
0f1c48de39f5 introduced AList module in favor of assoc etc.
haftmann
parents: 17412
diff changeset
   271
           AList.defined (op =) ((#3 o the o AList.lookup (op =) descr) index) s)
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   272
             (Symtab.dest (DatatypePackage.get_datatypes thy)) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   273
          NONE => NONE
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   274
        | SOME (tname, {index, descr, ...}) =>
18247
b17724cae935 code generator: case expressions, improved name resolving
haftmann
parents: 18220
diff changeset
   275
           if is_some (get_assoc_code thy s T) then NONE else
17521
0f1c48de39f5 introduced AList module in favor of assoc etc.
haftmann
parents: 17412
diff changeset
   276
           let val SOME (_, _, constrs) = AList.lookup (op =) descr index
0f1c48de39f5 introduced AList module in favor of assoc etc.
haftmann
parents: 17412
diff changeset
   277
           in (case (AList.lookup (op =) constrs s, strip_type T) of
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   278
               (NONE, _) => SOME (pretty_case thy defs gr dep module brack
18247
b17724cae935 code generator: case expressions, improved name resolving
haftmann
parents: 18220
diff changeset
   279
                 ((#3 o the o AList.lookup (op =) descr) index) c ts)
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   280
             | (SOME args, (_, Type _)) => SOME (pretty_constr thy defs
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   281
                 (fst (invoke_tycodegen thy defs dep module false
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   282
                    (gr, snd (strip_type T))))
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   283
                 dep module brack args c ts)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   284
             | _ => NONE)
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   285
           end)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   286
 |  _ => NONE);
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   287
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   288
fun datatype_tycodegen thy defs gr dep module brack (Type (s, Ts)) =
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17261
diff changeset
   289
      (case Symtab.lookup (DatatypePackage.get_datatypes thy) s of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   290
         NONE => NONE
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15397
diff changeset
   291
       | SOME {descr, ...} =>
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   292
           if isSome (get_assoc_type thy s) then NONE else
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   293
           let
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   294
             val (gr', ps) = foldl_map
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   295
               (invoke_tycodegen thy defs dep module false) (gr, Ts);
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   296
             val gr'' = add_dt_defs thy defs dep module gr' descr
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   297
           in SOME (gr'',
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   298
             Pretty.block ((if null Ts then [] else
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   299
               [mk_tuple ps, Pretty.str " "]) @
17144
6642e0f96f44 Implemented incremental code generation.
berghofe
parents: 16645
diff changeset
   300
               [Pretty.str (mk_qual_id module (get_type_id s gr''))]))
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   301
           end)
16645
a152d6b21c31 Adapted to modular code generation.
berghofe
parents: 15574
diff changeset
   302
  | datatype_tycodegen _ _ _ _ _ _ _ = NONE;
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   303
18247
b17724cae935 code generator: case expressions, improved name resolving
haftmann
parents: 18220
diff changeset
   304
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   305
(** code 2nd generation **)
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   306
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   307
fun datatype_tac thy dtco =
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   308
  let
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   309
    val ctxt = Context.init_proof thy;
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   310
    val inject = (#inject o DatatypePackage.the_datatype thy) dtco;
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   311
    val simpset = Simplifier.context ctxt
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   312
      (MetaSimplifier.empty_ss addsimprocs [distinct_simproc]);
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   313
  in
19458
a70f1b0f09cd more precise tactics
haftmann
parents: 19346
diff changeset
   314
    (TRY o ALLGOALS o match_tac) [HOL.eq_reflection]
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   315
    THEN (
19458
a70f1b0f09cd more precise tactics
haftmann
parents: 19346
diff changeset
   316
      (ALLGOALS o match_tac) (eqTrueI :: inject)
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   317
      ORELSE (ALLGOALS o simp_tac) simpset
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   318
    )
19458
a70f1b0f09cd more precise tactics
haftmann
parents: 19346
diff changeset
   319
    THEN (ALLGOALS o match_tac) [HOL.refl, Drule.reflexive_thm]
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   320
  end;
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   321
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   322
fun get_datatype_spec_thms thy dtco =
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   323
  case DatatypePackage.get_datatype_spec thy dtco
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   324
   of SOME vs_cos =>
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   325
        SOME (vs_cos, datatype_tac thy dtco)
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   326
    | NONE => NONE;
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   327
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   328
fun get_all_datatype_cons thy =
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   329
  Symtab.fold (fn (dtco, _) => fold
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   330
    (fn (co, _) => cons (co, dtco))
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   331
      ((snd o the oo DatatypePackage.get_datatype_spec) thy dtco))
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   332
        (DatatypePackage.get_datatypes thy) [];
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   333
19599
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   334
fun add_datatype_case_const dtco thy =
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   335
  let
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   336
    val {case_name, index, descr, ...} = DatatypePackage.the_datatype thy dtco
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   337
  in
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   338
    CodegenPackage.add_case_const case_name
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   339
      ((map (apsnd length) o #3 o the o AList.lookup (op =) descr) index) thy
a5c7eb37d14f added DatatypeHooks
haftmann
parents: 19458
diff changeset
   340
  end;
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   341
19818
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   342
fun add_datatype_case_defs dtco thy =
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   343
  let
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   344
    val {case_rewrites, ...} = DatatypePackage.the_datatype thy dtco
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   345
  in
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   346
    fold CodegenTheorems.add_fun case_rewrites thy
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   347
  end;
5c5c1208a3fa adding case theorems for code generator
haftmann
parents: 19599
diff changeset
   348
19008
14c1b2f5dda4 improved code generator devarification
haftmann
parents: 18963
diff changeset
   349
val setup = 
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
   350
  add_codegen "datatype" datatype_codegen #>
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18702
diff changeset
   351
  add_tycodegen "datatype" datatype_tycodegen #>
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   352
  CodegenTheorems.add_datatype_extr
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   353
    get_datatype_spec_thms #>
18963
3adfc9dfb30a slight improvements in code generation
haftmann
parents: 18866
diff changeset
   354
  CodegenPackage.set_get_datatype
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   355
    DatatypePackage.get_datatype_spec #>
18451
5ff0244e25e8 slight clean ups
haftmann
parents: 18386
diff changeset
   356
  CodegenPackage.set_get_all_datatype_cons
19346
c4c003abd830 cleanup in datatype package
haftmann
parents: 19008
diff changeset
   357
    get_all_datatype_cons #>
19886
6bec6daac280 added hook for case const defs
haftmann
parents: 19818
diff changeset
   358
  DatatypeHooks.add add_datatype_case_const #>
6bec6daac280 added hook for case const defs
haftmann
parents: 19818
diff changeset
   359
  DatatypeHooks.add add_datatype_case_defs
12445
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   360
f17eb90bfd16 Code generator for datatypes.
berghofe
parents:
diff changeset
   361
end;