src/Pure/Isar/expression.ML
author ballarin
Thu Nov 27 21:25:34 2008 +0100 (2008-11-27)
changeset 28898 530c7d28a962
parent 28895 4e2914c2f8c5
child 28902 2019bcc9d8bf
permissions -rw-r--r--
Proper treatment of expressions with free arguments.
     1 (*  Title:      Pure/Isar/expression.ML
     2     ID:         $Id$
     3     Author:     Clemens Ballarin, TU Muenchen
     4 
     5 New locale development --- experimental.
     6 *)
     7 
     8 signature EXPRESSION =
     9 sig
    10   datatype 'term map = Positional of 'term option list | Named of (string * 'term) list;
    11   type 'term expr = (string * (string * 'term map)) list;
    12   type expression = string expr * (Name.binding * string option * mixfix) list;
    13   type expression_i = term expr * (Name.binding * typ option * mixfix) list;
    14 
    15   (* Processing of context statements *)
    16   val read_statement: Element.context list -> (string * string list) list list ->
    17     Proof.context ->  (term * term list) list list * Proof.context;
    18   val cert_statement: Element.context_i list -> (term * term list) list list ->
    19     Proof.context -> (term * term list) list list * Proof.context;
    20 
    21   (* Declaring locales *)
    22   val add_locale: string -> bstring -> expression -> Element.context list -> theory ->
    23     string * Proof.context
    24   val add_locale_i: string -> bstring -> expression_i -> Element.context_i list -> theory ->
    25     string * Proof.context
    26 
    27   (* Interpretation *)
    28   val sublocale: (thm list list -> Proof.context -> Proof.context) ->
    29     string -> expression -> theory -> Proof.state;
    30   val sublocale_i: (thm list list -> Proof.context -> Proof.context) ->
    31     string -> expression_i -> theory -> Proof.state;
    32 
    33   (* Debugging and development *)
    34   val parse_expression: OuterParse.token list -> expression * OuterParse.token list
    35 end;
    36 
    37 
    38 structure Expression : EXPRESSION =
    39 struct
    40 
    41 datatype ctxt = datatype Element.ctxt;
    42 
    43 
    44 (*** Expressions ***)
    45 
    46 datatype 'term map =
    47   Positional of 'term option list |
    48   Named of (string * 'term) list;
    49 
    50 type 'term expr = (string * (string * 'term map)) list;
    51 
    52 type expression = string expr * (Name.binding * string option * mixfix) list;
    53 type expression_i = term expr * (Name.binding * typ option * mixfix) list;
    54 
    55 
    56 (** Parsing and printing **)
    57 
    58 local
    59 
    60 structure P = OuterParse;
    61 
    62 val loc_keyword = P.$$$ "fixes" || P.$$$ "constrains" || P.$$$ "assumes" ||
    63    P.$$$ "defines" || P.$$$ "notes";
    64 fun plus1_unless test scan =
    65   scan ::: Scan.repeat (P.$$$ "+" |-- Scan.unless test (P.!!! scan));
    66 
    67 val prefix = P.name --| P.$$$ ":";
    68 val named = P.name -- (P.$$$ "=" |-- P.term);
    69 val position = P.maybe P.term;
    70 val instance = P.$$$ "where" |-- P.and_list1 named >> Named ||
    71   Scan.repeat1 position >> Positional;
    72 
    73 in
    74 
    75 val parse_expression =
    76   let
    77     fun expr2 x = P.xname x;
    78     fun expr1 x = (Scan.optional prefix "" -- expr2 --
    79       Scan.optional instance (Named []) >> (fn ((p, l), i) => (l, (p, i)))) x;
    80     fun expr0 x = (plus1_unless loc_keyword expr1) x;
    81   in expr0 -- P.for_fixes end;
    82 
    83 end;
    84 
    85 fun pretty_expr thy expr =
    86   let
    87     fun pretty_pos NONE = Pretty.str "_"
    88       | pretty_pos (SOME x) = Pretty.str x;
    89     fun pretty_named (x, y) = [Pretty.str x, Pretty.brk 1, Pretty.str "=",
    90           Pretty.brk 1, Pretty.str y] |> Pretty.block;
    91     fun pretty_ren (Positional ps) = take_suffix is_none ps |> snd |>
    92           map pretty_pos |> Pretty.breaks
    93       | pretty_ren (Named []) = []
    94       | pretty_ren (Named ps) = Pretty.str "where" :: Pretty.brk 1 ::
    95           (ps |> map pretty_named |> Pretty.separate "and");
    96     fun pretty_rename (loc, ("", ren)) =
    97           Pretty.block (Pretty.str (NewLocale.extern thy loc) :: Pretty.brk 1 :: pretty_ren ren) 
    98       | pretty_rename (loc, (prfx, ren)) =
    99           Pretty.block (Pretty.str prfx :: Pretty.brk 1 :: Pretty.str (NewLocale.extern thy loc) ::
   100             Pretty.brk 1 :: pretty_ren ren);
   101   in Pretty.separate "+" (map pretty_rename expr) |> Pretty.block end;
   102 
   103 fun err_in_expr thy msg expr =
   104   let
   105     val err_msg =
   106       if null expr then msg
   107       else msg ^ "\n" ^ Pretty.string_of (Pretty.block
   108         [Pretty.str "The above error(s) occurred in expression:", Pretty.brk 1,
   109           pretty_expr thy expr])
   110   in error err_msg end;
   111 
   112 
   113 (** Internalise locale names in expr **)
   114 
   115 fun intern thy instances =  map (apfst (NewLocale.intern thy)) instances;
   116 
   117 
   118 (** Parameters of expression.
   119 
   120    Sanity check of instantiations and extraction of implicit parameters.
   121    The latter only occurs iff strict = false.
   122    Positional instantiations are extended to match full length of parameter list
   123    of instantiated locale. **)
   124 
   125 fun parameters_of thy strict (expr, fixed) =
   126   let
   127     fun reject_dups message xs =
   128       let val dups = duplicates (op =) xs
   129       in
   130         if null dups then () else error (message ^ commas dups)
   131       end;
   132 
   133     fun match_bind (n, b) = (n = Name.name_of b);
   134     fun bind_eq (b1, b2) = (Name.name_of b1 = Name.name_of b2);
   135       (* FIXME: cannot compare bindings for equality. *)
   136 
   137     fun params_loc loc =
   138           (NewLocale.params_of thy loc |> map (fn (p, _, mx) => (p, mx)), loc);
   139     fun params_inst (expr as (loc, (prfx, Positional insts))) =
   140           let
   141             val (ps, loc') = params_loc loc;
   142 	    val d = length ps - length insts;
   143 	    val insts' =
   144 	      if d < 0 then error ("More arguments than parameters in instantiation of locale " ^
   145                 quote (NewLocale.extern thy loc))
   146 	      else insts @ replicate d NONE;
   147             val ps' = (ps ~~ insts') |>
   148               map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
   149           in (ps', (loc', (prfx, Positional insts'))) end
   150       | params_inst (expr as (loc, (prfx, Named insts))) =
   151           let
   152             val _ = reject_dups "Duplicate instantiation of the following parameter(s): "
   153               (map fst insts);
   154 
   155             val (ps, loc') = params_loc loc;
   156             val ps' = fold (fn (p, _) => fn ps =>
   157               if AList.defined match_bind ps p then AList.delete match_bind p ps
   158               else error (quote p ^" not a parameter of instantiated expression.")) insts ps;
   159           in (ps', (loc', (prfx, Named insts))) end;
   160     fun params_expr is =
   161           let
   162             val (is', ps') = fold_map (fn i => fn ps =>
   163               let
   164                 val (ps', i') = params_inst i;
   165                 val ps'' = AList.join bind_eq (fn p => fn (mx1, mx2) =>
   166                   (* FIXME: should check for bindings being the same.
   167                      Instead we check for equal name and syntax. *)
   168                   if mx1 = mx2 then mx1
   169                   else error ("Conflicting syntax for parameter" ^ quote (Name.display p) ^
   170                     " in expression.")) (ps, ps')
   171               in (i', ps'') end) is []
   172           in (ps', is') end;
   173 
   174     val (implicit, expr') = params_expr expr;
   175 
   176     val implicit' = map (#1 #> Name.name_of) implicit;
   177     val fixed' = map (#1 #> Name.name_of) fixed;
   178     val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
   179     val implicit'' = if strict then []
   180       else let val _ = reject_dups
   181           "Parameter(s) declared simultaneously in expression and for clause: " (implicit' @ fixed')
   182         in map (fn (b, mx) => (b, NONE, mx)) implicit end;
   183 
   184   in (expr', implicit'' @ fixed) end;
   185 
   186 
   187 (** Read instantiation **)
   188 
   189 (* Parse positional or named instantiation *)
   190 
   191 local
   192 
   193 fun prep_inst parse_term parms (Positional insts) ctxt =
   194       (insts ~~ parms) |> map (fn
   195         (NONE, p) => Syntax.parse_term ctxt p |
   196         (SOME t, _) => parse_term ctxt t)
   197   | prep_inst parse_term parms (Named insts) ctxt =
   198       parms |> map (fn p => case AList.lookup (op =) insts p of
   199         SOME t => parse_term ctxt t |
   200         NONE => Syntax.parse_term ctxt p);
   201 
   202 in
   203 
   204 fun parse_inst x = prep_inst Syntax.parse_term x;
   205 fun make_inst x = prep_inst (K I) x;
   206 
   207 end;
   208 
   209 
   210 (* Instantiation morphism *)
   211 
   212 fun inst_morph (parm_names, parm_types) (prfx, insts') ctxt =
   213   let
   214     (* parameters *)
   215     val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
   216 
   217     (* type inference and contexts *)
   218     val parm_types' = map (TypeInfer.paramify_vars o Logic.varifyT) parm_types;
   219     val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
   220     val arg = type_parms @ map2 TypeInfer.constrain parm_types' insts';
   221     val res = Syntax.check_terms ctxt arg;
   222     val ctxt' = ctxt |> fold Variable.auto_fixes res;
   223     
   224     (* instantiation *)
   225     val (type_parms'', res') = chop (length type_parms) res;
   226     val insts'' = (parm_names ~~ res') |> map_filter
   227       (fn (inst as (x, Free (y, _))) => if x = y then NONE else SOME inst |
   228         inst => SOME inst);
   229     val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
   230     val inst = Symtab.make insts'';
   231   in
   232     (Element.inst_morphism (ProofContext.theory_of ctxt) (instT, inst) $>
   233       Morphism.name_morphism (Name.qualified prfx), ctxt')
   234   end;
   235 
   236 
   237 (*** Locale processing ***)
   238 
   239 (** Parsing **)
   240 
   241 fun parse_elem prep_typ prep_term ctxt elem =
   242   Element.map_ctxt {name = I, var = I, typ = prep_typ ctxt,
   243     term = prep_term ctxt, fact = I, attrib = I} elem;
   244 
   245 fun parse_concl prep_term ctxt concl =
   246   (map o map) (fn (t, ps) =>
   247     (prep_term ctxt, map (prep_term ctxt) ps)) concl;
   248 
   249 
   250 (** Simultaneous type inference: instantiations + elements + conclusion **)
   251 
   252 local
   253 
   254 fun mk_type T = (Logic.mk_type T, []);
   255 fun mk_term t = (t, []);
   256 fun mk_propp (p, pats) = (Syntax.type_constraint propT p, pats);
   257 
   258 fun dest_type (T, []) = Logic.dest_type T;
   259 fun dest_term (t, []) = t;
   260 fun dest_propp (p, pats) = (p, pats);
   261 
   262 fun extract_inst (_, (_, ts)) = map mk_term ts;
   263 fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
   264 
   265 fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
   266   | extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
   267   | extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
   268   | extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
   269   | extract_elem (Notes _) = [];
   270 
   271 fun restore_elem (Fixes fixes, css) =
   272       (fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
   273         (x, cs |> map dest_type |> try hd, mx)) |> Fixes
   274   | restore_elem (Constrains csts, css) =
   275       (csts ~~ css) |> map (fn ((x, _), cs) =>
   276         (x, cs |> map dest_type |> hd)) |> Constrains
   277   | restore_elem (Assumes asms, css) =
   278       (asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
   279   | restore_elem (Defines defs, css) =
   280       (defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
   281   | restore_elem (Notes notes, _) = Notes notes;
   282 
   283 fun check cs context =
   284   let
   285     fun prep (_, pats) (ctxt, t :: ts) =
   286       let val ctxt' = Variable.auto_fixes t ctxt
   287       in
   288         ((t, Syntax.check_props (ProofContext.set_mode ProofContext.mode_pattern ctxt') pats),
   289           (ctxt', ts))
   290       end
   291     val (cs', (context', _)) = fold_map prep cs
   292       (context, Syntax.check_terms
   293         (ProofContext.set_mode ProofContext.mode_schematic context) (map fst cs));
   294   in (cs', context') end;
   295 
   296 in
   297 
   298 fun check_autofix insts elems concl ctxt =
   299   let
   300     val inst_cs = map extract_inst insts;
   301     val elem_css = map extract_elem elems;
   302     val concl_cs = (map o map) mk_propp concl;
   303     (* Type inference *)
   304     val (inst_cs' :: css', ctxt') =
   305       (fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
   306     (* Re-check to resolve bindings, elements and conclusion only *)
   307     val (css'', _) = (fold_burrow o fold_burrow) check css' ctxt';
   308     val (elem_css'', [concl_cs'']) = chop (length elem_css) css'';
   309   in
   310     (map restore_inst (insts ~~ inst_cs'), map restore_elem (elems ~~ elem_css''),
   311       concl_cs'', ctxt')
   312   end;
   313 
   314 end;
   315 
   316 
   317 (** Prepare locale elements **)
   318 
   319 fun declare_elem prep_vars (Fixes fixes) ctxt =
   320       let val (vars, _) = prep_vars fixes ctxt
   321       in ctxt |> ProofContext.add_fixes_i vars |> snd end
   322   | declare_elem prep_vars (Constrains csts) ctxt =
   323       ctxt |> prep_vars (map (fn (x, T) => (Name.binding x, SOME T, NoSyn)) csts) |> snd
   324   | declare_elem _ (Assumes _) ctxt = ctxt
   325   | declare_elem _ (Defines _) ctxt = ctxt
   326   | declare_elem _ (Notes _) ctxt = ctxt;
   327 
   328 (** Finish locale elements, extract specification text **)
   329 
   330 val norm_term = Envir.beta_norm oo Term.subst_atomic;
   331 
   332 fun abstract_thm thy eq =
   333   Thm.assume (Thm.cterm_of thy eq) |> Drule.gen_all |> Drule.abs_def;
   334 
   335 fun bind_def ctxt eq (xs, env, ths) =
   336   let
   337     val ((y, T), b) = LocalDefs.abs_def eq;
   338     val b' = norm_term env b;
   339     val th = abstract_thm (ProofContext.theory_of ctxt) eq;
   340     fun err msg = error (msg ^ ": " ^ quote y);
   341   in
   342     exists (fn (x, _) => x = y) xs andalso
   343       err "Attempt to define previously specified variable";
   344     exists (fn (Free (y', _), _) => y = y' | _ => false) env andalso
   345       err "Attempt to redefine variable";
   346     (Term.add_frees b' xs, (Free (y, T), b') :: env, th :: ths)
   347   end;
   348 
   349 fun eval_text _ _ (Fixes _) text = text
   350   | eval_text _ _ (Constrains _) text = text
   351   | eval_text _ is_ext (Assumes asms)
   352         (((exts, exts'), (ints, ints')), (xs, env, defs)) =
   353       let
   354         val ts = maps (map #1 o #2) asms;
   355         val ts' = map (norm_term env) ts;
   356         val spec' =
   357           if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
   358           else ((exts, exts'), (ints @ ts, ints' @ ts'));
   359       in (spec', (fold Term.add_frees ts' xs, env, defs)) end
   360   | eval_text ctxt _ (Defines defs) (spec, binds) =
   361       (spec, fold (bind_def ctxt o #1 o #2) defs binds)
   362   | eval_text _ _ (Notes _) text = text;
   363 
   364 fun closeup _ _ false elem = elem
   365   | closeup ctxt parms true elem =
   366       let
   367         fun close_frees t =
   368           let
   369             val rev_frees =
   370               Term.fold_aterms (fn Free (x, T) =>
   371                 if AList.defined (op =) parms x then I else insert (op =) (x, T) | _ => I) t [];
   372           in Term.list_all_free (rev rev_frees, t) end;
   373 
   374         fun no_binds [] = []
   375           | no_binds _ = error "Illegal term bindings in context element";
   376       in
   377         (case elem of
   378           Assumes asms => Assumes (asms |> map (fn (a, propps) =>
   379             (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
   380         | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
   381             (a, (close_frees (#2 (LocalDefs.cert_def ctxt t)), no_binds ps))))
   382         | e => e)
   383       end;
   384 
   385 fun finish_primitive parms _ (Fixes fixes) = Fixes (map (fn (binding, _, mx) =>
   386       let val x = Name.name_of binding
   387       in (binding, AList.lookup (op =) parms x, mx) end) fixes)
   388   | finish_primitive _ _ (Constrains _) = Constrains []
   389   | finish_primitive _ close (Assumes asms) = close (Assumes asms)
   390   | finish_primitive _ close (Defines defs) = close (Defines defs)
   391   | finish_primitive _ _ (Notes facts) = Notes facts;
   392 
   393 fun finish_inst ctxt parms do_close (loc, (prfx, inst)) text =
   394   let
   395     val thy = ProofContext.theory_of ctxt;
   396     val (parm_names, parm_types) = NewLocale.params_of thy loc |>
   397       map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
   398     val (asm, defs) = NewLocale.specification_of thy loc;
   399     val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst) ctxt;
   400     val asm' = Option.map (Morphism.term morph) asm;
   401     val defs' = map (Morphism.term morph) defs;
   402     val text' = text |>
   403       (if is_some asm
   404         then eval_text ctxt false (Assumes [(Attrib.no_binding, [(the asm', [])])])
   405         else I) |>
   406       (if not (null defs)
   407         then eval_text ctxt false (Defines (map (fn def => (Attrib.no_binding, (def, []))) defs'))
   408         else I)
   409 (* FIXME clone from new_locale.ML *)
   410   in ((loc, morph), text') end;
   411 
   412 fun finish_elem ctxt parms do_close elem text =
   413   let
   414     val elem' = finish_primitive parms (closeup ctxt parms do_close) elem;
   415     val text' = eval_text ctxt true elem' text;
   416   in (elem', text') end
   417   
   418 fun finish ctxt parms do_close insts elems text =
   419   let
   420     val (deps, text') = fold_map (finish_inst ctxt parms do_close) insts text;
   421     val (elems', text'') = fold_map (finish_elem ctxt parms do_close) elems text';
   422   in (deps, elems', text'') end;
   423 
   424 
   425 (** Process full context statement: instantiations + elements + conclusion **)
   426 
   427 (* Interleave incremental parsing and type inference over entire parsed stretch. *)
   428 
   429 local
   430 
   431 fun prep_full_context_statement parse_typ parse_prop parse_inst prep_vars prep_expr
   432     strict do_close context raw_import raw_elems raw_concl =
   433   let
   434     val thy = ProofContext.theory_of context;
   435 
   436     val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
   437 
   438     fun prep_inst (loc, (prfx, inst)) (i, marked, insts, ctxt) =
   439       let
   440         val (parm_names, parm_types) = NewLocale.params_of thy loc |>
   441           map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
   442         val inst' = parse_inst parm_names inst ctxt;
   443         val parm_types' = map (TypeInfer.paramify_vars o
   444           Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT) parm_types;
   445         val inst'' = map2 TypeInfer.constrain parm_types' inst';
   446         val insts' = insts @ [(loc, (prfx, inst''))];
   447         val (insts'', _, _, ctxt') = check_autofix insts' [] [] ctxt;
   448         val inst''' = insts'' |> List.last |> snd |> snd;
   449         val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst''') ctxt;
   450         val (marked', ctxt'') = NewLocale.activate_declarations thy (loc, morph) (marked, ctxt);
   451       in (i+1, marked', insts', ctxt'') end;
   452   
   453     fun prep_elem raw_elem (insts, elems, ctxt) =
   454       let
   455         val ctxt' = declare_elem prep_vars raw_elem ctxt;
   456         val elems' = elems @ [parse_elem parse_typ parse_prop ctxt' raw_elem];
   457         (* FIXME term bindings *)
   458         val (_, _, _, ctxt'') = check_autofix insts elems' [] ctxt';
   459       in (insts, elems', ctxt') end;
   460 
   461     fun prep_concl raw_concl (insts, elems, ctxt) =
   462       let
   463         val concl = (map o map) (fn (t, ps) =>
   464           (parse_prop ctxt t, map (parse_prop ctxt) ps)) raw_concl;
   465       in check_autofix insts elems concl ctxt end;
   466 
   467     val fors = prep_vars fixed context |> fst;
   468     val ctxt = context |> ProofContext.add_fixes_i fors |> snd;
   469     val (_, _, insts', ctxt') = fold prep_inst raw_insts (0, NewLocale.empty, [], ctxt);
   470     val (_, elems'', ctxt'') = fold prep_elem raw_elems (insts', [], ctxt');
   471     val (insts, elems, concl, ctxt) = prep_concl raw_concl (insts', elems'', ctxt'');
   472 
   473     (* Retrieve parameter types *)
   474     val xs = fold (fn Fixes fixes => (fn ps => ps @ map (Name.name_of o #1) fixes) |
   475       _ => fn ps => ps) (Fixes fors :: elems) [];
   476     val (Ts, ctxt') = fold_map ProofContext.inferred_param xs ctxt; 
   477     val parms = xs ~~ Ts;  (* params from expression and elements *)
   478 
   479     val Fixes fors' = finish_primitive parms I (Fixes fors);
   480     val (deps, elems', text) = finish ctxt' parms do_close insts elems ((([], []), ([], [])), ([], [], []));
   481     (* text has the following structure:
   482            (((exts, exts'), (ints, ints')), (xs, env, defs))
   483        where
   484          exts: external assumptions (terms in assumes elements)
   485          exts': dito, normalised wrt. env
   486          ints: internal assumptions (terms in assumptions from insts)
   487          ints': dito, normalised wrt. env
   488          xs: the free variables in exts' and ints' and rhss of definitions,
   489            this includes parameters except defined parameters
   490          env: list of term pairs encoding substitutions, where the first term
   491            is a free variable; substitutions represent defines elements and
   492            the rhs is normalised wrt. the previous env
   493          defs: theorems representing the substitutions from defines elements
   494            (thms are normalised wrt. env).
   495        elems is an updated version of raw_elems:
   496          - type info added to Fixes and modified in Constrains
   497          - axiom and definition statement replaced by corresponding one
   498            from proppss in Assumes and Defines
   499          - Facts unchanged
   500        *)
   501 
   502   in ((fors', deps, elems', concl), (parms, text)) end
   503 
   504 in
   505 
   506 fun read_full_context_statement x =
   507   prep_full_context_statement Syntax.parse_typ Syntax.parse_prop parse_inst
   508   ProofContext.read_vars intern x;
   509 fun cert_full_context_statement x =
   510   prep_full_context_statement (K I) (K I) make_inst ProofContext.cert_vars (K I) x;
   511 
   512 end;
   513 
   514 
   515 (* Context statement: elements + conclusion *)
   516 
   517 local
   518 
   519 fun prep_statement prep activate raw_elems raw_concl context =
   520   let
   521      val ((_, _, elems, concl), _) = prep true false context ([], []) raw_elems raw_concl;
   522      val (_, context') = activate elems (ProofContext.set_stmt true context);
   523   in (concl, context') end;
   524 
   525 in
   526 
   527 fun read_statement x = prep_statement read_full_context_statement Element.activate x;
   528 fun cert_statement x = prep_statement cert_full_context_statement Element.activate_i x;
   529 
   530 end;
   531 
   532 
   533 (* Locale declaration: import + elements *)
   534 
   535 local
   536 
   537 fun prep_declaration prep activate raw_import raw_elems context =
   538   let
   539     val thy = ProofContext.theory_of context;
   540 
   541     val ((fixed, deps, elems, _), (parms, (spec, (_, _, defs)))) =
   542       prep false true context raw_import raw_elems [];
   543     (* Declare parameters and imported facts *)
   544     val context' = context |>
   545       ProofContext.add_fixes_i fixed |> snd |>
   546       pair NewLocale.empty |> fold (NewLocale.activate_facts thy) deps |> snd;
   547     val ((elems', _), _) = activate elems (ProofContext.set_stmt true context');
   548   in ((fixed, deps, elems'), (parms, spec, defs)) end;
   549 
   550 in
   551 
   552 fun read_declaration x = prep_declaration read_full_context_statement Element.activate x;
   553 fun cert_declaration x = prep_declaration cert_full_context_statement Element.activate_i x;
   554 
   555 end;
   556 
   557 
   558 (* Locale expression to set up a goal *)
   559 
   560 local
   561 
   562 fun props_of thy (name, morph) =
   563   let
   564     val (asm, defs) = NewLocale.specification_of thy name;
   565   in
   566     (case asm of NONE => defs | SOME asm => asm :: defs) |> map (Morphism.term morph)
   567   end;
   568 
   569 fun prep_goal_expression prep expression context =
   570   let
   571     val thy = ProofContext.theory_of context;
   572 
   573     val ((fixed, deps, _, _), _) = prep true true context expression [] [];
   574     (* proof obligations *)
   575     val propss = map (props_of thy) deps;
   576 
   577     val goal_ctxt = context |>
   578       ProofContext.add_fixes_i fixed |> snd |>
   579       (fold o fold) Variable.auto_fixes propss;
   580 
   581     val export = Variable.export_morphism goal_ctxt context;
   582     val exp_fact = Drule.zero_var_indexes_list o map Thm.strip_shyps o Morphism.fact export;
   583 (*    val exp_term = TermSubst.zero_var_indexes o Morphism.term export; *)
   584     val exp_term = Drule.term_rule thy (singleton exp_fact);
   585     val exp_typ = Logic.type_map exp_term;
   586     val export' =
   587       Morphism.morphism {name = I, var = I, typ = exp_typ, term = exp_term, fact = exp_fact};
   588   in ((propss, deps, export'), goal_ctxt) end;
   589     
   590 in
   591 
   592 fun read_goal_expression x = prep_goal_expression read_full_context_statement x;
   593 fun cert_goal_expression x = prep_goal_expression cert_full_context_statement x;
   594 
   595 end;
   596 
   597 
   598 (*** Locale declarations ***)
   599 
   600 local
   601 
   602 (* introN: name of theorems for introduction rules of locale and
   603      delta predicates;
   604    axiomsN: name of theorem set with destruct rules for locale predicates,
   605      also name suffix of delta predicates. *)
   606 
   607 val introN = "intro";
   608 val axiomsN = "axioms";
   609 
   610 fun atomize_spec thy ts =
   611   let
   612     val t = Logic.mk_conjunction_balanced ts;
   613     val body = ObjectLogic.atomize_term thy t;
   614     val bodyT = Term.fastype_of body;
   615   in
   616     if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
   617     else (body, bodyT, ObjectLogic.atomize (Thm.cterm_of thy t))
   618   end;
   619 
   620 (* achieve plain syntax for locale predicates (without "PROP") *)
   621 
   622 fun aprop_tr' n c = (Syntax.constN ^ c, fn ctxt => fn args =>
   623   if length args = n then
   624     Syntax.const "_aprop" $
   625       Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
   626   else raise Match);
   627 
   628 (* define one predicate including its intro rule and axioms
   629    - bname: predicate name
   630    - parms: locale parameters
   631    - defs: thms representing substitutions from defines elements
   632    - ts: terms representing locale assumptions (not normalised wrt. defs)
   633    - norm_ts: terms representing locale assumptions (normalised wrt. defs)
   634    - thy: the theory
   635 *)
   636 
   637 fun def_pred bname parms defs ts norm_ts thy =
   638   let
   639     val name = Sign.full_name thy bname;
   640 
   641     val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
   642     val env = Term.add_term_free_names (body, []);
   643     val xs = filter (member (op =) env o #1) parms;
   644     val Ts = map #2 xs;
   645     val extraTs = (Term.term_tfrees body \\ fold Term.add_tfreesT Ts [])
   646       |> Library.sort_wrt #1 |> map TFree;
   647     val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
   648 
   649     val args = map Logic.mk_type extraTs @ map Free xs;
   650     val head = Term.list_comb (Const (name, predT), args);
   651     val statement = ObjectLogic.ensure_propT thy head;
   652 
   653     val ([pred_def], defs_thy) =
   654       thy
   655       |> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
   656       |> Sign.declare_const [] ((Name.binding bname, predT), NoSyn) |> snd
   657       |> PureThy.add_defs false
   658         [((Thm.def_name bname, Logic.mk_equals (head, body)), [Thm.kind_internal])];
   659     val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
   660 
   661     val cert = Thm.cterm_of defs_thy;
   662 
   663     val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
   664       MetaSimplifier.rewrite_goals_tac [pred_def] THEN
   665       Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
   666       Tactic.compose_tac (false,
   667         Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
   668 
   669     val conjuncts =
   670       (Drule.equal_elim_rule2 OF [body_eq,
   671         MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
   672       |> Conjunction.elim_balanced (length ts);
   673     val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
   674       Element.prove_witness defs_ctxt t
   675        (MetaSimplifier.rewrite_goals_tac defs THEN
   676         Tactic.compose_tac (false, ax, 0) 1));
   677   in ((statement, intro, axioms), defs_thy) end;
   678 
   679 in
   680 
   681 (* CB: main predicate definition function *)
   682 
   683 fun define_preds pname (parms, ((exts, exts'), (ints, ints')), defs) thy =
   684   let
   685     val (a_pred, a_intro, a_axioms, thy'') =
   686       if null exts then (NONE, NONE, [], thy)
   687       else
   688         let
   689           val aname = if null ints then pname else pname ^ "_" ^ axiomsN;
   690           val ((statement, intro, axioms), thy') =
   691             thy
   692             |> def_pred aname parms defs exts exts';
   693           val (_, thy'') =
   694             thy'
   695             |> Sign.add_path aname
   696             |> Sign.no_base_names
   697             |> PureThy.note_thmss Thm.internalK [((Name.binding introN, []), [([intro], [])])]
   698             ||> Sign.restore_naming thy';
   699           in (SOME statement, SOME intro, axioms, thy'') end;
   700     val (b_pred, b_intro, b_axioms, thy'''') =
   701       if null ints then (NONE, NONE, [], thy'')
   702       else
   703         let
   704           val ((statement, intro, axioms), thy''') =
   705             thy''
   706             |> def_pred pname parms defs (ints @ the_list a_pred) (ints' @ the_list a_pred);
   707           val (_, thy'''') =
   708             thy'''
   709             |> Sign.add_path pname
   710             |> Sign.no_base_names
   711             |> PureThy.note_thmss Thm.internalK
   712                  [((Name.binding introN, []), [([intro], [])]),
   713                   ((Name.binding axiomsN, []),
   714                     [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
   715             ||> Sign.restore_naming thy''';
   716         in (SOME statement, SOME intro, axioms, thy'''') end;
   717   in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
   718 
   719 end;
   720 
   721 
   722 local
   723 
   724 fun assumes_to_notes (Assumes asms) axms =
   725       fold_map (fn (a, spec) => fn axs =>
   726           let val (ps, qs) = chop (length spec) axs
   727           in ((a, [(ps, [])]), qs) end) asms axms
   728       |> apfst (curry Notes Thm.assumptionK)
   729   | assumes_to_notes e axms = (e, axms);
   730 
   731 fun defines_to_notes thy (Defines defs) defns =
   732     let
   733       val defs' = map (fn (_, (def, _)) => def) defs
   734       val notes = map (fn (a, (def, _)) =>
   735         (a, [([assume (cterm_of thy def)], [])])) defs
   736     in
   737       (Notes (Thm.definitionK, notes), defns @ defs')
   738     end
   739   | defines_to_notes _ e defns = (e, defns);
   740 
   741 fun gen_add_locale prep_decl
   742     bname predicate_name raw_imprt raw_body thy =
   743   let
   744     val thy_ctxt = ProofContext.init thy;
   745     val name = Sign.full_name thy bname;
   746     val _ = NewLocale.test_locale thy name andalso
   747       error ("Duplicate definition of locale " ^ quote name);
   748 
   749     val ((fixed, deps, body_elems), text as (parms, ((_, exts'), _), defs)) =
   750       prep_decl raw_imprt raw_body thy_ctxt;
   751     val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
   752       define_preds predicate_name text thy;
   753 
   754     val extraTs = fold Term.add_tfrees exts' [] \\ fold Term.add_tfreesT (map snd parms) [];
   755     val _ = if null extraTs then ()
   756       else warning ("Additional type variable(s) in locale specification " ^ quote bname);
   757 
   758     val satisfy = Element.satisfy_morphism b_axioms;
   759     val params = fixed @
   760       (body_elems |> map_filter (fn Fixes fixes => SOME fixes | _ => NONE) |> flat);
   761     val (body_elems', defns) = fold_map (defines_to_notes thy) body_elems [];
   762 
   763     val notes = body_elems' |>
   764       (fn elems => fold_map assumes_to_notes elems (map Element.conclude_witness a_axioms)) |>
   765       fst |> map (Element.morph_ctxt satisfy) |>
   766       map_filter (fn Notes notes => SOME notes | _ => NONE);
   767 
   768     val deps' = map (fn (l, morph) => (l, morph $> satisfy)) deps;
   769 
   770     val loc_ctxt = thy' |>
   771       NewLocale.register_locale name (extraTs, params)
   772         (if is_some b_statement then b_statement else a_statement, map prop_of defs) ([], [])
   773         (map (fn n => (n, stamp ())) notes |> rev) (map (fn d => (d, stamp ())) deps' |> rev) |>
   774       NewLocale.init name
   775   in (name, loc_ctxt) end;
   776 
   777 in
   778 
   779 val add_locale = gen_add_locale read_declaration;
   780 val add_locale_i = gen_add_locale cert_declaration;
   781 
   782 end;
   783 
   784 
   785 (*** Interpretation ***)
   786 
   787 (** Witnesses and goals **)
   788 
   789 fun prep_propp propss = propss |> map (map (rpair [] o Element.mark_witness));
   790 
   791 fun prep_result propps thmss =
   792   ListPair.map (fn (props, thms) => map2 Element.make_witness props thms) (propps, thmss);
   793 
   794 
   795 (** Interpretation between locales: declaring sublocale relationships **)
   796 
   797 local
   798 
   799 fun gen_sublocale prep_expr
   800     after_qed target expression thy =
   801   let
   802     val target_ctxt = NewLocale.init target thy;
   803     val target' = NewLocale.intern thy target;
   804 
   805     val ((propss, deps, export'), goal_ctxt) = prep_expr expression target_ctxt;
   806     
   807     fun store_dep target ((name, morph), thms) =
   808       NewLocale.add_dependency target (name, morph $> Element.satisfy_morphism thms $> export');
   809 
   810     fun after_qed' results =
   811       fold (store_dep target') (deps ~~ prep_result propss results) #>
   812       after_qed results;
   813 
   814   in
   815     goal_ctxt |>
   816       Proof.theorem_i NONE after_qed' (prep_propp propss) |>
   817       Element.refine_witness |> Seq.hd
   818   end;
   819 
   820 in
   821 
   822 fun sublocale x = gen_sublocale read_goal_expression x;
   823 fun sublocale_i x = gen_sublocale cert_goal_expression x;
   824 
   825 end;
   826 
   827 
   828 end;