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