wenzelm@18620: (* Title: Pure/Isar/specification.ML wenzelm@18620: ID: $Id$ wenzelm@18620: Author: Makarius wenzelm@18620: wenzelm@21036: Derived local theory specifications --- with type-inference and wenzelm@18810: toplevel polymorphism. wenzelm@18620: *) wenzelm@18620: wenzelm@18620: signature SPECIFICATION = wenzelm@18620: sig wenzelm@20890: val quiet_mode: bool ref wenzelm@20890: val print_consts: local_theory -> (string * typ -> bool) -> (string * typ) list -> unit wenzelm@18771: val read_specification: (string * string option * mixfix) list -> wenzelm@18954: ((string * Attrib.src list) * string list) list -> local_theory -> wenzelm@18771: (((string * typ) * mixfix) list * ((string * Attrib.src list) * term list) list) * wenzelm@18954: local_theory wenzelm@18771: val cert_specification: (string * typ option * mixfix) list -> wenzelm@18954: ((string * Attrib.src list) * term list) list -> local_theory -> wenzelm@18771: (((string * typ) * mixfix) list * ((string * Attrib.src list) * term list) list) * wenzelm@18954: local_theory wenzelm@18954: val axiomatization: (string * string option * mixfix) list -> wenzelm@18954: ((bstring * Attrib.src list) * string list) list -> local_theory -> wenzelm@18954: (term list * (bstring * thm list) list) * local_theory wenzelm@18954: val axiomatization_i: (string * typ option * mixfix) list -> wenzelm@18954: ((bstring * Attrib.src list) * term list) list -> local_theory -> wenzelm@18954: (term list * (bstring * thm list) list) * local_theory wenzelm@18954: val definition: wenzelm@18786: ((string * string option * mixfix) option * ((string * Attrib.src list) * string)) list -> wenzelm@18954: local_theory -> (term * (bstring * thm)) list * local_theory wenzelm@18954: val definition_i: wenzelm@18786: ((string * typ option * mixfix) option * ((string * Attrib.src list) * term)) list -> wenzelm@18954: local_theory -> (term * (bstring * thm)) list * local_theory wenzelm@20784: val abbreviation: Syntax.mode -> ((string * string option * mixfix) option * string) list -> wenzelm@19080: local_theory -> local_theory wenzelm@20784: val abbreviation_i: Syntax.mode -> ((string * typ option * mixfix) option * term) list -> wenzelm@19080: local_theory -> local_theory wenzelm@21206: val notation: Syntax.mode -> (string * mixfix) list -> local_theory -> local_theory wenzelm@21206: val notation_i: Syntax.mode -> (term * mixfix) list -> local_theory -> local_theory wenzelm@20914: val theorems: string -> ((bstring * Attrib.src list) * (thmref * Attrib.src list) list) list wenzelm@20914: -> local_theory -> (bstring * thm list) list * local_theory wenzelm@20914: val theorems_i: string -> ((bstring * Attrib.src list) * (thm list * Attrib.src list) list) list wenzelm@20914: -> local_theory -> (bstring * thm list) list * local_theory wenzelm@21036: val theorem: string -> Method.text option -> (thm list list -> local_theory -> local_theory) -> wenzelm@21036: string * Attrib.src list -> Element.context Locale.element list -> Element.statement -> wenzelm@21036: local_theory -> Proof.state wenzelm@21036: val theorem_i: string -> Method.text option -> (thm list list -> local_theory -> local_theory) -> wenzelm@21036: string * Attrib.src list -> Element.context_i Locale.element list -> Element.statement_i -> wenzelm@21036: local_theory -> Proof.state wenzelm@18620: end; wenzelm@18620: wenzelm@18620: structure Specification: SPECIFICATION = wenzelm@18620: struct wenzelm@18620: wenzelm@21230: wenzelm@20890: (* diagnostics *) wenzelm@20890: wenzelm@20890: val quiet_mode = ref false; wenzelm@20890: wenzelm@20890: fun print_consts _ _ [] = () wenzelm@20890: | print_consts ctxt pred cs = wenzelm@20890: if ! quiet_mode then () else Pretty.writeln (ProofDisplay.pretty_consts ctxt pred cs); wenzelm@20890: wenzelm@21036: fun present_results ctxt res = wenzelm@21036: if ! quiet_mode then () else ProofDisplay.present_results ctxt res; wenzelm@21036: wenzelm@21036: fun present_results' ctxt kind res = present_results ctxt ((kind, ""), res); wenzelm@20914: wenzelm@19664: wenzelm@18620: (* prepare specification *) wenzelm@18620: wenzelm@18828: fun prep_specification prep_vars prep_propp prep_att raw_vars raw_specs ctxt = wenzelm@18620: let wenzelm@18670: val thy = ProofContext.theory_of ctxt; wenzelm@18620: wenzelm@18670: val (vars, vars_ctxt) = ctxt |> prep_vars raw_vars; wenzelm@18670: val (xs, params_ctxt) = vars_ctxt |> ProofContext.add_fixes_i vars; wenzelm@18670: val ((specs, vs), specs_ctxt) = wenzelm@19585: prep_propp (params_ctxt, map (map (rpair []) o snd) raw_specs) wenzelm@18620: |> swap |>> map (map fst) wenzelm@18771: ||>> fold_map ProofContext.inferred_param xs; wenzelm@18620: wenzelm@18771: val params = vs ~~ map #3 vars; wenzelm@18620: val names = map (fst o fst) raw_specs; wenzelm@18670: val atts = map (map (prep_att thy) o snd o fst) raw_specs; wenzelm@18620: in ((params, (names ~~ atts) ~~ specs), specs_ctxt) end; wenzelm@18620: wenzelm@18620: fun read_specification x = wenzelm@18771: prep_specification ProofContext.read_vars ProofContext.read_propp Attrib.intern_src x; wenzelm@18620: fun cert_specification x = wenzelm@18670: prep_specification ProofContext.cert_vars ProofContext.cert_propp (K I) x; wenzelm@18620: wenzelm@18620: wenzelm@18771: (* axiomatization *) wenzelm@18620: wenzelm@20890: fun gen_axioms prep raw_vars raw_specs lthy = wenzelm@18620: let wenzelm@20890: val (vars, specs) = fst (prep raw_vars raw_specs lthy); wenzelm@18828: val cs = map fst vars; wenzelm@18880: val spec_frees = member (op =) (fold (fold Term.add_frees o snd) specs []); wenzelm@18786: wenzelm@20890: val ((consts, axioms), lthy') = lthy wenzelm@20890: |> LocalTheory.consts spec_frees vars wenzelm@20914: ||> fold (fold Variable.fix_frees o snd) specs (* FIXME !? *) wenzelm@20890: ||>> LocalTheory.axioms specs; wenzelm@18786: wenzelm@20890: (* FIXME generic target!? *) wenzelm@20890: val hs = map (Term.head_of o #2 o Logic.dest_equals o Thm.prop_of o #2) consts; wenzelm@20890: val lthy'' = lthy' |> LocalTheory.theory (Theory.add_finals_i false hs); wenzelm@20890: wenzelm@20890: val _ = print_consts lthy' spec_frees cs; wenzelm@20890: in ((map #1 consts, axioms), lthy'') end; wenzelm@18786: wenzelm@18954: val axiomatization = gen_axioms read_specification; wenzelm@18954: val axiomatization_i = gen_axioms cert_specification; wenzelm@18620: wenzelm@18786: wenzelm@18786: (* definition *) wenzelm@18786: wenzelm@20890: fun gen_defs prep args lthy = wenzelm@18786: let wenzelm@20890: fun define (raw_var, (raw_a, raw_prop)) lthy1 = wenzelm@18786: let wenzelm@20890: val (vars, [((raw_name, atts), [prop])]) = wenzelm@20890: fst (prep (the_list raw_var) [(raw_a, [raw_prop])] lthy1); wenzelm@20890: val (((x, T), rhs), prove) = LocalDefs.derived_def lthy1 true prop; wenzelm@20890: val name = Thm.def_name_optional x raw_name; wenzelm@18786: val mx = (case vars of [] => NoSyn | [((x', _), mx)] => wenzelm@18786: if x = x' then mx wenzelm@18786: else error ("Head of definition " ^ quote x ^ " differs from declaration " ^ quote x')); wenzelm@20890: val ((lhs, (_, th)), lthy2) = lthy1 wenzelm@20890: (* |> LocalTheory.def ((x, mx), ((name ^ "_raw", []), rhs)); FIXME *) wenzelm@20890: |> LocalTheory.def ((x, mx), ((name, []), rhs)); wenzelm@20890: val ((b, [th']), lthy3) = lthy2 wenzelm@20914: |> LocalTheory.note ((name, atts), [prove lthy2 th]); wenzelm@20890: in (((x, T), (lhs, (b, th'))), LocalTheory.reinit lthy3) end; wenzelm@18786: wenzelm@20890: val ((cs, defs), lthy') = lthy |> fold_map define args |>> split_list; wenzelm@18880: val def_frees = member (op =) (fold (Term.add_frees o fst) defs []); wenzelm@20890: val _ = print_consts lthy' def_frees cs; wenzelm@20890: in (defs, lthy') end; wenzelm@18786: wenzelm@18954: val definition = gen_defs read_specification; wenzelm@18954: val definition_i = gen_defs cert_specification; wenzelm@18786: wenzelm@19080: wenzelm@19080: (* abbreviation *) wenzelm@19080: wenzelm@20890: fun gen_abbrevs prep mode args lthy = wenzelm@19080: let wenzelm@20890: fun abbrev (raw_var, raw_prop) lthy1 = wenzelm@19080: let wenzelm@19372: val ((vars, [(_, [prop])]), _) = wenzelm@19372: prep (the_list raw_var) [(("", []), [raw_prop])] wenzelm@20890: (lthy1 |> ProofContext.expand_abbrevs false); wenzelm@20890: val ((x, T), rhs) = LocalDefs.abs_def (#2 (LocalDefs.cert_def lthy1 prop)); wenzelm@19080: val mx = (case vars of [] => NoSyn | [((x', _), mx)] => wenzelm@19080: if x = x' then mx wenzelm@19080: else error ("Head of abbreviation " ^ quote x ^ " differs from declaration " ^ quote x')); wenzelm@19080: in wenzelm@20890: lthy1 wenzelm@19664: |> LocalTheory.abbrevs mode [((x, mx), rhs)] wenzelm@19080: |> pair (x, T) wenzelm@19080: end; wenzelm@19080: wenzelm@20890: val (cs, lthy1) = lthy wenzelm@19544: |> ProofContext.set_syntax_mode mode wenzelm@19544: |> fold_map abbrev args wenzelm@20890: ||> ProofContext.restore_syntax_mode lthy; wenzelm@20890: val _ = print_consts lthy1 (K false) cs; wenzelm@20890: in lthy1 end; wenzelm@19080: wenzelm@19080: val abbreviation = gen_abbrevs read_specification; wenzelm@19080: val abbreviation_i = gen_abbrevs cert_specification; wenzelm@19080: wenzelm@19664: wenzelm@21230: (* notation *) wenzelm@19664: wenzelm@21206: fun gen_notation prep_const mode args lthy = wenzelm@21206: lthy |> LocalTheory.notation mode (map (apfst (prep_const lthy)) args); wenzelm@19664: wenzelm@21206: val notation = gen_notation ProofContext.read_const; wenzelm@21206: val notation_i = gen_notation (K I); wenzelm@19664: wenzelm@20914: wenzelm@21036: (* fact statements *) wenzelm@20914: wenzelm@20914: fun gen_theorems prep_thms prep_att kind raw_facts lthy = wenzelm@20914: let wenzelm@20914: val k = if kind = "" then [] else [Attrib.kind kind]; wenzelm@20914: val attrib = prep_att (ProofContext.theory_of lthy); wenzelm@20914: val facts = raw_facts |> map (fn ((name, atts), bs) => wenzelm@20914: ((name, map attrib atts), wenzelm@20914: bs |> map (fn (b, more_atts) => (prep_thms lthy b, map attrib more_atts @ k)))); wenzelm@20914: val (res, lthy') = lthy |> LocalTheory.notes facts; wenzelm@21036: val _ = present_results' lthy' kind res; wenzelm@20914: in (res, lthy') end; wenzelm@20914: wenzelm@20914: val theorems = gen_theorems ProofContext.get_thms Attrib.intern_src; wenzelm@20914: val theorems_i = gen_theorems (K I) (K I); wenzelm@20914: wenzelm@21036: wenzelm@21230: (* complex goal statements *) wenzelm@21036: wenzelm@21036: local wenzelm@21036: wenzelm@21230: fun conclusion prep_att (Element.Shows concl) = wenzelm@21230: let wenzelm@21230: fun mk_stmt propp ctxt = wenzelm@21230: ((Attrib.map_specs prep_att (map fst concl ~~ propp), []), wenzelm@21230: fold (fold (Variable.fix_frees o fst)) propp ctxt); wenzelm@21230: in (([], map snd concl), mk_stmt) end wenzelm@21230: | conclusion _ (Element.Obtains cases) = wenzelm@21230: let wenzelm@21230: val names = wenzelm@21230: cases |> map_index (fn (i, ("", _)) => string_of_int (i + 1) | (_, (name, _)) => name); wenzelm@21230: val elems = cases |> map (fn (_, (vars, _)) => wenzelm@21230: Element.Constrains (vars |> map_filter (fn (x, SOME T) => SOME (x, T) | _ => NONE))); wenzelm@21230: val concl = cases |> map (fn (_, (_, props)) => map (rpair []) props); wenzelm@21036: wenzelm@21230: fun mk_stmt propp ctxt = wenzelm@21230: let wenzelm@21230: val thesis = wenzelm@21230: ObjectLogic.fixed_judgment (ProofContext.theory_of ctxt) AutoBind.thesisN; wenzelm@21230: val atts = map Attrib.internal wenzelm@21230: [RuleCases.consumes (~ (length cases)), RuleCases.case_names names]; wenzelm@21036: wenzelm@21230: fun assume_case ((name, (vars, _)), asms) ctxt' = wenzelm@21230: let wenzelm@21230: val xs = map fst vars; wenzelm@21230: val props = map fst asms; wenzelm@21230: val (parms, _) = ctxt' wenzelm@21230: |> fold Variable.declare_term props wenzelm@21230: |> fold_map ProofContext.inferred_param xs; wenzelm@21230: val asm = Term.list_all_free (parms, Logic.list_implies (props, thesis)); wenzelm@21230: in wenzelm@21230: ctxt' |> (snd o ProofContext.add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs)); wenzelm@21230: ctxt' |> Variable.fix_frees asm wenzelm@21230: |> ProofContext.add_assms_i Assumption.assume_export wenzelm@21230: [((name, [ContextRules.intro_query NONE]), [(asm, [])])] wenzelm@21230: |>> (fn [(_, [th])] => th) wenzelm@21230: end; wenzelm@21230: val (ths, ctxt') = ctxt wenzelm@21230: |> (snd o ProofContext.add_fixes_i [(AutoBind.thesisN, NONE, NoSyn)]) wenzelm@21230: |> fold_map assume_case (cases ~~ propp) wenzelm@21230: |-> (fn ths => wenzelm@21230: ProofContext.note_thmss_i [((Obtain.thatN, []), [(ths, [])])] #> #2 #> pair ths); wenzelm@21230: in (([(("", atts), [(thesis, [])])], ths), ctxt') end; wenzelm@21230: in ((map Locale.Elem elems, concl), mk_stmt) end; wenzelm@21036: wenzelm@21036: fun gen_theorem prep_att prep_stmt wenzelm@21036: kind before_qed after_qed (name, raw_atts) raw_elems raw_concl lthy0 = wenzelm@21036: let wenzelm@21036: val _ = LocalTheory.assert lthy0; wenzelm@21036: val thy = ProofContext.theory_of lthy0; wenzelm@21206: wenzelm@21036: val (loc, ctxt, lthy) = wenzelm@21036: (case (TheoryTarget.peek lthy0, exists (fn Locale.Expr _ => true | _ => false) raw_elems) of wenzelm@21036: (SOME loc, true) => (* workaround non-modularity of in/includes *) (* FIXME *) wenzelm@21230: (SOME loc, ProofContext.init thy, LocalTheory.reinit lthy0) wenzelm@21036: | _ => (NONE, lthy0, lthy0)); wenzelm@21036: wenzelm@21036: val attrib = prep_att thy; wenzelm@21036: val elem_attrib = Locale.map_elem wenzelm@21036: (Element.map_ctxt {name = I, var = I, typ = I, term = I, fact = I, attrib = attrib}); wenzelm@21036: wenzelm@21036: val ((concl_elems, concl), mk_stmt) = conclusion attrib raw_concl; wenzelm@21036: val elems = map elem_attrib (raw_elems @ concl_elems); wenzelm@21036: wenzelm@21230: val (_, _, elems_ctxt, propp) = prep_stmt loc elems concl ctxt; wenzelm@21230: val ((stmt, facts), goal_ctxt) = mk_stmt propp elems_ctxt; wenzelm@21036: wenzelm@21036: val k = if kind = "" then [] else [Attrib.kind kind]; wenzelm@21230: val names = map (fst o fst) stmt; wenzelm@21230: val attss = map (fn ((_, atts), _) => map attrib atts @ k) stmt; wenzelm@21036: val atts = map attrib raw_atts @ k; wenzelm@21036: wenzelm@21036: fun after_qed' results goal_ctxt' = wenzelm@21036: let val results' = burrow (ProofContext.export_standard goal_ctxt' lthy) results in wenzelm@21036: lthy wenzelm@21036: |> LocalTheory.notes ((names ~~ attss) ~~ map (fn ths => [(ths, [])]) results') wenzelm@21036: |> (fn (res, lthy') => wenzelm@21036: (present_results lthy' ((kind, name), res); wenzelm@21036: if name = "" andalso null raw_atts then lthy' wenzelm@21036: else #2 (LocalTheory.notes [((name, atts), [(maps #2 res, [])])] lthy'))) wenzelm@21036: |> after_qed results' wenzelm@21036: end; wenzelm@21036: in wenzelm@21036: goal_ctxt wenzelm@21230: |> Proof.global_goal (K (K ())) Attrib.attribute_i ProofContext.bind_propp_schematic_i wenzelm@21230: kind before_qed after_qed' NONE (name, []) stmt wenzelm@21036: |> Proof.refine_insert facts wenzelm@21036: end; wenzelm@21036: wenzelm@21230: in wenzelm@21230: wenzelm@21036: val theorem = gen_theorem Attrib.intern_src Locale.read_context_statement_i; wenzelm@21036: val theorem_i = gen_theorem (K I) Locale.cert_context_statement; wenzelm@21036: wenzelm@18620: end; wenzelm@21036: wenzelm@21036: end;