src/HOL/Tools/typedef_package.ML
author berghofe
Fri Jul 01 14:13:40 2005 +0200 (2005-07-01)
changeset 16645 a152d6b21c31
parent 16486 1a12cdb6ee6b
child 17057 0934ac31985f
permissions -rw-r--r--
Adapted to modular code generation.
wenzelm@4866
     1
(*  Title:      HOL/Tools/typedef_package.ML
wenzelm@4866
     2
    ID:         $Id$
wenzelm@16458
     3
    Author:     Markus Wenzel and Stefan Berghofer, TU Muenchen
wenzelm@4866
     4
wenzelm@6357
     5
Gordon/HOL-style type definitions.
wenzelm@4866
     6
*)
wenzelm@4866
     7
wenzelm@4866
     8
signature TYPEDEF_PACKAGE =
wenzelm@4866
     9
sig
wenzelm@5697
    10
  val quiet_mode: bool ref
wenzelm@5104
    11
  val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
wenzelm@11822
    12
  val add_typedef_x: string -> bstring * string list * mixfix ->
wenzelm@4866
    13
    string -> string list -> thm list -> tactic option -> theory -> theory
wenzelm@11827
    14
  val add_typedef: bool -> string option -> bstring * string list * mixfix ->
wenzelm@11822
    15
    string -> (bstring * bstring) option -> tactic -> theory -> theory *
wenzelm@11822
    16
    {type_definition: thm, set_def: thm option, Rep: thm, Rep_inverse: thm,
wenzelm@11822
    17
      Abs_inverse: thm, Rep_inject: thm, Abs_inject: thm, Rep_cases: thm, Abs_cases: thm,
wenzelm@11822
    18
      Rep_induct: thm, Abs_induct: thm}
wenzelm@11827
    19
  val add_typedef_i: bool -> string option -> bstring * string list * mixfix ->
wenzelm@11822
    20
    term -> (bstring * bstring) option -> tactic -> theory -> theory *
wenzelm@11822
    21
    {type_definition: thm, set_def: thm option, Rep: thm, Rep_inverse: thm,
wenzelm@11822
    22
      Abs_inverse: thm, Rep_inject: thm, Abs_inject: thm, Rep_cases: thm, Abs_cases: thm,
wenzelm@11822
    23
      Rep_induct: thm, Abs_induct: thm}
wenzelm@13443
    24
  val typedef_proof: (bool * string) * (bstring * string list * mixfix) * string
wenzelm@13443
    25
    * (string * string) option -> bool -> theory -> ProofHistory.T
wenzelm@13443
    26
  val typedef_proof_i: (bool * string) * (bstring * string list * mixfix) * term
wenzelm@13443
    27
    * (string * string) option -> bool -> theory -> ProofHistory.T
berghofe@15259
    28
  val setup: (theory -> theory) list
wenzelm@4866
    29
end;
wenzelm@4866
    30
wenzelm@4866
    31
structure TypedefPackage: TYPEDEF_PACKAGE =
wenzelm@4866
    32
struct
wenzelm@4866
    33
wenzelm@4866
    34
wenzelm@10280
    35
(** theory context references **)
wenzelm@10280
    36
wenzelm@11608
    37
val type_definitionN = "Typedef.type_definition";
wenzelm@10280
    38
wenzelm@13413
    39
val Rep = thm "type_definition.Rep";
wenzelm@13413
    40
val Rep_inverse = thm "type_definition.Rep_inverse";
wenzelm@13413
    41
val Abs_inverse = thm "type_definition.Abs_inverse";
wenzelm@13413
    42
val Rep_inject = thm "type_definition.Rep_inject";
wenzelm@13413
    43
val Abs_inject = thm "type_definition.Abs_inject";
wenzelm@13413
    44
val Rep_cases = thm "type_definition.Rep_cases";
wenzelm@13413
    45
val Abs_cases = thm "type_definition.Abs_cases";
wenzelm@13413
    46
val Rep_induct = thm "type_definition.Rep_induct";
wenzelm@13413
    47
val Abs_induct = thm "type_definition.Abs_induct";
wenzelm@10280
    48
wenzelm@10280
    49
wenzelm@10280
    50
berghofe@15259
    51
(** theory data **)
berghofe@15259
    52
wenzelm@16458
    53
structure TypedefData = TheoryDataFun
wenzelm@16458
    54
