src/Pure/Isar/expression.ML
author haftmann
Fri Jun 06 19:19:46 2014 +0200 (2014-06-06)
changeset 57181 2d13bf9ea77b
parent 56809 b60009672a65
child 57860 bcc243ea48e7
permissions -rw-r--r--
dropped obscure and unused ad-hoc before_exit hook for named targets
     1 (*  Title:      Pure/Isar/expression.ML
     2     Author:     Clemens Ballarin, TU Muenchen
     3 
     4 Locale expressions and user interface layer of locales.
     5 *)
     6 
     7 signature EXPRESSION =
     8 sig
     9   (* Locale expressions *)
    10   datatype 'term map = Positional of 'term option list | Named of (string * 'term) list
    11   type ('name, 'term) expr = ('name * ((string * bool) * 'term map)) list
    12   type expression_i = (string, term) expr * (binding * typ option * mixfix) list
    13   type expression = (xstring * Position.T, string) expr * (binding * string option * mixfix) list
    14 
    15   (* Processing of context statements *)
    16   val cert_statement: Element.context_i list -> (term * term list) list list ->
    17     Proof.context -> (term * term list) list list * Proof.context
    18   val read_statement: Element.context list -> (string * string list) list list ->
    19     Proof.context -> (term * term list) list list * Proof.context
    20 
    21   (* Declaring locales *)
    22   val cert_declaration: expression_i -> (Proof.context -> Proof.context) ->
    23     Element.context_i list ->
    24     Proof.context -> (((string * typ) * mixfix) list * (string * morphism) list
    25       * Element.context_i list * Proof.context) * ((string * typ) list * Proof.context)
    26   val cert_read_declaration: expression_i -> (Proof.context -> Proof.context) ->
    27     Element.context list ->
    28     Proof.context -> (((string * typ) * mixfix) list * (string * morphism) list
    29       * Element.context_i list * Proof.context) * ((string * typ) list * Proof.context)
    30       (*FIXME*)
    31   val read_declaration: expression -> (Proof.context -> Proof.context) -> Element.context list ->
    32     Proof.context -> (((string * typ) * mixfix) list * (string * morphism) list
    33       * Element.context_i list * Proof.context) * ((string * typ) list * Proof.context)
    34   val add_locale: binding -> binding ->
    35     expression_i -> Element.context_i list -> theory -> string * local_theory
    36   val add_locale_cmd: binding -> binding ->
    37     expression -> Element.context list -> theory -> string * local_theory
    38 
    39   (* Interpretation *)
    40   val cert_goal_expression: expression_i -> Proof.context ->
    41     (term list list * (string * morphism) list * morphism) * Proof.context
    42   val read_goal_expression: expression -> Proof.context ->
    43     (term list list * (string * morphism) list * morphism) * Proof.context
    44   val permanent_interpretation: expression_i -> (Attrib.binding * term) list ->
    45     local_theory -> Proof.state
    46   val ephemeral_interpretation: expression_i -> (Attrib.binding * term) list ->
    47     local_theory -> Proof.state
    48   val interpret: expression_i -> (Attrib.binding * term) list -> bool -> Proof.state -> Proof.state
    49   val interpret_cmd: expression -> (Attrib.binding * string) list ->
    50     bool -> Proof.state -> Proof.state
    51   val interpretation: expression_i -> (Attrib.binding * term) list -> local_theory -> Proof.state
    52   val interpretation_cmd: expression -> (Attrib.binding * string) list ->
    53     local_theory -> Proof.state
    54   val sublocale: expression_i -> (Attrib.binding * term) list -> local_theory -> Proof.state
    55   val sublocale_cmd: expression -> (Attrib.binding * string) list -> local_theory -> Proof.state
    56   val sublocale_global: string -> expression_i ->
    57     (Attrib.binding * term) list -> theory -> Proof.state
    58   val sublocale_global_cmd: xstring * Position.T -> expression ->
    59     (Attrib.binding * string) list -> theory -> Proof.state
    60 
    61   (* Diagnostic *)
    62   val print_dependencies: Proof.context -> bool -> expression -> unit
    63 end;
    64 
    65 structure Expression : EXPRESSION =
    66 struct
    67 
    68 datatype ctxt = datatype Element.ctxt;
    69 
    70 
    71 (*** Expressions ***)
    72 
    73 datatype 'term map =
    74   Positional of 'term option list |
    75   Named of (string * 'term) list;
    76 
    77 type ('name, 'term) expr = ('name * ((string * bool) * 'term map)) list;
    78 
    79 type expression_i = (string, term) expr * (binding * typ option * mixfix) list;
    80 type expression = (xstring * Position.T, string) expr * (binding * string option * mixfix) list;
    81 
    82 
    83 (** Internalise locale names in expr **)
    84 
    85 fun check_expr thy instances = map (apfst (Locale.check thy)) instances;
    86 
    87 
    88 (** Parameters of expression **)
    89 
    90 (*Sanity check of instantiations and extraction of implicit parameters.
    91   The latter only occurs iff strict = false.
    92   Positional instantiations are extended to match full length of parameter list
    93   of instantiated locale.*)
    94 
    95 fun parameters_of thy strict (expr, fixed) =
    96   let
    97     val ctxt = Proof_Context.init_global thy;
    98 
    99     fun reject_dups message xs =
   100       (case duplicates (op =) xs of
   101         [] => ()
   102       | dups => error (message ^ commas dups));
   103 
   104     fun parm_eq ((p1: string, mx1: mixfix), (p2, mx2)) = p1 = p2 andalso
   105       (mx1 = mx2 orelse error ("Conflicting syntax for parameter " ^ quote p1 ^ " in expression"));
   106 
   107     fun params_loc loc = Locale.params_of thy loc |> map (apfst #1);
   108     fun params_inst (loc, (prfx, Positional insts)) =
   109           let
   110             val ps = params_loc loc;
   111             val d = length ps - length insts;
   112             val insts' =
   113               if d < 0 then
   114                 error ("More arguments than parameters in instantiation of locale " ^
   115                   quote (Locale.markup_name ctxt loc))
   116               else insts @ replicate d NONE;
   117             val ps' = (ps ~~ insts') |>
   118               map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
   119           in (ps', (loc, (prfx, Positional insts'))) end
   120       | params_inst (loc, (prfx, Named insts)) =
   121           let
   122             val _ =
   123               reject_dups "Duplicate instantiation of the following parameter(s): "
   124                 (map fst insts);
   125             val ps' = (insts, params_loc loc) |-> fold (fn (p, _) => fn ps =>
   126               if AList.defined (op =) ps p then AList.delete (op =) p ps
   127               else error (quote p ^ " not a parameter of instantiated expression"));
   128           in (ps', (loc, (prfx, Named insts))) end;
   129     fun params_expr is =
   130       let
   131         val (is', ps') = fold_map (fn i => fn ps =>
   132           let
   133             val (ps', i') = params_inst i;
   134             val ps'' = distinct parm_eq (ps @ ps');
   135           in (i', ps'') end) is []
   136       in (ps', is') end;
   137 
   138     val (implicit, expr') = params_expr expr;
   139 
   140     val implicit' = map #1 implicit;
   141     val fixed' = map (Variable.check_name o #1) fixed;
   142     val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
   143     val implicit'' =
   144       if strict then []
   145       else
   146         let
   147           val _ =
   148             reject_dups
   149               "Parameter(s) declared simultaneously in expression and for clause: "
   150               (implicit' @ fixed');
   151         in map (fn (x, mx) => (Binding.name x, NONE, mx)) implicit end;
   152 
   153   in (expr', implicit'' @ fixed) end;
   154 
   155 
   156 (** Read instantiation **)
   157 
   158 (* Parse positional or named instantiation *)
   159 
   160 local
   161 
   162 fun prep_inst prep_term ctxt parms (Positional insts) =
   163       (insts ~~ parms) |> map
   164         (fn (NONE, p) => Free (p, dummyT)
   165           | (SOME t, _) => prep_term ctxt t)
   166   | prep_inst prep_term ctxt parms (Named insts) =
   167       parms |> map (fn p =>
   168         (case AList.lookup (op =) insts p of
   169           SOME t => prep_term ctxt t |
   170           NONE => Free (p, dummyT)));
   171 
   172 in
   173 
   174 fun parse_inst x = prep_inst Syntax.parse_term x;
   175 fun make_inst x = prep_inst (K I) x;
   176 
   177 end;
   178 
   179 
   180 (* Instantiation morphism *)
   181 
   182 fun inst_morphism (parm_names, parm_types) ((prfx, mandatory), insts') ctxt =
   183   let
   184     (* parameters *)
   185     val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
   186 
   187     (* type inference and contexts *)
   188     val parm_types' = map (Type_Infer.paramify_vars o Logic.varifyT_global) parm_types;
   189     val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
   190     val arg = type_parms @ map2 Type.constraint parm_types' insts';
   191     val res = Syntax.check_terms ctxt arg;
   192     val ctxt' = ctxt |> fold Variable.auto_fixes res;
   193 
   194     (* instantiation *)
   195     val (type_parms'', res') = chop (length type_parms) res;
   196     val insts'' = (parm_names ~~ res') |> map_filter
   197       (fn inst as (x, Free (y, _)) => if x = y then NONE else SOME inst
   198         | inst => SOME inst);
   199     val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
   200     val inst = Symtab.make insts'';
   201   in
   202     (Element.inst_morphism (Proof_Context.theory_of ctxt) (instT, inst) $>
   203       Morphism.binding_morphism "Expression.inst" (Binding.prefix mandatory prfx), ctxt')
   204   end;
   205 
   206 
   207 (*** Locale processing ***)
   208 
   209 (** Parsing **)
   210 
   211 fun parse_elem prep_typ prep_term ctxt =
   212   Element.map_ctxt
   213    {binding = I,
   214     typ = prep_typ ctxt,
   215     term = prep_term (Proof_Context.set_mode Proof_Context.mode_schematic ctxt),
   216     pattern = prep_term (Proof_Context.set_mode Proof_Context.mode_pattern ctxt),
   217     fact = I,
   218     attrib = I};
   219 
   220 fun parse_concl prep_term ctxt concl =
   221   (map o map) (fn (t, ps) =>
   222     (prep_term (Proof_Context.set_mode Proof_Context.mode_schematic ctxt) t,
   223       map (prep_term (Proof_Context.set_mode Proof_Context.mode_pattern ctxt)) ps)) concl;
   224 
   225 
   226 (** Simultaneous type inference: instantiations + elements + conclusion **)
   227 
   228 local
   229 
   230 fun mk_type T = (Logic.mk_type T, []);
   231 fun mk_term t = (t, []);
   232 fun mk_propp (p, pats) = (Type.constraint propT p, pats);
   233 
   234 fun dest_type (T, []) = Logic.dest_type T;
   235 fun dest_term (t, []) = t;
   236 fun dest_propp (p, pats) = (p, pats);
   237 
   238 fun extract_inst (_, (_, ts)) = map mk_term ts;
   239 fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
   240 
   241 fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
   242   | extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
   243   | extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
   244   | extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
   245   | extract_elem (Notes _) = [];
   246 
   247 fun restore_elem (Fixes fixes, css) =
   248       (fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
   249         (x, cs |> map dest_type |> try hd, mx)) |> Fixes
   250   | restore_elem (Constrains csts, css) =
   251       (csts ~~ css) |> map (fn ((x, _), cs) =>
   252         (x, cs |> map dest_type |> hd)) |> Constrains
   253   | restore_elem (Assumes asms, css) =
   254       (asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
   255   | restore_elem (Defines defs, css) =
   256       (defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
   257   | restore_elem (Notes notes, _) = Notes notes;
   258 
   259 fun check cs context =
   260   let
   261     fun prep (_, pats) (ctxt, t :: ts) =
   262       let val ctxt' = Variable.auto_fixes t ctxt
   263       in
   264         ((t, Syntax.check_props (Proof_Context.set_mode Proof_Context.mode_pattern ctxt') pats),
   265           (ctxt', ts))
   266       end;
   267     val (cs', (context', _)) = fold_map prep cs
   268       (context, Syntax.check_terms
   269         (Proof_Context.set_mode Proof_Context.mode_schematic context) (map fst cs));
   270   in (cs', context') end;
   271 
   272 in
   273 
   274 fun check_autofix insts elems concl ctxt =
   275   let
   276     val inst_cs = map extract_inst insts;
   277     val elem_css = map extract_elem elems;
   278     val concl_cs = (map o map) mk_propp concl;
   279     (* Type inference *)
   280     val (inst_cs' :: css', ctxt') =
   281       (fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
   282     val (elem_css', [concl_cs']) = chop (length elem_css) css';
   283   in
   284     (map restore_inst (insts ~~ inst_cs'),
   285       map restore_elem (elems ~~ elem_css'),
   286       concl_cs', ctxt')
   287   end;
   288 
   289 end;
   290 
   291 
   292 (** Prepare locale elements **)
   293 
   294 fun declare_elem prep_vars (Fixes fixes) ctxt =
   295       let val (vars, _) = prep_vars fixes ctxt
   296       in ctxt |> Proof_Context.add_fixes vars |> snd end
   297   | declare_elem prep_vars (Constrains csts) ctxt =
   298       ctxt |> prep_vars (map (fn (x, T) => (Binding.name x, SOME T, NoSyn)) csts) |> snd
   299   | declare_elem _ (Assumes _) ctxt = ctxt
   300   | declare_elem _ (Defines _) ctxt = ctxt
   301   | declare_elem _ (Notes _) ctxt = ctxt;
   302 
   303 
   304 (** Finish locale elements **)
   305 
   306 fun finish_inst ctxt (loc, (prfx, inst)) =
   307   let
   308     val thy = Proof_Context.theory_of ctxt;
   309     val (parm_names, parm_types) = Locale.params_of thy loc |> map #1 |> split_list;
   310     val (morph, _) = inst_morphism (parm_names, parm_types) (prfx, inst) ctxt;
   311   in (loc, morph) end;
   312 
   313 fun finish_fixes (parms: (string * typ) list) = map (fn (binding, _, mx) =>
   314   let val x = Binding.name_of binding
   315   in (binding, AList.lookup (op =) parms x, mx) end);
   316 
   317 local
   318 
   319 fun closeup _ _ false elem = elem
   320   | closeup (outer_ctxt, ctxt) parms true elem =
   321       let
   322         (* FIXME consider closing in syntactic phase -- before type checking *)
   323         fun close_frees t =
   324           let
   325             val rev_frees =
   326               Term.fold_aterms (fn Free (x, T) =>
   327                 if Variable.is_fixed outer_ctxt x orelse AList.defined (op =) parms x then I
   328                 else insert (op =) (x, T) | _ => I) t [];
   329           in fold (Logic.all o Free) rev_frees t end;
   330 
   331         fun no_binds [] = []
   332           | no_binds _ = error "Illegal term bindings in context element";
   333       in
   334         (case elem of
   335           Assumes asms => Assumes (asms |> map (fn (a, propps) =>
   336             (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
   337         | Defines defs => Defines (defs |> map (fn ((name, atts), (t, ps)) =>
   338             let val ((c, _), t') = Local_Defs.cert_def ctxt (close_frees t)
   339             in ((Thm.def_binding_optional (Binding.name c) name, atts), (t', no_binds ps)) end))
   340         | e => e)
   341       end;
   342 
   343 in
   344 
   345 fun finish_elem _ parms _ (Fixes fixes) = Fixes (finish_fixes parms fixes)
   346   | finish_elem _ _ _ (Constrains _) = Constrains []
   347   | finish_elem ctxts parms do_close (Assumes asms) = closeup ctxts parms do_close (Assumes asms)
   348   | finish_elem ctxts parms do_close (Defines defs) = closeup ctxts parms do_close (Defines defs)
   349   | finish_elem _ _ _ (Notes facts) = Notes facts;
   350 
   351 end;
   352 
   353 
   354 (** Process full context statement: instantiations + elements + conclusion **)
   355 
   356 (* Interleave incremental parsing and type inference over entire parsed stretch. *)
   357 
   358 local
   359 
   360 fun prep_full_context_statement
   361     parse_typ parse_prop prep_vars_elem prep_inst prep_vars_inst prep_expr
   362     {strict, do_close, fixed_frees} raw_import init_body raw_elems raw_concl ctxt1 =
   363   let
   364     val thy = Proof_Context.theory_of ctxt1;
   365 
   366     val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
   367 
   368     fun prep_insts_cumulative (loc, (prfx, inst)) (i, insts, ctxt) =
   369       let
   370         val (parm_names, parm_types) = Locale.params_of thy loc |> map #1 |> split_list;
   371         val inst' = prep_inst ctxt parm_names inst;
   372         val parm_types' = parm_types
   373           |> map (Type_Infer.paramify_vars o
   374               Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT_global);
   375         val inst'' = map2 Type.constraint parm_types' inst';
   376         val insts' = insts @ [(loc, (prfx, inst''))];
   377         val (insts'', _, _, _) = check_autofix insts' [] [] ctxt;
   378         val inst''' = insts'' |> List.last |> snd |> snd;
   379         val (morph, _) = inst_morphism (parm_names, parm_types) (prfx, inst''') ctxt;
   380         val ctxt'' = Locale.activate_declarations (loc, morph) ctxt;
   381       in (i + 1, insts', ctxt'') end;
   382 
   383     fun prep_elem raw_elem ctxt =
   384       let
   385         val ctxt' = ctxt
   386           |> Context_Position.set_visible false
   387           |> declare_elem prep_vars_elem raw_elem
   388           |> Context_Position.restore_visible ctxt;
   389         val elems' = parse_elem parse_typ parse_prop ctxt' raw_elem;
   390       in (elems', ctxt') end;
   391 
   392     fun prep_concl raw_concl (insts, elems, ctxt) =
   393       let
   394         val concl = parse_concl parse_prop ctxt raw_concl;
   395       in check_autofix insts elems concl ctxt end;
   396 
   397     val fors = prep_vars_inst fixed ctxt1 |> fst;
   398     val ctxt2 = ctxt1 |> Proof_Context.add_fixes fors |> snd;
   399     val (_, insts', ctxt3) = fold prep_insts_cumulative raw_insts (0, [], ctxt2);
   400 
   401     val _ =
   402       if fixed_frees then ()
   403       else
   404         (case fold (fold (Variable.add_frees ctxt3) o snd o snd) insts' [] of
   405           [] => ()
   406         | frees => error ("Illegal free variables in expression: " ^
   407             commas_quote (map (Syntax.string_of_term ctxt3 o Free) (rev frees))));
   408 
   409     val ctxt4 = init_body ctxt3;
   410     val (elems, ctxt5) = fold_map prep_elem raw_elems ctxt4;
   411     val (insts, elems', concl, ctxt6) = prep_concl raw_concl (insts', elems, ctxt5);
   412 
   413     (* Retrieve parameter types *)
   414     val xs = maps (fn Fixes fixes => map (Variable.check_name o #1) fixes | _ => [])
   415       (Fixes fors :: elems');
   416     val (Ts, ctxt7) = fold_map Proof_Context.inferred_param xs ctxt6;
   417     val parms = xs ~~ Ts;  (* params from expression and elements *)
   418 
   419     val fors' = finish_fixes parms fors;
   420     val fixed = map (fn (b, SOME T, mx) => ((Binding.name_of b, T), mx)) fors';
   421     val deps = map (finish_inst ctxt6) insts;
   422     val elems'' = map (finish_elem (ctxt1, ctxt6) parms do_close) elems';
   423 
   424   in ((fixed, deps, elems'', concl), (parms, ctxt7)) end;
   425 
   426 in
   427 
   428 fun cert_full_context_statement x =
   429   prep_full_context_statement (K I) (K I) Proof_Context.cert_vars
   430   make_inst Proof_Context.cert_vars (K I) x;
   431 
   432 fun cert_read_full_context_statement x =
   433   prep_full_context_statement Syntax.parse_typ Syntax.parse_prop Proof_Context.read_vars
   434   make_inst Proof_Context.cert_vars (K I) x;
   435 
   436 fun read_full_context_statement x =
   437   prep_full_context_statement Syntax.parse_typ Syntax.parse_prop Proof_Context.read_vars
   438   parse_inst Proof_Context.read_vars check_expr x;
   439 
   440 end;
   441 
   442 
   443 (* Context statement: elements + conclusion *)
   444 
   445 local
   446 
   447 fun prep_statement prep activate raw_elems raw_concl context =
   448   let
   449     val ((_, _, elems, concl), _) =
   450       prep {strict = true, do_close = false, fixed_frees = true}
   451         ([], []) I raw_elems raw_concl context;
   452     val (_, context') = context
   453       |> Proof_Context.set_stmt true
   454       |> fold_map activate elems;
   455   in (concl, context') end;
   456 
   457 in
   458 
   459 fun cert_statement x = prep_statement cert_full_context_statement Element.activate_i x;
   460 fun read_statement x = prep_statement read_full_context_statement Element.activate x;
   461 
   462 end;
   463 
   464 
   465 (* Locale declaration: import + elements *)
   466 
   467 fun fix_params params =
   468   Proof_Context.add_fixes (map (fn ((x, T), mx) => (Binding.name x, SOME T, mx)) params) #> snd;
   469 
   470 local
   471 
   472 fun prep_declaration prep activate raw_import init_body raw_elems context =
   473   let
   474     val ((fixed, deps, elems, _), (parms, ctxt')) =
   475       prep {strict = false, do_close = true, fixed_frees = false}
   476         raw_import init_body raw_elems [] context;
   477     (* Declare parameters and imported facts *)
   478     val context' = context |>
   479       fix_params fixed |>
   480       fold (Context.proof_map o Locale.activate_facts NONE) deps;
   481     val (elems', context'') = context' |>
   482       Proof_Context.set_stmt true |>
   483       fold_map activate elems;
   484   in ((fixed, deps, elems', context''), (parms, ctxt')) end;
   485 
   486 in
   487 
   488 fun cert_declaration x = prep_declaration cert_full_context_statement Element.activate_i x;
   489 fun cert_read_declaration x = prep_declaration cert_read_full_context_statement Element.activate x;
   490 fun read_declaration x = prep_declaration read_full_context_statement Element.activate x;
   491 
   492 end;
   493 
   494 
   495 (* Locale expression to set up a goal *)
   496 
   497 local
   498 
   499 fun props_of thy (name, morph) =
   500   let
   501     val (asm, defs) = Locale.specification_of thy name;
   502   in
   503     (case asm of NONE => defs | SOME asm => asm :: defs)
   504     |> map (Morphism.term morph)
   505   end;
   506 
   507 fun prep_goal_expression prep expression context =
   508   let
   509     val thy = Proof_Context.theory_of context;
   510 
   511     val ((fixed, deps, _, _), _) =
   512       prep {strict = true, do_close = true, fixed_frees = true} expression I [] [] context;
   513     (* proof obligations *)
   514     val propss = map (props_of thy) deps;
   515 
   516     val goal_ctxt = context |>
   517       fix_params fixed |>
   518       (fold o fold) Variable.auto_fixes propss;
   519 
   520     val export = Variable.export_morphism goal_ctxt context;
   521     val exp_fact = Drule.zero_var_indexes_list o map Thm.strip_shyps o Morphism.fact export;
   522     val exp_term = Term_Subst.zero_var_indexes o Morphism.term export;
   523     val exp_typ = Logic.type_map exp_term;
   524     val export' =
   525       Morphism.morphism "Expression.prep_goal"
   526         {binding = [], typ = [exp_typ], term = [exp_term], fact = [exp_fact]};
   527   in ((propss, deps, export'), goal_ctxt) end;
   528 
   529 in
   530 
   531 fun cert_goal_expression x = prep_goal_expression cert_full_context_statement x;
   532 fun read_goal_expression x = prep_goal_expression read_full_context_statement x;
   533 
   534 end;
   535 
   536 
   537 (*** Locale declarations ***)
   538 
   539 (* extract specification text *)
   540 
   541 val norm_term = Envir.beta_norm oo Term.subst_atomic;
   542 
   543 fun bind_def ctxt eq (xs, env, eqs) =
   544   let
   545     val _ = Local_Defs.cert_def ctxt eq;
   546     val ((y, T), b) = Local_Defs.abs_def eq;
   547     val b' = norm_term env b;
   548     fun err msg = error (msg ^ ": " ^ quote y);
   549   in
   550     (case filter (fn (Free (y', _), _) => y = y' | _ => false) env of
   551       [] => (Term.add_frees b' xs, (Free (y, T), b') :: env, eq :: eqs)
   552     | dups =>
   553         if forall (fn (_, b'') => b' aconv b'') dups then (xs, env, eqs)
   554         else err "Attempt to redefine variable")
   555   end;
   556 
   557 (* text has the following structure:
   558        (((exts, exts'), (ints, ints')), (xs, env, defs))
   559    where
   560      exts: external assumptions (terms in assumes elements)
   561      exts': dito, normalised wrt. env
   562      ints: internal assumptions (terms in assumptions from insts)
   563      ints': dito, normalised wrt. env
   564      xs: the free variables in exts' and ints' and rhss of definitions,
   565        this includes parameters except defined parameters
   566      env: list of term pairs encoding substitutions, where the first term
   567        is a free variable; substitutions represent defines elements and
   568        the rhs is normalised wrt. the previous env
   569      defs: the equations from the defines elements
   570    *)
   571 
   572 fun eval_text _ _ (Fixes _) text = text
   573   | eval_text _ _ (Constrains _) text = text
   574   | eval_text _ is_ext (Assumes asms)
   575         (((exts, exts'), (ints, ints')), (xs, env, defs)) =
   576       let
   577         val ts = maps (map #1 o #2) asms;
   578         val ts' = map (norm_term env) ts;
   579         val spec' =
   580           if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
   581           else ((exts, exts'), (ints @ ts, ints' @ ts'));
   582       in (spec', (fold Term.add_frees ts' xs, env, defs)) end
   583   | eval_text ctxt _ (Defines defs) (spec, binds) =
   584       (spec, fold (bind_def ctxt o #1 o #2) defs binds)
   585   | eval_text _ _ (Notes _) text = text;
   586 
   587 fun eval_inst ctxt (loc, morph) text =
   588   let
   589     val thy = Proof_Context.theory_of ctxt;
   590     val (asm, defs) = Locale.specification_of thy loc;
   591     val asm' = Option.map (Morphism.term morph) asm;
   592     val defs' = map (Morphism.term morph) defs;
   593     val text' =
   594       text |>
   595        (if is_some asm then
   596           eval_text ctxt false (Assumes [(Attrib.empty_binding, [(the asm', [])])])
   597         else I) |>
   598        (if not (null defs) then
   599           eval_text ctxt false (Defines (map (fn def => (Attrib.empty_binding, (def, []))) defs'))
   600         else I)
   601 (* FIXME clone from locale.ML *)
   602   in text' end;
   603 
   604 fun eval_elem ctxt elem text =
   605   eval_text ctxt true elem text;
   606 
   607 fun eval ctxt deps elems =
   608   let
   609     val text' = fold (eval_inst ctxt) deps ((([], []), ([], [])), ([], [], []));
   610     val ((spec, (_, _, defs))) = fold (eval_elem ctxt) elems text';
   611   in (spec, defs) end;
   612 
   613 (* axiomsN: name of theorem set with destruct rules for locale predicates,
   614      also name suffix of delta predicates and assumptions. *)
   615 
   616 val axiomsN = "axioms";
   617 
   618 local
   619 
   620 (* introN: name of theorems for introduction rules of locale and
   621      delta predicates *)
   622 
   623 val introN = "intro";
   624 
   625 fun atomize_spec thy ts =
   626   let
   627     val t = Logic.mk_conjunction_balanced ts;
   628     val body = Object_Logic.atomize_term thy t;
   629     val bodyT = Term.fastype_of body;
   630   in
   631     if bodyT = propT
   632     then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
   633     else (body, bodyT, Object_Logic.atomize (Proof_Context.init_global thy) (Thm.cterm_of thy t))
   634   end;
   635 
   636 (* achieve plain syntax for locale predicates (without "PROP") *)
   637 
   638 fun aprop_tr' n c =
   639   let
   640     val c' = Lexicon.mark_const c;
   641     fun tr' (_: Proof.context) T args =
   642       if T <> dummyT andalso length args = n
   643       then Syntax.const "_aprop" $ Term.list_comb (Syntax.const c', args)
   644       else raise Match;
   645   in (c', tr') end;
   646 
   647 (* define one predicate including its intro rule and axioms
   648    - binding: predicate name
   649    - parms: locale parameters
   650    - defs: thms representing substitutions from defines elements
   651    - ts: terms representing locale assumptions (not normalised wrt. defs)
   652    - norm_ts: terms representing locale assumptions (normalised wrt. defs)
   653    - thy: the theory
   654 *)
   655 
   656 fun def_pred binding parms defs ts norm_ts thy =
   657   let
   658     val name = Sign.full_name thy binding;
   659 
   660     val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
   661     val env = Term.add_free_names body [];
   662     val xs = filter (member (op =) env o #1) parms;
   663     val Ts = map #2 xs;
   664     val extraTs =
   665       (subtract (op =) (fold Term.add_tfreesT Ts []) (Term.add_tfrees body []))
   666       |> Library.sort_wrt #1 |> map TFree;
   667     val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
   668 
   669     val args = map Logic.mk_type extraTs @ map Free xs;
   670     val head = Term.list_comb (Const (name, predT), args);
   671     val statement = Object_Logic.ensure_propT thy head;
   672 
   673     val ([pred_def], defs_thy) =
   674       thy
   675       |> bodyT = propT ? Sign.typed_print_translation [aprop_tr' (length args) name]
   676       |> Sign.declare_const_global ((Binding.conceal binding, predT), NoSyn) |> snd
   677       |> Global_Theory.add_defs false
   678         [((Binding.conceal (Thm.def_binding binding), Logic.mk_equals (head, body)), [])];
   679     val defs_ctxt = Proof_Context.init_global defs_thy |> Variable.declare_term head;
   680 
   681     val cert = Thm.cterm_of defs_thy;
   682 
   683     val intro = Goal.prove_global defs_thy [] norm_ts statement
   684       (fn {context = ctxt, ...} =>
   685         rewrite_goals_tac ctxt [pred_def] THEN
   686         compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
   687         compose_tac (false, Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
   688 
   689     val conjuncts =
   690       (Drule.equal_elim_rule2 OF
   691         [body_eq, rewrite_rule defs_ctxt [pred_def] (Thm.assume (cert statement))])
   692       |> Conjunction.elim_balanced (length ts);
   693 
   694     val (_, axioms_ctxt) = defs_ctxt
   695       |> Assumption.add_assumes (maps (#hyps o Thm.crep_thm) (defs @ conjuncts));
   696     val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
   697       Element.prove_witness axioms_ctxt t
   698        (rewrite_goals_tac axioms_ctxt defs THEN compose_tac (false, ax, 0) 1));
   699   in ((statement, intro, axioms), defs_thy) end;
   700 
   701 in
   702 
   703 (* main predicate definition function *)
   704 
   705 fun define_preds binding parms (((exts, exts'), (ints, ints')), defs) thy =
   706   let
   707     val ctxt = Proof_Context.init_global thy;
   708     val defs' = map (cterm_of thy #> Assumption.assume ctxt #> Drule.abs_def) defs;
   709 
   710     val (a_pred, a_intro, a_axioms, thy'') =
   711       if null exts then (NONE, NONE, [], thy)
   712       else
   713         let
   714           val abinding =
   715             if null ints then binding else Binding.suffix_name ("_" ^ axiomsN) binding;
   716           val ((statement, intro, axioms), thy') =
   717             thy
   718             |> def_pred abinding parms defs' exts exts';
   719           val (_, thy'') =
   720             thy'
   721             |> Sign.qualified_path true abinding
   722             |> Global_Theory.note_thmss ""
   723               [((Binding.conceal (Binding.name introN), []), [([intro], [Locale.unfold_add])])]
   724             ||> Sign.restore_naming thy';
   725           in (SOME statement, SOME intro, axioms, thy'') end;
   726     val (b_pred, b_intro, b_axioms, thy'''') =
   727       if null ints then (NONE, NONE, [], thy'')
   728       else
   729         let
   730           val ((statement, intro, axioms), thy''') =
   731             thy''
   732             |> def_pred binding parms defs' (ints @ the_list a_pred) (ints' @ the_list a_pred);
   733           val ctxt''' = Proof_Context.init_global thy''';
   734           val (_, thy'''') =
   735             thy'''
   736             |> Sign.qualified_path true binding
   737             |> Global_Theory.note_thmss ""
   738                  [((Binding.conceal (Binding.name introN), []), [([intro], [Locale.intro_add])]),
   739                   ((Binding.conceal (Binding.name axiomsN), []),
   740                     [(map (Drule.export_without_context o Element.conclude_witness ctxt''') axioms,
   741                       [])])]
   742             ||> Sign.restore_naming thy''';
   743         in (SOME statement, SOME intro, axioms, thy'''') end;
   744   in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
   745 
   746 end;
   747 
   748 
   749 local
   750 
   751 fun assumes_to_notes (Assumes asms) axms =
   752       fold_map (fn (a, spec) => fn axs =>
   753           let val (ps, qs) = chop (length spec) axs
   754           in ((a, [(ps, [])]), qs) end) asms axms
   755       |> apfst (curry Notes "")
   756   | assumes_to_notes e axms = (e, axms);
   757 
   758 fun defines_to_notes ctxt (Defines defs) =
   759       Notes ("", map (fn (a, (def, _)) =>
   760         (a, [([Assumption.assume ctxt (cterm_of (Proof_Context.theory_of ctxt) def)],
   761           [(Attrib.internal o K) Locale.witness_add])])) defs)
   762   | defines_to_notes _ e = e;
   763 
   764 fun gen_add_locale prep_decl
   765     binding raw_predicate_binding raw_import raw_body thy =
   766   let
   767     val name = Sign.full_name thy binding;
   768     val _ = Locale.defined thy name andalso
   769       error ("Duplicate definition of locale " ^ quote name);
   770 
   771     val ((fixed, deps, body_elems, _), (parms, ctxt')) =
   772       prep_decl raw_import I raw_body (Proof_Context.init_global thy);
   773     val text as (((_, exts'), _), defs) = eval ctxt' deps body_elems;
   774 
   775     val extraTs =
   776       subtract (op =)
   777         (fold Term.add_tfreesT (map snd parms) [])
   778         (fold Term.add_tfrees exts' []);
   779     val _ =
   780       if null extraTs then ()
   781       else warning ("Additional type variable(s) in locale specification " ^
   782           Binding.print binding ^ ": " ^
   783           commas (map (Syntax.string_of_typ ctxt' o TFree) (sort_wrt #1 extraTs)));
   784 
   785     val predicate_binding =
   786       if Binding.is_empty raw_predicate_binding then binding
   787       else raw_predicate_binding;
   788     val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
   789       define_preds predicate_binding parms text thy;
   790     val pred_ctxt = Proof_Context.init_global thy';
   791 
   792     val a_satisfy = Element.satisfy_morphism a_axioms;
   793     val b_satisfy = Element.satisfy_morphism b_axioms;
   794 
   795     val params = fixed @
   796       maps (fn Fixes fixes =>
   797         map (fn (b, SOME T, mx) => ((Binding.name_of b, T), mx)) fixes | _ => []) body_elems;
   798     val asm = if is_some b_statement then b_statement else a_statement;
   799 
   800     val notes =
   801       if is_some asm then
   802         [("", [((Binding.conceal (Binding.suffix_name ("_" ^ axiomsN) binding), []),
   803           [([Assumption.assume pred_ctxt (cterm_of thy' (the asm))],
   804             [(Attrib.internal o K) Locale.witness_add])])])]
   805       else [];
   806 
   807     val notes' =
   808       body_elems
   809       |> map (defines_to_notes pred_ctxt)
   810       |> map (Element.transform_ctxt a_satisfy)
   811       |> (fn elems =>
   812         fold_map assumes_to_notes elems (map (Element.conclude_witness pred_ctxt) a_axioms))
   813       |> fst
   814       |> map (Element.transform_ctxt b_satisfy)
   815       |> map_filter (fn Notes notes => SOME notes | _ => NONE);
   816 
   817     val deps' = map (fn (l, morph) => (l, morph $> b_satisfy)) deps;
   818     val axioms = map (Element.conclude_witness pred_ctxt) b_axioms;
   819 
   820     val loc_ctxt = thy'
   821       |> Locale.register_locale binding (extraTs, params)
   822           (asm, rev defs) (a_intro, b_intro) axioms [] (rev notes) (rev deps')
   823       |> Named_Target.init name
   824       |> fold (fn (kind, facts) => Local_Theory.notes_kind kind facts #> snd) notes';
   825 
   826   in (name, loc_ctxt) end;
   827 
   828 in
   829 
   830 val add_locale = gen_add_locale cert_declaration;
   831 val add_locale_cmd = gen_add_locale read_declaration;
   832 
   833 end;
   834 
   835 
   836 (*** Interpretation ***)
   837 
   838 local
   839 
   840 (* reading *)
   841 
   842 fun prep_with_extended_syntax prep_prop deps ctxt props =
   843   let
   844     val deps_ctxt = fold Locale.activate_declarations deps ctxt;
   845   in
   846     map (prep_prop deps_ctxt o snd) props |> Syntax.check_terms deps_ctxt
   847       |> Variable.export_terms deps_ctxt ctxt
   848   end;
   849 
   850 fun prep_interpretation prep_expr prep_prop prep_attr expression raw_eqns initial_ctxt =
   851   let
   852     val ((propss, deps, export), expr_ctxt) = prep_expr expression initial_ctxt;
   853     val eqns = prep_with_extended_syntax prep_prop deps expr_ctxt raw_eqns;
   854     val attrss = map (apsnd (map (prep_attr initial_ctxt)) o fst) raw_eqns;
   855     val goal_ctxt = fold Variable.auto_fixes eqns expr_ctxt;
   856     val export' = Variable.export_morphism goal_ctxt expr_ctxt;
   857   in (((propss, deps, export, export'), (eqns, attrss)), goal_ctxt) end;
   858 
   859 val cert_interpretation =
   860   prep_interpretation cert_goal_expression (K I) (K I);
   861 
   862 val read_interpretation =
   863   prep_interpretation read_goal_expression Syntax.parse_prop Attrib.check_src;
   864 
   865 
   866 (* generic interpretation machinery *)
   867 
   868 fun meta_rewrite eqns ctxt =
   869   (map (Local_Defs.meta_rewrite_rule ctxt #> Drule.abs_def) (maps snd eqns), ctxt);
   870 
   871 fun note_eqns_register note activate deps witss eqns attrss export export' ctxt =
   872   let
   873     val facts = map2 (fn attrs => fn eqn =>
   874       (attrs, [([Morphism.thm (export' $> export) eqn], [])])) attrss eqns;
   875     val (eqns', ctxt') = ctxt
   876       |> note Thm.lemmaK facts
   877       |-> meta_rewrite;
   878     val dep_morphs =
   879       map2 (fn (dep, morph) => fn wits =>
   880           (dep, morph $> Element.satisfy_morphism (map (Element.transform_witness export') wits)))
   881         deps witss;
   882     fun activate' dep_morph ctxt =
   883       activate dep_morph
   884         (Option.map (rpair true) (Element.eq_morphism (Proof_Context.theory_of ctxt) eqns'))
   885         export ctxt;
   886   in
   887     ctxt'
   888     |> fold activate' dep_morphs
   889   end;
   890 
   891 fun generic_interpretation prep_interpretation setup_proof note activate
   892     expression raw_eqns initial_ctxt =
   893   let
   894     val (((propss, deps, export, export'), (eqns, attrss)), goal_ctxt) =
   895       prep_interpretation expression raw_eqns initial_ctxt;
   896     fun after_qed witss eqns =
   897       note_eqns_register note activate deps witss eqns attrss export export';
   898   in setup_proof after_qed propss eqns goal_ctxt end;
   899 
   900 
   901 (* first dimension: proof vs. local theory *)
   902 
   903 fun gen_interpret prep_interpretation expression raw_eqns int state =
   904   let
   905     val _ = Proof.assert_forward_or_chain state;
   906     val ctxt = Proof.context_of state;
   907     fun lift_after_qed after_qed witss eqns =
   908       Proof.map_context (after_qed witss eqns) #> Proof.reset_facts;
   909     fun setup_proof after_qed propss eqns goal_ctxt =
   910       Element.witness_local_proof_eqs (lift_after_qed after_qed) "interpret"
   911         propss eqns goal_ctxt int state;
   912   in
   913     generic_interpretation prep_interpretation setup_proof
   914       Attrib.local_notes (Context.proof_map ooo Locale.add_registration) expression raw_eqns ctxt
   915   end;
   916 
   917 fun gen_local_theory_interpretation prep_interpretation activate expression raw_eqns lthy =
   918   generic_interpretation prep_interpretation Element.witness_proof_eqs
   919     Local_Theory.notes_kind (activate lthy) expression raw_eqns lthy;
   920 
   921 
   922 (* second dimension: relation to underlying target *)
   923 
   924 fun subscribe_or_activate lthy =
   925   if Named_Target.is_theory lthy
   926   then Local_Theory.subscription
   927   else Local_Theory.activate;
   928 
   929 fun subscribe_locale_only lthy =
   930   let
   931     val _ =
   932       if Named_Target.is_theory lthy
   933       then error "Not possible on level of global theory"
   934       else ();
   935   in Local_Theory.subscription end;
   936 
   937 
   938 (* special case: global sublocale command *)
   939 
   940 fun gen_sublocale_global prep_loc prep_interpretation
   941     raw_locale expression raw_eqns thy =
   942   let
   943     val lthy = Named_Target.init (prep_loc thy raw_locale) thy;
   944     fun setup_proof after_qed =
   945       Element.witness_proof_eqs
   946         (fn wits => fn eqs => after_qed wits eqs #> Local_Theory.exit);
   947   in
   948     lthy |>
   949       generic_interpretation prep_interpretation setup_proof
   950         Local_Theory.notes_kind (subscribe_locale_only lthy) expression raw_eqns
   951   end;
   952 
   953 in
   954 
   955 
   956 (* interfaces *)
   957 
   958 fun interpret x = gen_interpret cert_interpretation x;
   959 fun interpret_cmd x = gen_interpret read_interpretation x;
   960 
   961 fun permanent_interpretation expression raw_eqns =
   962   Local_Theory.assert_bottom true
   963   #> gen_local_theory_interpretation cert_interpretation
   964     (K Local_Theory.subscription) expression raw_eqns;
   965 
   966 fun ephemeral_interpretation x =
   967   gen_local_theory_interpretation cert_interpretation (K Local_Theory.activate) x;
   968 
   969 fun interpretation x =
   970   gen_local_theory_interpretation cert_interpretation subscribe_or_activate x;
   971 fun interpretation_cmd x =
   972   gen_local_theory_interpretation read_interpretation subscribe_or_activate x;
   973 
   974 fun sublocale x =
   975   gen_local_theory_interpretation cert_interpretation subscribe_locale_only x;
   976 fun sublocale_cmd x =
   977   gen_local_theory_interpretation read_interpretation subscribe_locale_only x;
   978 
   979 fun sublocale_global x = gen_sublocale_global (K I) cert_interpretation x;
   980 fun sublocale_global_cmd x = gen_sublocale_global Locale.check read_interpretation x;
   981 
   982 end;
   983 
   984 
   985 (** Print the instances that would be activated by an interpretation
   986   of the expression in the current context (clean = false) or in an
   987   empty context (clean = true). **)
   988 
   989 fun print_dependencies ctxt clean expression =
   990   let
   991     val ((_, deps, export), expr_ctxt) = read_goal_expression expression ctxt;
   992     val export' = if clean then Morphism.identity else export;
   993   in
   994     Locale.print_dependencies expr_ctxt clean export' deps
   995   end;
   996 
   997 end;