src/HOL/Tools/function_package/fundef_package.ML
author krauss
Thu May 11 15:46:40 2006 +0200 (2006-05-11)
changeset 19611 da2a0014c461
parent 19585 70a1ce3b23ae
child 19617 7cb4b67d4b97
permissions -rw-r--r--
Function Package: Quick-and-dirty-fixed strange "Proved a different theorem bug"
due to abbreviations
krauss@19564
     1
(*  Title:      HOL/Tools/function_package/fundef_package.ML
krauss@19564
     2
    ID:         $Id$
krauss@19564
     3
    Author:     Alexander Krauss, TU Muenchen
krauss@19564
     4
krauss@19564
     5
A package for general recursive function definitions. 
krauss@19564
     6
Isar commands.
krauss@19564
     7
krauss@19564
     8
*)
krauss@19564
     9
krauss@19564
    10
signature FUNDEF_PACKAGE = 
krauss@19564
    11
sig
krauss@19564
    12
    val add_fundef : ((bstring * Attrib.src list) * string) list -> theory -> Proof.state (* Need an _i variant *)
krauss@19564
    13
krauss@19564
    14
    val cong_add: attribute
krauss@19564
    15
    val cong_del: attribute
krauss@19564
    16
							 
krauss@19564
    17
    val setup : theory -> theory
krauss@19564
    18
end
krauss@19564
    19
krauss@19564
    20
krauss@19564
    21
structure FundefPackage : FUNDEF_PACKAGE =
krauss@19564
    22
struct
krauss@19564
    23
krauss@19564
    24
open FundefCommon
krauss@19564
    25
krauss@19564
    26
val True_implies = thm "True_implies"
krauss@19564
    27
krauss@19564
    28
krauss@19611
    29
fun fundef_afterqed congs curry_info name data names atts thmss thy =
krauss@19564
    30
    let
krauss@19564
    31
	val (complete_thm :: compat_thms) = map hd thmss
krauss@19564
    32
	val fundef_data = FundefProof.mk_partial_rules_curried thy congs curry_info data (freezeT complete_thm) (map freezeT compat_thms)
krauss@19583
    33
	val FundefResult {psimps, subset_pinduct, simple_pinduct, total_intro, dom_intros, ...} = fundef_data
krauss@19564
    34
krauss@19564
    35
krauss@19583
    36
	val Prep {names = Names {acc_R=accR, ...}, ...} = data
krauss@19583
    37
	val dom_abbrev = Logic.mk_equals (Free (name ^ "_dom", fastype_of accR), accR)
krauss@19583
    38
	val (_, thy) = LocalTheory.mapping NONE (Specification.abbreviation_i ("", false) [(NONE, dom_abbrev)]) thy
krauss@19564
    39
krauss@19564
    40
	val thy = thy |> Theory.add_path name 
krauss@19564
    41
krauss@19564
    42
	val thy = thy |> Theory.add_path "psimps"
krauss@19564
    43
	val (_, thy) = PureThy.add_thms ((names ~~ psimps) ~~ atts) thy;
krauss@19564
    44
	val thy = thy |> Theory.parent_path
krauss@19564
    45
krauss@19564
    46
	val (_, thy) = PureThy.add_thms [(("cases", complete_thm), [RuleCases.case_names names])] thy
krauss@19564
    47
	val (_, thy) = PureThy.add_thmss [(("domintros", dom_intros), [])] thy
krauss@19564
    48
	val (_, thy) = PureThy.add_thms [(("termination", total_intro), [])] thy
krauss@19564
    49
	val (_,thy) = PureThy.add_thms [(("pinduct", simple_pinduct), [RuleCases.case_names names, InductAttrib.induct_set ""])] thy
krauss@19564
    50
	val (_, thy) = PureThy.add_thmss [(("psimps", psimps), [Simplifier.simp_add])] thy
krauss@19564
    51
	val thy = thy |> Theory.parent_path
krauss@19564
    52
    in
krauss@19564
    53
	add_fundef_data name fundef_data thy
krauss@19564
    54
    end
krauss@19564
    55
krauss@19611
    56
fun gen_add_fundef prep_att eqns_atts thy =
krauss@19564
    57
    let
krauss@19564
    58
	val (natts, eqns) = split_list eqns_atts
krauss@19611
    59
	val (names, raw_atts) = split_list natts
krauss@19611
    60
krauss@19611
    61
	val atts = map (map (prep_att thy)) raw_atts
krauss@19564
    62
krauss@19564
    63
	val congs = get_fundef_congs (Context.Theory thy)
