src/Pure/Isar/expression.ML
author ballarin
Mon Dec 08 14:18:29 2008 +0100 (2008-12-08)
changeset 29019 8e7d6f959bd7
parent 29018 17538bdef546
child 29020 3e95d28114a1
permissions -rw-r--r--
Explicitly close up defines.
     1 (*  Title:      Pure/Isar/expression.ML
     2     Author:     Clemens Ballarin, TU Muenchen
     3 
     4 New locale development --- experimental.
     5 *)
     6 
     7 signature EXPRESSION =
     8 sig
     9   datatype 'term map = Positional of 'term option list | Named of (string * 'term) list;
    10   type 'term expr = (string * (string * 'term map)) list;
    11   type expression = string expr * (Binding.T * string option * mixfix) list;
    12   type expression_i = term expr * (Binding.T * typ option * mixfix) list;
    13 
    14   (* Processing of context statements *)
    15   val read_statement: Element.context list -> (string * string list) list list ->
    16     Proof.context ->  (term * term list) list list * Proof.context;
    17   val cert_statement: Element.context_i list -> (term * term list) list list ->
    18     Proof.context -> (term * term list) list list * Proof.context;
    19 
    20   (* Declaring locales *)
    21   val add_locale_cmd: string -> bstring -> expression -> Element.context list -> theory ->
    22     string * Proof.context
    23   val add_locale: string -> bstring -> expression_i -> Element.context_i list -> theory ->
    24     string * Proof.context
    25 
    26   (* Interpretation *)
    27   val sublocale_cmd: string -> expression -> theory -> Proof.state;
    28   val sublocale: string -> expression_i -> theory -> Proof.state;
    29   val interpretation_cmd: expression -> theory -> Proof.state;
    30   val interpretation: expression_i -> theory -> Proof.state;
    31   val interpret_cmd: expression -> bool -> Proof.state -> Proof.state;
    32   val interpret: expression_i -> bool -> Proof.state -> Proof.state;
    33 
    34   (* Debugging and development *)
    35   val parse_expression: OuterParse.token list -> expression * OuterParse.token list
    36     (* FIXME to spec_parse.ML *)
    37 end;
    38 
    39 
    40 structure Expression : EXPRESSION =
    41 struct
    42 
    43 datatype ctxt = datatype Element.ctxt;
    44 
    45 
    46 (*** Expressions ***)
    47 
    48 datatype 'term map =
    49   Positional of 'term option list |
    50   Named of (string * 'term) list;
    51 
    52 type 'term expr = (string * (string * 'term map)) list;
    53 
    54 type expression = string expr * (Binding.T * string option * mixfix) list;
    55 type expression_i = term expr * (Binding.T * typ option * mixfix) list;
    56 
    57 
    58 (** Parsing and printing **)
    59 
    60 local
    61 
    62 structure P = OuterParse;
    63 
    64 val loc_keyword = P.$$$ "fixes" || P.$$$ "constrains" || P.$$$ "assumes" ||
    65    P.$$$ "defines" || P.$$$ "notes";
    66 fun plus1_unless test scan =
    67   scan ::: Scan.repeat (P.$$$ "+" |-- Scan.unless test (P.!!! scan));
    68 
    69 val prefix = P.name --| P.$$$ ":";
    70 val named = P.name -- (P.$$$ "=" |-- P.term);
    71 val position = P.maybe P.term;
    72 val instance = P.$$$ "where" |-- P.and_list1 named >> Named ||
    73   Scan.repeat1 position >> Positional;
    74 
    75 in
    76 
    77 val parse_expression =
    78   let
    79     fun expr2 x = P.xname x;
    80     fun expr1 x = (Scan.optional prefix "" -- expr2 --
    81       Scan.optional instance (Named []) >> (fn ((p, l), i) => (l, (p, i)))) x;
    82     fun expr0 x = (plus1_unless loc_keyword expr1) x;
    83   in expr0 -- P.for_fixes end;
    84 
    85 end;
    86 
    87 fun pretty_expr thy expr =
    88   let
    89     fun pretty_pos NONE = Pretty.str "_"
    90       | pretty_pos (SOME x) = Pretty.str x;
    91     fun pretty_named (x, y) = [Pretty.str x, Pretty.brk 1, Pretty.str "=",
    92           Pretty.brk 1, Pretty.str y] |> Pretty.block;
    93     fun pretty_ren (Positional ps) = take_suffix is_none ps |> snd |>
    94           map pretty_pos |> Pretty.breaks
    95       | pretty_ren (Named []) = []
    96       | pretty_ren (Named ps) = Pretty.str "where" :: Pretty.brk 1 ::
    97           (ps |> map pretty_named |> Pretty.separate "and");
    98     fun pretty_rename (loc, ("", ren)) =
    99           Pretty.block (Pretty.str (NewLocale.extern thy loc) :: Pretty.brk 1 :: pretty_ren ren) 
   100       | pretty_rename (loc, (prfx, ren)) =
   101           Pretty.block (Pretty.str prfx :: Pretty.brk 1 :: Pretty.str (NewLocale.extern thy loc) ::
   102             Pretty.brk 1 :: pretty_ren ren);
   103   in Pretty.separate "+" (map pretty_rename expr) |> Pretty.block end;
   104 
   105 fun err_in_expr thy msg expr =
   106   let
   107     val err_msg =
   108       if null expr then msg
   109       else msg ^ "\n" ^ Pretty.string_of (Pretty.block
   110         [Pretty.str "The above error(s) occurred in expression:", Pretty.brk 1,
   111           pretty_expr thy expr])
   112   in error err_msg end;
   113 
   114 
   115 (** Internalise locale names in expr **)
   116 
   117 fun intern thy instances =  map (apfst (NewLocale.intern thy)) instances;
   118 
   119 
   120 (** Parameters of expression.
   121 
   122    Sanity check of instantiations and extraction of implicit parameters.
   123    The latter only occurs iff strict = false.
   124    Positional instantiations are extended to match full length of parameter list
   125    of instantiated locale. **)
   126 
   127 fun parameters_of thy strict (expr, fixed) =
   128   let
   129     fun reject_dups message xs =
   130       let val dups = duplicates (op =) xs
   131       in
   132         if null dups then () else error (message ^ commas dups)
   133       end;
   134 
   135     fun match_bind (n, b) = (n = Name.name_of b);
   136     fun bind_eq (b1, b2) = (Name.name_of b1 = Name.name_of b2);
   137       (* FIXME: cannot compare bindings for equality. *)
   138 
   139     fun params_loc loc =
   140           (NewLocale.params_of thy loc |> map (fn (p, _, mx) => (p, mx)), loc);
   141     fun params_inst (expr as (loc, (prfx, Positional insts))) =
   142           let
   143             val (ps, loc') = params_loc loc;
   144 	    val d = length ps - length insts;
   145 	    val insts' =
   146 	      if d < 0 then error ("More arguments than parameters in instantiation of locale " ^
   147                 quote (NewLocale.extern thy loc))
   148 	      else insts @ replicate d NONE;
   149             val ps' = (ps ~~ insts') |>
   150               map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
   151           in (ps', (loc', (prfx, Positional insts'))) end
   152       | params_inst (expr as (loc, (prfx, Named insts))) =
   153           let
   154             val _ = reject_dups "Duplicate instantiation of the following parameter(s): "
   155               (map fst insts);
   156 
   157             val (ps, loc') = params_loc loc;
   158             val ps' = fold (fn (p, _) => fn ps =>
   159               if AList.defined match_bind ps p then AList.delete match_bind p ps
   160               else error (quote p ^" not a parameter of instantiated expression.")) insts ps;
   161           in (ps', (loc', (prfx, Named insts))) end;
   162     fun params_expr is =
   163           let
   164             val (is', ps') = fold_map (fn i => fn ps =>
   165               let
   166                 val (ps', i') = params_inst i;
   167                 val ps'' = AList.join bind_eq (fn p => fn (mx1, mx2) =>
   168                   (* FIXME: should check for bindings being the same.
   169                      Instead we check for equal name and syntax. *)
   170                   if mx1 = mx2 then mx1
   171                   else error ("Conflicting syntax for parameter" ^ quote (Binding.display p) ^
   172                     " in expression.")) (ps, ps')
   173               in (i', ps'') end) is []
   174           in (ps', is') end;
   175 
   176     val (implicit, expr') = params_expr expr;
   177 
   178     val implicit' = map (#1 #> Name.name_of) implicit;
   179     val fixed' = map (#1 #> Name.name_of) fixed;
   180     val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
   181     val implicit'' = if strict then []
   182       else let val _ = reject_dups
   183           "Parameter(s) declared simultaneously in expression and for clause: " (implicit' @ fixed')
   184         in map (fn (b, mx) => (b, NONE, mx)) implicit end;
   185 
   186   in (expr', implicit'' @ fixed) end;
   187 
   188 
   189 (** Read instantiation **)
   190 
   191 (* Parse positional or named instantiation *)
   192 
   193 local
   194 
   195 fun prep_inst parse_term parms (Positional insts) ctxt =
   196       (insts ~~ parms) |> map (fn
   197         (NONE, p) => Syntax.parse_term ctxt p |
   198         (SOME t, _) => parse_term ctxt t)
   199   | prep_inst parse_term parms (Named insts) ctxt =
   200       parms |> map (fn p => case AList.lookup (op =) insts p of
   201         SOME t => parse_term ctxt t |
   202         NONE => Syntax.parse_term ctxt p);
   203 
   204 in
   205 
   206 fun parse_inst x = prep_inst Syntax.parse_term x;
   207 fun make_inst x = prep_inst (K I) x;
   208 
   209 end;
   210 
   211 
   212 (* Instantiation morphism *)
   213 
   214 fun inst_morph (parm_names, parm_types) (prfx, insts') ctxt =
   215   let
   216     (* parameters *)
   217     val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
   218 
   219     (* type inference and contexts *)
   220     val parm_types' = map (TypeInfer.paramify_vars o Logic.varifyT) parm_types;
   221     val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
   222     val arg = type_parms @ map2 TypeInfer.constrain parm_types' insts';
   223     val res = Syntax.check_terms ctxt arg;
   224     val ctxt' = ctxt |> fold Variable.auto_fixes res;
   225     
   226     (* instantiation *)
   227     val (type_parms'', res') = chop (length type_parms) res;
   228     val insts'' = (parm_names ~~ res') |> map_filter
   229       (fn (inst as (x, Free (y, _))) => if x = y then NONE else SOME inst |
   230         inst => SOME inst);
   231     val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
   232     val inst = Symtab.make insts'';
   233   in
   234     (Element.inst_morphism (ProofContext.theory_of ctxt) (instT, inst) $>
   235       Morphism.binding_morphism (Binding.qualify prfx), ctxt')
   236   end;
   237 
   238 
   239 (*** Locale processing ***)
   240 
   241 (** Parsing **)
   242 
   243 fun parse_elem prep_typ prep_term ctxt elem =
   244   Element.map_ctxt {binding = I, var = I, typ = prep_typ ctxt,
   245     term = prep_term ctxt, fact = I, attrib = I} elem;
   246 
   247 fun parse_concl prep_term ctxt concl =
   248   (map o map) (fn (t, ps) =>
   249     (prep_term ctxt, map (prep_term ctxt) ps)) concl;
   250 
   251 
   252 (** Simultaneous type inference: instantiations + elements + conclusion **)
   253 
   254 local
   255 
   256 fun mk_type T = (Logic.mk_type T, []);
   257 fun mk_term t = (t, []);
   258 fun mk_propp (p, pats) = (Syntax.type_constraint propT p, pats);
   259 
   260 fun dest_type (T, []) = Logic.dest_type T;
   261 fun dest_term (t, []) = t;
   262 fun dest_propp (p, pats) = (p, pats);
   263 
   264 fun extract_inst (_, (_, ts)) = map mk_term ts;
   265 fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
   266 
   267 fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
   268   | extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
   269   | extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
   270   | extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
   271   | extract_elem (Notes _) = [];
   272 
   273 fun restore_elem (Fixes fixes, css) =
   274       (fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
   275         (x, cs |> map dest_type |> try hd, mx)) |> Fixes
   276   | restore_elem (Constrains csts, css) =
   277       (csts ~~ css) |> map (fn ((x, _), cs) =>
   278         (x, cs |> map dest_type |> hd)) |> Constrains
   279   | restore_elem (Assumes asms, css) =
   280       (asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
   281   | restore_elem (Defines defs, css) =
   282       (defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
   283   | restore_elem (Notes notes, _) = Notes notes;
   284 
   285 fun check cs context =
   286   let
   287     fun prep (_, pats) (ctxt, t :: ts) =
   288       let val ctxt' = Variable.auto_fixes t ctxt
   289       in
   290         ((t, Syntax.check_props (ProofContext.set_mode ProofContext.mode_pattern ctxt') pats),
   291           (ctxt', ts))
   292       end
   293     val (cs', (context', _)) = fold_map prep cs
   294       (context, Syntax.check_terms
   295         (ProofContext.set_mode ProofContext.mode_schematic context) (map fst cs));
   296   in (cs', context') end;
   297 
   298 in
   299 
   300 fun check_autofix insts elems concl ctxt =
   301   let
   302     val inst_cs = map extract_inst insts;
   303     val elem_css = map extract_elem elems;
   304     val concl_cs = (map o map) mk_propp concl;
   305     (* Type inference *)
   306     val (inst_cs' :: css', ctxt') =
   307       (fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
   308     val (elem_css', [concl_cs']) = chop (length elem_css) css';
   309   in
   310     (map restore_inst (insts ~~ inst_cs'), map restore_elem (elems ~~ elem_css'),
   311       concl_cs', ctxt')
   312   end;
   313 
   314 end;
   315 
   316 
   317 (** Prepare locale elements **)
   318 
   319 fun declare_elem prep_vars (Fixes fixes) ctxt =
   320       let val (vars, _) = prep_vars fixes ctxt
   321       in ctxt |> ProofContext.add_fixes_i vars |> snd end
   322   | declare_elem prep_vars (Constrains csts) ctxt =
   323       ctxt |> prep_vars (map (fn (x, T) => (Binding.name x, SOME T, NoSyn)) csts) |> snd
   324   | declare_elem _ (Assumes _) ctxt = ctxt
   325   | declare_elem _ (Defines _) ctxt = ctxt
   326   | declare_elem _ (Notes _) ctxt = ctxt;
   327 
   328 (** Finish locale elements, extract specification text **)
   329 
   330 val norm_term = Envir.beta_norm oo Term.subst_atomic;
   331 
   332 fun abstract_thm thy eq =
   333   Thm.assume (Thm.cterm_of thy eq) |> Drule.gen_all |> Drule.abs_def;
   334 
   335 fun bind_def ctxt eq (xs, env, ths) =
   336   let
   337     val ((y, T), b) = LocalDefs.abs_def eq;
   338     val b' = norm_term env b;
   339     val th = abstract_thm (ProofContext.theory_of ctxt) eq;
   340     fun err msg = error (msg ^ ": " ^ quote y);
   341   in
   342     exists (fn (x, _) => x = y) xs andalso
   343       err "Attempt to define previously specified variable";
   344     exists (fn (Free (y', _), _) => y = y' | _ => false) env andalso
   345       err "Attempt to redefine variable";
   346     (Term.add_frees b' xs, (Free (y, T), b') :: env, th :: ths)
   347   end;
   348 
   349 fun eval_text _ _ (Fixes _) text = text
   350   | eval_text _ _ (Constrains _) text = text
   351   | eval_text _ is_ext (Assumes asms)
   352         (((exts, exts'), (ints, ints')), (xs, env, defs)) =
   353       let
   354         val ts = maps (map #1 o #2) asms;
   355         val ts' = map (norm_term env) ts;
   356         val spec' =
   357           if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
   358           else ((exts, exts'), (ints @ ts, ints' @ ts'));
   359       in (spec', (fold Term.add_frees ts' xs, env, defs)) end
   360   | eval_text ctxt _ (Defines defs) (spec, binds) =
   361       (spec, fold (bind_def ctxt o #1 o #2) defs binds)
   362   | eval_text _ _ (Notes _) text = text;
   363 
   364 fun closeup _ _ false elem = elem
   365   | closeup ctxt parms true elem =
   366       let
   367         fun close_frees t =
   368           let
   369             val rev_frees =
   370               Term.fold_aterms (fn Free (x, T) =>
   371                 if AList.defined (op =) parms x then I else insert (op =) (x, T) | _ => I) t [];
   372           in Term.list_all_free (rev rev_frees, t) end;
   373   (* FIXME consider closing in syntactic phase *)
   374 
   375         fun no_binds [] = []
   376           | no_binds _ = error "Illegal term bindings in context element";
   377       in
   378         (case elem of
   379           Assumes asms => Assumes (asms |> map (fn (a, propps) =>
   380             (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
   381         | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
   382             (a, (close_frees (#2 (LocalDefs.cert_def ctxt (close_frees t))), no_binds ps))))
   383         | e => e)
   384       end;
   385 
   386 fun finish_primitive parms _ (Fixes fixes) = Fixes (map (fn (binding, _, mx) =>
   387       let val x = Name.name_of binding
   388       in (binding, AList.lookup (op =) parms x, mx) end) fixes)
   389   | finish_primitive _ _ (Constrains _) = Constrains []
   390   | finish_primitive _ close (Assumes asms) = close (Assumes asms)
   391   | finish_primitive _ close (Defines defs) = close (Defines defs)
   392   | finish_primitive _ _ (Notes facts) = Notes facts;
   393 
   394 fun finish_inst ctxt parms do_close (loc, (prfx, inst)) text =
   395   let
   396     val thy = ProofContext.theory_of ctxt;
   397     val (parm_names, parm_types) = NewLocale.params_of thy loc |>
   398       map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
   399     val (asm, defs) = NewLocale.specification_of thy loc;
   400     val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst) ctxt;
   401     val asm' = Option.map (Morphism.term morph) asm;
   402     val defs' = map (Morphism.term morph) defs;
   403     val text' = text |>
   404       (if is_some asm
   405         then eval_text ctxt false (Assumes [(Attrib.empty_binding, [(the asm', [])])])
   406         else I) |>
   407       (if not (null defs)
   408         then eval_text ctxt false (Defines (map (fn def => (Attrib.empty_binding, (def, []))) defs'))
   409         else I)
   410 (* FIXME clone from new_locale.ML *)
   411   in ((loc, morph), text') end;
   412 
   413 fun finish_elem ctxt parms do_close elem text =
   414   let
   415     val elem' = finish_primitive parms (closeup ctxt parms do_close) elem;
   416     val text' = eval_text ctxt true elem' text;
   417   in (elem', text') end
   418   
   419 fun finish ctxt parms do_close insts elems text =
   420   let
   421     val (deps, text') = fold_map (finish_inst ctxt parms do_close) insts text;
   422     val (elems', text'') = fold_map (finish_elem ctxt parms do_close) elems text';
   423   in (deps, elems', text'') end;
   424 
   425 
   426 (** Process full context statement: instantiations + elements + conclusion **)
   427 
   428 (* Interleave incremental parsing and type inference over entire parsed stretch. *)
   429 
   430 local
   431 
   432 fun prep_full_context_statement parse_typ parse_prop parse_inst prep_vars prep_expr
   433     strict do_close context raw_import raw_elems raw_concl =
   434   let
   435     val thy = ProofContext.theory_of context;
   436 
   437     val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
   438 
   439     fun prep_inst (loc, (prfx, inst)) (i, insts, ctxt) =
   440       let
   441         val (parm_names, parm_types) = NewLocale.params_of thy loc |>
   442           map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
   443         val inst' = parse_inst parm_names inst ctxt;
   444         val parm_types' = map (TypeInfer.paramify_vars o
   445           Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT) parm_types;
   446         val inst'' = map2 TypeInfer.constrain parm_types' inst';
   447         val insts' = insts @ [(loc, (prfx, inst''))];
   448         val (insts'', _, _, ctxt' (* FIXME not used *) ) = check_autofix insts' [] [] ctxt;
   449         val inst''' = insts'' |> List.last |> snd |> snd;
   450         val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst''') ctxt;
   451         val ctxt'' = NewLocale.activate_declarations thy (loc, morph) ctxt;
   452       in (i+1, insts', ctxt'') end;
   453   
   454     fun prep_elem raw_elem (insts, elems, ctxt) =
   455       let
   456         val ctxt' = declare_elem prep_vars raw_elem ctxt;
   457         val elems' = elems @ [parse_elem parse_typ parse_prop ctxt' raw_elem];
   458         (* FIXME term bindings *)
   459         val (_, _, _, ctxt'') = check_autofix insts elems' [] ctxt';
   460       in (insts, elems', ctxt') end;
   461 
   462     fun prep_concl raw_concl (insts, elems, ctxt) =
   463       let
   464         val concl = (map o map) (fn (t, ps) =>
   465           (parse_prop ctxt t, map (parse_prop ctxt) ps)) raw_concl;
   466       in check_autofix insts elems concl ctxt end;
   467 
   468     val fors = prep_vars fixed context |> fst;
   469     val ctxt = context |> ProofContext.add_fixes_i fors |> snd;
   470     val (_, insts', ctxt') = fold prep_inst raw_insts (0, [], NewLocale.clear_local_idents ctxt);
   471     val (_, elems'', ctxt'') = fold prep_elem raw_elems (insts', [], ctxt');
   472     val (insts, elems, concl, ctxt) = prep_concl raw_concl (insts', elems'', ctxt'');
   473 
   474     (* Retrieve parameter types *)
   475     val xs = fold (fn Fixes fixes => (fn ps => ps @ map (Name.name_of o #1) fixes) |
   476       _ => fn ps => ps) (Fixes fors :: elems) [];
   477     val (Ts, ctxt') = fold_map ProofContext.inferred_param xs ctxt; 
   478     val parms = xs ~~ Ts;  (* params from expression and elements *)
   479 
   480     val Fixes fors' = finish_primitive parms I (Fixes fors);
   481     val (deps, elems', text) = finish ctxt' parms do_close insts elems ((([], []), ([], [])), ([], [], []));
   482     (* text has the following structure:
   483            (((exts, exts'), (ints, ints')), (xs, env, defs))
   484        where
   485          exts: external assumptions (terms in assumes elements)
   486          exts': dito, normalised wrt. env
   487          ints: internal assumptions (terms in assumptions from insts)
   488          ints': dito, normalised wrt. env
   489          xs: the free variables in exts' and ints' and rhss of definitions,
   490            this includes parameters except defined parameters
   491          env: list of term pairs encoding substitutions, where the first term
   492            is a free variable; substitutions represent defines elements and
   493            the rhs is normalised wrt. the previous env
   494          defs: theorems representing the substitutions from defines elements
   495            (thms are normalised wrt. env).
   496        elems is an updated version of raw_elems:
   497          - type info added to Fixes and modified in Constrains
   498          - axiom and definition statement replaced by corresponding one
   499            from proppss in Assumes and Defines
   500          - Facts unchanged
   501        *)
   502 
   503   in ((fors', deps, elems', concl), (parms, text)) end
   504 
   505 in
   506 
   507 fun read_full_context_statement x =
   508   prep_full_context_statement Syntax.parse_typ Syntax.parse_prop parse_inst
   509   ProofContext.read_vars intern x;
   510 fun cert_full_context_statement x =
   511   prep_full_context_statement (K I) (K I) make_inst ProofContext.cert_vars (K I) x;
   512 
   513 end;
   514 
   515 
   516 (* Context statement: elements + conclusion *)
   517 
   518 local
   519 
   520 fun prep_statement prep activate raw_elems raw_concl context =
   521   let
   522      val ((_, _, elems, concl), _) = prep true false context ([], []) raw_elems raw_concl;
   523      val (_, context') = activate elems (ProofContext.set_stmt true context);
   524   in (concl, context') end;
   525 
   526 in
   527 
   528 fun read_statement x = prep_statement read_full_context_statement Element.activate x;
   529 fun cert_statement x = prep_statement cert_full_context_statement Element.activate_i x;
   530 
   531 end;
   532 
   533 
   534 (* Locale declaration: import + elements *)
   535 
   536 local
   537 
   538 fun prep_declaration prep activate raw_import raw_elems context =
   539   let
   540     val ((fixed, deps, elems, _), (parms, (spec, (_, _, defs)))) =
   541       prep false true context raw_import raw_elems [];
   542     (* Declare parameters and imported facts *)
   543     val context' = context |>
   544       ProofContext.add_fixes_i fixed |> snd |>
   545       NewLocale.clear_local_idents |> fold NewLocale.activate_local_facts deps;
   546     val ((elems', _), _) = activate elems (ProofContext.set_stmt true context');
   547   in ((fixed, deps, elems'), (parms, spec, defs)) end;
   548 
   549 in
   550 
   551 fun read_declaration x = prep_declaration read_full_context_statement Element.activate x;
   552 fun cert_declaration x = prep_declaration cert_full_context_statement Element.activate_i x;
   553 
   554 end;
   555 
   556 
   557 (* Locale expression to set up a goal *)
   558 
   559 local
   560 
   561 fun props_of thy (name, morph) =
   562   let
   563     val (asm, defs) = NewLocale.specification_of thy name;
   564   in
   565     (case asm of NONE => defs | SOME asm => asm :: defs) |> map (Morphism.term morph)
   566   end;
   567 
   568 fun prep_goal_expression prep expression context =
   569   let
   570     val thy = ProofContext.theory_of context;
   571 
   572     val ((fixed, deps, _, _), _) = prep true true context expression [] [];
   573     (* proof obligations *)
   574     val propss = map (props_of thy) deps;
   575 
   576     val goal_ctxt = context |>
   577       ProofContext.add_fixes_i fixed |> snd |>
   578       (fold o fold) Variable.auto_fixes propss;
   579 
   580     val export = Variable.export_morphism goal_ctxt context;
   581     val exp_fact = Drule.zero_var_indexes_list o map Thm.strip_shyps o Morphism.fact export;
   582 (*    val exp_term = TermSubst.zero_var_indexes o Morphism.term export; *)
   583     val exp_term = Drule.term_rule thy (singleton exp_fact);
   584     val exp_typ = Logic.type_map exp_term;
   585     val export' =
   586       Morphism.morphism {binding = I, var = I, typ = exp_typ, term = exp_term, fact = exp_fact};
   587   in ((propss, deps, export'), goal_ctxt) end;
   588     
   589 in
   590 
   591 fun read_goal_expression x = prep_goal_expression read_full_context_statement x;
   592 fun cert_goal_expression x = prep_goal_expression cert_full_context_statement x;
   593 
   594 end;
   595 
   596 
   597 (*** Locale declarations ***)
   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 = ObjectLogic.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, ObjectLogic.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 = (Syntax.constN ^ c, fn ctxt => fn args =>
   624   if length args = n then
   625     Syntax.const "_aprop" $
   626       Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
   627   else raise Match);
   628 
   629 (* define one predicate including its intro rule and axioms
   630    - bname: 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 bname parms defs ts norm_ts thy =
   639   let
   640     val name = Sign.full_bname thy bname;
   641 
   642     val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
   643     val env = Term.add_term_free_names (body, []);
   644     val xs = filter (member (op =) env o #1) parms;
   645     val Ts = map #2 xs;
   646     val extraTs = (Term.term_tfrees body \\ fold Term.add_tfreesT Ts [])
   647       |> Library.sort_wrt #1 |> map TFree;
   648     val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
   649 
   650     val args = map Logic.mk_type extraTs @ map Free xs;
   651     val head = Term.list_comb (Const (name, predT), args);
   652     val statement = ObjectLogic.ensure_propT thy head;
   653 
   654     val ([pred_def], defs_thy) =
   655       thy
   656       |> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
   657       |> Sign.declare_const [] ((Binding.name bname, predT), NoSyn) |> snd
   658       |> PureThy.add_defs false
   659         [((Thm.def_name bname, Logic.mk_equals (head, body)), [Thm.kind_internal])];
   660     val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
   661 
   662     val cert = Thm.cterm_of defs_thy;
   663 
   664     val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
   665       MetaSimplifier.rewrite_goals_tac [pred_def] THEN
   666       Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
   667       Tactic.compose_tac (false,
   668         Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
   669 
   670     val conjuncts =
   671       (Drule.equal_elim_rule2 OF [body_eq,
   672         MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
   673       |> Conjunction.elim_balanced (length ts);
   674     val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
   675       Element.prove_witness defs_ctxt t
   676        (MetaSimplifier.rewrite_goals_tac defs THEN
   677         Tactic.compose_tac (false, ax, 0) 1));
   678   in ((statement, intro, axioms), defs_thy) end;
   679 
   680 in
   681 
   682 (* CB: main predicate definition function *)
   683 
   684 fun define_preds pname (parms, ((exts, exts'), (ints, ints')), defs) thy =
   685   let
   686     val (a_pred, a_intro, a_axioms, thy'') =
   687       if null exts then (NONE, NONE, [], thy)
   688       else
   689         let
   690           val aname = if null ints then pname else pname ^ "_" ^ axiomsN;
   691           val ((statement, intro, axioms), thy') =
   692             thy
   693             |> def_pred aname parms defs exts exts';
   694           val (_, thy'') =
   695             thy'
   696             |> Sign.add_path aname
   697             |> Sign.no_base_names
   698             |> PureThy.note_thmss Thm.internalK
   699               [((Binding.name introN, []), [([intro], [NewLocale.unfold_attrib])])]
   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 pname parms defs (ints @ the_list a_pred) (ints' @ the_list a_pred);
   709           val (_, thy'''') =
   710             thy'''
   711             |> Sign.add_path pname
   712             |> Sign.no_base_names
   713             |> PureThy.note_thmss Thm.internalK
   714                  [((Binding.name introN, []), [([intro], [NewLocale.intro_attrib])]),
   715                   ((Binding.name axiomsN, []),
   716                     [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
   717             ||> Sign.restore_naming thy''';
   718         in (SOME statement, SOME intro, axioms, thy'''') end;
   719   in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
   720 
   721 end;
   722 
   723 
   724 local
   725 
   726 fun assumes_to_notes (Assumes asms) axms =
   727       fold_map (fn (a, spec) => fn axs =>
   728           let val (ps, qs) = chop (length spec) axs
   729           in ((a, [(ps, [])]), qs) end) asms axms
   730       |> apfst (curry Notes Thm.assumptionK)
   731   | assumes_to_notes e axms = (e, axms);
   732 
   733 fun defines_to_notes thy (Defines defs) defns =
   734     let
   735       val defs' = map (fn (_, (def, _)) => def) defs
   736       val notes = map (fn (a, (def, _)) =>
   737         (a, [([assume (cterm_of thy def)], [])])) defs
   738     in
   739       (Notes (Thm.definitionK, notes), defns @ defs')
   740     end
   741   | defines_to_notes _ e defns = (e, defns);
   742 
   743 fun gen_add_locale prep_decl
   744     bname predicate_name raw_imprt raw_body thy =
   745   let
   746     val thy_ctxt = ProofContext.init thy;
   747     val name = Sign.full_bname thy bname;
   748     val _ = NewLocale.test_locale thy name andalso
   749       error ("Duplicate definition of locale " ^ quote name);
   750 
   751     val ((fixed, deps, body_elems), text as (parms, ((_, exts'), _), defs)) =
   752       prep_decl raw_imprt raw_body thy_ctxt;
   753     val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
   754       define_preds predicate_name text thy;
   755 
   756     val extraTs = fold Term.add_tfrees exts' [] \\ fold Term.add_tfreesT (map snd parms) [];
   757     val _ = if null extraTs then ()
   758       else warning ("Additional type variable(s) in locale specification " ^ quote bname);
   759 
   760     val satisfy = Element.satisfy_morphism b_axioms;
   761 
   762     val params = fixed @
   763       (body_elems |> map_filter (fn Fixes fixes => SOME fixes | _ => NONE) |> flat);
   764     val asm = if is_some b_statement then b_statement else a_statement;
   765     val (body_elems', defns) = fold_map (defines_to_notes thy') body_elems [];
   766     val notes = body_elems' |>
   767       (fn elems => fold_map assumes_to_notes elems (map Element.conclude_witness a_axioms)) |>
   768       fst |> map (Element.morph_ctxt satisfy) |>
   769       map_filter (fn Notes notes => SOME notes | _ => NONE) |>
   770       (if is_some asm
   771         then cons (Thm.internalK, [((Binding.name (bname ^ "_" ^ axiomsN), []),
   772           [([assume (cterm_of thy' (the asm))], [(Attrib.internal o K) NewLocale.witness_attrib])])])
   773         else I);
   774 
   775     val deps' = map (fn (l, morph) => (l, morph $> satisfy)) deps;
   776 
   777     val loc_ctxt = thy' |>
   778       NewLocale.register_locale bname (extraTs, params)
   779         (asm, map prop_of defs) ([], [])
   780         (map (fn n => (n, stamp ())) notes |> rev) (map (fn d => (d, stamp ())) deps' |> rev) |>
   781       NewLocale.init name
   782   in (name, loc_ctxt) end;
   783 
   784 in
   785 
   786 val add_locale_cmd = gen_add_locale read_declaration;
   787 val add_locale = gen_add_locale cert_declaration;
   788 
   789 end;
   790 
   791 
   792 (*** Interpretation ***)
   793 
   794 (** Witnesses and goals **)
   795 
   796 fun prep_propp propss = propss |> map (map (rpair [] o Element.mark_witness));
   797 
   798 fun prep_result propps thmss =
   799   ListPair.map (fn (props, thms) => map2 Element.make_witness props thms) (propps, thmss);
   800 
   801 
   802 (** Interpretation between locales: declaring sublocale relationships **)
   803 
   804 local
   805 
   806 fun gen_sublocale prep_expr intern
   807     raw_target expression thy =
   808   let
   809     val target = intern thy raw_target;
   810     val target_ctxt = NewLocale.init target thy;
   811 
   812     val ((propss, deps, export), goal_ctxt) = prep_expr expression target_ctxt;
   813     
   814     fun store_dep ((name, morph), thms) =
   815       NewLocale.add_dependency target (name, morph $> Element.satisfy_morphism thms $> export);
   816 
   817     fun after_qed results =
   818       ProofContext.theory (
   819         (* store dependencies *)
   820         fold store_dep (deps ~~ prep_result propss results) #>
   821         (* propagate registrations *)
   822         (fn thy => fold_rev (fn reg => NewLocale.activate_global_facts reg)
   823           (NewLocale.get_global_registrations thy) thy));
   824   in
   825     goal_ctxt |>
   826       Proof.theorem_i NONE after_qed (prep_propp propss) |>
   827       Element.refine_witness |> Seq.hd
   828   end;
   829 
   830 in
   831 
   832 fun sublocale_cmd x = gen_sublocale read_goal_expression NewLocale.intern x;
   833 fun sublocale x = gen_sublocale cert_goal_expression (K I) x;
   834 
   835 end;
   836 
   837 
   838 (** Interpretation in theories **)
   839 
   840 local
   841 
   842 fun gen_interpretation prep_expr
   843     expression thy =
   844   let
   845     val ctxt = ProofContext.init thy;
   846 
   847     val ((propss, regs, export), goal_ctxt) = prep_expr expression ctxt;
   848     
   849     fun store_reg ((name, morph), thms) =
   850       let
   851         val morph' = morph $> Element.satisfy_morphism thms $> export;
   852       in
   853         NewLocale.add_global_registration (name, morph') #>
   854         NewLocale.activate_global_facts (name, morph')
   855       end;
   856 
   857     fun after_qed results =
   858       ProofContext.theory (fold store_reg (regs ~~ prep_result propss results));
   859   in
   860     goal_ctxt |>
   861       Proof.theorem_i NONE after_qed (prep_propp propss) |>
   862       Element.refine_witness |> Seq.hd
   863   end;
   864 
   865 in
   866 
   867 fun interpretation_cmd x = gen_interpretation read_goal_expression x;
   868 fun interpretation x = gen_interpretation cert_goal_expression x;
   869 
   870 end;
   871 
   872 
   873 (** Interpretation in proof contexts **)
   874 
   875 local
   876 
   877 fun gen_interpret prep_expr
   878     expression int state =
   879   let
   880     val _ = Proof.assert_forward_or_chain state;
   881     val ctxt = Proof.context_of state;
   882 
   883     val ((propss, regs, export), goal_ctxt) = prep_expr expression ctxt;
   884     
   885     fun store_reg ((name, morph), thms) =
   886       let
   887         val morph' = morph $> Element.satisfy_morphism thms $> export;
   888       in
   889         NewLocale.activate_local_facts (name, morph')
   890       end;
   891 
   892     fun after_qed results =
   893       Proof.map_context (fold store_reg (regs ~~ prep_result propss results)) #> Seq.single;
   894   in
   895     state |> Proof.map_context (K goal_ctxt) |>
   896       Proof.local_goal (ProofDisplay.print_results int) (K I) ProofContext.bind_propp_i
   897       "interpret" NONE after_qed (map (pair (Binding.empty, [])) (prep_propp propss)) |>
   898       Element.refine_witness |> Seq.hd
   899   end;
   900 
   901 in
   902 
   903 fun interpret_cmd x = gen_interpret read_goal_expression x;
   904 fun interpret x = gen_interpret cert_goal_expression x;
   905 
   906 end;
   907 
   908 end;
   909