src/HOL/thy_syntax.ML
author wenzelm
Wed May 12 17:26:56 1999 +0200 (1999-05-12)
changeset 6642 732af87c0650
parent 6576 7e0b35bed503
child 8623 5668aaf41c36
permissions -rw-r--r--
strip_quotes replaced by unenclose;
     1 (*  Title:      HOL/thy_syntax.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel and Lawrence C Paulson and Carsten Clasohm
     4 
     5 Additional theory file sections for HOL.
     6 *)
     7 
     8 local
     9 
    10 open ThyParse;
    11 
    12 
    13 (** typedef **)
    14 
    15 fun mk_typedef_decl (((((opt_name, vs), t), mx), rhs), wt) =
    16   let
    17     val name' = if_none opt_name t;
    18     val name = unenclose name';
    19   in
    20     (cat_lines [name', mk_triple (t, mk_list vs, mx), rhs, wt],
    21       [name ^ "_def", "Rep_" ^ name, "Rep_" ^ name ^ "_inverse",
    22         "Abs_" ^ name ^ "_inverse"])
    23   end;
    24 
    25 val typedef_decl =
    26   optional ("(" $$-- name --$$ ")" >> Some) None --
    27   type_args -- name -- opt_infix --$$ "=" -- string -- opt_witness
    28   >> mk_typedef_decl;
    29 
    30 
    31 
    32 (** record **)
    33 
    34 val record_decl =
    35   (type_args -- name >> (mk_pair o apfst mk_list)) --$$ "="
    36     -- optional (typ --$$ "+" >> (parens o cat "Some")) "None"
    37     -- repeat1 ((name --$$ "::" -- typ) >> mk_pair)
    38   >> (fn ((x, y), zs) => cat_lines [x, y, mk_big_list zs]);
    39 
    40 
    41 
    42 (** (co)inductive **)
    43 
    44 fun inductive_decl coind =
    45   let
    46     val no_atts = map (mk_pair o rpair "[]");
    47     fun mk_intr_name (s, _) =   (*the "op" cancels any infix status*)
    48       if Syntax.is_identifier s then "op " ^ s else "_";
    49     fun mk_params (((recs, ipairs), monos), con_defs) =
    50       let val big_rec_name = space_implode "_" (map (scan_to_id o unenclose) recs)
    51           and srec_tms = mk_list recs
    52           and sintrs   = mk_big_list (no_atts (map (mk_pair o apfst quote) ipairs))
    53       in
    54         ";\n\n\
    55         \local\n\
    56         \val (thy, {defs, mono, unfold, intrs, elims, mk_cases, induct, ...}) =\n\
    57         \  InductivePackage.add_inductive true " ^
    58         (if coind then "true " else "false ") ^ srec_tms ^ " [] " ^
    59          sintrs ^ " " ^ mk_list (no_atts monos) ^ " " ^ mk_list (no_atts con_defs) ^ " thy;\n\
    60         \in\n\
    61         \structure " ^ big_rec_name ^ " =\n\
    62         \struct\n\
    63         \  val defs = defs;\n\
    64         \  val mono = mono;\n\
    65         \  val unfold = unfold;\n\
    66         \  val intrs = intrs;\n\
    67         \  val elims = elims;\n\
    68         \  val elim = hd elims;\n\
    69         \  val " ^ (if coind then "co" else "") ^ "induct = induct;\n\
    70         \  val mk_cases = mk_cases;\n\
    71         \  val " ^ mk_list (map mk_intr_name ipairs) ^ " = intrs;\n\
    72         \end;\n\
    73         \val thy = thy;\nend;\n\
    74         \val thy = thy\n"
    75       end
    76     val ipairs = "intrs" $$-- repeat1 (ident -- !! string)
    77     fun optlist s = optional (s $$-- list1 name) []
    78   in
    79     repeat1 name -- ipairs -- optlist "monos" -- optlist "con_defs"
    80       >> mk_params
    81   end;
    82 
    83 
    84 
    85 (** datatype **)
    86 
    87 local
    88   (*** generate string for calling add_datatype ***)
    89   (*** and bindig theorems to ML identifiers    ***)
    90 
    91   fun mk_bind_thms_string names =
    92    (case find_first (not o Syntax.is_identifier) names of
    93       Some id => (warning (id ^ " is not a valid identifier"); "")
    94     | None =>
    95         let
    96           fun mk_dt_struct (s, (id, i)) =
    97             s ^ "structure " ^ id ^ " =\n\
    98             \struct\n\
    99             \  val distinct = nth_elem (" ^ i ^ ", distinct);\n\
   100             \  val inject = nth_elem (" ^ i ^ ", inject);\n\
   101             \  val exhaust = nth_elem (" ^ i ^ ", exhaustion);\n\
   102             \  val cases = nth_elem (" ^ i ^ ", case_thms);\n\
   103             \  val (split, split_asm) = nth_elem (" ^ i ^ ", split_thms);\n" ^
   104               (if length names = 1 then
   105                  "  val induct = induction;\n\
   106                  \  val recs = rec_thms;\n\
   107                  \  val simps = simps;\n\
   108                  \  val size = size;\n"
   109                else "") ^
   110             "end;\n";
   111 
   112           val structs = foldl mk_dt_struct
   113             ("", (names ~~ (map string_of_int (0 upto length names - 1))));
   114 
   115         in
   116           (if length names > 1 then
   117              "structure " ^ (space_implode "_" names) ^ " =\n\
   118              \struct\n\
   119              \  val induct = induction;\n\
   120              \  val recs = rec_thms;\n\
   121              \  val simps = simps;\n\
   122              \  val size = size;\nend;\n"
   123            else "") ^ structs
   124         end);
   125 
   126   fun mk_dt_string dts =
   127     let
   128       val names = map (fn ((((alt_name, _), name), _), _) =>
   129         unenclose (if_none alt_name name)) dts;
   130 
   131       val add_datatype_args = brackets (commas (map quote names)) ^ " " ^
   132         brackets (commas (map (fn ((((_, vs), name), mx), cs) =>
   133           parens (brackets (commas vs) ^ ", " ^ name ^ ", " ^ mx ^ ", " ^
   134             brackets (commas cs))) dts));
   135 
   136     in
   137       ";\nlocal\n\
   138       \val (thy, {distinct, inject, exhaustion, rec_thms,\n\
   139       \  case_thms, split_thms, induction, size, simps}) =\n\
   140       \ DatatypePackage.add_datatype false " ^ add_datatype_args ^ " thy;\n\
   141       \in\n" ^ mk_bind_thms_string names ^
   142       "val thy = thy;\nend;\nval thy = thy\n"
   143     end;
   144 
   145   fun mk_thmss namess = mk_list (map (mk_list o map (mk_pair o rpair "[]")) namess);
   146   fun mk_thm name = mk_pair (name, "[]");
   147 
   148   fun mk_rep_dt_string (((names, distinct), inject), induct) =
   149     ";\nlocal\n\
   150     \val (thy, {distinct, inject, exhaustion, rec_thms,\n\
   151     \  case_thms, split_thms, induction, size, simps}) =\n\
   152     \ DatatypePackage.rep_datatype " ^
   153     (case names of
   154         Some names => "(Some [" ^ commas_quote names ^ "])\n " ^
   155           mk_thmss distinct ^ "\n " ^ mk_thmss inject ^
   156             "\n " ^ mk_thm induct ^ " thy;\nin\n" ^ mk_bind_thms_string names
   157       | None => "None\n " ^ mk_thmss distinct ^ "\n " ^ mk_thmss inject ^
   158             "\n " ^ mk_thm induct ^ " thy;\nin\n") ^
   159     "val thy = thy;\nend;\nval thy = thy\n";
   160 
   161   (*** parsers ***)
   162 
   163   val simple_typ = ident || (type_var >> unenclose);
   164 
   165   fun complex_typ toks =
   166     let val typ = simple_typ || "(" $$-- complex_typ --$$ ")";
   167         val typ2 = complex_typ || "(" $$-- complex_typ --$$ ")";
   168     in
   169      (typ ^^ (repeat ident >> (cat "" o space_implode " ")) ||
   170       "(" $$-- !! (list1 typ2 >> (parens o commas)) --$$ ")" ^^ !!
   171         (repeat1 ident >> (cat "" o space_implode " "))) toks
   172     end;
   173 
   174   val opt_typs = repeat ((string >> unenclose) ||
   175     simple_typ || ("(" $$-- complex_typ --$$ ")"));
   176   val constructor = name -- opt_typs -- opt_mixfix >> (fn ((n, Ts), mx) =>
   177     parens (n ^ ", " ^ brackets (commas_quote Ts) ^ ", " ^ mx));
   178   val opt_name = optional ("(" $$-- name --$$ ")" >> Some) None
   179 
   180   fun optlistlist s = optional (s $$-- enum "and" (list name)) [[]]
   181 
   182 in
   183   val datatype_decl =
   184     enum1 "and" (opt_name -- type_args -- name -- opt_infix --$$ "=" --
   185       enum1 "|" constructor) >> mk_dt_string;
   186   val rep_datatype_decl =
   187     ((optional ((repeat1 (name >> unenclose)) >> Some) None) --
   188       optlistlist "distinct" -- optlistlist "inject" --
   189         ("induct" $$-- name)) >> mk_rep_dt_string;
   190 end;
   191 
   192 
   193 
   194 (** primrec **)
   195 
   196 fun mk_primrec_decl (alt_name, eqns) =
   197   let
   198     val names = map (fn (s, _) => if s = "" then "_" else s) eqns
   199   in
   200     ";\nval (thy, " ^ mk_list names ^ ") = PrimrecPackage.add_primrec " ^ alt_name ^ " " ^
   201     mk_list (map (fn (x, y) => mk_pair (mk_pair (quote x, y), "[]")) eqns) ^
   202     " " ^ " thy;\n\
   203     \val thy = thy\n"
   204   end;
   205 
   206 (* either names and axioms or just axioms *)
   207 val primrec_decl = (optional ("(" $$-- name --$$ ")") "\"\"" --
   208   (repeat1 ((ident -- string) || (string >> pair "")))) >> mk_primrec_decl;
   209 
   210 
   211 (*** recdef: interface to Slind's TFL ***)
   212 
   213 (** TFL with explicit WF relations **)
   214 
   215 (*fname: name of function being defined; rel: well-founded relation*)
   216 fun mk_recdef_decl ((((fname, rel), congs), ss), axms) =
   217   let
   218     val fid = unenclose fname;
   219     val congs_text = mk_list (map (fn c => mk_pair (c, "[]")) congs);
   220     val axms_text = mk_big_list axms;
   221   in
   222     ";\n\n\
   223     \local\n\
   224     \val (thy, result) = thy |> RecdefPackage.add_recdef " ^ quote fid ^ " " ^ rel ^ "\n" ^
   225     axms_text ^ "\n(Some (" ^ ss ^ "))\n" ^ congs_text ^ ";\n\
   226     \in\n\
   227     \structure " ^ fid ^ " =\n\
   228     \struct\n\
   229     \  val {rules, induct, tcs} = result;\n\
   230     \end;\n\
   231     \val thy = thy;\n\
   232     \end;\n\
   233     \val thy = thy\n"
   234   end;
   235 
   236 val recdef_decl =
   237   (name -- string --
   238     optional ("congs" $$-- list1 name) [] --
   239     optional ("simpset" $$-- string >> unenclose) "simpset()" --
   240     repeat1 string >> mk_recdef_decl);
   241 
   242 
   243 (** TFL with no WF relation supplied **)
   244 
   245 (*fname: name of function being defined; rel: well-founded relation*)
   246 fun mk_defer_recdef_decl ((fname, congs), axms) =
   247   let
   248     val fid = unenclose fname;
   249     val congs_text = mk_list (map (fn c => mk_pair (c, "[]")) congs);
   250     val axms_text = mk_big_list axms;
   251   in
   252     ";\n\n\
   253     \local\n\
   254     \val (thy, result) = thy |> RecdefPackage.defer_recdef " ^ quote fid ^ "\n" ^
   255     axms_text ^ "\n" ^ congs_text ^ ";\n\
   256     \in\n\
   257     \structure " ^ fid ^ " =\n\
   258     \struct\n\
   259     \  val {induct_rules} = result;\n\
   260     \end;\n\
   261     \val thy = thy;\n\
   262     \end;\n\
   263     \val thy = thy\n"
   264   end;
   265 
   266 val defer_recdef_decl =
   267   (name --
   268     optional ("congs" $$-- list1 name) [] --
   269     repeat1 string >> mk_defer_recdef_decl);
   270 
   271 
   272 
   273 (** augment thy syntax **)
   274 
   275 in
   276 
   277 val _ = ThySyn.add_syntax
   278  ["intrs", "monos", "con_defs", "congs", "simpset", "|",
   279   "and", "distinct", "inject", "induct"]
   280  [axm_section "typedef" "|> TypedefPackage.add_typedef" typedef_decl,
   281   section "record" "|> (#1 oooo RecordPackage.add_record)" record_decl,
   282   section "inductive" 	"" (inductive_decl false),
   283   section "coinductive"	"" (inductive_decl true),
   284   section "datatype" 	"" datatype_decl,
   285   section "rep_datatype" "" rep_datatype_decl,
   286   section "primrec" 	"" primrec_decl,
   287   section "recdef" 	"" recdef_decl,
   288   section "defer_recdef" "" defer_recdef_decl];
   289 
   290 end;