src/HOL/Tools/function_package/fundef_package.ML
author krauss
Sun May 07 00:00:13 2006 +0200 (2006-05-07)
changeset 19583 c5fa77b03442
parent 19564 d3e2f532459a
child 19585 70a1ce3b23ae
permissions -rw-r--r--
function-package: Changed record usage to make sml/nj happy...
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@19564
    29
fun fundef_afterqed congs curry_info name data natts 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
	val (names, attsrcs) = split_list natts
krauss@19564
    36
	val atts = map (map (Attrib.attribute thy)) attsrcs
krauss@19564
    37
krauss@19583
    38
	val Prep {names = Names {acc_R=accR, ...}, ...} = data
krauss@19583
    39
	val dom_abbrev = Logic.mk_equals (Free (name ^ "_dom", fastype_of accR), accR)
krauss@19583
    40
	val (_, thy) = LocalTheory.mapping NONE (Specification.abbreviation_i ("", false) [(NONE, dom_abbrev)]) thy
krauss@19564
    41
krauss@19564
    42
	val thy = thy |> Theory.add_path name 
krauss@19564
    43
krauss@19564
    44
	val thy = thy |> Theory.add_path "psimps"
krauss@19564
    45
	val (_, thy) = PureThy.add_thms ((names ~~ psimps) ~~ atts) thy;
krauss@19564
    46
	val thy = thy |> Theory.parent_path
krauss@19564
    47
krauss@19564
    48
	val (_, thy) = PureThy.add_thms [(("cases", complete_thm), [RuleCases.case_names names])] thy
krauss@19564
    49
	val (_, thy) = PureThy.add_thmss [(("domintros", dom_intros), [])] thy
krauss@19564
    50
	val (_, thy) = PureThy.add_thms [(("termination", total_intro), [])] thy
krauss@19564
    51
	val (_,thy) = PureThy.add_thms [(("pinduct", simple_pinduct), [RuleCases.case_names names, InductAttrib.induct_set ""])] thy
krauss@19564
    52
	val (_, thy) = PureThy.add_thmss [(("psimps", psimps), [Simplifier.simp_add])] thy
krauss@19564
    53
	val thy = thy |> Theory.parent_path
krauss@19564
    54
    in
krauss@19564
    55
	add_fundef_data name fundef_data thy
krauss@19564
    56
    end
krauss@19564
    57
krauss@19564
    58
fun add_fundef eqns_atts thy =
krauss@19564
    59
    let
krauss@19564
    60
	val (natts, eqns) = split_list eqns_atts
krauss@19564
    61
krauss@19564
    62
	val congs = get_fundef_congs (Context.Theory thy)
krauss@19564
    63
krauss@19564
    64
	val (curry_info, name, (data, thy)) = FundefPrep.prepare_fundef_curried congs (map (Sign.read_prop thy) eqns) thy
krauss@19583
    65
	val Prep {complete, compat, ...} = data
krauss@19564
    66
krauss@19564
    67
	val props = (complete :: compat) (*(complete :: fst (chop 110 compat))*)
krauss@19564
    68
    in
krauss@19564
    69
	thy |> ProofContext.init
krauss@19564
    70
	    |> Proof.theorem_i PureThy.internalK NONE (fundef_afterqed congs curry_info name data natts) NONE ("", [])
krauss@19564
    71
	    (map (fn t => (("", []), [(t, ([], []))])) props)
krauss@19564
    72
    end
krauss@19564
    73
krauss@19564
    74
krauss@19564
    75
fun total_termination_afterqed name thmss thy =
krauss@19564
    76
    let
krauss@19564
    77
	val totality = hd (hd thmss)
krauss@19564
    78
krauss@19583
    79
	val FundefResult {psimps, simple_pinduct, ... }
krauss@19564
    80
	  = the (get_fundef_data name thy)
krauss@19564
    81
krauss@19564
    82
	val remove_domain_condition = full_simplify (HOL_basic_ss addsimps [totality, True_implies])
krauss@19564
    83
krauss@19564
    84
	val tsimps = map remove_domain_condition psimps
krauss@19564
    85
	val tinduct = remove_domain_condition simple_pinduct
krauss@19564
    86
krauss@19564
    87
	val thy = Theory.add_path name thy
krauss@19564
    88
		  
krauss@19564
    89
		  (* Need the names and attributes. Apply the attributes again? *)
krauss@19564
    90
(*	val thy = thy |> Theory.add_path "simps"
krauss@19564
    91
	val (_, thy) = PureThy.add_thms ((names ~~ tsimps) ~~ atts) thy;
krauss@19564
    92
	val thy = thy |> Theory.parent_path*)
krauss@19564
    93
krauss@19564
    94
	val (_, thy) = PureThy.add_thms [(("induct", tinduct), [])] thy 
krauss@19564
    95
	val (_, thy) = PureThy.add_thmss [(("simps", tsimps), [Simplifier.simp_add, RecfunCodegen.add NONE])] thy
krauss@19564
    96
	val thy = Theory.parent_path thy
krauss@19564
    97
    in
krauss@19564
    98
	thy
krauss@19564
    99
    end
krauss@19564
   100
krauss@19564
   101
