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