author | kleing |
Mon, 21 Jun 2004 10:25:57 +0200 | |
changeset 14981 | e73f8140af78 |
parent 14241 | dfae7eb2830c |
child 15032 | 02aed07e01bf |
permissions | -rw-r--r-- |
6429 | 1 |
(* Title: HOL/Tools/recdef_package.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
5 |
Wrapper module for Konrad Slind's TFL package. |
|
6 |
*) |
|
7 |
||
8 |
signature RECDEF_PACKAGE = |
|
9 |
sig |
|
10 |
val quiet_mode: bool ref |
|
6439 | 11 |
val print_recdefs: theory -> unit |
8657 | 12 |
val get_recdef: theory -> string |
13 |
-> {simps: thm list, rules: thm list list, induct: thm, tcs: term list} option |
|
9859 | 14 |
val simp_add_global: theory attribute |
15 |
val simp_del_global: theory attribute |
|
16 |
val cong_add_global: theory attribute |
|
17 |
val cong_del_global: theory attribute |
|
18 |
val wf_add_global: theory attribute |
|
19 |
val wf_del_global: theory attribute |
|
20 |
val simp_add_local: Proof.context attribute |
|
21 |
val simp_del_local: Proof.context attribute |
|
22 |
val cong_add_local: Proof.context attribute |
|
23 |
val cong_del_local: Proof.context attribute |
|
24 |
val wf_add_local: Proof.context attribute |
|
25 |
val wf_del_local: Proof.context attribute |
|
11629 | 26 |
val add_recdef: bool -> xstring -> string -> ((bstring * string) * Args.src list) list -> |
9859 | 27 |
Args.src option -> theory -> theory |
28 |
* {simps: thm list, rules: thm list list, induct: thm, tcs: term list} |
|
11629 | 29 |
val add_recdef_i: bool -> xstring -> term -> ((bstring * term) * theory attribute list) list -> |
9859 | 30 |
theory -> theory * {simps: thm list, rules: thm list list, induct: thm, tcs: term list} |
31 |
val add_recdef_old: xstring -> string -> ((bstring * string) * Args.src list) list -> |
|
32 |
simpset * thm list -> theory -> |
|
33 |
theory * {simps: thm list, rules: thm list list, induct: thm, tcs: term list} |
|
6557 | 34 |
val defer_recdef: xstring -> string list -> (xstring * Args.src list) list |
35 |
-> theory -> theory * {induct_rules: thm} |
|
12708 | 36 |
val defer_recdef_i: xstring -> term list -> (thm list * theory attribute list) list |
6557 | 37 |
-> theory -> theory * {induct_rules: thm} |
10775 | 38 |
val recdef_tc: bstring * Args.src list -> xstring -> int option |
39 |
-> bool -> theory -> ProofHistory.T |
|
40 |
val recdef_tc_i: bstring * theory attribute list -> string -> int option |
|
41 |
-> bool -> theory -> ProofHistory.T |
|
6439 | 42 |
val setup: (theory -> theory) list |
6429 | 43 |
end; |
44 |
||
45 |
structure RecdefPackage: RECDEF_PACKAGE = |
|
46 |
struct |
|
47 |
||
9859 | 48 |
|
6429 | 49 |
val quiet_mode = Tfl.quiet_mode; |
50 |
val message = Tfl.message; |
|
51 |
||
52 |
||
9859 | 53 |
(** recdef hints **) |
6439 | 54 |
|
9859 | 55 |
(* type hints *) |
56 |
||
57 |
type hints = {simps: thm list, congs: (string * thm) list, wfs: thm list}; |
|
58 |
||
59 |
fun mk_hints (simps, congs, wfs) = {simps = simps, congs = congs, wfs = wfs}: hints; |
|
60 |
fun map_hints f ({simps, congs, wfs}: hints) = mk_hints (f (simps, congs, wfs)); |
|
61 |
||
62 |
fun map_simps f = map_hints (fn (simps, congs, wfs) => (f simps, congs, wfs)); |
|
63 |
fun map_congs f = map_hints (fn (simps, congs, wfs) => (simps, f congs, wfs)); |
|
64 |
fun map_wfs f = map_hints (fn (simps, congs, wfs) => (simps, congs, f wfs)); |
|
65 |
||
66 |
fun pretty_hints ({simps, congs, wfs}: hints) = |
|
67 |
[Pretty.big_list "recdef simp hints:" (map Display.pretty_thm simps), |
|
68 |
Pretty.big_list "recdef cong hints:" (map Display.pretty_thm (map #2 congs)), |
|
69 |
Pretty.big_list "recdef wf hints:" (map Display.pretty_thm wfs)]; |
|
70 |
||
71 |
||
72 |
(* congruence rules *) |
|
73 |
||
74 |
local |
|
75 |
||
76 |
val cong_head = |
|
77 |
fst o Term.dest_Const o Term.head_of o fst o Logic.dest_equals o Thm.concl_of; |
|
6439 | 78 |
|
9859 | 79 |
fun prep_cong raw_thm = |
80 |
let val thm = safe_mk_meta_eq raw_thm in (cong_head thm, thm) end; |
|
81 |
||
82 |
in |
|
83 |
||
84 |
fun add_cong raw_thm congs = |
|
85 |
let val (c, thm) = prep_cong raw_thm |
|
86 |
in overwrite_warn (congs, (c, thm)) ("Overwriting recdef congruence rule for " ^ quote c) end; |
|
87 |
||
88 |
fun del_cong raw_thm congs = |
|
89 |
let |
|
90 |
val (c, thm) = prep_cong raw_thm; |
|
91 |
val (del, rest) = Library.partition (Library.equal c o fst) congs; |
|
92 |
in if null del then (warning ("No recdef congruence rule for " ^ quote c); congs) else rest end; |
|
93 |
||
94 |
val add_congs = curry (foldr (uncurry add_cong)); |
|
95 |
||
96 |
end; |
|
97 |
||
98 |
||
99 |
||
100 |
(** global and local recdef data **) |
|
101 |
||
102 |
(* theory data kind 'HOL/recdef' *) |
|
6439 | 103 |
|
8657 | 104 |
type recdef_info = {simps: thm list, rules: thm list list, induct: thm, tcs: term list}; |
6439 | 105 |
|
9859 | 106 |
structure GlobalRecdefArgs = |
6439 | 107 |
struct |
108 |
val name = "HOL/recdef"; |
|
9859 | 109 |
type T = recdef_info Symtab.table * hints; |
6439 | 110 |
|
9879 | 111 |
val empty = (Symtab.empty, mk_hints ([], [], [])): T; |
6557 | 112 |
val copy = I; |
6439 | 113 |
val prep_ext = I; |
9859 | 114 |
fun merge |
115 |
((tab1, {simps = simps1, congs = congs1, wfs = wfs1}), |
|
116 |
(tab2, {simps = simps2, congs = congs2, wfs = wfs2})) = |
|
117 |
(Symtab.merge (K true) (tab1, tab2), |
|
118 |
mk_hints (Drule.merge_rules (simps1, simps2), |
|
119 |
Library.merge_alists congs1 congs2, |
|
120 |
Drule.merge_rules (wfs1, wfs2))); |
|
6439 | 121 |
|
9859 | 122 |
fun print sg (tab, hints) = |
123 |
(Pretty.strs ("recdefs:" :: map #1 (Sign.cond_extern_table sg Sign.constK tab)) :: |
|
124 |
pretty_hints hints) |> Pretty.chunks |> Pretty.writeln; |
|
6439 | 125 |
end; |
126 |
||
9859 | 127 |
structure GlobalRecdefData = TheoryDataFun(GlobalRecdefArgs); |
128 |
val print_recdefs = GlobalRecdefData.print; |
|
6429 | 129 |
|
6439 | 130 |
|
9859 | 131 |
fun get_recdef thy name = Symtab.lookup (#1 (GlobalRecdefData.get thy), name); |
6439 | 132 |
|
133 |
fun put_recdef name info thy = |
|
6429 | 134 |
let |
9859 | 135 |
val (tab, hints) = GlobalRecdefData.get thy; |
136 |
val tab' = Symtab.update_new ((name, info), tab) |
|
6439 | 137 |
handle Symtab.DUP _ => error ("Duplicate recursive function definition " ^ quote name); |
9859 | 138 |
in GlobalRecdefData.put (tab', hints) thy end; |
139 |
||
140 |
val get_global_hints = #2 o GlobalRecdefData.get; |
|
141 |
val map_global_hints = GlobalRecdefData.map o apsnd; |
|
142 |
||
143 |
||
144 |
(* proof data kind 'HOL/recdef' *) |
|
145 |
||
146 |
structure LocalRecdefArgs = |
|
147 |
struct |
|
148 |
val name = "HOL/recdef"; |
|
149 |
type T = hints; |
|
150 |
val init = get_global_hints; |
|
151 |
fun print _ hints = pretty_hints hints |> Pretty.chunks |> Pretty.writeln; |
|
152 |
end; |
|
153 |
||
154 |
structure LocalRecdefData = ProofDataFun(LocalRecdefArgs); |
|
155 |
val get_local_hints = LocalRecdefData.get; |
|
156 |
val map_local_hints = LocalRecdefData.map; |
|
157 |
||
158 |
||
159 |
(* attributes *) |
|
160 |
||
161 |
local |
|
162 |
||
163 |
fun global_local f g = |
|
164 |
(fn (thy, thm) => (map_global_hints (f (g thm)) thy, thm), |
|
165 |
fn (ctxt, thm) => (map_local_hints (f (g thm)) ctxt, thm)); |
|
166 |
||
167 |
fun mk_attr (add1, add2) (del1, del2) = |
|
168 |
(Attrib.add_del_args add1 del1, Attrib.add_del_args add2 del2); |
|
169 |
||
170 |
in |
|
171 |
||
12371 | 172 |
val (simp_add_global, simp_add_local) = global_local map_simps Drule.add_rule; |
173 |
val (simp_del_global, simp_del_local) = global_local map_simps Drule.del_rule; |
|
9859 | 174 |
val (cong_add_global, cong_add_local) = global_local map_congs add_cong; |
175 |
val (cong_del_global, cong_del_local) = global_local map_congs del_cong; |
|
12371 | 176 |
val (wf_add_global, wf_add_local) = global_local map_wfs Drule.add_rule; |
177 |
val (wf_del_global, wf_del_local) = global_local map_wfs Drule.del_rule; |
|
9859 | 178 |
|
179 |
val simp_attr = mk_attr (simp_add_global, simp_add_local) (simp_del_global, simp_del_local); |
|
180 |
val cong_attr = mk_attr (cong_add_global, cong_add_local) (cong_del_global, cong_del_local); |
|
181 |
val wf_attr = mk_attr (wf_add_global, wf_add_local) (wf_del_global, wf_del_local); |
|
182 |
||
183 |
end; |
|
184 |
||
185 |
||
9949 | 186 |
(* modifiers *) |
9859 | 187 |
|
9949 | 188 |
val recdef_simpN = "recdef_simp"; |
189 |
val recdef_congN = "recdef_cong"; |
|
190 |
val recdef_wfN = "recdef_wf"; |
|
9859 | 191 |
|
192 |
val recdef_modifiers = |
|
9949 | 193 |
[Args.$$$ recdef_simpN -- Args.colon >> K ((I, simp_add_local): Method.modifier), |
10032 | 194 |
Args.$$$ recdef_simpN -- Args.add -- Args.colon >> K (I, simp_add_local), |
195 |
Args.$$$ recdef_simpN -- Args.del -- Args.colon >> K (I, simp_del_local), |
|
9949 | 196 |
Args.$$$ recdef_congN -- Args.colon >> K (I, cong_add_local), |
10032 | 197 |
Args.$$$ recdef_congN -- Args.add -- Args.colon >> K (I, cong_add_local), |
198 |
Args.$$$ recdef_congN -- Args.del -- Args.colon >> K (I, cong_del_local), |
|
9949 | 199 |
Args.$$$ recdef_wfN -- Args.colon >> K (I, wf_add_local), |
10032 | 200 |
Args.$$$ recdef_wfN -- Args.add -- Args.colon >> K (I, wf_add_local), |
201 |
Args.$$$ recdef_wfN -- Args.del -- Args.colon >> K (I, wf_del_local)] @ |
|
9949 | 202 |
Clasimp.clasimp_modifiers; |
9859 | 203 |
|
9949 | 204 |
|
9859 | 205 |
|
9949 | 206 |
(** prepare_hints(_i) **) |
9859 | 207 |
|
208 |
fun prepare_hints thy opt_src = |
|
209 |
let |
|
210 |
val ctxt0 = ProofContext.init thy; |
|
211 |
val ctxt = |
|
212 |
(case opt_src of |
|
213 |
None => ctxt0 |
|
9949 | 214 |
| Some src => Method.only_sectioned_args recdef_modifiers I src ctxt0); |
9859 | 215 |
val {simps, congs, wfs} = get_local_hints ctxt; |
216 |
val cs = Classical.get_local_claset ctxt; |
|
217 |
val ss = Simplifier.get_local_simpset ctxt addsimps simps; |
|
218 |
in (cs, ss, map #2 congs, wfs) end; |
|
219 |
||
220 |
fun prepare_hints_i thy () = |
|
221 |
let val {simps, congs, wfs} = get_global_hints thy |
|
222 |
in (Classical.claset_of thy, Simplifier.simpset_of thy addsimps simps, map #2 congs, wfs) end; |
|
223 |
||
6439 | 224 |
|
225 |
||
226 |
(** add_recdef(_i) **) |
|
227 |
||
6557 | 228 |
fun requires_recdef thy = Theory.requires thy "Recdef" "recursive functions"; |
229 |
||
14241
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
230 |
(*"strict" is true iff (permissive) has been omitted*) |
11629 | 231 |
fun gen_add_recdef tfl_fn prep_att prep_hints strict raw_name R eq_srcs hints thy = |
6439 | 232 |
let |
9859 | 233 |
val _ = requires_recdef thy; |
234 |
||
6439 | 235 |
val name = Sign.intern_const (Theory.sign_of thy) raw_name; |
236 |
val bname = Sign.base_name name; |
|
6429 | 237 |
val _ = message ("Defining recursive function " ^ quote name ^ " ..."); |
238 |
||
8657 | 239 |
val ((eq_names, eqs), raw_eq_atts) = apfst split_list (split_list eq_srcs); |
240 |
val eq_atts = map (map (prep_att thy)) raw_eq_atts; |
|
241 |
||
9859 | 242 |
val (cs, ss, congs, wfs) = prep_hints thy hints; |
14241
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
243 |
(*We must remove imp_cong to prevent looping when the induction rule |
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
244 |
is simplified. Many induction rules have nested implications that would |
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
245 |
give rise to looping conditional rewriting.*) |
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
246 |
val (thy, {rules = rules_idx, induct, tcs}) = |
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
247 |
tfl_fn strict thy cs (ss delcongs [imp_cong]) |
dfae7eb2830c
Prevent recdef from looping when the inductio rule is simplified
paulson
parents:
12876
diff
changeset
|
248 |
congs wfs name R eqs; |
8657 | 249 |
val rules = map (map #1) (Library.partition_eq Library.eq_snd rules_idx); |
12448
473cb9f9e237
Recursive equations to be used for code generation are now registered
berghofe
parents:
12371
diff
changeset
|
250 |
val simp_att = if null tcs then |
473cb9f9e237
Recursive equations to be used for code generation are now registered
berghofe
parents:
12371
diff
changeset
|
251 |
[Simplifier.simp_add_global, RecfunCodegen.add] else []; |
8657 | 252 |
|
253 |
val (thy, (simps' :: rules', [induct'])) = |
|
7798
42e94b618f34
return stored thms with proper naming in derivation;
wenzelm
parents:
7262
diff
changeset
|
254 |
thy |
6439 | 255 |
|> Theory.add_path bname |
8657 | 256 |
|> PureThy.add_thmss ((("simps", flat rules), simp_att) :: ((eq_names ~~ rules) ~~ eq_atts)) |
12755
a906a8b364f1
removed case_numbers (already covered by default);
wenzelm
parents:
12708
diff
changeset
|
257 |
|>>> PureThy.add_thms [(("induct", induct), [])]; |
8657 | 258 |
val result = {simps = simps', rules = rules', induct = induct', tcs = tcs}; |
7798
42e94b618f34
return stored thms with proper naming in derivation;
wenzelm
parents:
7262
diff
changeset
|
259 |
val thy = |
42e94b618f34
return stored thms with proper naming in derivation;
wenzelm
parents:
7262
diff
changeset
|
260 |
thy |
6439 | 261 |
|> put_recdef name result |
6429 | 262 |
|> Theory.parent_path; |
7798
42e94b618f34
return stored thms with proper naming in derivation;
wenzelm
parents:
7262
diff
changeset
|
263 |
in (thy, result) end; |
6429 | 264 |
|
9859 | 265 |
val add_recdef = gen_add_recdef Tfl.define Attrib.global_attribute prepare_hints; |
11629 | 266 |
fun add_recdef_i x y z w = gen_add_recdef Tfl.define_i (K I) prepare_hints_i x y z w (); |
9859 | 267 |
|
268 |
||
269 |
(* add_recdef_old -- legacy interface *) |
|
270 |
||
271 |
fun prepare_hints_old thy (ss, thms) = |
|
272 |
let val {simps, congs, wfs} = get_global_hints thy |
|
273 |
in (Classical.claset_of thy, ss addsimps simps, map #2 (add_congs thms congs), wfs) end; |
|
274 |
||
11629 | 275 |
val add_recdef_old = gen_add_recdef Tfl.define Attrib.global_attribute prepare_hints_old false; |
6429 | 276 |
|
277 |
||
6557 | 278 |
|
279 |
(** defer_recdef(_i) **) |
|
280 |
||
281 |
fun gen_defer_recdef tfl_fn app_thms raw_name eqs raw_congs thy = |
|
282 |
let |
|
283 |
val name = Sign.intern_const (Theory.sign_of thy) raw_name; |
|
284 |
val bname = Sign.base_name name; |
|
285 |
||
286 |
val _ = requires_recdef thy; |
|
287 |
val _ = message ("Deferred recursive function " ^ quote name ^ " ..."); |
|
288 |
||
289 |
val (thy1, congs) = thy |> app_thms raw_congs; |
|
9859 | 290 |
val (thy2, induct_rules) = tfl_fn thy1 congs name eqs; |
8430 | 291 |
val (thy3, [induct_rules']) = |
6557 | 292 |
thy2 |
293 |
|> Theory.add_path bname |
|
294 |
|> PureThy.add_thms [(("induct_rules", induct_rules), [])] |
|
8430 | 295 |
|>> Theory.parent_path; |
296 |
in (thy3, {induct_rules = induct_rules'}) end; |
|
6557 | 297 |
|
298 |
val defer_recdef = gen_defer_recdef Tfl.defer IsarThy.apply_theorems; |
|
299 |
val defer_recdef_i = gen_defer_recdef Tfl.defer_i IsarThy.apply_theorems_i; |
|
300 |
||
301 |
||
302 |
||
10775 | 303 |
(** recdef_tc(_i) **) |
304 |
||
305 |
fun gen_recdef_tc prep_att prep_name (bname, raw_atts) raw_name opt_i int thy = |
|
306 |
let |
|
307 |
val name = prep_name (Theory.sign_of thy) raw_name; |
|
308 |
val atts = map (prep_att thy) raw_atts; |
|
309 |
val tcs = |
|
310 |
(case get_recdef thy name of |
|
311 |
None => error ("No recdef definition of constant: " ^ quote name) |
|
312 |
| Some {tcs, ...} => tcs); |
|
313 |
val i = if_none opt_i 1; |
|
314 |
val tc = Library.nth_elem (i - 1, tcs) handle Library.LIST _ => |
|
315 |
error ("No termination condition #" ^ string_of_int i ^ |
|
316 |
" in recdef definition of " ^ quote name); |
|
317 |
in |
|
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12755
diff
changeset
|
318 |
thy |
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12755
diff
changeset
|
319 |
|> IsarThy.theorem_i Drule.internalK ((bname, atts), (HOLogic.mk_Trueprop tc, ([], []))) int |
10775 | 320 |
end; |
321 |
||
322 |
val recdef_tc = gen_recdef_tc Attrib.global_attribute Sign.intern_const; |
|
323 |
val recdef_tc_i = gen_recdef_tc (K I) (K I); |
|
324 |
||
325 |
||
326 |
||
6439 | 327 |
(** package setup **) |
328 |
||
329 |
(* setup theory *) |
|
330 |
||
9859 | 331 |
val setup = |
332 |
[GlobalRecdefData.init, LocalRecdefData.init, |
|
333 |
Attrib.add_attributes |
|
9949 | 334 |
[(recdef_simpN, simp_attr, "declaration of recdef simp rule"), |
335 |
(recdef_congN, cong_attr, "declaration of recdef cong rule"), |
|
336 |
(recdef_wfN, wf_attr, "declaration of recdef wf rule")]]; |
|
6439 | 337 |
|
338 |
||
6429 | 339 |
(* outer syntax *) |
340 |
||
6723 | 341 |
local structure P = OuterParse and K = OuterSyntax.Keyword in |
6429 | 342 |
|
9859 | 343 |
val hints = |
344 |
P.$$$ "(" |-- P.!!! (P.position (P.$$$ "hints" -- P.arguments) --| P.$$$ ")") >> Args.src; |
|
345 |
||
6429 | 346 |
val recdef_decl = |
11629 | 347 |
Scan.optional (P.$$$ "(" -- P.!!! (P.$$$ "permissive" -- P.$$$ ")") >> K false) true -- |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12755
diff
changeset
|
348 |
P.name -- P.term -- Scan.repeat1 (P.opt_thm_name ":" -- P.prop) -- Scan.option hints |
11629 | 349 |
>> (fn ((((p, f), R), eqs), src) => #1 o add_recdef p f R (map P.triple_swap eqs) src); |
6429 | 350 |
|
351 |
val recdefP = |
|
6723 | 352 |
OuterSyntax.command "recdef" "define general recursive functions (TFL)" K.thy_decl |
6429 | 353 |
(recdef_decl >> Toplevel.theory); |
354 |
||
6557 | 355 |
|
356 |
val defer_recdef_decl = |
|
8657 | 357 |
P.name -- Scan.repeat1 P.prop -- |
6723 | 358 |
Scan.optional (P.$$$ "(" |-- P.$$$ "congs" |-- P.!!! (P.xthms1 --| P.$$$ ")")) [] |
6557 | 359 |
>> (fn ((f, eqs), congs) => #1 o defer_recdef f eqs congs); |
360 |
||
361 |
val defer_recdefP = |
|
6723 | 362 |
OuterSyntax.command "defer_recdef" "defer general recursive functions (TFL)" K.thy_decl |
6557 | 363 |
(defer_recdef_decl >> Toplevel.theory); |
364 |
||
10775 | 365 |
|
366 |
val recdef_tc_decl = |
|
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12755
diff
changeset
|
367 |
P.opt_thm_name ":" -- P.xname -- Scan.option (P.$$$ "(" |-- P.nat --| P.$$$ ")"); |
10775 | 368 |
|
369 |
fun mk_recdef_tc ((thm_name, name), i) = recdef_tc thm_name name i; |
|
370 |
||
371 |
val recdef_tcP = |
|
372 |
OuterSyntax.command "recdef_tc" "recommence proof of termination condition (TFL)" K.thy_goal |
|
373 |
(recdef_tc_decl >> (Toplevel.print oo (Toplevel.theory_to_proof o mk_recdef_tc))); |
|
374 |
||
375 |
||
11629 | 376 |
val _ = OuterSyntax.add_keywords ["permissive", "congs", "hints"]; |
10775 | 377 |
val _ = OuterSyntax.add_parsers [recdefP, defer_recdefP, recdef_tcP]; |
6429 | 378 |
|
379 |
end; |
|
380 |
||
381 |
||
382 |
end; |