krauss@19564
    64
krauss@19611
    65
	val t_eqns = map (Sign.read_prop thy) eqns
krauss@19611
    66
			 |> map (term_of o cterm_of thy) (* HACK to prevent strange things from happening with abbreviations *)
krauss@19611
    67
krauss@19611
    68
	val (curry_info, name, (data, thy)) = FundefPrep.prepare_fundef_curried congs t_eqns thy
krauss@19583
    69
	val Prep {complete, compat, ...} = data
krauss@19564
    70
krauss@19564
    71
	val props = (complete :: compat) (*(complete :: fst (chop 110 compat))*)
krauss@19564
    72
    in
krauss@19564
    73
	thy |> ProofContext.init
krauss@19611
    74
	    |> Proof.theorem_i PureThy.internalK NONE (fundef_afterqed congs curry_info name data names atts) NONE ("", [])
wenzelm@19585
    75
	    (map (fn t => (("", []), [(t, [])])) props)
krauss@19564
    76
    end
krauss@19564
    77
krauss@19564
    78
krauss@19564
    79
fun total_termination_afterqed name thmss thy =
krauss@19564
    80
    let
krauss@19564
    81
	val totality = hd (hd thmss)
krauss@19564
    82
krauss@19583
    83
	val FundefResult {psimps, simple_pinduct, ... }
krauss@19564
    84
	  = the (get_fundef_data name thy)
krauss@19564
    85
krauss@19564
    86
	val remove_domain_condition = full_simplify (HOL_basic_ss addsimps [totality, True_implies])
krauss@19564
    87
krauss@19564
    88
	val tsimps = map remove_domain_condition psimps
krauss@19564
    89
	val tinduct = remove_domain_condition simple_pinduct
krauss@19564
    90
krauss@19564
    91
	val thy = Theory.add_path name thy
krauss@19564
    92
		  
krauss@19564
    93
		  (* Need the names and attributes. Apply the attributes again? *)
krauss@19564
    94
(*	val thy = thy |> Theory.add_path "simps"
krauss@19564
    95
	val (_, thy) = PureThy.add_thms ((names ~~ tsimps) ~~ atts) thy;
krauss@19564
    96
	val thy = thy |> Theory.parent_path*)
krauss@19564
    97
krauss@19564
    98
	val (_, thy) = PureThy.add_thms [(("induct", tinduct), [])] thy 
krauss@19564
    99
	val (_, thy) = PureThy.add_thmss [(("simps", tsimps), [Simplifier.simp_add, RecfunCodegen.add NONE])] thy
krauss@19564
   100
	val thy = Theory.parent_path thy
krauss@19564
   101
    in
krauss@19564
   102
	thy
krauss@19564
   103
    end
krauss@19564
   104
krauss@19564
   105
