src/HOL/Tools/recdef_package.ML
author wenzelm
Thu Apr 22 12:50:39 1999 +0200 (1999-04-22)
changeset 6478 48f90bc10cf5
parent 6458 13c779aec65a
child 6520 08637598f7ec
permissions -rw-r--r--
add_recdef: actual simpset;
add_recdef_x: named simpset;
wenzelm@6429
     1
(*  Title:      HOL/Tools/recdef_package.ML
wenzelm@6429
     2
    ID:         $Id$
wenzelm@6429
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@6429
     4
wenzelm@6429
     5
Wrapper module for Konrad Slind's TFL package.
wenzelm@6429
     6
*)
wenzelm@6429
     7
wenzelm@6429
     8
signature RECDEF_PACKAGE =
wenzelm@6429
     9
sig
wenzelm@6429
    10
  val quiet_mode: bool ref
wenzelm@6439
    11
  val print_recdefs: theory -> unit
wenzelm@6439
    12
  val get_recdef: theory -> string -> {rules: thm list, induct: thm, tcs: term list}
wenzelm@6429
    13
  val add_recdef: xstring -> string -> ((bstring * string) * Args.src list) list
wenzelm@6478
    14
    -> simpset option -> (xstring * Args.src list) list
wenzelm@6429
    15
    -> theory -> theory * {rules: thm list, induct: thm, tcs: term list}
wenzelm@6429
    16
  val add_recdef_i: xstring -> term -> ((bstring * term) * theory attribute list) list
wenzelm@6429
    17
    -> simpset option -> (thm * theory attribute list) list
wenzelm@6429
    18
    -> theory -> theory * {rules: thm list, induct: thm, tcs: term list}
wenzelm@6439
    19
  val setup: (theory -> theory) list
wenzelm@6429
    20
end;
wenzelm@6429
    21
wenzelm@6429
    22
structure RecdefPackage: RECDEF_PACKAGE =
wenzelm@6429
    23
struct
wenzelm@6429
    24
wenzelm@6458
    25
(* FIXME tmp
wenzelm@6429
    26
val quiet_mode = Tfl.quiet_mode;
wenzelm@6429
    27
val message = Tfl.message;
wenzelm@6458
    28
*)
wenzelm@6458
    29
val quiet_mode = ref false;
wenzelm@6458
    30
val message = writeln;
wenzelm@6429
    31
wenzelm@6429
    32
wenzelm@6439
    33
wenzelm@6439
    34
(** theory data **)
wenzelm@6439
    35
wenzelm@6439
    36
(* data kind 'HOL/recdef' *)
wenzelm@6439
    37
wenzelm@6439
    38
type recdef_info = {rules: thm list, induct: thm, tcs: term list};
wenzelm@6439
    39
wenzelm@6439
    40
structure RecdefArgs =
wenzelm@6439
    41
struct
wenzelm@6439
    42
  val name = "HOL/recdef";
wenzelm@6439
    43
  type T = recdef_info Symtab.table;
wenzelm@6439
    44
wenzelm@6439
    45
  val empty = Symtab.empty;
wenzelm@6439
    46
  val prep_ext = I;
wenzelm@6439
    47
  val merge: T * T -> T = Symtab.merge (K true);
wenzelm@6439
    48
wenzelm@6439
    49
  fun print sg tab =
wenzelm@6439
    50
    Pretty.writeln (Pretty.strs ("recdefs:" ::
wenzelm@6439
    51
      map (Sign.cond_extern sg Sign.constK o fst) (Symtab.dest tab)));
wenzelm@6439
    52
end;
wenzelm@6439
    53
wenzelm@6439
    54
structure RecdefData = TheoryDataFun(RecdefArgs);
wenzelm@6439
    55
val print_recdefs = RecdefData.print;
wenzelm@6429
    56
wenzelm@6439
    57
wenzelm@6439
    58
(* get and put data *)
wenzelm@6439
    59
wenzelm@6439
    60
fun get_recdef thy name =
wenzelm@6439
    61
  (case Symtab.lookup (RecdefData.get thy, name) of
wenzelm@6439
    62
    Some info => info
wenzelm@6439
    63
  | None => error ("Unknown recursive function " ^ quote name));
wenzelm@6439
    64
wenzelm@6439
    65
fun put_recdef name info thy =
wenzelm@6429
    66
  let
wenzelm@6439
    67
    val tab = Symtab.update_new ((name, info), RecdefData.get thy)
wenzelm@6439
    68
      handle Symtab.DUP _ => error ("Duplicate recursive function definition " ^ quote name);
