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