author | krauss |
Mon, 29 Oct 2007 10:37:09 +0100 | |
changeset 25222 | 78943ac46f6d |
parent 25169 | b1ea9d2e6a72 |
child 25289 | 3d332d8a827c |
permissions | -rw-r--r-- |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
1 |
(* Title: HOL/Tools/function_package/fundef_datatype.ML |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
2 |
ID: $Id$ |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
3 |
Author: Alexander Krauss, TU Muenchen |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
4 |
|
20344 | 5 |
A package for general recursive function definitions. |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
6 |
A tactic to prove completeness of datatype patterns. |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
7 |
*) |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
8 |
|
20344 | 9 |
signature FUNDEF_DATATYPE = |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
10 |
sig |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
11 |
val pat_complete_tac: int -> tactic |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
12 |
|
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
13 |
val pat_completeness : method |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
14 |
val setup : theory -> theory |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
15 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
16 |
|
23351 | 17 |
structure FundefDatatype: FUNDEF_DATATYPE = |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
18 |
struct |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
19 |
|
21051
c49467a9c1e1
Switched function package to use the new package for inductive predicates.
krauss
parents:
20999
diff
changeset
|
20 |
open FundefLib |
c49467a9c1e1
Switched function package to use the new package for inductive predicates.
krauss
parents:
20999
diff
changeset
|
21 |
open FundefCommon |
19770
be5c23ebe1eb
HOL/Tools/function_package: Added support for mutual recursive definitions.
krauss
parents:
19564
diff
changeset
|
22 |
|
23189 | 23 |
|
24 |
fun check_pats ctxt geq = |
|
25 |
let |
|
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
26 |
fun err str = error (cat_lines ["Malformed definition:", |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
27 |
str ^ " not allowed in sequential mode.", |
24920 | 28 |
Syntax.string_of_term ctxt geq]) |
23189 | 29 |
val thy = ProofContext.theory_of ctxt |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
30 |
|
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
31 |
fun check_constr_pattern (Bound _) = () |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
32 |
| check_constr_pattern t = |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
33 |
let |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
34 |
val (hd, args) = strip_comb t |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
35 |
in |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
36 |
(((case DatatypePackage.datatype_of_constr thy (fst (dest_Const hd)) of |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
37 |
SOME _ => () |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
38 |
| NONE => err "Non-constructor pattern") |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
39 |
handle TERM ("dest_Const", _) => err "Non-constructor patterns"); |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
40 |
map check_constr_pattern args; |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
41 |
()) |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
42 |
end |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
43 |
|
24170 | 44 |
val (fname, qs, gs, args, rhs) = split_def ctxt geq |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
45 |
|
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
46 |
val _ = if not (null gs) then err "Conditional equations" else () |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
47 |
val _ = map check_constr_pattern args |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
48 |
|
23189 | 49 |
(* just count occurrences to check linearity *) |
24170 | 50 |
val _ = if fold (fold_aterms (fn Bound _ => curry (op +) 1 | _ => I)) args 0 > length qs |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
51 |
then err "Nonlinear patterns" else () |
23189 | 52 |
in |
53 |
() |
|
54 |
end |
|
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
55 |
|
23189 | 56 |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
57 |
fun mk_argvar i T = Free ("_av" ^ (string_of_int i), T) |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
58 |
fun mk_patvar i T = Free ("_pv" ^ (string_of_int i), T) |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
59 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
60 |
fun inst_free var inst thm = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
61 |
forall_elim inst (forall_intr var thm) |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
62 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
63 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
64 |
fun inst_case_thm thy x P thm = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
65 |
let |
20344 | 66 |
val [Pv, xv] = term_vars (prop_of thm) |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
67 |
in |
20344 | 68 |
cterm_instantiate [(cterm_of thy xv, cterm_of thy x), (cterm_of thy Pv, cterm_of thy P)] thm |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
69 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
70 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
71 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
72 |
fun invent_vars constr i = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
73 |
let |
20344 | 74 |
val Ts = binder_types (fastype_of constr) |
75 |
val j = i + length Ts |
|
76 |
val is = i upto (j - 1) |
|
77 |
val avs = map2 mk_argvar is Ts |
|
78 |
val pvs = map2 mk_patvar is Ts |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
79 |
in |
20344 | 80 |
(avs, pvs, j) |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
81 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
82 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
83 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
84 |
fun filter_pats thy cons pvars [] = [] |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
85 |
| filter_pats thy cons pvars (([], thm) :: pts) = raise Match |
20344 | 86 |
| filter_pats thy cons pvars ((pat :: pats, thm) :: pts) = |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
87 |
case pat of |
20344 | 88 |
Free _ => let val inst = list_comb (cons, pvars) |
89 |
in (inst :: pats, inst_free (cterm_of thy pat) (cterm_of thy inst) thm) |
|
90 |
:: (filter_pats thy cons pvars pts) end |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
91 |
| _ => if fst (strip_comb pat) = cons |
20344 | 92 |
then (pat :: pats, thm) :: (filter_pats thy cons pvars pts) |
93 |
else filter_pats thy cons pvars pts |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
94 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
95 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
96 |
fun inst_constrs_of thy (T as Type (name, _)) = |
20344 | 97 |
map (fn (Cn,CT) => Envir.subst_TVars (Sign.typ_match thy (body_type CT, T) Vartab.empty) (Const (Cn, CT))) |
98 |
(the (DatatypePackage.get_datatype_constrs thy name)) |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
99 |
| inst_constrs_of thy _ = raise Match |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
100 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
101 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
102 |
fun transform_pat thy avars c_assum ([] , thm) = raise Match |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
103 |
| transform_pat thy avars c_assum (pat :: pats, thm) = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
104 |
let |
20344 | 105 |
val (_, subps) = strip_comb pat |
106 |
val eqs = map (cterm_of thy o HOLogic.mk_Trueprop o HOLogic.mk_eq) (avars ~~ subps) |
|
107 |
val a_eqs = map assume eqs |
|
108 |
val c_eq_pat = simplify (HOL_basic_ss addsimps a_eqs) c_assum |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
109 |
in |
20344 | 110 |
(subps @ pats, fold_rev implies_intr eqs |
111 |
(implies_elim thm c_eq_pat)) |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
112 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
113 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
114 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
115 |
exception COMPLETENESS |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
116 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
117 |
fun constr_case thy P idx (v :: vs) pats cons = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
118 |
let |
20344 | 119 |
val (avars, pvars, newidx) = invent_vars cons idx |
120 |
val c_hyp = cterm_of thy (HOLogic.mk_Trueprop (HOLogic.mk_eq (v, list_comb (cons, avars)))) |
|
121 |
val c_assum = assume c_hyp |
|
122 |
val newpats = map (transform_pat thy avars c_assum) (filter_pats thy cons pvars pats) |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
123 |
in |
20344 | 124 |
o_alg thy P newidx (avars @ vs) newpats |
125 |
|> implies_intr c_hyp |
|
126 |
|> fold_rev (forall_intr o cterm_of thy) avars |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
127 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
128 |
| constr_case _ _ _ _ _ _ = raise Match |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
129 |
and o_alg thy P idx [] (([], Pthm) :: _) = Pthm |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
130 |
| o_alg thy P idx (v :: vs) [] = raise COMPLETENESS |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
131 |
| o_alg thy P idx (v :: vs) pts = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
132 |
if forall (is_Free o hd o fst) pts (* Var case *) |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
133 |
then o_alg thy P idx vs (map (fn (pv :: pats, thm) => |
20344 | 134 |
(pats, refl RS (inst_free (cterm_of thy pv) (cterm_of thy v) thm))) pts) |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
135 |
else (* Cons case *) |
20344 | 136 |
let |
137 |
val T = fastype_of v |
|
138 |
val (tname, _) = dest_Type T |
|
139 |
val {exhaustion=case_thm, ...} = DatatypePackage.the_datatype thy tname |
|
140 |
val constrs = inst_constrs_of thy T |
|
141 |
val c_cases = map (constr_case thy P idx (v :: vs) pts) constrs |
|
142 |
in |
|
143 |
inst_case_thm thy v P case_thm |
|
144 |
|> fold (curry op COMP) c_cases |
|
145 |
end |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
146 |
| o_alg _ _ _ _ _ = raise Match |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
147 |
|
20344 | 148 |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
149 |
fun prove_completeness thy x P qss pats = |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
150 |
let |
20344 | 151 |
fun mk_assum qs pat = Logic.mk_implies (HOLogic.mk_Trueprop (HOLogic.mk_eq (x,pat)), |
152 |
HOLogic.mk_Trueprop P) |
|
153 |
|> fold_rev mk_forall qs |
|
154 |
|> cterm_of thy |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
155 |
|
20344 | 156 |
val hyps = map2 mk_assum qss pats |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
157 |
|
20344 | 158 |
fun inst_hyps hyp qs = fold (forall_elim o cterm_of thy) qs (assume hyp) |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
159 |
|
20344 | 160 |
val assums = map2 inst_hyps hyps qss |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
161 |
in |
20344 | 162 |
o_alg thy P 2 [x] (map2 (pair o single) pats assums) |
163 |
|> fold_rev implies_intr hyps |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
164 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
165 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
166 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
167 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
168 |
fun pat_complete_tac i thm = |
20344 | 169 |
let |
19922 | 170 |
val thy = theory_of_thm thm |
171 |
||
20344 | 172 |
val subgoal = nth (prems_of thm) (i - 1) (* FIXME SUBGOAL tactical *) |
19922 | 173 |
|
174 |
val ([P, x], subgf) = dest_all_all subgoal |
|
175 |
||
20344 | 176 |
val assums = Logic.strip_imp_prems subgf |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
177 |
|
20344 | 178 |
fun pat_of assum = |
179 |
let |
|
180 |
val (qs, imp) = dest_all_all assum |
|
181 |
in |
|
182 |
case Logic.dest_implies imp of |
|
183 |
(_ $ (_ $ _ $ pat), _) => (qs, pat) |
|
184 |
| _ => raise COMPLETENESS |
|
185 |
end |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
186 |
|
20344 | 187 |
val (qss, pats) = split_list (map pat_of assums) |
188 |
||
189 |
val complete_thm = prove_completeness thy x P qss pats |
|
19922 | 190 |
|> forall_intr (cterm_of thy x) |
191 |
|> forall_intr (cterm_of thy P) |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
192 |
in |
20344 | 193 |
Seq.single (Drule.compose_single(complete_thm, i, thm)) |
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
194 |
end |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
195 |
handle COMPLETENESS => Seq.empty |
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
196 |
|
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
197 |
|
21588 | 198 |
val pat_completeness = Method.SIMPLE_METHOD' pat_complete_tac |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
199 |
|
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
200 |
val by_pat_completeness_simp = |
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
201 |
Proof.global_terminal_proof |
23351 | 202 |
(Method.Basic (K pat_completeness, Position.none), |
22899
5ea718c68123
"fun" command: Changed pattern compatibility proof back from "simp_all" to the slower but more robust "auto"
krauss
parents:
22733
diff
changeset
|
203 |
SOME (Method.Source_i (Args.src (("HOL.auto", []), Position.none)))) |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
204 |
|
22733
0b14bb35be90
definition lookup via terms, not names. Methods "relation" and "lexicographic_order"
krauss
parents:
22498
diff
changeset
|
205 |
val termination_by_lexicographic_order = |
0b14bb35be90
definition lookup via terms, not names. Methods "relation" and "lexicographic_order"
krauss
parents:
22498
diff
changeset
|
206 |
FundefPackage.setup_termination_proof NONE |
23351 | 207 |
#> Proof.global_terminal_proof |
208 |
(Method.Basic (LexicographicOrder.lexicographic_order [], Position.none), NONE) |
|
19564
d3e2f532459a
First usable version of the new function definition package (HOL/function_packake/...).
krauss
parents:
diff
changeset
|
209 |
|
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
210 |
fun mk_catchall fixes arities = |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
211 |
let |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
212 |
fun mk_eqn ((fname, fT), _) = |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
213 |
let |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
214 |
val n = the (Symtab.lookup arities fname) |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
215 |
val (argTs, rT) = chop n (binder_types fT) |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
216 |
|> apsnd (fn Ts => Ts ---> body_type fT) |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
217 |
|
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
218 |
val qs = map Free (Name.invent_list [] "a" n ~~ argTs) |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
219 |
in |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
220 |
HOLogic.mk_eq(list_comb (Free (fname, fT), qs), |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
221 |
Const ("HOL.undefined", rT)) |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
222 |
|> HOLogic.mk_Trueprop |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
223 |
|> fold_rev mk_forall qs |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
224 |
end |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
225 |
in |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
226 |
map mk_eqn fixes |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
227 |
end |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
228 |
|
24170 | 229 |
fun add_catchall ctxt fixes spec = |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
230 |
let |
24170 | 231 |
val catchalls = mk_catchall fixes (mk_arities (map (split_def ctxt) (map snd spec))) |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
232 |
in |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
233 |
spec @ map (pair true) catchalls |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
234 |
end |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
235 |
|
24356
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
236 |
fun warn_if_redundant ctxt origs tss = |
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
237 |
let |
24920 | 238 |
fun msg t = "Ignoring redundant equation: " ^ quote (Syntax.string_of_term ctxt t) |
24466 | 239 |
|
240 |
val (tss', _) = chop (length origs) tss |
|
241 |
fun check ((_, t), []) = (Output.warning (msg t); []) |
|
242 |
| check ((_, t), s) = s |
|
24356
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
243 |
in |
24466 | 244 |
(map check (origs ~~ tss'); tss) |
24356
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
245 |
end |
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
246 |
|
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
247 |
|
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
248 |
fun sequential_preproc (config as FundefConfig {sequential, ...}) flags ctxt fixes spec = |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
249 |
let |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
250 |
val enabled = sequential orelse exists I flags |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
251 |
in |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
252 |
if enabled then |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
253 |
let |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
254 |
val flags' = if sequential then map (K true) flags else flags |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
255 |
|
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
256 |
val (nas, eqss) = split_list spec |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
257 |
|
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
258 |
val eqs = map the_single eqss |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
259 |
|
24356
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
260 |
val feqs = eqs |
25222
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
261 |
|> tap (check_defs ctxt fixes) (* Standard checks *) |
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
262 |
|> tap (map (check_pats ctxt)) (* More checks for sequential mode *) |
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
263 |
|> curry op ~~ flags' |
24356
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
264 |
|
25222
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
265 |
val compleqs = add_catchall ctxt fixes feqs (* Completion *) |
24356
65fd09a7243f
issue a warning, when encountering redundant equations (covered by prece3ding clauses)
krauss
parents:
24170
diff
changeset
|
266 |
|
25222
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
267 |
val spliteqs = warn_if_redundant ctxt feqs |
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
268 |
(FundefSplit.split_some_equations ctxt compleqs) |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
269 |
|
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
270 |
fun restore_spec thms = |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
271 |
nas ~~ Library.take (length nas, Library.unflat spliteqs thms) |
23819 | 272 |
|
273 |
val spliteqs' = flat (Library.take (length nas, spliteqs)) |
|
274 |
val fnames = map (fst o fst) fixes |
|
275 |
val indices = map (fn eq => find_index (curry op = (fname_of eq)) fnames) spliteqs' |
|
276 |
||
277 |
fun sort xs = partition_list (fn i => fn (j,_) => i = j) 0 (length fnames - 1) (indices ~~ xs) |
|
278 |
|> map (map snd) |
|
279 |
||
25222
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
280 |
|
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
281 |
val nas' = nas @ replicate (length spliteqs - length nas) ("",[]) |
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
282 |
|
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
283 |
val case_names = map_index (fn (i, ((n, _), es)) => mk_case_names i n (length es)) |
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
284 |
(nas' ~~ spliteqs) |
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
285 |
|> flat |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
286 |
in |
25222
78943ac46f6d
fun/function: generate case names for induction rules
krauss
parents:
25169
diff
changeset
|
287 |
(flat spliteqs, restore_spec, sort, case_names) |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
288 |
end |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
289 |
else |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
290 |
FundefCommon.empty_preproc check_defs config flags ctxt fixes spec |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
291 |
end |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
292 |
|
20344 | 293 |
val setup = |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
294 |
Method.add_methods [("pat_completeness", Method.no_args pat_completeness, |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
295 |
"Completeness prover for datatype patterns")] |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
296 |
#> Context.theory_map (FundefCommon.set_preproc sequential_preproc) |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
297 |
|
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
298 |
|
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
299 |
val fun_config = FundefConfig { sequential=true, default="%x. arbitrary", |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
300 |
target=NONE, domintros=false, tailrec=false } |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
301 |
|
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
302 |
|
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
303 |
local structure P = OuterParse and K = OuterKeyword in |
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
304 |
|
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
305 |
fun fun_cmd config fixes statements flags lthy = |
21211
5370cfbf3070
Preparations for making "lexicographic_order" part of "fun"
krauss
parents:
21051
diff
changeset
|
306 |
lthy |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
307 |
|> FundefPackage.add_fundef fixes statements config flags |
22733
0b14bb35be90
definition lookup via terms, not names. Methods "relation" and "lexicographic_order"
krauss
parents:
22498
diff
changeset
|
308 |
|> by_pat_completeness_simp |
25169
b1ea9d2e6a72
fun command: use "reinit" between "function" and "termination"
krauss
parents:
24920
diff
changeset
|
309 |
|> (fn lthy => LocalTheory.reinit lthy (ProofContext.theory_of lthy)) |
22733
0b14bb35be90
definition lookup via terms, not names. Methods "relation" and "lexicographic_order"
krauss
parents:
22498
diff
changeset
|
310 |
|> termination_by_lexicographic_order |
21211
5370cfbf3070
Preparations for making "lexicographic_order" part of "fun"
krauss
parents:
21051
diff
changeset
|
311 |
|
24867 | 312 |
val _ = |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
313 |
OuterSyntax.command "fun" "define general recursive functions (short version)" K.thy_decl |
23203
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
314 |
(fundef_parser fun_config |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
315 |
>> (fn ((config, fixes), (flags, statements)) => |
a5026e73cfcf
"function (sequential)" and "fun" now handle incomplete patterns silently by adding "undefined" cases.
krauss
parents:
23189
diff
changeset
|
316 |
(Toplevel.local_theory (target_of config) (fun_cmd config fixes statements flags)))); |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
317 |
|
20344 | 318 |
end |
20523
36a59e5d0039
Major update to function package, including new syntax and the (only theoretical)
krauss
parents:
20344
diff
changeset
|
319 |
|
20875 | 320 |
end |