wenzelm@6439
    69
  in RecdefData.put tab thy end;
wenzelm@6439
    70
wenzelm@6439
    71
wenzelm@6439
    72
wenzelm@6439
    73
(** add_recdef(_i) **)
wenzelm@6439
    74
wenzelm@6439
    75
fun gen_add_recdef tfl_def prep_att prep_ss app_thms raw_name R eq_srcs raw_ss raw_congs thy =
wenzelm@6439
    76
  let
wenzelm@6439
    77
    val name = Sign.intern_const (Theory.sign_of thy) raw_name;
wenzelm@6439
    78
    val bname = Sign.base_name name;
wenzelm@6439
    79
wenzelm@6478
    80
    val _ = Theory.requires thy "Recdef" "recursive function definitions";
wenzelm@6429
    81
    val _ = message ("Defining recursive function " ^ quote name ^ " ...");
wenzelm@6429
    82
wenzelm@6429
    83
    val ((eq_names, eqs), raw_eq_atts) = apfst split_list (split_list eq_srcs);
wenzelm@6429
    84
    val eq_atts = map (map (prep_att thy)) raw_eq_atts;
wenzelm@6429
    85
    val ss = (case raw_ss of None => Simplifier.simpset_of thy | Some x => prep_ss x);
wenzelm@6429
    86
    val (thy1, congs) = thy |> app_thms raw_congs;
wenzelm@6429
    87
    val (thy2, pats) = tfl_def thy1 name R eqs;
wenzelm@6429
    88
    val (result as {rules, induct, tcs}) = Tfl.simplify_defn (ss, congs) (thy2, (name, pats));
wenzelm@6429
    89
    val thy3 =
wenzelm@6429
    90
      thy2
wenzelm@6439
    91
      |> Theory.add_path bname
wenzelm@6429
    92
      |> PureThy.add_thmss [(("rules", rules), [])]
wenzelm@6429
    93
      |> PureThy.add_thms ((("induct", induct), []) :: ((eq_names ~~ rules) ~~ eq_atts))
wenzelm@6439
    94
      |> put_recdef name result
wenzelm@6429
    95
      |> Theory.parent_path;
wenzelm@6429
    96
  in (thy3, result) end;
wenzelm@6429
    97
wenzelm@6478
    98
val add_recdef = gen_add_recdef Tfl.define Attrib.global_attribute I IsarThy.apply_theorems;
wenzelm@6478
    99
val add_recdef_x = gen_add_recdef Tfl.define Attrib.global_attribute
wenzelm@6429
   100
  (Simplifier.simpset_of o ThyInfo.get_theory) IsarThy.apply_theorems;
wenzelm@6429
   101
val add_recdef_i = gen_add_recdef Tfl.define_i (K I) I IsarThy.apply_theorems_i;
wenzelm@6429
   102
wenzelm@6429
   103
wenzelm@6439
   104
(** package setup **)
wenzelm@6439
   105
wenzelm@6439
   106
(* setup theory *)
wenzelm@6439
   107
wenzelm@6439
   108
val setup = [RecdefData.init];
wenzelm@6439
   109
wenzelm@6439
   110
wenzelm@6429
   111
(* outer syntax *)
wenzelm@6429
   112
wenzelm@6429
   113
local open OuterParse in
wenzelm@6429
   114
wenzelm@6429
   115
val recdef_decl =
wenzelm@6429
   116
  name -- term -- Scan.repeat1 (opt_thm_name ":" -- term) --
wenzelm@6478
   117
  Scan.optional ($$$ "(" |-- $$$ "congs" |-- !!! (xthms1 --| $$$ ")")) [] --
wenzelm@6478
   118
  Scan.option ($$$ "(" |-- $$$ "simpset" |-- !!! (name --| $$$ ")"))
wenzelm@6478
   119
  >> (fn ((((f, R), eqs), congs), ss) => #1 o add_recdef_x f R (map triple_swap eqs) ss congs);
wenzelm@6429
   120
wenzelm@6429
   121
val recdefP =
wenzelm@6439
   122
  OuterSyntax.command "recdef" "define general recursive functions (TFL)"
wenzelm@6429
   123
    (recdef_decl >> Toplevel.theory);
wenzelm@6429
   124
wenzelm@6429
   125
val _ = OuterSyntax.add_keywords ["congs", "simpset"];
wenzelm@6429
   126
val _ = OuterSyntax.add_parsers [recdefP];
wenzelm@6429
   127
wenzelm@6429
   128
end;
wenzelm@6429
   129
wenzelm@6429
   130
wenzelm@6429
   131
end;