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