author | haftmann |
Tue, 20 Mar 2007 15:52:37 +0100 | |
changeset 22480 | b20bc8029edb |
parent 22101 | 6d13239d5f52 |
child 22692 | 1e057a3f087d |
permissions | -rw-r--r-- |
5719 | 1 |
(* Title: HOL/Tools/primrec_package.ML |
5178 | 2 |
ID: $Id$ |
11539 | 3 |
Author: Stefan Berghofer, TU Muenchen and Norbert Voelker, FernUni Hagen |
5178 | 4 |
|
6359 | 5 |
Package for defining functions on datatypes by primitive recursion. |
5178 | 6 |
*) |
7 |
||
8 |
signature PRIMREC_PACKAGE = |
|
9 |
sig |
|
6427 | 10 |
val quiet_mode: bool ref |
15703 | 11 |
val add_primrec: string -> ((bstring * string) * Attrib.src list) list |
20176 | 12 |
-> theory -> thm list * theory |
19688 | 13 |
val add_primrec_unchecked: string -> ((bstring * string) * Attrib.src list) list |
20176 | 14 |
-> theory -> thm list * theory |
18728 | 15 |
val add_primrec_i: string -> ((bstring * term) * attribute list) list |
20176 | 16 |
-> theory -> thm list * theory |
19636 | 17 |
val add_primrec_unchecked_i: string -> ((bstring * term) * attribute list) list |
20176 | 18 |
-> theory -> thm list * theory |
20841 | 19 |
val gen_primrec: ((bstring * attribute list) * thm list -> theory -> (bstring * thm list) * theory) |
20 |
-> ((bstring * attribute list) * term -> theory -> (bstring * thm) * theory) |
|
21 |
-> string -> ((bstring * attribute list) * term) list |
|
22 |
-> theory -> thm list * theory; |
|
5178 | 23 |
end; |
24 |
||
25 |
structure PrimrecPackage : PRIMREC_PACKAGE = |
|
26 |
struct |
|
27 |
||
28 |
open DatatypeAux; |
|
29 |
||
30 |
exception RecError of string; |
|
31 |
||
32 |
fun primrec_err s = error ("Primrec definition error:\n" ^ s); |
|
20176 | 33 |
fun primrec_eq_err thy s eq = |
34 |
primrec_err (s ^ "\nin\n" ^ quote (Sign.string_of_term thy eq)); |
|
6427 | 35 |
|
36 |
||
37 |
(* messages *) |
|
38 |
||
39 |
val quiet_mode = ref false; |
|
40 |
fun message s = if ! quiet_mode then () else writeln s; |
|
5178 | 41 |
|
6359 | 42 |
|
5178 | 43 |
(* preprocessing of equations *) |
44 |
||
21064 | 45 |
fun process_eqn thy eq rec_fns = |
5178 | 46 |
let |
6032 | 47 |
val (lhs, rhs) = |
20176 | 48 |
if null (term_vars eq) then |
49 |
HOLogic.dest_eq (HOLogic.dest_Trueprop eq) |
|
50 |
handle TERM _ => raise RecError "not a proper equation" |
|
51 |
else raise RecError "illegal schematic variable(s)"; |
|
5178 | 52 |
|
53 |
val (recfun, args) = strip_comb lhs; |
|
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
54 |
val fnameT = dest_Const recfun handle TERM _ => |
5178 | 55 |
raise RecError "function is not declared as constant in theory"; |
56 |
||
57 |
val (ls', rest) = take_prefix is_Free args; |
|
58 |
val (middle, rs') = take_suffix is_Free rest; |
|
59 |
val rpos = length ls'; |
|
60 |
||
61 |
val (constr, cargs') = if null middle then raise RecError "constructor missing" |
|
62 |
else strip_comb (hd middle); |
|
63 |
val (cname, T) = dest_Const constr |
|
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
64 |
handle TERM _ => raise RecError "ill-formed constructor"; |
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
65 |
val (tname, _) = dest_Type (body_type T) handle TYPE _ => |
5178 | 66 |
raise RecError "cannot determine datatype associated with function" |
67 |
||
20176 | 68 |
val (ls, cargs, rs) = |
69 |
(map dest_Free ls', map dest_Free cargs', map dest_Free rs') |
|
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
70 |
handle TERM _ => raise RecError "illegal argument in pattern"; |
5178 | 71 |
val lfrees = ls @ rs @ cargs; |
72 |
||
12474 | 73 |
fun check_vars _ [] = () |
74 |
| check_vars s vars = raise RecError (s ^ commas_quote (map fst vars)) |
|
5178 | 75 |
in |
8973 | 76 |
if length middle > 1 then |
5178 | 77 |
raise RecError "more than one non-variable in pattern" |
12474 | 78 |
else |
18964 | 79 |
(check_vars "repeated variable names in pattern: " (duplicates (op =) lfrees); |
12474 | 80 |
check_vars "extra variables on rhs: " |
81 |
(map dest_Free (term_frees rhs) \\ lfrees); |
|
17184 | 82 |
case AList.lookup (op =) rec_fns fnameT of |
15531 | 83 |
NONE => |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
84 |
(fnameT, (tname, rpos, [(cname, (ls, cargs, rs, rhs, eq))]))::rec_fns |
15531 | 85 |
| SOME (_, rpos', eqns) => |
17184 | 86 |
if AList.defined (op =) eqns cname then |
6037 | 87 |
raise RecError "constructor already occurred as pattern" |
5178 | 88 |
else if rpos <> rpos' then |
89 |
raise RecError "position of recursive argument inconsistent" |
|
90 |
else |
|
17314 | 91 |
AList.update (op =) (fnameT, (tname, rpos, (cname, (ls, cargs, rs, rhs, eq))::eqns)) |
92 |
rec_fns) |
|
5178 | 93 |
end |
20176 | 94 |
handle RecError s => primrec_eq_err thy s eq; |
5178 | 95 |
|
21064 | 96 |
fun process_fun thy descr rec_eqns (i, fnameT as (fname, _)) (fnameTs, fnss) = |
5178 | 97 |
let |
15570 | 98 |
val (_, (tname, _, constrs)) = List.nth (descr, i); |
5178 | 99 |
|
100 |
(* substitute "fname ls x rs" by "y ls rs" for (x, (_, y)) in subs *) |
|
101 |
||
21064 | 102 |
fun subst [] t fs = (t, fs) |
103 |
| subst subs (Abs (a, T, t)) fs = |
|
104 |
fs |
|
105 |
|> subst subs t |
|
106 |
|-> (fn t' => pair (Abs (a, T, t'))) |
|
107 |
| subst subs (t as (_ $ _)) fs = |
|
108 |
let |
|
109 |
val (f, ts) = strip_comb t; |
|
5178 | 110 |
in |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
111 |
if is_Const f andalso dest_Const f mem map fst rec_eqns then |
5178 | 112 |
let |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
113 |
val fnameT' as (fname', _) = dest_Const f; |
17184 | 114 |
val (_, rpos, _) = the (AList.lookup (op =) rec_eqns fnameT'); |
15570 | 115 |
val ls = Library.take (rpos, ts); |
116 |
val rest = Library.drop (rpos, ts); |
|
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
117 |
val (x', rs) = (hd rest, tl rest) |
15570 | 118 |
handle Empty => raise RecError ("not enough arguments\ |
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
119 |
\ in recursive application\nof function " ^ quote fname' ^ " on rhs"); |
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
120 |
val (x, xs) = strip_comb x' |
21064 | 121 |
in case AList.lookup (op =) subs x |
122 |
of NONE => |
|
123 |
fs |
|
124 |
|> fold_map (subst subs) ts |
|
125 |
|-> (fn ts' => pair (list_comb (f, ts'))) |
|
126 |
| SOME (i', y) => |
|
127 |
fs |
|
128 |
|> fold_map (subst subs) (xs @ ls @ rs) |
|
129 |
||> process_fun thy descr rec_eqns (i', fnameT') |
|
130 |
|-> (fn ts' => pair (list_comb (y, ts'))) |
|
5178 | 131 |
end |
132 |
else |
|
21064 | 133 |
fs |
134 |
|> fold_map (subst subs) (f :: ts) |
|
135 |
|-> (fn (f'::ts') => pair (list_comb (f', ts'))) |
|
5178 | 136 |
end |
21064 | 137 |
| subst _ t fs = (t, fs); |
5178 | 138 |
|
139 |
(* translate rec equations into function arguments suitable for rec comb *) |
|
140 |
||
21064 | 141 |
fun trans eqns (cname, cargs) (fnameTs', fnss', fns) = |
17184 | 142 |
(case AList.lookup (op =) eqns cname of |
15531 | 143 |
NONE => (warning ("No equation for constructor " ^ quote cname ^ |
6427 | 144 |
"\nin definition of function " ^ quote fname); |
22480 | 145 |
(fnameTs', fnss', (Const ("HOL.undefined", dummyT))::fns)) |
15531 | 146 |
| SOME (ls, cargs', rs, rhs, eq) => |
5178 | 147 |
let |
21064 | 148 |
val recs = filter (is_rec_type o snd) (cargs' ~~ cargs); |
5178 | 149 |
val rargs = map fst recs; |
6037 | 150 |
val subs = map (rpair dummyT o fst) |
20176 | 151 |
(rev (rename_wrt_term rhs rargs)); |
21064 | 152 |
val (rhs', (fnameTs'', fnss'')) = |
20176 | 153 |
(subst (map (fn ((x, y), z) => |
154 |
(Free x, (body_index y, Free z))) |
|
21064 | 155 |
(recs ~~ subs)) rhs (fnameTs', fnss')) |
20176 | 156 |
handle RecError s => primrec_eq_err thy s eq |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
157 |
in (fnameTs'', fnss'', |
20176 | 158 |
(list_abs_free (cargs' @ subs @ ls @ rs, rhs'))::fns) |
5178 | 159 |
end) |
160 |
||
17184 | 161 |
in (case AList.lookup (op =) fnameTs i of |
15531 | 162 |
NONE => |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
163 |
if exists (equal fnameT o snd) fnameTs then |
6427 | 164 |
raise RecError ("inconsistent functions for datatype " ^ quote tname) |
5178 | 165 |
else |
166 |
let |
|
17184 | 167 |
val (_, _, eqns) = the (AList.lookup (op =) rec_eqns fnameT); |
21064 | 168 |
val (fnameTs', fnss', fns) = fold_rev (trans eqns) constrs |
169 |
((i, fnameT)::fnameTs, fnss, []) |
|
5178 | 170 |
in |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
171 |
(fnameTs', (i, (fname, #1 (snd (hd eqns)), fns))::fnss') |
5178 | 172 |
end |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
173 |
| SOME fnameT' => |
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
174 |
if fnameT = fnameT' then (fnameTs, fnss) |
6427 | 175 |
else raise RecError ("inconsistent functions for datatype " ^ quote tname)) |
5178 | 176 |
end; |
177 |
||
6359 | 178 |
|
5178 | 179 |
(* prepare functions needed for definitions *) |
180 |
||
21064 | 181 |
fun get_fns fns ((i : int, (tname, _, constrs)), rec_name) (fs, defs) = |
17184 | 182 |
case AList.lookup (op =) fns i of |
15531 | 183 |
NONE => |
5178 | 184 |
let |
22480 | 185 |
val dummy_fns = map (fn (_, cargs) => Const ("HOL.undefined", |
15570 | 186 |
replicate ((length cargs) + (length (List.filter is_rec_type cargs))) |
5178 | 187 |
dummyT ---> HOLogic.unitT)) constrs; |
6427 | 188 |
val _ = warning ("No function definition for datatype " ^ quote tname) |
5178 | 189 |
in |
190 |
(dummy_fns @ fs, defs) |
|
191 |
end |
|
21064 | 192 |
| SOME (fname, ls, fs') => (fs' @ fs, (fname, ls, rec_name, tname) :: defs); |
5178 | 193 |
|
6359 | 194 |
|
5178 | 195 |
(* make definition *) |
196 |
||
20176 | 197 |
fun make_def thy fs (fname, ls, rec_name, tname) = |
5178 | 198 |
let |
21064 | 199 |
val rhs = fold_rev (fn T => fn t => Abs ("", T, t)) |
200 |
((map snd ls) @ [dummyT]) |
|
20176 | 201 |
(list_comb (Const (rec_name, dummyT), |
202 |
fs @ map Bound (0 ::(length ls downto 1)))) |
|
5178 | 203 |
val defpair = (Sign.base_name fname ^ "_" ^ Sign.base_name tname ^ "_def", |
20176 | 204 |
Logic.mk_equals (Const (fname, dummyT), rhs)) |
205 |
in Theory.inferT_axm thy defpair end; |
|
5178 | 206 |
|
6359 | 207 |
|
5178 | 208 |
(* find datatypes which contain all datatypes in tnames' *) |
209 |
||
210 |
fun find_dts (dt_info : datatype_info Symtab.table) _ [] = [] |
|
211 |
| find_dts dt_info tnames' (tname::tnames) = |
|
17412 | 212 |
(case Symtab.lookup dt_info tname of |
15531 | 213 |
NONE => primrec_err (quote tname ^ " is not a datatype") |
214 |
| SOME dt => |
|
5178 | 215 |
if tnames' subset (map (#1 o snd) (#descr dt)) then |
216 |
(tname, dt)::(find_dts dt_info tnames' tnames) |
|
217 |
else find_dts dt_info tnames' tnames); |
|
218 |
||
8432 | 219 |
fun prepare_induct ({descr, induction, ...}: datatype_info) rec_eqns = |
220 |
let |
|
221 |
fun constrs_of (_, (_, _, cs)) = |
|
222 |
map (fn (cname:string, (_, cargs, _, _, _)) => (cname, map fst cargs)) cs; |
|
17184 | 223 |
val params_of = these o AList.lookup (op =) (List.concat (map constrs_of rec_eqns)); |
8432 | 224 |
in |
225 |
induction |
|
15570 | 226 |
|> RuleCases.rename_params (map params_of (List.concat (map (map #1 o #3 o #2) descr))) |
10525 | 227 |
|> RuleCases.save induction |
8432 | 228 |
end; |
229 |
||
20841 | 230 |
local |
231 |
||
232 |
fun gen_primrec_i note def alt_name eqns_atts thy = |
|
5178 | 233 |
let |
20841 | 234 |
val (eqns, atts) = split_list eqns_atts; |
5178 | 235 |
val dt_info = DatatypePackage.get_datatypes thy; |
21064 | 236 |
val rec_eqns = fold_rev (process_eqn thy o snd) eqns [] ; |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
18964
diff
changeset
|
237 |
val tnames = distinct (op =) (map (#1 o snd) rec_eqns); |
5178 | 238 |
val dts = find_dts dt_info tnames tnames; |
6037 | 239 |
val main_fns = |
18362
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
240 |
map (fn (tname, {index, ...}) => |
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
241 |
(index, |
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
242 |
(fst o the o find_first (fn f => (#1 o snd) f = tname)) rec_eqns)) |
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
243 |
dts; |
6037 | 244 |
val {descr, rec_names, rec_rewrites, ...} = |
18362
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
245 |
if null dts then |
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
246 |
primrec_err ("datatypes " ^ commas_quote tnames ^ "\nare not mutually recursive") |
e8b7e0a22727
removed thms 'swap' and 'nth_map' from ML toplevel
haftmann
parents:
18358
diff
changeset
|
247 |
else snd (hd dts); |
20176 | 248 |
val (fnameTs, fnss) = |
21064 | 249 |
fold_rev (process_fun thy descr rec_eqns) main_fns ([], []); |
250 |
val (fs, defs) = fold_rev (get_fns fnss) (descr ~~ rec_names) ([], []); |
|
20176 | 251 |
val defs' = map (make_def thy fs) defs; |
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
252 |
val nameTs1 = map snd fnameTs; |
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
253 |
val nameTs2 = map fst rec_eqns; |
20841 | 254 |
val _ = if gen_eq_set (op =) (nameTs1, nameTs2) then () |
255 |
else primrec_err ("functions " ^ commas_quote (map fst nameTs2) ^ |
|
256 |
"\nare not mutually recursive"); |
|
8432 | 257 |
val primrec_name = |
258 |
if alt_name = "" then (space_implode "_" (map (Sign.base_name o #1) defs)) else alt_name; |
|
20841 | 259 |
val (defs_thms', thy') = |
260 |
thy |
|
261 |
|> Theory.add_path primrec_name |
|
262 |
|> fold_map def (map (fn (name, t) => ((name, []), t)) defs'); |
|
263 |
val rewrites = (map mk_meta_eq rec_rewrites) @ map snd defs_thms'; |
|
16765
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
264 |
val _ = message ("Proving equations for primrec function(s) " ^ |
b8b1f310877f
Some changes to allow mutually recursive, overloaded functions with same name.
berghofe
parents:
16646
diff
changeset
|
265 |
commas_quote (map fst nameTs1) ^ " ..."); |
20046 | 266 |
val simps = map (fn (_, t) => Goal.prove_global thy' [] [] t |
267 |
(fn _ => EVERY [rewrite_goals_tac rewrites, rtac refl 1])) eqns; |
|
20841 | 268 |
val (simps', thy'') = |
269 |
thy' |
|
270 |
|> fold_map note ((map fst eqns ~~ atts) ~~ map single simps); |
|
271 |
val simps'' = maps snd simps'; |
|
8480
50266d517b0c
Added new theory data slot for primrec equations.
berghofe
parents:
8432
diff
changeset
|
272 |
in |
20176 | 273 |
thy'' |
20841 | 274 |
|> note (("simps", [Simplifier.simp_add, RecfunCodegen.add NONE]), simps'') |
275 |
|> snd |
|
276 |
|> note (("induct", []), [prepare_induct (#2 (hd dts)) rec_eqns]) |
|
277 |
|> snd |
|
20176 | 278 |
|> Theory.parent_path |
20841 | 279 |
|> pair simps'' |
8480
50266d517b0c
Added new theory data slot for primrec equations.
berghofe
parents:
8432
diff
changeset
|
280 |
end; |
6359 | 281 |
|
20841 | 282 |
fun gen_primrec note def alt_name eqns thy = |
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
283 |
let |
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
284 |
val ((names, strings), srcss) = apfst split_list (split_list eqns); |
18728 | 285 |
val atts = map (map (Attrib.attribute thy)) srcss; |
20176 | 286 |
val eqn_ts = map (fn s => term_of (Thm.read_cterm thy (s, propT)) |
18678 | 287 |
handle ERROR msg => cat_error msg ("The error(s) above occurred for " ^ s)) strings; |
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
288 |
val rec_ts = map (fn eq => head_of (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop eq))) |
20176 | 289 |
handle TERM _ => primrec_eq_err thy "not a proper equation" eq) eqn_ts; |
21022
3634641f9405
Moved old inductive package to old_inductive_package.ML
berghofe
parents:
20841
diff
changeset
|
290 |
val (_, eqn_ts') = OldInductivePackage.unify_consts thy rec_ts eqn_ts |
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
291 |
in |
20841 | 292 |
gen_primrec_i note def alt_name (names ~~ eqn_ts' ~~ atts) thy |
7016
df54b5365477
- Now also supports arbitrarily branching datatypes.
berghofe
parents:
6729
diff
changeset
|
293 |
end; |
6359 | 294 |
|
20841 | 295 |
fun thy_note ((name, atts), thms) = |
296 |
PureThy.add_thmss [((name, thms), atts)] #-> (fn [thms] => pair (name, thms)); |
|
297 |
fun thy_def false ((name, atts), t) = |
|
298 |
PureThy.add_defs_i false [((name, t), atts)] #-> (fn [thm] => pair (name, thm)) |
|
299 |
| thy_def true ((name, atts), t) = |
|
300 |
PureThy.add_defs_unchecked_i false [((name, t), atts)] #-> (fn [thm] => pair (name, thm)); |
|
301 |
||
302 |
in |
|
303 |
||
304 |
val add_primrec = gen_primrec thy_note (thy_def false); |
|
305 |
val add_primrec_unchecked = gen_primrec thy_note (thy_def true); |
|
306 |
val add_primrec_i = gen_primrec_i thy_note (thy_def false); |
|
307 |
val add_primrec_unchecked_i = gen_primrec_i thy_note (thy_def true); |
|
308 |
fun gen_primrec note def alt_name specs = |
|
309 |
gen_primrec_i note def alt_name (map (fn ((name, t), atts) => ((name, atts), t)) specs); |
|
310 |
||
311 |
end; (*local*) |
|
19688 | 312 |
|
5178 | 313 |
|
6359 | 314 |
(* outer syntax *) |
315 |
||
17057 | 316 |
local structure P = OuterParse and K = OuterKeyword in |
6359 | 317 |
|
19688 | 318 |
val opt_unchecked_name = |
319 |
Scan.optional (P.$$$ "(" |-- P.!!! |
|
320 |
(((P.$$$ "unchecked" >> K true) -- Scan.optional P.name "" || |
|
321 |
P.name >> pair false) --| P.$$$ ")")) (false, ""); |
|
322 |
||
6359 | 323 |
val primrec_decl = |
22101 | 324 |
opt_unchecked_name -- Scan.repeat1 (SpecParse.opt_thm_name ":" -- P.prop); |
6359 | 325 |
|
326 |
val primrecP = |
|
6723 | 327 |
OuterSyntax.command "primrec" "define primitive recursive functions on datatypes" K.thy_decl |
19688 | 328 |
(primrec_decl >> (fn ((unchecked, alt_name), eqns) => |
20176 | 329 |
Toplevel.theory (snd o |
19688 | 330 |
(if unchecked then add_primrec_unchecked else add_primrec) alt_name |
331 |
(map P.triple_swap eqns)))); |
|
6359 | 332 |
|
333 |
val _ = OuterSyntax.add_parsers [primrecP]; |
|
5178 | 334 |
|
335 |
end; |
|
6384 | 336 |
|
337 |
||
338 |
end; |
|
15705 | 339 |