(struct
berghofe@15259
    55
  val name = "HOL/typedef";
berghofe@15259
    56
  type T = (typ * typ * string * string) Symtab.table;
berghofe@15259
    57
  val empty = Symtab.empty;
berghofe@15259
    58
  val copy = I;
wenzelm@16458
    59
  val extend = I;
wenzelm@16458
    60
  fun merge _ (tabs: T * T) = Symtab.merge (op =) tabs;
wenzelm@16458
    61
  fun print _ _ = ();
wenzelm@16458
    62
end);
berghofe@15259
    63
berghofe@15259
    64
fun put_typedef newT oldT Abs_name Rep_name thy =
berghofe@15259
    65
  TypedefData.put (Symtab.update_new
berghofe@15259
    66
    ((fst (dest_Type newT), (newT, oldT, Abs_name, Rep_name)),
berghofe@15259
    67
     TypedefData.get thy)) thy;
berghofe@15259
    68
berghofe@15259
    69
berghofe@15259
    70
wenzelm@5104
    71
(** type declarations **)
wenzelm@5104
    72
wenzelm@5104
    73
fun add_typedecls decls thy =
wenzelm@5104
    74
  let
wenzelm@5104
    75
    fun arity_of (raw_name, args, mx) =
wenzelm@16458
    76
      (Sign.full_name thy (Syntax.type_name raw_name mx),
wenzelm@16458
    77
        replicate (length args) HOLogic.typeS, HOLogic.typeS);
wenzelm@5104
    78
  in
wenzelm@8141
    79
    if can (Theory.assert_super HOL.thy) thy then
wenzelm@16458
    80
      thy |> Theory.add_typedecls decls
wenzelm@8141
    81
      |> Theory.add_arities_i (map arity_of decls)
wenzelm@16458
    82
    else thy |> Theory.add_typedecls decls
wenzelm@5104
    83
  end;
wenzelm@5104
    84
wenzelm@5104
    85
wenzelm@5104
    86
wenzelm@5104
    87
(** type definitions **)
wenzelm@5104
    88
wenzelm@5697
    89
(* messages *)
wenzelm@5697
    90
wenzelm@5697
    91
val quiet_mode = ref false;
wenzelm@5697
    92
fun message s = if ! quiet_mode then () else writeln s;
wenzelm@5697
    93
wenzelm@5697
    94
wenzelm@11426
    95
(* prove_nonempty -- tactical version *)        (*exception ERROR*)
wenzelm@4866
    96
wenzelm@11827
    97
fun prove_nonempty thy cset goal (witn1_tac, witn_names, witn_thms, witn2_tac) =
wenzelm@6383
    98
  let
wenzelm@6383
    99
    val is_def = Logic.is_equals o #prop o Thm.rep_thm;
wenzelm@16486
   100
    val thms = PureThy.get_thmss thy (map Name witn_names) @ witn_thms;
wenzelm@4866
   101
    val tac =
wenzelm@11827
   102
      witn1_tac THEN
skalberg@15570
   103
      TRY (rewrite_goals_tac (List.filter is_def thms)) THEN
wenzelm@4866
   104
      TRY (REPEAT_FIRST (resolve_tac (filter_out is_def thms))) THEN
