src/Pure/Isar/specification.ML
author wenzelm
Thu Mar 20 00:20:49 2008 +0100 (2008-03-20)
changeset 26345 f70620a4cf81
parent 26336 a0e2b706ce73
child 26595 855893d4d75f
permissions -rw-r--r--
renamed former get_thms(_silent) to get_fact(_silent);
     1 (*  Title:      Pure/Isar/specification.ML
     2     ID:         $Id$
     3     Author:     Makarius
     4 
     5 Derived local theory specifications --- with type-inference and
     6 toplevel polymorphism.
     7 *)
     8 
     9 signature SPECIFICATION =
    10 sig
    11   val print_consts: local_theory -> (string * typ -> bool) -> (string * typ) list -> unit
    12   val check_specification: (string * typ option * mixfix) list ->
    13     ((string * Attrib.src list) * term list) list list -> Proof.context ->
    14     (((string * typ) * mixfix) list * ((string * Attrib.src list) * term list) list) *
    15     Proof.context
    16   val read_specification: (string * string option * mixfix) list ->
    17     ((string * Attrib.src list) * string list) list list -> Proof.context ->
    18     (((string * typ) * mixfix) list * ((string * Attrib.src list) * term list) list) *
    19     Proof.context
    20   val check_free_specification: (string * typ option * mixfix) list ->
    21     ((string * Attrib.src list) * term list) list -> Proof.context ->
    22     (((string * typ) * mixfix) list * ((string * Attrib.src list) * term list) list) *
    23     Proof.context
    24   val read_free_specification: (string * string option * mixfix) list ->
    25     ((string * Attrib.src list) * string list) list -> Proof.context ->
    26     (((string * typ) * mixfix) list * ((string * Attrib.src list) * term list) list) *
    27     Proof.context
    28   val axiomatization: (string * typ option * mixfix) list ->
    29     ((bstring * Attrib.src list) * term list) list -> local_theory ->
    30     (term list * (bstring * thm list) list) * local_theory
    31   val axiomatization_cmd: (string * string option * mixfix) list ->
    32     ((bstring * Attrib.src list) * string list) list -> local_theory ->
    33     (term list * (bstring * thm list) list) * local_theory
    34   val definition:
    35     (string * typ option * mixfix) option * ((string * Attrib.src list) * term) ->
    36     local_theory -> (term * (bstring * thm)) * local_theory
    37   val definition_cmd:
    38     (string * string option * mixfix) option * ((string * Attrib.src list) * string) ->
    39     local_theory -> (term * (bstring * thm)) * local_theory
    40   val abbreviation: Syntax.mode -> (string * typ option * mixfix) option * term ->
    41     local_theory -> local_theory
    42   val abbreviation_cmd: Syntax.mode -> (string * string option * mixfix) option * string ->
    43     local_theory -> local_theory
    44   val notation: bool -> Syntax.mode -> (term * mixfix) list -> local_theory -> local_theory
    45   val notation_cmd: bool -> Syntax.mode -> (string * mixfix) list -> local_theory -> local_theory
    46   val theorems: string -> ((bstring * Attrib.src list) * (thm list * Attrib.src list) list) list ->
    47     local_theory -> (bstring * thm list) list * local_theory
    48   val theorems_cmd: string ->
    49     ((bstring * Attrib.src list) * (Facts.ref * Attrib.src list) list) list ->
    50     local_theory -> (bstring * thm list) list * local_theory
    51   val theorem: string -> Method.text option ->
    52     (thm list list -> local_theory -> local_theory) ->
    53     string * Attrib.src list -> Element.context_i Locale.element list -> Element.statement_i ->
    54     bool -> local_theory -> Proof.state
    55   val theorem_cmd: string -> Method.text option ->
    56     (thm list list -> local_theory -> local_theory) ->
    57     string * Attrib.src list -> Element.context Locale.element list -> Element.statement ->
    58     bool -> local_theory -> Proof.state
    59   val add_theorem_hook: (bool -> Proof.state -> Proof.state) -> Context.generic -> Context.generic
    60 end;
    61 
    62 structure Specification: SPECIFICATION =
    63 struct
    64 
    65 
    66 (* diagnostics *)
    67 
    68 fun print_consts _ _ [] = ()
    69   | print_consts ctxt pred cs = Pretty.writeln (ProofDisplay.pretty_consts ctxt pred cs);
    70 
    71 
    72 (* prepare specification *)
    73 
    74 local
    75 
    76 fun close_forms ctxt i xs As =
    77   let
    78     fun add_free (Free (x, _)) = if Variable.is_fixed ctxt x then I else insert (op =) x
    79       | add_free _ = I;
    80 
    81     val commons = map #1 xs;
    82     val _ =
    83       (case duplicates (op =) commons of [] => ()
    84       | dups => error ("Duplicate local variables " ^ commas_quote dups));
    85     val frees = rev ((fold o fold_aterms) add_free As (rev commons));
    86     val types = map (TypeInfer.param i o rpair []) (Name.invents Name.context Name.aT (length frees));
    87     val uniform_typing = the o AList.lookup (op =) (frees ~~ types);
    88 
    89     fun abs_body lev y (Abs (x, T, b)) = Abs (x, T, abs_body (lev + 1) y b)
    90       | abs_body lev y (t $ u) = abs_body lev y t $ abs_body lev y u
    91       | abs_body lev y (t as Free (x, T)) =
    92           if x = y then TypeInfer.constrain (uniform_typing x) (TypeInfer.constrain T (Bound lev))
    93           else t
    94       | abs_body _ _ a = a;
    95     fun close (y, U) B =
    96       let val B' = abs_body 0 y (Term.incr_boundvars 1 B)
    97       in if Term.loose_bvar1 (B', 0) then Term.all dummyT $ Abs (y, U, B') else B end;
    98     fun close_form A =
    99       let
   100         val occ_frees = rev (fold_aterms add_free A []);
   101         val bounds = xs @ map (rpair dummyT) (subtract (op =) commons occ_frees);
   102       in fold_rev close bounds A end;
   103   in map close_form As end;
   104 
   105 fun prep_spec prep_vars parse_prop prep_att do_close raw_vars raw_specss ctxt =
   106   let
   107     val thy = ProofContext.theory_of ctxt;
   108 
   109     val (vars, vars_ctxt) = ctxt |> prep_vars raw_vars;
   110     val (xs, params_ctxt) = vars_ctxt |> ProofContext.add_fixes_i vars;
   111 
   112     val Asss = (map o map) (map (parse_prop params_ctxt) o snd) raw_specss;
   113     val names = Variable.names_of (params_ctxt |> (fold o fold o fold) Variable.declare_term Asss)
   114       |> fold Name.declare xs;
   115     val Asss' = #1 ((fold_map o fold_map o fold_map) Term.free_dummy_patterns Asss names);
   116     val idx = (fold o fold o fold) Term.maxidx_term Asss' ~1 + 1;
   117     val specs =
   118       (if do_close then
   119         #1 (fold_map
   120             (fn Ass => fn i => (burrow (close_forms params_ctxt i []) Ass, i + 1)) Asss' idx)
   121       else Asss')
   122       |> flat |> burrow (Syntax.check_props params_ctxt);
   123     val specs_ctxt = params_ctxt |> (fold o fold) Variable.declare_term specs;
   124 
   125     val vs = specs_ctxt |> fold_map ProofContext.inferred_param xs |> fst;
   126     val params = vs ~~ map #3 vars;
   127     val name_atts = map (fn ((name, atts), _) => (name, map (prep_att thy) atts)) (flat raw_specss);
   128   in ((params, name_atts ~~ specs), specs_ctxt) end;
   129 
   130 fun read_spec x = prep_spec ProofContext.read_vars Syntax.parse_prop Attrib.intern_src x;
   131 fun check_spec x = prep_spec ProofContext.cert_vars (K I) (K I) x;
   132 
   133 in
   134 
   135 fun read_specification x = read_spec true x;
   136 fun check_specification x = check_spec true x;
   137 fun read_free_specification vars specs = read_spec false vars [specs];
   138 fun check_free_specification vars specs = check_spec false vars [specs];
   139 
   140 end;
   141 
   142 
   143 (* axiomatization *)
   144 
   145 fun gen_axioms prep raw_vars raw_specs lthy =
   146   let
   147     val ((vars, specs), _) = prep raw_vars [raw_specs] lthy;
   148     val ((consts, axioms), lthy') = LocalTheory.axioms Thm.axiomK (vars, specs) lthy;
   149     val consts' = map (Morphism.term (LocalTheory.target_morphism lthy')) consts;
   150     val _ = print_consts lthy' (member (op =) (fold Term.add_frees consts' [])) (map fst vars);
   151   in ((consts, axioms), lthy') end;
   152 
   153 val axiomatization = gen_axioms check_specification;
   154 val axiomatization_cmd = gen_axioms read_specification;
   155 
   156 
   157 (* definition *)
   158 
   159 fun gen_def prep (raw_var, (raw_a, raw_prop)) lthy =
   160   let
   161     val (vars, [((raw_name, atts), [prop])]) =
   162       fst (prep (the_list raw_var) [(raw_a, [raw_prop])] lthy);
   163     val (((x, T), rhs), prove) = LocalDefs.derived_def lthy true prop;
   164     val name = Thm.def_name_optional x raw_name;
   165     val mx = (case vars of [] => NoSyn | [((x', _), mx)] =>
   166       if x = x' then mx
   167       else error ("Head of definition " ^ quote x ^ " differs from declaration " ^ quote x'));
   168     val ((lhs, (_, th)), lthy2) = lthy
   169       |> LocalTheory.define Thm.definitionK ((x, mx), ((name ^ "_raw", []), rhs));
   170     val ((b, [th']), lthy3) = lthy2
   171       |> LocalTheory.note Thm.definitionK
   172           ((name, Code.add_default_func_attr :: atts), [prove lthy2 th]);
   173 
   174     val lhs' = Morphism.term (LocalTheory.target_morphism lthy3) lhs;
   175     val _ = print_consts lthy3 (member (op =) (Term.add_frees lhs' [])) [(x, T)];
   176   in ((lhs, (b, th')), lthy3) end;
   177 
   178 val definition = gen_def check_free_specification;
   179 val definition_cmd = gen_def read_free_specification;
   180 
   181 
   182 (* abbreviation *)
   183 
   184 fun gen_abbrev prep mode (raw_var, raw_prop) lthy =
   185   let
   186     val ((vars, [(_, [prop])]), _) =
   187       prep (the_list raw_var) [(("", []), [raw_prop])]
   188         (lthy |> ProofContext.set_mode ProofContext.mode_abbrev);
   189     val ((x, T), rhs) = LocalDefs.abs_def (#2 (LocalDefs.cert_def lthy prop));
   190     val mx = (case vars of [] => NoSyn | [((y, _), mx)] =>
   191       if x = y then mx
   192       else error ("Head of abbreviation " ^ quote x ^ " differs from declaration " ^ quote y));
   193     val lthy' = lthy
   194       |> ProofContext.set_syntax_mode mode    (* FIXME ?!? *)
   195       |> LocalTheory.abbrev mode ((x, mx), rhs) |> snd
   196       |> ProofContext.restore_syntax_mode lthy;
   197 
   198     val _ = print_consts lthy' (K false) [(x, T)]
   199   in lthy' end;
   200 
   201 val abbreviation = gen_abbrev check_free_specification;
   202 val abbreviation_cmd = gen_abbrev read_free_specification;
   203 
   204 
   205 (* notation *)
   206 
   207 fun gen_notation prep_const add mode args lthy =
   208   lthy |> LocalTheory.notation add mode (map (apfst (prep_const lthy)) args);
   209 
   210 val notation = gen_notation (K I);
   211 val notation_cmd = gen_notation ProofContext.read_const;
   212 
   213 
   214 (* fact statements *)
   215 
   216 fun gen_theorems prep_fact prep_att kind raw_facts lthy =
   217   let
   218     val attrib = prep_att (ProofContext.theory_of lthy);
   219     val facts = raw_facts |> map (fn ((name, atts), bs) =>
   220       ((name, map attrib atts),
   221         bs |> map (fn (b, more_atts) => (prep_fact lthy b, map attrib more_atts))));
   222     val (res, lthy') = lthy |> LocalTheory.notes kind facts;
   223     val _ = ProofDisplay.present_results lthy' ((kind, ""), res);
   224   in (res, lthy') end;
   225 
   226 val theorems = gen_theorems (K I) (K I);
   227 val theorems_cmd = gen_theorems ProofContext.get_fact Attrib.intern_src;
   228 
   229 
   230 (* complex goal statements *)
   231 
   232 local
   233 
   234 fun subtract_prems ctxt1 ctxt2 =
   235   Library.drop (length (Assumption.prems_of ctxt1), Assumption.prems_of ctxt2);
   236 
   237 fun prep_statement prep_att prep_stmt elems concl ctxt =
   238   (case concl of
   239     Element.Shows shows =>
   240       let
   241         val (_, loc_ctxt, elems_ctxt, propp) = prep_stmt elems (map snd shows) ctxt;
   242         val prems = subtract_prems loc_ctxt elems_ctxt;
   243         val stmt = Attrib.map_specs prep_att (map fst shows ~~ propp);
   244         val goal_ctxt = fold (fold (Variable.auto_fixes o fst)) propp elems_ctxt;
   245       in ((prems, stmt, []), goal_ctxt) end
   246   | Element.Obtains obtains =>
   247       let
   248         val case_names = obtains |> map_index
   249           (fn (i, ("", _)) => string_of_int (i + 1) | (_, (name, _)) => name);
   250         val constraints = obtains |> map (fn (_, (vars, _)) =>
   251           Locale.Elem (Element.Constrains
   252             (vars |> map_filter (fn (x, SOME T) => SOME (x, T) | _ => NONE))));
   253 
   254         val raw_propp = obtains |> map (fn (_, (_, props)) => map (rpair []) props);
   255         val (_, loc_ctxt, elems_ctxt, propp) = prep_stmt (elems @ constraints) raw_propp ctxt;
   256 
   257         val thesis = ObjectLogic.fixed_judgment (ProofContext.theory_of ctxt) AutoBind.thesisN;
   258 
   259         fun assume_case ((name, (vars, _)), asms) ctxt' =
   260           let
   261             val xs = map fst vars;
   262             val props = map fst asms;
   263             val (parms, _) = ctxt'
   264               |> fold Variable.declare_term props
   265               |> fold_map ProofContext.inferred_param xs;
   266             val asm = Term.list_all_free (parms, Logic.list_implies (props, thesis));
   267           in
   268             ctxt' |> (snd o ProofContext.add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs));
   269             ctxt' |> Variable.auto_fixes asm
   270             |> ProofContext.add_assms_i Assumption.assume_export
   271               [((name, [ContextRules.intro_query NONE]), [(asm, [])])]
   272             |>> (fn [(_, [th])] => th)
   273           end;
   274 
   275         val atts = map (Attrib.internal o K)
   276           [RuleCases.consumes (~ (length obtains)), RuleCases.case_names case_names];
   277         val prems = subtract_prems loc_ctxt elems_ctxt;
   278         val stmt = [(("", atts), [(thesis, [])])];
   279 
   280         val (facts, goal_ctxt) = elems_ctxt
   281           |> (snd o ProofContext.add_fixes_i [(AutoBind.thesisN, NONE, NoSyn)])
   282           |> fold_map assume_case (obtains ~~ propp)
   283           |-> (fn ths => ProofContext.note_thmss_i Thm.assumptionK
   284                 [((Obtain.thatN, []), [(ths, [])])] #> #2 #> pair ths);
   285       in ((prems, stmt, facts), goal_ctxt) end);
   286 
   287 structure TheoremHook = GenericDataFun
   288 (
   289   type T = ((bool -> Proof.state -> Proof.state) * stamp) list;
   290   val empty = [];
   291   val extend = I;
   292   fun merge _ hooks : T = Library.merge (eq_snd op =) hooks;
   293 );
   294 
   295 fun gen_theorem prep_att prep_stmt
   296     kind before_qed after_qed (name, raw_atts) raw_elems raw_concl int lthy0 =
   297   let
   298     val _ = LocalTheory.affirm lthy0;
   299     val thy = ProofContext.theory_of lthy0;
   300 
   301     val (loc, ctxt, lthy) =
   302       (case (TheoryTarget.peek lthy0, exists (fn Locale.Expr _ => true | _ => false) raw_elems) of
   303         ({target, is_locale = true, ...}, true) =>
   304           (*temporary workaround for non-modularity of in/includes*)  (* FIXME *)
   305           (SOME target, ProofContext.init thy, LocalTheory.restore lthy0)
   306       | _ => (NONE, lthy0, lthy0));
   307 
   308     val attrib = prep_att thy;
   309     val atts = map attrib raw_atts;
   310 
   311     val elems = raw_elems |> map (Locale.map_elem (Element.map_ctxt_attrib attrib));
   312     val ((prems, stmt, facts), goal_ctxt) =
   313       prep_statement attrib (prep_stmt loc) elems raw_concl ctxt;
   314 
   315     fun after_qed' results goal_ctxt' =
   316       let val results' =
   317         burrow (map Goal.norm_result o ProofContext.export goal_ctxt' lthy) results
   318       in
   319         lthy
   320         |> LocalTheory.notes kind (map2 (fn (a, _) => fn ths => (a, [(ths, [])])) stmt results')
   321         |> (fn (res, lthy') =>
   322           (ProofDisplay.present_results lthy' ((kind, name), res);
   323             if name = "" andalso null atts then lthy'
   324             else #2 (LocalTheory.notes kind [((name, atts), [(maps #2 res, [])])] lthy')))
   325         |> after_qed results'
   326       end;
   327   in
   328     goal_ctxt
   329     |> ProofContext.note_thmss_i Thm.assumptionK [((AutoBind.assmsN, []), [(prems, [])])]
   330     |> snd
   331     |> Proof.theorem_i before_qed after_qed' (map snd stmt)
   332     |> Proof.refine_insert facts
   333     |> Library.apply (map (fn (f, _) => f int) (rev (TheoremHook.get (Context.Proof goal_ctxt))))
   334   end;
   335 
   336 in
   337 
   338 val theorem = gen_theorem (K I) Locale.cert_context_statement;
   339 val theorem_cmd = gen_theorem Attrib.intern_src Locale.read_context_statement_i;
   340 
   341 fun add_theorem_hook f = TheoremHook.map (cons (f, stamp ()));
   342 
   343 end;
   344 
   345 end;