(*
krauss@19564
   102
fun mk_partial_rules name D_name D domT idomT thmss thy =
krauss@19564
   103
    let
krauss@19564
   104
	val [subs, dcl] = (hd thmss)
krauss@19564
   105
krauss@19564
   106
	val {f_const, f_curried_const, G_const, R_const, G_elims, completeness, f_simps, names_attrs, subset_induct, ... }
krauss@19564
   107
	  = the (Symtab.lookup (FundefData.get thy) name)
krauss@19564
   108
krauss@19564
   109
	val D_implies_dom = subs COMP (instantiate' [SOME (ctyp_of thy idomT)] 
krauss@19564
   110
						    [SOME (cterm_of thy D)]
krauss@19564
   111
						    subsetD)
krauss@19564
   112
krauss@19564
   113
	val D_simps = map (curry op RS D_implies_dom) f_simps
krauss@19564
   114
krauss@19564
   115
	val D_induct = subset_induct
krauss@19564
   116
			   |> cterm_instantiate [(cterm_of thy (Var (("D",0), fastype_of D)) ,cterm_of thy D)]
krauss@19564
   117
			   |> curry op COMP subs
krauss@19564
   118
			   |> curry op COMP (dcl |> forall_intr (cterm_of thy (Var (("z",0), idomT)))
krauss@19564
   119
						 |> forall_intr (cterm_of thy (Var (("x",0), idomT))))
krauss@19564
   120
krauss@19564
   121
	val ([tinduct'], thy2) = PureThy.add_thms [((name ^ "_" ^ D_name ^ "_induct", D_induct), [])] thy
krauss@19564
   122
	val ([tsimps'], thy3) = PureThy.add_thmss [((name ^ "_" ^ D_name ^ "_simps", D_simps), [])] thy2
krauss@19564
   123
    in
krauss@19564
   124
	thy3
krauss@19564
   125
    end
krauss@19564
   126
*)
krauss@19564
   127
 
krauss@19564
   128
krauss@19564
   129
fun fundef_setup_termination_proof name NONE thy = 
krauss@19564
   130
    let
krauss@19564
   131
	val name = if name = "" then get_last_fundef thy else name
krauss@19564
   132
	val data = the (get_fundef_data name thy)
krauss@19564
   133
krauss@19583
   134
	val FundefResult {total_intro, ...} = data
krauss@19564
   135
	val goal = FundefTermination.mk_total_termination_goal data
krauss@19564
   136
    in
krauss@19564
   137
	thy |> ProofContext.init
krauss@19564
   138
	    |> ProofContext.note_thmss_i [(("termination_intro", 
krauss@19564
   139
					    [ContextRules.intro_query NONE]), [([total_intro], [])])] |> snd
krauss@19564
   140
	    |> Proof.theorem_i PureThy.internalK NONE (total_termination_afterqed name) NONE ("", [])
krauss@19564
   141
	    [(("", []), [(goal, ([], []))])]
krauss@19564
   142
    end	
krauss@19564
   143
  | fundef_setup_termination_proof name (SOME (dom_name, dom)) thy =
krauss@19564
   144
    let
krauss@19564
   145
	val name = if name = "" then get_last_fundef thy else name
krauss@19564
   146
	val data = the (get_fundef_data name thy)
krauss@19564
   147
	val (subs, dcl) = FundefTermination.mk_partial_termination_goal thy data dom
krauss@19564
   148
    in
krauss@19564
   149
	thy |> ProofContext.init
krauss@19564
   150
	    |> Proof.theorem_i PureThy.internalK NONE (K I) NONE ("", [])
krauss@19564
   151
	    [(("", []), [(subs, ([], [])), (dcl, ([], []))])]
krauss@19564
   152
    end	
krauss@19564
   153
krauss@19564
   154
krauss@19564
   155
krauss@19564
   156
krauss@19564
   157
(* congruence rules *)
krauss@19564
   158
krauss@19564
   159
val cong_add = Thm.declaration_attribute (map_fundef_congs o cons o safe_mk_meta_eq);
krauss@19564
   160
val cong_del = Thm.declaration_attribute (map_fundef_congs o remove (op =) o safe_mk_meta_eq);
krauss@19564
   161
krauss@19564
   162
krauss@19564
   163
(* setup *)
krauss@19564
   164
krauss@19564
   165
val setup = FundefData.init #> FundefCongs.init 
krauss@19564
   166
	#>  Attrib.add_attributes
krauss@19564
   167
		[("fundef_cong", Attrib.add_del_args cong_add cong_del, "declaration of congruence rule for function definitions")]
krauss@19564
   168
krauss@19564
   169
krauss@19564
   170
(* outer syntax *)
krauss@19564
   171
krauss@19564
   172
local structure P = OuterParse and K = OuterKeyword in
krauss@19564
   173
krauss@19564
   174
val function_decl =
krauss@19564
   175
    Scan.repeat1 (P.opt_thm_name ":" -- P.prop);
krauss@19564
   176
krauss@19564
   177
val functionP =
krauss@19564
   178
  OuterSyntax.command "function" "define general recursive functions" K.thy_goal
krauss@19564
   179
    (function_decl >> (fn eqns =>
krauss@19564
   180
      Toplevel.print o Toplevel.theory_to_proof (add_fundef eqns)));
krauss@19564
   181
krauss@19564
   182
val terminationP =
krauss@19564
   183
  OuterSyntax.command "termination" "prove termination of a recursive function" K.thy_goal
krauss@19564
   184
  ((Scan.optional P.name "" -- Scan.option (P.$$$ "(" |-- Scan.optional (P.name --| P.$$$ ":") "dom" -- P.term --| P.$$$ ")"))
krauss@19564
   185
       >> (fn (name,dom) =>
krauss@19564
   186
	      Toplevel.print o Toplevel.theory_to_proof (fundef_setup_termination_proof name dom)));
krauss@19564
   187
krauss@19564
   188
val _ = OuterSyntax.add_parsers [functionP];
krauss@19564
   189
val _ = OuterSyntax.add_parsers [terminationP];
krauss@19564
   190
krauss@19564
   191
krauss@19564
   192
end;
krauss@19564
   193
krauss@19564
   194
krauss@19564
   195
end