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