(*
krauss@19564
   106
fun mk_partial_rules name D_name D domT idomT thmss thy =
krauss@19564
   107
    let
krauss@19564
   108
	val [subs, dcl] = (hd thmss)
krauss@19564
   109
krauss@19564
   110
	val {f_const, f_curried_const, G_const, R_const, G_elims, completeness, f_simps, names_attrs, subset_induct, ... }
krauss@19564
   111
	  = the (Symtab.lookup (FundefData.get thy) name)
krauss@19564
   112
krauss@19564
   113
	val D_implies_dom = subs COMP (instantiate' [SOME (ctyp_of thy idomT)] 
krauss@19564
   114
						    [SOME (cterm_of thy D)]
krauss@19564
   115
						    subsetD)
krauss@19564
   116
krauss@19564
   117
	val D_simps = map (curry op RS D_implies_dom) f_simps
krauss@19564
   118
krauss@19564
   119
	val D_induct = subset_induct
krauss@19564
   120
			   |> cterm_instantiate [(cterm_of thy (Var (("D",0), fastype_of D)) ,cterm_of thy D)]
krauss@19564
   121
			   |> curry op COMP subs
krauss@19564
   122
			   |> curry op COMP (dcl |> forall_intr (cterm_of thy (Var (("z",0), idomT)))
krauss@19564
   123
						 |> forall_intr (cterm_of thy (Var (("x",0), idomT))))
krauss@19564
   124
krauss@19564
   125
	val ([tinduct'], thy2) = PureThy.add_thms [((name ^ "_" ^ D_name ^ "_induct", D_induct), [])] thy
krauss@19564
   126
	val ([tsimps'], thy3) = PureThy.add_thmss [((name ^ "_" ^ D_name ^ "_simps", D_simps), [])] thy2
krauss@19564
   127
    in
krauss@19564
   128
	thy3
krauss@19564
   129
    end
krauss@19564
   130
*)
krauss@19564
   131
 
krauss@19564
   132
krauss@19564
   133
fun fundef_setup_termination_proof name NONE thy = 
krauss@19564
   134
    let
krauss@19564
   135
	val name = if name = "" then get_last_fundef thy else name
krauss@19564
   136
	val data = the (get_fundef_data name thy)
krauss@19564
   137
krauss@19583
   138
	val FundefResult {total_intro, ...} = data
krauss@19564
   139
	val goal = FundefTermination.mk_total_termination_goal data
krauss@19564
   140
    in
krauss@19564
   141
	thy |> ProofContext.init
krauss@19564
   142
	    |> ProofContext.note_thmss_i [(("termination_intro", 
krauss@19564
   143
					    [ContextRules.intro_query NONE]), [([total_intro], [])])] |> snd
krauss@19564
   144
	    |> Proof.theorem_i PureThy.internalK NONE (total_termination_afterqed name) NONE ("", [])
wenzelm@19585
   145
	    [(("", []), [(goal, [])])]
krauss@19564
   146
    end	
krauss@19564
   147
  | fundef_setup_termination_proof name (SOME (dom_name, dom)) thy =
krauss@19564
   148
    let
krauss@19564
   149
	val name = if name = "" then get_last_fundef thy else name
krauss@19564
   150
	val data = the (get_fundef_data name thy)
krauss@19564
   151
	val (subs, dcl) = FundefTermination.mk_partial_termination_goal thy data dom
krauss@19564
   152
    in
krauss@19564
   153
	thy |> ProofContext.init
krauss@19564
   154
	    |> Proof.theorem_i PureThy.internalK NONE (K I) NONE ("", [])
wenzelm@19585
   155
	    [(("", []), [(subs, []), (dcl, [])])]
krauss@19564
   156
    end	
krauss@19564
   157
krauss@19564
   158
krauss@19611
   159
val add_fundef = gen_add_fundef Attrib.attribute
krauss@19611
   160
krauss@19564
   161
krauss@19564
   162
krauss@19564
   163
(* congruence rules *)
krauss@19564
   164
krauss@19564
   165
val cong_add = Thm.declaration_attribute (map_fundef_congs o cons o safe_mk_meta_eq);
krauss@19564
   166
val cong_del = Thm.declaration_attribute (map_fundef_congs o remove (op =) o safe_mk_meta_eq);
krauss@19564
   167
krauss@19564
   168
krauss@19564
   169
(* setup *)
krauss@19564
   170
krauss@19564
   171
val setup = FundefData.init #> FundefCongs.init 
krauss@19564
   172
	#>  Attrib.add_attributes
krauss@19564
   173
		[("fundef_cong", Attrib.add_del_args cong_add cong_del, "declaration of congruence rule for function definitions")]
krauss@19564
   174
krauss@19564
   175
krauss@19564
   176
(* outer syntax *)
krauss@19564
   177
krauss@19564
   178
local structure P = OuterParse and K = OuterKeyword in
krauss@19564
   179
krauss@19564
   180
val function_decl =
krauss@19564
   181
    Scan.repeat1 (P.opt_thm_name ":" -- P.prop);
krauss@19564
   182
krauss@19564
   183
val functionP =
krauss@19564
   184
  OuterSyntax.command "function" "define general recursive functions" K.thy_goal
krauss@19564
   185
    (function_decl >> (fn eqns =>
krauss@19564
   186
      Toplevel.print o Toplevel.theory_to_proof (add_fundef eqns)));
krauss@19564
   187
krauss@19564
   188
val terminationP =
krauss@19564
   189
  OuterSyntax.command "termination" "prove termination of a recursive function" K.thy_goal
krauss@19564
   190
  ((Scan.optional P.name "" -- Scan.option (P.$$$ "(" |-- Scan.optional (P.name --| P.$$$ ":") "dom" -- P.term --| P.$$$ ")"))
krauss@19564
   191
       >> (fn (name,dom) =>
krauss@19564
   192
	      Toplevel.print o Toplevel.theory_to_proof (fundef_setup_termination_proof name dom)));
krauss@19564
   193
krauss@19564
   194
val _ = OuterSyntax.add_parsers [functionP];
krauss@19564
   195
val _ = OuterSyntax.add_parsers [terminationP];
krauss@19564
   196
krauss@19564
   197
krauss@19564
   198
end;
krauss@19564
   199
krauss@19564
   200
wenzelm@19585
   201
end