src/HOL/Tools/record_package.ML
author wenzelm
Tue Apr 27 10:49:52 1999 +0200 (1999-04-27)
changeset 6519 5bd1c469e742
parent 6394 3d9fd50fcc43
child 6556 daa00919502b
permissions -rw-r--r--
iff_add_global (from simpdata.ML);
     1 (*  Title:      HOL/Tools/record_package.ML
     2     ID:         $Id$
     3     Author:     Wolfgang Naraschewski and Markus Wenzel, TU Muenchen
     4 
     5 Extensible records with structural subtyping in HOL.
     6 *)
     7 
     8 signature BASIC_RECORD_PACKAGE =
     9 sig
    10   val record_split_tac: int -> tactic
    11   val record_split_name: string
    12   val record_split_wrapper: string * wrapper
    13 end;
    14 
    15 signature RECORD_PACKAGE =
    16 sig
    17   include BASIC_RECORD_PACKAGE
    18   val quiet_mode: bool ref
    19   val moreS: sort
    20   val mk_fieldT: (string * typ) * typ -> typ
    21   val dest_fieldT: typ -> (string * typ) * typ
    22   val mk_field: (string * term) * term -> term
    23   val mk_fst: term -> term
    24   val mk_snd: term -> term
    25   val mk_recordT: (string * typ) list * typ -> typ
    26   val dest_recordT: typ -> (string * typ) list * typ
    27   val mk_record: (string * term) list * term -> term
    28   val mk_sel: term -> string -> term
    29   val mk_update: term -> string * term -> term
    30   val print_records: theory -> unit
    31   val add_record: (string list * bstring) -> string option
    32     -> (bstring * string) list -> theory -> theory * {simps: thm list, iffs: thm list}
    33   val add_record_i: (string list * bstring) -> (typ list * string) option
    34     -> (bstring * typ) list -> theory -> theory * {simps: thm list, iffs: thm list}
    35   val setup: (theory -> theory) list
    36 end;
    37 
    38 structure RecordPackage: RECORD_PACKAGE =
    39 struct
    40 
    41 
    42 (*** utilities ***)
    43 
    44 (* messages *)
    45 
    46 val quiet_mode = ref false;
    47 fun message s = if ! quiet_mode then () else writeln s;
    48 
    49 
    50 (* wrappers *)
    51 
    52 fun add_wrapper wrapper thy =
    53   let val r = Classical.claset_ref_of thy
    54   in r := ! r addSWrapper wrapper; thy end;
    55 
    56 
    57 (* definitions and equations *)
    58 
    59 infix 0 :== ===;
    60 
    61 val (op :==) = Logic.mk_defpair;
    62 val (op ===) = HOLogic.mk_Trueprop o HOLogic.mk_eq;
    63 
    64 fun get_defs thy specs = map (PureThy.get_thm thy o fst) specs;
    65 
    66 
    67 (* proof by simplification *)
    68 
    69 fun prove_simp thy tacs simps =
    70   let
    71     val sign = Theory.sign_of thy;
    72     val ss = Simplifier.addsimps (HOL_basic_ss, simps);
    73 
    74     fun prove goal =
    75       Goals.prove_goalw_cterm [] (Thm.cterm_of sign goal)
    76         (K (tacs @ [ALLGOALS (Simplifier.simp_tac ss)]))
    77       handle ERROR => error ("The error(s) above occurred while trying to prove "
    78         ^ quote (Sign.string_of_term sign goal));
    79   in prove end;
    80 
    81 
    82 
    83 (*** syntax operations ***)
    84 
    85 (** name components **)
    86 
    87 val moreN = "more";
    88 val schemeN = "_scheme";
    89 val fieldN = "_field";
    90 val raw_fieldN = "_raw_field";
    91 val field_typeN = "_field_type";
    92 val fstN = "_val";
    93 val sndN = "_more";
    94 val updateN = "_update";
    95 val makeN = "make";
    96 val make_schemeN = "make_scheme";
    97 
    98 (*see datatype package*)
    99 val caseN = "_case";
   100 
   101 
   102 
   103 (** generic operations **)
   104 
   105 (* adhoc priming of vars *)
   106 
   107 fun prime (Free (x, T)) = Free (x ^ "'", T)
   108   | prime t = raise TERM ("prime: no free variable", [t]);
   109 
   110 
   111 (* product case *)
   112 
   113 fun fst_fn T U = Abs ("x", T, Abs ("y", U, Bound 1));
   114 fun snd_fn T U = Abs ("x", T, Abs ("y", U, Bound 0));
   115 
   116 fun mk_prod_case name f p =
   117   let
   118     val fT as Type ("fun", [A, Type ("fun", [B, C])]) = fastype_of f;
   119     val pT = fastype_of p;
   120   in Const (suffix caseN name, fT --> pT --> C) $ f $ p end;
   121 
   122 
   123 
   124 (** tuple operations **)
   125 
   126 (* more type class *)
   127 
   128 val moreS = ["Record.more"];
   129 
   130 
   131 (* types *)
   132 
   133 fun mk_fieldT ((c, T), U) = Type (suffix field_typeN c, [T, U]);
   134 
   135 fun dest_fieldT (typ as Type (c_field_type, [T, U])) =
   136       (case try (unsuffix field_typeN) c_field_type of
   137         None => raise TYPE ("dest_fieldT", [typ], [])
   138       | Some c => ((c, T), U))
   139   | dest_fieldT typ = raise TYPE ("dest_fieldT", [typ], []);
   140 
   141 
   142 (* constructors *)
   143 
   144 fun mk_fieldC U (c, T) = (suffix fieldN c, T --> U --> mk_fieldT ((c, T), U));
   145 
   146 fun gen_mk_field sfx ((c, t), u) =
   147   let val T = fastype_of t and U = fastype_of u
   148   in Const (suffix sfx c, [T, U] ---> mk_fieldT ((c, T), U)) $ t $ u end;
   149 
   150 val mk_field = gen_mk_field fieldN;
   151 val mk_raw_field = gen_mk_field raw_fieldN;
   152 
   153 
   154 (* destructors *)
   155 
   156 fun mk_fstC U (c, T) = (suffix fstN c, mk_fieldT ((c, T), U) --> T);
   157 fun mk_sndC U (c, T) = (suffix sndN c, mk_fieldT ((c, T), U) --> U);
   158 
   159 fun dest_field fst_or_snd p =
   160   let
   161     val pT = fastype_of p;
   162     val ((c, T), U) = dest_fieldT pT;
   163     val (destN, destT) = if fst_or_snd then (fstN, T) else (sndN, U);
   164   in Const (suffix destN c, pT --> destT) $ p end;
   165 
   166 val mk_fst = dest_field true;
   167 val mk_snd = dest_field false;
   168 
   169 
   170 
   171 (** record operations **)
   172 
   173 (* types *)
   174 
   175 val mk_recordT = foldr mk_fieldT;
   176 
   177 fun dest_recordT T =
   178   (case try dest_fieldT T of
   179     None => ([], T)
   180   | Some (c_T, U) => apfst (cons c_T) (dest_recordT U));
   181 
   182 fun find_fieldT c rT =
   183   (case assoc (fst (dest_recordT rT), c) of
   184     None => raise TYPE ("find_field: " ^ c, [rT], [])
   185   | Some T => T);
   186 
   187 
   188 (* constructors *)
   189 
   190 val mk_record = foldr mk_field;
   191 
   192 
   193 (* selectors *)
   194 
   195 fun mk_selC rT (c, T) = (c, rT --> T);
   196 
   197 fun mk_sel r c =
   198   let val rT = fastype_of r
   199   in Const (mk_selC rT (c, find_fieldT c rT)) $ r end;
   200 
   201 val mk_moreC = mk_selC;
   202 
   203 fun mk_more r c =
   204   let val rT = fastype_of r
   205   in Const (mk_moreC rT (c, snd (dest_recordT rT))) $ r end;
   206 
   207 
   208 (* updates *)
   209 
   210 fun mk_updateC rT (c, T) = (suffix updateN c, T --> rT --> rT);
   211 
   212 fun mk_update r (c, x) =
   213   let val rT = fastype_of r
   214   in Const (mk_updateC rT (c, find_fieldT c rT)) $ x $ r end;
   215 
   216 val mk_more_updateC = mk_updateC;
   217 
   218 fun mk_more_update r (c, x) =
   219   let val rT = fastype_of r
   220   in Const (mk_more_updateC rT (c, snd (dest_recordT rT))) $ x $ r end;
   221 
   222 
   223 (* make *)
   224 
   225 fun mk_makeC rT (c, Ts) = (c, Ts ---> rT);
   226 
   227 
   228 
   229 (** concrete syntax for records **)
   230 
   231 (* parse translations *)
   232 
   233 fun gen_field_tr mark sfx (t as Const (c, _) $ Free (name, _) $ arg) =
   234       if c = mark then Syntax.const (suffix sfx name) $ arg
   235       else raise TERM ("gen_field_tr: " ^ mark, [t])
   236   | gen_field_tr mark _ t = raise TERM ("gen_field_tr: " ^ mark, [t]);
   237 
   238 fun gen_fields_tr sep mark sfx (tm as Const (c, _) $ t $ u) =
   239       if c = sep then gen_field_tr mark sfx t :: gen_fields_tr sep mark sfx u
   240       else [gen_field_tr mark sfx tm]
   241   | gen_fields_tr _ mark sfx tm = [gen_field_tr mark sfx tm];
   242 
   243 fun gen_record_tr sep mark sfx unit [t] = foldr (op $) (gen_fields_tr sep mark sfx t, unit)
   244   | gen_record_tr _ _ _ _ ts = raise TERM ("gen_record_tr", ts);
   245 
   246 fun gen_record_scheme_tr sep mark sfx [t, more] = foldr (op $) (gen_fields_tr sep mark sfx t, more)
   247   | gen_record_scheme_tr _ _ _ ts = raise TERM ("gen_record_scheme_tr", ts);
   248 
   249 
   250 val record_type_tr = gen_record_tr "_field_types" "_field_type" field_typeN (Syntax.const "unit");
   251 val record_type_scheme_tr = gen_record_scheme_tr "_field_types" "_field_type" field_typeN;
   252 
   253 val record_tr = gen_record_tr "_fields" "_field" fieldN HOLogic.unit;
   254 val record_scheme_tr = gen_record_scheme_tr "_fields" "_field" fieldN;
   255 
   256 fun record_update_tr [t, u] =
   257       foldr (op $) (rev (gen_fields_tr "_updates" "_update" updateN u), t)
   258   | record_update_tr ts = raise TERM ("record_update_tr", ts);
   259 
   260 
   261 val parse_translation =
   262  [("_record_type", record_type_tr),
   263   ("_record_type_scheme", record_type_scheme_tr),
   264   ("_record", record_tr),
   265   ("_record_scheme", record_scheme_tr),
   266   ("_record_update", record_update_tr)];
   267 
   268 
   269 (* print translations *)
   270 
   271 fun gen_fields_tr' mark sfx (tm as Const (name_field, _) $ t $ u) =
   272       (case try (unsuffix sfx) name_field of
   273         Some name =>
   274           apfst (cons (Syntax.const mark $ Syntax.free name $ t)) (gen_fields_tr' mark sfx u)
   275       | None => ([], tm))
   276   | gen_fields_tr' _ _ tm = ([], tm);
   277 
   278 fun gen_record_tr' sep mark sfx is_unit record record_scheme tm =
   279   let
   280     val (ts, u) = gen_fields_tr' mark sfx tm;
   281     val t' = foldr1 (fn (v, w) => Syntax.const sep $ v $ w) ts;
   282   in
   283     if is_unit u then Syntax.const record $ t'
   284     else Syntax.const record_scheme $ t' $ u
   285   end;
   286 
   287 
   288 val record_type_tr' =
   289   gen_record_tr' "_field_types" "_field_type" field_typeN
   290     (fn Const ("unit", _) => true | _ => false) "_record_type" "_record_type_scheme";
   291 
   292 val record_tr' =
   293   gen_record_tr' "_fields" "_field" fieldN HOLogic.is_unit "_record" "_record_scheme";
   294 
   295 fun record_update_tr' tm =
   296   let val (ts, u) = gen_fields_tr' "_update" updateN tm in
   297     Syntax.const "_record_update" $ u $
   298       foldr1 (fn (v, w) => Syntax.const "_updates" $ v $ w) (rev ts)
   299   end;
   300 
   301 
   302 fun gen_field_tr' sfx tr' name =
   303   let val name_sfx = suffix sfx name
   304   in (name_sfx, fn [t, u] => tr' (Syntax.const name_sfx $ t $ u) | _ => raise Match) end;
   305 
   306 fun print_translation names =
   307   map (gen_field_tr' field_typeN record_type_tr') names @
   308   map (gen_field_tr' fieldN record_tr') names @
   309   map (gen_field_tr' updateN record_update_tr') names;
   310 
   311 
   312 
   313 (*** extend theory by record definition ***)
   314 
   315 (** record info **)
   316 
   317 (* type record_info and parent_info *)
   318 
   319 type record_info =
   320  {args: (string * sort) list,
   321   parent: (typ list * string) option,
   322   fields: (string * typ) list,
   323   simps: thm list};
   324 
   325 type parent_info =
   326  {name: string,
   327   fields: (string * typ) list,
   328   simps: thm list};
   329 
   330 
   331 (* data kind 'HOL/records' *)
   332 
   333 structure RecordsArgs =
   334 struct
   335   val name = "HOL/records";
   336   type T =
   337     record_info Symtab.table *                          (*records*)
   338       (thm Symtab.table * Simplifier.simpset);          (*field split rules*)
   339 
   340   val empty = (Symtab.empty, (Symtab.empty, HOL_basic_ss));
   341   val prep_ext = I;
   342   fun merge ((recs1, (sps1, ss1)), (recs2, (sps2, ss2))) =
   343     (Symtab.merge (K true) (recs1, recs2),
   344       (Symtab.merge (K true) (sps1, sps2), Simplifier.merge_ss (ss1, ss2)));
   345 
   346   fun print sg (recs, _) =
   347     let
   348       val prt_typ = Sign.pretty_typ sg;
   349       val ext_const = Sign.cond_extern sg Sign.constK;
   350 
   351       fun pretty_parent None = []
   352         | pretty_parent (Some (Ts, name)) =
   353             [Pretty.block [prt_typ (Type (name, Ts)), Pretty.str " +"]];
   354 
   355       fun pretty_field (c, T) = Pretty.block
   356         [Pretty.str (ext_const c), Pretty.str " ::", Pretty.brk 1, Pretty.quote (prt_typ T)];
   357 
   358       fun pretty_record (name, {args, parent, fields, simps = _}) = Pretty.block (Pretty.fbreaks
   359         (Pretty.block [prt_typ (Type (name, map TFree args)), Pretty.str " = "] ::
   360           pretty_parent parent @ map pretty_field fields));
   361     in
   362       seq (Pretty.writeln o pretty_record) (Symtab.dest recs)
   363     end;
   364 end;
   365 
   366 structure RecordsData = TheoryDataFun(RecordsArgs);
   367 val print_records = RecordsData.print;
   368 
   369 
   370 (* get and put data *)
   371 
   372 fun get_record thy name = Symtab.lookup (#1 (RecordsData.get thy), name);
   373 
   374 fun put_record name info thy =
   375   let val (tab, sp) = RecordsData.get thy
   376   in RecordsData.put (Symtab.update ((name, info), tab), sp) thy end;
   377 
   378 fun add_record_splits splits thy =
   379   let
   380     val (tab, (sps, ss)) = RecordsData.get thy;
   381     val simps = map #2 splits;
   382   in RecordsData.put (tab, (Symtab.extend (sps, splits), Simplifier.addsimps (ss, simps))) thy end;
   383 
   384 
   385 (* parent records *)
   386 
   387 fun inst_record thy (types, name) =
   388   let
   389     val sign = Theory.sign_of thy;
   390     fun err msg = error (msg ^ " parent record " ^ quote name);
   391 
   392     val {args, parent, fields, simps} =
   393       (case get_record thy name of Some info => info | None => err "Unknown");
   394     val _ = if length types <> length args then err "Bad number of arguments for" else ();
   395 
   396     fun bad_inst ((x, S), T) =
   397       if Sign.of_sort sign (T, S) then None else Some x
   398     val bads = mapfilter bad_inst (args ~~ types);
   399 
   400     val inst = map fst args ~~ types;
   401     val subst = Term.map_type_tfree (fn (x, _) => the (assoc (inst, x)));
   402   in
   403     if not (null bads) then
   404       err ("Ill-sorted instantiation of " ^ commas bads ^ " in")
   405     else (apsome (apfst (map subst)) parent, map (apsnd subst) fields, simps)
   406   end;
   407 
   408 fun add_parents thy (None, parents) = parents
   409   | add_parents thy (Some (types, name), parents) =
   410       let val (pparent, pfields, psimps) = inst_record thy (types, name)
   411       in add_parents thy (pparent, {name = name, fields = pfields, simps = psimps} :: parents) end;
   412 
   413 
   414 
   415 (** record field splitting **)
   416 
   417 (* tactic *)
   418 
   419 fun record_split_tac i st =
   420   let
   421     val (_, (sps, ss)) = RecordsData.get_sg (Thm.sign_of_thm st);
   422 
   423     fun is_fieldT (_, Type (a, [_, _])) = is_some (Symtab.lookup (sps, a))
   424       | is_fieldT _ = false;
   425     val params = Logic.strip_params (Library.nth_elem (i - 1, Thm.prems_of st));
   426   in
   427     if exists is_fieldT params then Simplifier.full_simp_tac ss i st
   428     else Seq.empty
   429   end handle Library.LIST _ => Seq.empty;
   430 
   431 
   432 (* wrapper *)
   433 
   434 val record_split_name = "record_split_tac";
   435 val record_split_wrapper = (record_split_name, fn tac => record_split_tac ORELSE' tac);
   436 
   437 
   438 (* method *)
   439 
   440 val record_split_method =
   441   ("record_split", Method.no_args (Method.METHOD0 (FIRSTGOAL record_split_tac)),
   442     "split record fields");
   443 
   444 
   445 
   446 (** internal theory extenders **)
   447 
   448 (* field_type_defs *)
   449 
   450 fun field_type_def ((thy, simps), (name, tname, vs, T, U)) =
   451   let
   452     val full = Sign.full_name (Theory.sign_of thy);
   453     val (thy', {simps = simps', ...}) =
   454       thy
   455       |> setmp DatatypePackage.quiet_mode true
   456         (DatatypePackage.add_datatype_i true [tname]
   457           [(vs, tname, Syntax.NoSyn, [(name, [T, U], Syntax.NoSyn)])]);
   458     val thy'' =
   459       thy'
   460       |> setmp AxClass.quiet_mode true
   461         (AxClass.add_inst_arity_i (full tname, [HOLogic.termS, moreS], moreS) [] [] None);
   462   in (thy'', simps' @ simps) end;
   463 
   464 fun field_type_defs args thy = foldl field_type_def ((thy, []), args);
   465 
   466 
   467 (* field_definitions *)
   468 
   469 fun field_definitions fields names zeta moreT more vars named_vars thy =
   470   let
   471     val sign = Theory.sign_of thy;
   472     val base = Sign.base_name;
   473     val full_path = Sign.full_name_path sign;
   474 
   475 
   476     (* prepare declarations and definitions *)
   477 
   478     (*field types*)
   479     fun mk_fieldT_spec c =
   480       (suffix raw_fieldN c, suffix field_typeN c,
   481         ["'a", zeta], TFree ("'a", HOLogic.termS), moreT);
   482     val fieldT_specs = map (mk_fieldT_spec o base) names;
   483 
   484     (*field constructors*)
   485     val field_decls = map (mk_fieldC moreT) fields;
   486 
   487     fun mk_field_spec (c, v) =
   488       mk_field ((c, v), more) :== mk_raw_field ((c, v), more);
   489     val field_specs = map mk_field_spec named_vars;
   490 
   491     (*field destructors*)
   492     val dest_decls = map (mk_fstC moreT) fields @ map (mk_sndC moreT) fields;
   493 
   494     fun mk_dest_spec dest f (c, T) =
   495       let val p = Free ("p", mk_fieldT ((c, T), moreT));
   496       in dest p :== mk_prod_case (suffix field_typeN c) (f T moreT) p end;
   497     val dest_specs =
   498       map (mk_dest_spec mk_fst fst_fn) fields @
   499       map (mk_dest_spec mk_snd snd_fn) fields;
   500 
   501 
   502     (* prepare theorems *)
   503 
   504     (*constructor injects*)
   505     fun mk_inject_prop (c, v) =
   506       HOLogic.mk_eq (mk_field ((c, v), more), mk_field ((c, prime v), prime more)) ===
   507         (HOLogic.conj $ HOLogic.mk_eq (v, prime v) $ HOLogic.mk_eq (more, prime more));
   508     val inject_props = map mk_inject_prop named_vars;
   509 
   510     (*destructor conversions*)
   511     fun mk_dest_prop dest dest' (c, v) =
   512       dest (mk_field ((c, v), more)) === dest' (v, more);
   513     val dest_props =
   514       map (mk_dest_prop mk_fst fst) named_vars @
   515       map (mk_dest_prop mk_snd snd) named_vars;
   516 
   517     (*surjective pairing*)
   518     fun mk_surj_prop (c, T) =
   519       let val p = Free ("p", mk_fieldT ((c, T), moreT));
   520       in p === mk_field ((c, mk_fst p), mk_snd p) end;
   521     val surj_props = map mk_surj_prop fields;
   522 
   523 
   524     (* 1st stage: types_thy *)
   525 
   526     val (types_thy, datatype_simps) =
   527       thy
   528       |> field_type_defs fieldT_specs;
   529 
   530 
   531     (* 2nd stage: defs_thy *)
   532 
   533     val defs_thy =
   534       types_thy
   535        |> (Theory.add_consts_i o map (Syntax.no_syn o apfst base))
   536          (field_decls @ dest_decls)
   537        |> (PureThy.add_defs_i o map (fn x => (x, [Drule.tag_internal])))
   538          (field_specs @ dest_specs);
   539 
   540     val field_defs = get_defs defs_thy field_specs;
   541     val dest_defs = get_defs defs_thy dest_specs;
   542 
   543 
   544     (* 3rd stage: thms_thy *)
   545 
   546     val prove = prove_simp defs_thy;
   547     val prove_std = prove [] (field_defs @ dest_defs @ datatype_simps);
   548 
   549     val field_injects = map prove_std inject_props;
   550     val dest_convs = map prove_std dest_props;
   551     val surj_pairs = map (prove [DatatypePackage.induct_tac "p" 1]
   552       (map Thm.symmetric field_defs @ dest_convs)) surj_props;
   553 
   554     fun mk_split th = SplitPairedAll.rule (th RS eq_reflection);
   555     val field_splits = map mk_split surj_pairs;
   556 
   557     val thms_thy =
   558       defs_thy
   559       |> (PureThy.add_thmss o map Thm.no_attributes)
   560         [("field_defs", field_defs),
   561           ("dest_defs", dest_defs),
   562           ("dest_convs", dest_convs),
   563           ("surj_pairs", surj_pairs),
   564           ("field_splits", field_splits)];
   565 
   566   in (thms_thy, dest_convs, field_injects, field_splits) end;
   567 
   568 
   569 (* record_definition *)
   570 
   571 fun record_definition (args, bname) parent (parents: parent_info list) bfields thy =
   572   let
   573     val sign = Theory.sign_of thy;
   574     val full = Sign.full_name_path sign bname;
   575     val base = Sign.base_name;
   576 
   577 
   578     (* basic components *)
   579 
   580     val alphas = map fst args;
   581     val name = Sign.full_name sign bname;       (*not made part of record name space!*)
   582 
   583     val parent_fields = flat (map #fields parents);
   584     val parent_names = map fst parent_fields;
   585     val parent_types = map snd parent_fields;
   586     val parent_len = length parent_fields;
   587     val parent_xs = variantlist (map (base o fst) parent_fields, [moreN]);
   588     val parent_vars = ListPair.map Free (parent_xs, parent_types);
   589     val parent_named_vars = parent_names ~~ parent_vars;
   590 
   591     val fields = map (apfst full) bfields;
   592     val names = map fst fields;
   593     val types = map snd fields;
   594     val len = length fields;
   595     val xs = variantlist (map fst bfields, moreN :: parent_xs);
   596     val vars = ListPair.map Free (xs, types);
   597     val named_vars = names ~~ vars;
   598 
   599     val all_fields = parent_fields @ fields;
   600     val all_names = parent_names @ names;
   601     val all_types = parent_types @ types;
   602     val all_len = parent_len + len;
   603     val all_xs = parent_xs @ xs;
   604     val all_vars = parent_vars @ vars;
   605     val all_named_vars = parent_named_vars @ named_vars;
   606 
   607     val zeta = variant alphas "'z";
   608     val moreT = TFree (zeta, moreS);
   609     val more = Free (moreN, moreT);
   610     val full_moreN = full moreN;
   611     fun more_part t = mk_more t full_moreN;
   612     fun more_part_update t x = mk_more_update t (full_moreN, x);
   613 
   614     val parent_more = funpow parent_len mk_snd;
   615     val idxs = 0 upto (len - 1);
   616 
   617     val rec_schemeT = mk_recordT (all_fields, moreT);
   618     val rec_scheme = mk_record (all_named_vars, more);
   619     val r = Free ("r", rec_schemeT);
   620     val recT = mk_recordT (all_fields, HOLogic.unitT);
   621 
   622 
   623     (* prepare print translation functions *)
   624 
   625     val field_tr's =
   626       print_translation (distinct (flat (map NameSpace.accesses (full_moreN :: names))));
   627 
   628 
   629     (* prepare declarations *)
   630 
   631     val sel_decls = map (mk_selC rec_schemeT) bfields @
   632       [mk_moreC rec_schemeT (moreN, moreT)];
   633     val update_decls = map (mk_updateC rec_schemeT) bfields @
   634       [mk_more_updateC rec_schemeT (moreN, moreT)];
   635     val make_decls =
   636       [(mk_makeC rec_schemeT (make_schemeN, all_types @ [moreT])),
   637        (mk_makeC recT (makeN, all_types))];
   638 
   639 
   640     (* prepare definitions *)
   641 
   642     (*record (scheme) type abbreviation*)
   643     val recordT_specs =
   644       [(suffix schemeN bname, alphas @ [zeta], rec_schemeT, Syntax.NoSyn),
   645         (bname, alphas, recT, Syntax.NoSyn)];
   646 
   647     (*selectors*)
   648     fun mk_sel_spec (i, c) =
   649       mk_sel r c :== mk_fst (funpow i mk_snd (parent_more r));
   650     val sel_specs =
   651       ListPair.map mk_sel_spec (idxs, names) @
   652         [more_part r :== funpow len mk_snd (parent_more r)];
   653 
   654     (*updates*)
   655     val all_sels = all_names ~~ map (mk_sel r) all_names;
   656     fun mk_upd_spec (i, (c, x)) =
   657       mk_update r (c, x) :==
   658         mk_record (nth_update (c, x) (parent_len + i, all_sels), more_part r)
   659     val update_specs =
   660       ListPair.map mk_upd_spec (idxs, named_vars) @
   661         [more_part_update r more :== mk_record (all_sels, more)];
   662 
   663     (*makes*)
   664     val make_scheme = Const (mk_makeC rec_schemeT (full make_schemeN, all_types @ [moreT]));
   665     val make = Const (mk_makeC recT (full makeN, all_types));
   666     val make_specs =
   667       [list_comb (make_scheme, all_vars) $ more :== rec_scheme,
   668         list_comb (make, all_vars) :== mk_record (all_named_vars, HOLogic.unit)];
   669 
   670 
   671     (* prepare propositions *)
   672 
   673     (*selectors*)
   674     val sel_props =
   675       map (fn (c, x) => mk_sel rec_scheme c === x) named_vars @
   676         [more_part rec_scheme === more];
   677 
   678     (*updates*)
   679     fun mk_upd_prop (i, (c, T)) =
   680       let val x' = Free (variant all_xs (base c ^ "'"), T) in
   681         mk_update rec_scheme (c, x') ===
   682           mk_record (nth_update (c, x') (parent_len + i, all_named_vars), more)
   683       end;
   684     val update_props =
   685       ListPair.map mk_upd_prop (idxs, fields) @
   686         let val more' = Free (variant all_xs (moreN ^ "'"), moreT)
   687         in [more_part_update rec_scheme more' === mk_record (all_named_vars, more')] end;
   688 
   689 
   690     (* 1st stage: fields_thy *)
   691 
   692     val (fields_thy, field_simps, field_injects, field_splits) =
   693       thy
   694       |> Theory.add_path bname
   695       |> field_definitions fields names zeta moreT more vars named_vars;
   696 
   697     val named_splits = map2 (fn (c, th) => (suffix field_typeN c, th)) (names, field_splits);
   698 
   699 
   700     (* 2nd stage: defs_thy *)
   701 
   702     val defs_thy =
   703       fields_thy
   704       |> Theory.parent_path
   705       |> Theory.add_tyabbrs_i recordT_specs     (*not made part of record name space!*)
   706       |> Theory.add_path bname
   707       |> Theory.add_trfuns ([], [], field_tr's, [])
   708       |> (Theory.add_consts_i o map Syntax.no_syn)
   709         (sel_decls @ update_decls @ make_decls)
   710       |> (PureThy.add_defs_i o map (fn x => (x, [Drule.tag_internal])))
   711         (sel_specs @ update_specs)
   712       |> (PureThy.add_defs_i o map Thm.no_attributes) make_specs;
   713 
   714     val sel_defs = get_defs defs_thy sel_specs;
   715     val update_defs = get_defs defs_thy update_specs;
   716     val make_defs = get_defs defs_thy make_specs;
   717 
   718 
   719     (* 3rd stage: thms_thy *)
   720 
   721     val parent_simps = flat (map #simps parents);
   722     val prove = prove_simp defs_thy [];
   723 
   724     val sel_convs = map (prove (parent_simps @ sel_defs @ field_simps)) sel_props;
   725     val update_convs = map (prove (parent_simps @ update_defs @ sel_convs)) update_props;
   726 
   727     val simps = field_simps @ sel_convs @ update_convs @ make_defs;
   728     val iffs = field_injects;
   729 
   730     val thms_thy =
   731       defs_thy
   732       |> (PureThy.add_thmss o map Thm.no_attributes)
   733         [("select_defs", sel_defs),
   734           ("update_defs", update_defs),
   735           ("make_defs", make_defs),
   736           ("select_convs", sel_convs),
   737           ("update_convs", update_convs)]
   738       |> PureThy.add_thmss
   739         [(("simps", simps), [Simplifier.simp_add_global]),
   740          (("iffs", iffs), [iff_add_global])];
   741 
   742 
   743     (* 4th stage: final_thy *)
   744 
   745     val final_thy =
   746       thms_thy
   747       |> put_record name {args = args, parent = parent, fields = fields, simps = simps}
   748       |> add_record_splits named_splits
   749       |> Theory.parent_path;
   750 
   751   in (final_thy, {simps = simps, iffs = iffs}) end;
   752 
   753 
   754 
   755 (** theory extender interface **)
   756 
   757 (* prepare arguments *)
   758 
   759 (*note: read_raw_typ avoids expanding type abbreviations*)
   760 fun read_raw_parent sign s =
   761   (case Sign.read_raw_typ (sign, K None) s handle TYPE (msg, _, _) => error msg of
   762     Type (name, Ts) => (Ts, name)
   763   | _ => error ("Bad parent record specification: " ^ quote s));
   764 
   765 fun read_typ sign (env, s) =
   766   let
   767     fun def_sort (x, ~1) = assoc (env, x)
   768       | def_sort _ = None;
   769     val T = Type.no_tvars (Sign.read_typ (sign, def_sort) s) handle TYPE (msg, _, _) => error msg;
   770   in (Term.add_typ_tfrees (T, env), T) end;
   771 
   772 fun cert_typ sign (env, raw_T) =
   773   let val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle TYPE (msg, _, _) => error msg
   774   in (Term.add_typ_tfrees (T, env), T) end;
   775 
   776 
   777 (* add_record *)
   778 
   779 (*we do all preparations and error checks here, deferring the real
   780   work to record_definition*)
   781 
   782 fun gen_add_record prep_typ prep_raw_parent (params, bname) raw_parent raw_fields thy =
   783   let
   784     val _ = Theory.requires thy "Record" "record definitions";
   785     val sign = Theory.sign_of thy;
   786     val _ = message ("Defining record " ^ quote bname ^ " ...");
   787 
   788 
   789     (* parents *)
   790 
   791     fun prep_inst T = snd (cert_typ sign ([], T));
   792 
   793     val parent = apsome (apfst (map prep_inst) o prep_raw_parent sign) raw_parent
   794       handle ERROR => error ("The error(s) above in parent record specification");
   795     val parents = add_parents thy (parent, []);
   796 
   797     val init_env =
   798       (case parent of
   799         None => []
   800       | Some (types, _) => foldr Term.add_typ_tfrees (types, []));
   801 
   802 
   803     (* fields *)
   804 
   805     fun prep_field (env, (c, raw_T)) =
   806       let val (env', T) = prep_typ sign (env, raw_T) handle ERROR =>
   807         error ("The error(s) above occured in field " ^ quote c)
   808       in (env', (c, T)) end;
   809 
   810     val (envir, bfields) = foldl_map prep_field (init_env, raw_fields);
   811     val envir_names = map fst envir;
   812 
   813 
   814     (* args *)
   815 
   816     val defaultS = Sign.defaultS sign;
   817     val args = map (fn x => (x, if_none (assoc (envir, x)) defaultS)) params;
   818 
   819 
   820     (* errors *)
   821 
   822     val name = Sign.full_name sign bname;
   823     val err_dup_record =
   824       if is_none (get_record thy name) then []
   825       else ["Duplicate definition of record " ^ quote name];
   826 
   827     val err_dup_parms =
   828       (case duplicates params of
   829         [] => []
   830       | dups => ["Duplicate parameter(s) " ^ commas dups]);
   831 
   832     val err_extra_frees =
   833       (case gen_rems (op =) (envir_names, params) of
   834         [] => []
   835       | extras => ["Extra free type variable(s) " ^ commas extras]);
   836 
   837     val err_no_fields = if null bfields then ["No fields present"] else [];
   838 
   839     val err_dup_fields =
   840       (case duplicates (map fst bfields) of
   841         [] => []
   842       | dups => ["Duplicate field(s) " ^ commas_quote dups]);
   843 
   844     val err_bad_fields =
   845       if forall (not_equal moreN o fst) bfields then []
   846       else ["Illegal field name " ^ quote moreN];
   847 
   848     val err_dup_sorts =
   849       (case duplicates envir_names of
   850         [] => []
   851       | dups => ["Inconsistent sort constraints for " ^ commas dups]);
   852 
   853     val errs =
   854       err_dup_record @ err_dup_parms @ err_extra_frees @ err_no_fields @
   855       err_dup_fields @ err_bad_fields @ err_dup_sorts;
   856   in
   857     if null errs then () else error (cat_lines errs);
   858     thy |> record_definition (args, bname) parent parents bfields
   859   end
   860   handle ERROR => error ("Failed to define record " ^ quote bname);
   861 
   862 val add_record = gen_add_record read_typ read_raw_parent;
   863 val add_record_i = gen_add_record cert_typ (K I);
   864 
   865 
   866 
   867 (** package setup **)
   868 
   869 (* setup theory *)
   870 
   871 val setup =
   872  [RecordsData.init,
   873   Theory.add_trfuns ([], parse_translation, [], []),
   874   Method.add_methods [record_split_method],
   875   add_wrapper record_split_wrapper];
   876 
   877 
   878 (* outer syntax *)
   879 
   880 local open OuterParse in
   881 
   882 val record_decl =
   883   type_args -- name -- ($$$ "=" |-- Scan.option (typ --| $$$ "+")
   884     -- Scan.repeat1 (name -- ($$$ "::" |-- typ)));
   885 
   886 val recordP =
   887   OuterSyntax.command "record" "define extensible record"
   888     (record_decl >> (fn (x, (y, z)) => Toplevel.theory (#1 o add_record x y z)));
   889 
   890 val _ = OuterSyntax.add_parsers [recordP];
   891 
   892 end;
   893 
   894 
   895 end;
   896 
   897 structure BasicRecordPackage: BASIC_RECORD_PACKAGE = RecordPackage;
   898 open BasicRecordPackage;