skalberg@15570
   105
      getOpt (witn2_tac, TRY (ALLGOALS (CLASET' blast_tac)));
wenzelm@4866
   106
  in
wenzelm@6383
   107
    message ("Proving non-emptiness of set " ^ quote (string_of_cterm cset) ^ " ...");
wenzelm@16458
   108
    Tactic.prove thy [] [] goal (K tac)
wenzelm@16458
   109
  end
wenzelm@16458
   110
  handle ERROR => error ("Failed to prove non-emptiness of " ^ quote (string_of_cterm cset));
wenzelm@4866
   111
wenzelm@4866
   112
wenzelm@6383
   113
(* prepare_typedef *)
wenzelm@6383
   114
wenzelm@16458
   115
fun read_term thy used s =
wenzelm@16458
   116
  #1 (Thm.read_def_cterm (thy, K NONE, K NONE) used true (s, HOLogic.typeT));
wenzelm@4866
   117
wenzelm@16458
   118
fun cert_term thy _ t = Thm.cterm_of thy t handle TERM (msg, _) => error msg;
wenzelm@6383
   119
wenzelm@6383
   120
fun err_in_typedef name =
wenzelm@6383
   121
  error ("The error(s) above occurred in typedef " ^ quote name);
wenzelm@6383
   122
wenzelm@11822
   123
fun prepare_typedef prep_term def name (t, vs, mx) raw_set opt_morphs thy =
wenzelm@4866
   124
  let
wenzelm@11608
   125
    val _ = Theory.requires thy "Typedef" "typedefs";
wenzelm@16458
   126
    val full = Sign.full_name thy;
wenzelm@4866
   127
wenzelm@4866
   128
    (*rhs*)
wenzelm@10280
   129
    val full_name = full name;
wenzelm@16458
   130
    val cset = prep_term thy vs raw_set;
wenzelm@6383
   131
    val {T = setT, t = set, ...} = Thm.rep_cterm cset;
wenzelm@4866
   132
    val rhs_tfrees = term_tfrees set;
wenzelm@4866
   133
    val oldT = HOLogic.dest_setT setT handle TYPE _ =>
wenzelm@16458
   134
      error ("Not a set type: " ^ quote (Sign.string_of_typ thy setT));
wenzelm@11426
   135
    fun mk_nonempty A =
wenzelm@11426
   136
      HOLogic.mk_Trueprop (HOLogic.mk_exists ("x", oldT, HOLogic.mk_mem (Free ("x", oldT), A)));
wenzelm@11426
   137
    val goal = mk_nonempty set;
wenzelm@11744
   138
    val vname = take_suffix Symbol.is_digit (Symbol.explode name)
wenzelm@14819
   139
      |> apfst implode |> apsnd (#1 o Library.read_int);
wenzelm@11744
   140
    val goal_pat = mk_nonempty (Var (vname, setT));
wenzelm@4866
   141
wenzelm@4866
   142
    (*lhs*)
skalberg@15570
   143
    val lhs_tfrees = map (fn v => (v, getOpt (assoc (rhs_tfrees, v), HOLogic.typeS))) vs;
wenzelm@4866
   144
    val tname = Syntax.type_name t mx;
wenzelm@10280
   145
    val full_tname = full tname;
wenzelm@10280
   146
    val newT = Type (full_tname, map TFree lhs_tfrees);
wenzelm@4866
   147
skalberg@15570
   148
    val (Rep_name, Abs_name) = getOpt (opt_morphs, ("Rep_" ^ name, "Abs_" ^ name));
wenzelm@10280
   149
    val setC = Const (full_name, setT);
wenzelm@10280
   150
    val RepC = Const (full Rep_name, newT --> oldT);
wenzelm@10280
   151
    val AbsC = Const (full Abs_name, oldT --> newT);
wenzelm@4866
   152
    val x_new = Free ("x", newT);
wenzelm@4866
   153
    val y_old = Free ("y", oldT);
wenzelm@10280
   154
wenzelm@11822
   155
    val set' = if def then setC else set;
wenzelm@4866
   156
wenzelm@10280
   157
    val typedef_name = "type_definition_" ^ name;
wenzelm@10280
   158
    val typedefC =
wenzelm@10280
   159
      Const (type_definitionN, (newT --> oldT) --> (oldT --> newT) --> setT --> HOLogic.boolT);
wenzelm@11426
   160
    val typedef_prop =
wenzelm@11426
   161
      Logic.mk_implies (goal, HOLogic.mk_Trueprop (typedefC $ RepC $ AbsC $ set'));
wenzelm@4866
   162
wenzelm@11822
   163
    fun typedef_result (theory, nonempty) =
wenzelm@6383
   164
      theory
berghofe@15259
   165
      |> put_typedef newT oldT (full Abs_name) (full Rep_name)
wenzelm@6383
   166
      |> add_typedecls [(t, vs, mx)]
wenzelm@6383
   167
      |> Theory.add_consts_i
wenzelm@11822
   168
       ((if def then [(name, setT, NoSyn)] else []) @
wenzelm@6383
   169
        [(Rep_name, newT --> oldT, NoSyn),
wenzelm@6383
   170
         (Abs_name, oldT --> newT, NoSyn)])
skalberg@15531
   171
      |> (if def then (apsnd (SOME o hd) oo (PureThy.add_defs_i false o map Thm.no_attributes))
wenzelm@11822
   172
           [Logic.mk_defpair (setC, set)]
skalberg@15531
   173
          else rpair NONE)
wenzelm@14570
   174
      |>>> PureThy.add_axioms_i [((typedef_name, typedef_prop),
wenzelm@11727
   175
          [apsnd (fn cond_axm => Drule.standard (nonempty RS cond_axm))])]
wenzelm@14570
   176
      |>> Theory.add_finals_i false [RepC, AbsC]
wenzelm@14570
   177
      |> (fn (theory', (set_def, [type_definition])) =>
wenzelm@11822
   178
        let
wenzelm@11822
   179
          fun make th = Drule.standard (th OF [type_definition]);
wenzelm@11822
   180
          val (theory'', [Rep, Rep_inverse, Abs_inverse, Rep_inject, Abs_inject,
wenzelm@11822
   181
              Rep_cases, Abs_cases, Rep_induct, Abs_induct]) =
wenzelm@12338
   182
            theory'
wenzelm@12338
   183
            |> Theory.add_path name
wenzelm@12338
   184
            |> PureThy.add_thms
wenzelm@11822
   185
              ([((Rep_name, make Rep), []),
wenzelm@11822
   186
                ((Rep_name ^ "_inverse", make Rep_inverse), []),
wenzelm@11822
   187
                ((Abs_name ^ "_inverse", make Abs_inverse), []),
wenzelm@11822
   188
                ((Rep_name ^ "_inject", make Rep_inject), []),
wenzelm@11822
   189
                ((Abs_name ^ "_inject", make Abs_inject), []),
wenzelm@11822
   190
                ((Rep_name ^ "_cases", make Rep_cases),
wenzelm@11822
   191
                  [RuleCases.case_names [Rep_name], InductAttrib.cases_set_global full_name]),
wenzelm@11822
   192
                ((Abs_name ^ "_cases", make Abs_cases),
wenzelm@11822
   193
                  [RuleCases.case_names [Abs_name], InductAttrib.cases_type_global full_tname]),
wenzelm@11822
   194
                ((Rep_name ^ "_induct", make Rep_induct),
wenzelm@11822
   195
                  [RuleCases.case_names [Rep_name], InductAttrib.induct_set_global full_name]),
wenzelm@11822
   196
                ((Abs_name ^ "_induct", make Abs_induct),
wenzelm@12338
   197
                  [RuleCases.case_names [Abs_name], InductAttrib.induct_type_global full_tname])])
wenzelm@12338
   198
            |>> Theory.parent_path;
wenzelm@11822
   199
          val result = {type_definition = type_definition, set_def = set_def,
wenzelm@11822
   200
            Rep = Rep, Rep_inverse = Rep_inverse, Abs_inverse = Abs_inverse,
wenzelm@11822
   201
            Rep_inject = Rep_inject, Abs_inject = Abs_inject, Rep_cases = Rep_cases,
wenzelm@11822
   202
            Abs_cases = Abs_cases, Rep_induct = Rep_induct, Abs_induct = Abs_induct};
wenzelm@11822
   203
        in ((theory'', type_definition), result) end);
wenzelm@6383
   204
wenzelm@4866
   205
wenzelm@4866
   206
    (* errors *)
wenzelm@4866
   207
wenzelm@4866
   208
    fun show_names pairs = commas_quote (map fst pairs);
wenzelm@4866
   209
wenzelm@4866
   210
    val illegal_vars =
wenzelm@4866
   211
      if null (term_vars set) andalso null (term_tvars set) then []
wenzelm@4866
   212
      else ["Illegal schematic variable(s) on rhs"];
wenzelm@4866
   213
wenzelm@4866
   214
    val dup_lhs_tfrees =
wenzelm@4866
   215
      (case duplicates lhs_tfrees of [] => []
wenzelm@4866
   216
      | dups => ["Duplicate type variables on lhs: " ^ show_names dups]);
wenzelm@4866
   217
wenzelm@4866
   218
    val extra_rhs_tfrees =
wenzelm@4866
   219
      (case gen_rems (op =) (rhs_tfrees, lhs_tfrees) of [] => []
wenzelm@4866
   220
      | extras => ["Extra type variables on rhs: " ^ show_names extras]);
wenzelm@4866
   221
wenzelm@4866
   222
    val illegal_frees =
wenzelm@4866
   223
      (case term_frees set of [] => []
wenzelm@4866
   224
      | xs => ["Illegal variables on rhs: " ^ show_names (map dest_Free xs)]);
wenzelm@4866
   225
wenzelm@4866
   226
    val errs = illegal_vars @ dup_lhs_tfrees @ extra_rhs_tfrees @ illegal_frees;
wenzelm@11426
   227
    val _ = if null errs then () else error (cat_lines errs);
wenzelm@11426
   228
wenzelm@11426
   229
    (*test theory errors now!*)
wenzelm@11426
   230
    val test_thy = Theory.copy thy;
wenzelm@11727
   231
    val _ = (test_thy,
wenzelm@11822
   232
      setmp quick_and_dirty true (SkipProof.make_thm test_thy) goal) |> typedef_result;
wenzelm@11426
   233
wenzelm@11822
   234
  in (cset, goal, goal_pat, typedef_result) end
wenzelm@11426
   235
  handle ERROR => err_in_typedef name;
wenzelm@4866
   236
wenzelm@4866
   237
wenzelm@6383
   238
(* add_typedef interfaces *)
wenzelm@4866
   239
wenzelm@11827
   240
fun gen_typedef prep_term def name typ set opt_morphs tac1 names thms tac2 thy =
wenzelm@6383
   241
  let
wenzelm@11822
   242
    val (cset, goal, _, typedef_result) =
wenzelm@11822
   243
      prepare_typedef prep_term def name typ set opt_morphs thy;
wenzelm@11827
   244
    val non_empty = prove_nonempty thy cset goal (tac1, names, thms, tac2);
wenzelm@11822
   245
    val ((thy', _), result) = (thy, non_empty) |> typedef_result;
wenzelm@11822
   246
  in (thy', result) end;
wenzelm@4866
   247
wenzelm@11827
   248
fun sane_typedef prep_term def opt_name typ set opt_morphs tac =
wenzelm@11827
   249
  gen_typedef prep_term def
skalberg@15570
   250
    (getOpt (opt_name, #1 typ)) typ set opt_morphs all_tac [] [] (SOME tac);
wenzelm@11822
   251
wenzelm@11822
   252
fun add_typedef_x name typ set names thms tac =
skalberg@15531
   253
  #1 o gen_typedef read_term true name typ set NONE (Tactic.rtac exI 1) names thms tac;
wenzelm@11822
   254
wenzelm@11822
   255
val add_typedef = sane_typedef read_term;
wenzelm@11822
   256
val add_typedef_i = sane_typedef cert_term;
wenzelm@4866
   257
wenzelm@4866
   258
wenzelm@6383
   259
(* typedef_proof interface *)
wenzelm@6383
   260
wenzelm@13443
   261
fun gen_typedef_proof prep_term ((def, name), typ, set, opt_morphs) int thy =
wenzelm@11822
   262
  let
wenzelm@11822
   263
    val (_, goal, goal_pat, att_result) =
wenzelm@13443
   264
      prepare_typedef prep_term def name typ set opt_morphs thy;
wenzelm@11822
   265
    val att = #1 o att_result;
wenzelm@12876
   266
  in thy |> IsarThy.theorem_i Drule.internalK (("", [att]), (goal, ([goal_pat], []))) int end;
wenzelm@6383
   267
wenzelm@6383
   268
val typedef_proof = gen_typedef_proof read_term;
wenzelm@6383
   269
val typedef_proof_i = gen_typedef_proof cert_term;
wenzelm@6357
   270
wenzelm@6357
   271
wenzelm@6383
   272
berghofe@15259
   273
(** trivial code generator **)
berghofe@15259
   274
berghofe@16645
   275
fun typedef_codegen thy defs gr dep thyname brack t =
berghofe@15259
   276
  let
berghofe@16645
   277
    fun get_name (Type (tname, _)) = tname
berghofe@16645
   278
      | get_name _ = "";
berghofe@15259
   279
    fun mk_fun s T ts =
berghofe@15259
   280
      let
berghofe@16645
   281
        val (gr', _) = Codegen.invoke_tycodegen thy defs dep thyname false (gr, T);
berghofe@15259
   282
        val (gr'', ps) =
berghofe@16645
   283
          foldl_map (Codegen.invoke_codegen thy defs dep thyname true) (gr', ts);
berghofe@16645
   284
        val id = Codegen.mk_const_id thy
berghofe@16645
   285
          thyname (Codegen.thyname_of_type (get_name T) thy) s
skalberg@15531
   286
      in SOME (gr'', Codegen.mk_app brack (Pretty.str id) ps) end;
skalberg@15570
   287
    fun lookup f T = getOpt (Option.map f (Symtab.lookup
skalberg@15570
   288
      (TypedefData.get thy, get_name T)), "")
berghofe@15259
   289
  in
berghofe@15259
   290
    (case strip_comb t of
berghofe@15259
   291
       (Const (s, Type ("fun", [T, U])), ts) =>
berghofe@15259
   292
         if lookup #4 T = s andalso
berghofe@15259
   293
           is_none (Codegen.get_assoc_type thy (get_name T))
berghofe@15259
   294
         then mk_fun s T ts
berghofe@15259
   295
         else if lookup #3 U = s andalso
berghofe@15259
   296
           is_none (Codegen.get_assoc_type thy (get_name U))
berghofe@15259
   297
         then mk_fun s U ts
skalberg@15531
   298
         else NONE
skalberg@15531
   299
     | _ => NONE)
berghofe@15259
   300
  end;
berghofe@15259
   301
berghofe@15259
   302
fun mk_tyexpr [] s = Pretty.str s
berghofe@15259
   303
  | mk_tyexpr [p] s = Pretty.block [p, Pretty.str (" " ^ s)]
berghofe@15259
   304
  | mk_tyexpr ps s = Pretty.list "(" (") " ^ s) ps;
berghofe@15259
   305
berghofe@16645
   306
fun typedef_tycodegen thy defs gr dep thyname brack (Type (s, Ts)) =
berghofe@15259
   307
      (case Symtab.lookup (TypedefData.get thy, s) of
skalberg@15531
   308
         NONE => NONE
skalberg@15531
   309
       | SOME (newT as Type (tname, Us), oldT, Abs_name, Rep_name) =>
skalberg@15570
   310
           if isSome (Codegen.get_assoc_type thy tname) then NONE else
berghofe@15259
   311
           let
berghofe@16645
   312
             val thyname' = Codegen.thyname_of_type tname thy;
berghofe@16645
   313
             val Abs_id = Codegen.mk_const_id thy thyname' thyname' Abs_name;
berghofe@16645
   314
             val Rep_id = Codegen.mk_const_id thy thyname' thyname' Rep_name;
berghofe@16645
   315
             val ty_id = Codegen.mk_type_id thy thyname' thyname' s;
berghofe@16645
   316
             val ty_call_id = Codegen.mk_type_id thy thyname thyname' s;
berghofe@15259
   317
             val (gr', qs) = foldl_map
berghofe@16645
   318
               (Codegen.invoke_tycodegen thy defs dep thyname (length Ts = 1)) (gr, Ts);
berghofe@16645
   319
             val gr'' = Graph.add_edge (Abs_name, dep) gr' handle Graph.UNDEF _ =>
berghofe@15259
   320
               let
berghofe@15259
   321
                 val (gr'', p :: ps) = foldl_map
berghofe@16645
   322
                   (Codegen.invoke_tycodegen thy defs Abs_name thyname' false)
berghofe@16645
   323
                   (Graph.add_edge (Abs_name, dep)
berghofe@16645
   324
                      (Graph.new_node (Abs_name, (NONE, "", "")) gr'), oldT :: Us);
berghofe@15259
   325
                 val s =
berghofe@15259
   326
                   Pretty.string_of (Pretty.block [Pretty.str "datatype ",
berghofe@15259
   327
                     mk_tyexpr ps ty_id,
berghofe@15259
   328
                     Pretty.str " =", Pretty.brk 1, Pretty.str (Abs_id ^ " of"),
berghofe@15259
   329
                     Pretty.brk 1, p, Pretty.str ";"]) ^ "\n\n" ^
berghofe@15259
   330
                   Pretty.string_of (Pretty.block [Pretty.str ("fun " ^ Rep_id),
berghofe@15259
   331
                     Pretty.brk 1, Pretty.str ("(" ^ Abs_id), Pretty.brk 1,
berghofe@15259
   332
                     Pretty.str "x) = x;"]) ^ "\n\n" ^
berghofe@15259
   333
                   (if "term_of" mem !Codegen.mode then
berghofe@15259
   334
                      Pretty.string_of (Pretty.block [Pretty.str "fun ",
berghofe@16645
   335
                        Codegen.mk_term_of thy thyname' false newT, Pretty.brk 1,
berghofe@15259
   336
                        Pretty.str ("(" ^ Abs_id), Pretty.brk 1,
berghofe@15259
   337
                        Pretty.str "x) =", Pretty.brk 1,
berghofe@15259
   338
                        Pretty.block [Pretty.str ("Const (\"" ^ Abs_name ^ "\","),
berghofe@15259
   339
                          Pretty.brk 1, Codegen.mk_type false (oldT --> newT),
berghofe@15259
   340
                          Pretty.str ")"], Pretty.str " $", Pretty.brk 1,
berghofe@16645
   341
                        Codegen.mk_term_of thy thyname' false oldT, Pretty.brk 1,
berghofe@15259
   342
                        Pretty.str "x;"]) ^ "\n\n"
berghofe@15259
   343
                    else "") ^
berghofe@15259
   344
                   (if "test" mem !Codegen.mode then
berghofe@15259
   345
                      Pretty.string_of (Pretty.block [Pretty.str "fun ",
berghofe@16645
   346
                        Codegen.mk_gen thy thyname' false [] "" newT, Pretty.brk 1,
berghofe@15259
   347
                        Pretty.str "i =", Pretty.brk 1,
berghofe@15259
   348
                        Pretty.block [Pretty.str (Abs_id ^ " ("),
berghofe@16645
   349
                          Codegen.mk_gen thy thyname' false [] "" oldT, Pretty.brk 1,
berghofe@15259
   350
                          Pretty.str "i);"]]) ^ "\n\n"
berghofe@15259
   351
                    else "")
berghofe@16645
   352
               in Graph.map_node Abs_name (K (NONE, thyname', s)) gr'' end
berghofe@15259
   353
           in
berghofe@16645
   354
             SOME (gr'', mk_tyexpr qs ty_call_id)
berghofe@15259
   355
           end)
berghofe@16645
   356
  | typedef_tycodegen thy defs gr dep thyname brack _ = NONE;
berghofe@15259
   357
berghofe@15259
   358
val setup =
berghofe@15259
   359
  [TypedefData.init,
berghofe@15259
   360
   Codegen.add_codegen "typedef" typedef_codegen,
berghofe@15259
   361
   Codegen.add_tycodegen "typedef" typedef_tycodegen];
berghofe@15259
   362
berghofe@15259
   363
berghofe@15259
   364
wenzelm@6383
   365
(** outer syntax **)
wenzelm@6383
   366
wenzelm@6723
   367
local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@6383
   368
wenzelm@6357
   369
val typedeclP =
wenzelm@12624
   370
  OuterSyntax.command "typedecl" "type declaration (HOL)" K.thy_decl
wenzelm@12876
   371
    (P.type_args -- P.name -- P.opt_infix >> (fn ((vs, t), mx) =>
wenzelm@6357
   372
      Toplevel.theory (add_typedecls [(t, vs, mx)])));
wenzelm@6357
   373
wenzelm@6723
   374
wenzelm@6383
   375
val typedef_proof_decl =
wenzelm@16126
   376
  Scan.optional (P.$$$ "(" |--
wenzelm@16126
   377
      ((P.$$$ "open" >> K false) -- Scan.option P.name || P.name >> (fn s => (true, SOME s)))
wenzelm@16126
   378
        --| P.$$$ ")") (true, NONE) --
wenzelm@11744
   379
    (P.type_args -- P.name) -- P.opt_infix -- (P.$$$ "=" |-- P.term) --
wenzelm@12876
   380
    Scan.option (P.$$$ "morphisms" |-- P.!!! (P.name -- P.name));
wenzelm@6357
   381
wenzelm@13443
   382
fun mk_typedef_proof ((((((def, opt_name), (vs, t)), mx), A), morphs)) =
skalberg@15570
   383
  typedef_proof ((def, getOpt (opt_name, Syntax.type_name t mx)), (t, vs, mx), A, morphs);
wenzelm@6357
   384
wenzelm@6357
   385
val typedefP =
wenzelm@6723
   386
  OuterSyntax.command "typedef" "HOL type definition (requires non-emptiness proof)" K.thy_goal
wenzelm@6383
   387
    (typedef_proof_decl >> (Toplevel.print oo (Toplevel.theory_to_proof o mk_typedef_proof)));
wenzelm@6357
   388
wenzelm@6723
   389
wenzelm@11744
   390
val _ = OuterSyntax.add_keywords ["morphisms"];
wenzelm@6357
   391
val _ = OuterSyntax.add_parsers [typedeclP, typedefP];
wenzelm@6357
   392
wenzelm@4866
   393
end;
wenzelm@6383
   394
wenzelm@6383
   395
end;