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