author | wenzelm |
Thu, 22 Dec 2005 00:28:46 +0100 | |
changeset 18462 | b67d423b5234 |
parent 18455 | b293c1087f1d |
child 18518 | 3b1dfa53e64f |
permissions | -rw-r--r-- |
5177 | 1 |
(* Title: HOL/Tools/datatype_package.ML |
2 |
ID: $Id$ |
|
11539 | 3 |
Author: Stefan Berghofer, TU Muenchen |
5177 | 4 |
|
6360 | 5 |
Datatype package for Isabelle/HOL. |
5177 | 6 |
*) |
7 |
||
6360 | 8 |
signature BASIC_DATATYPE_PACKAGE = |
9 |
sig |
|
10 |
val induct_tac : string -> int -> tactic |
|
9747 | 11 |
val induct_thm_tac : thm -> string -> int -> tactic |
8437 | 12 |
val case_tac : string -> int -> tactic |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
13 |
val distinct_simproc : simproc |
6360 | 14 |
end; |
15 |
||
5177 | 16 |
signature DATATYPE_PACKAGE = |
17 |
sig |
|
6360 | 18 |
include BASIC_DATATYPE_PACKAGE |
5661 | 19 |
val quiet_mode : bool ref |
20 |
val add_datatype : bool -> string list -> (string list * bstring * mixfix * |
|
18008 | 21 |
(bstring * string list * mixfix) list) list -> theory -> |
5177 | 22 |
{distinct : thm list list, |
23 |
inject : thm list list, |
|
24 |
exhaustion : thm list, |
|
25 |
rec_thms : thm list, |
|
26 |
case_thms : thm list list, |
|
27 |
split_thms : (thm * thm) list, |
|
28 |
induction : thm, |
|
29 |
size : thm list, |
|
18008 | 30 |
simps : thm list} * theory |
14887 | 31 |
val add_datatype_i : bool -> bool -> string list -> (string list * bstring * mixfix * |
18008 | 32 |
(bstring * typ list * mixfix) list) list -> theory -> |
5177 | 33 |
{distinct : thm list list, |
34 |
inject : thm list list, |
|
35 |
exhaustion : thm list, |
|
36 |
rec_thms : thm list, |
|
37 |
case_thms : thm list list, |
|
38 |
split_thms : (thm * thm) list, |
|
39 |
induction : thm, |
|
40 |
size : thm list, |
|
18008 | 41 |
simps : thm list} * theory |
12708 | 42 |
val rep_datatype_i : string list option -> (thm list * theory attribute list) list list -> |
43 |
(thm list * theory attribute list) list list -> (thm list * theory attribute list) -> |
|
18008 | 44 |
theory -> |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
45 |
{distinct : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
46 |
inject : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
47 |
exhaustion : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
48 |
rec_thms : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
49 |
case_thms : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
50 |
split_thms : (thm * thm) list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
51 |
induction : thm, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
52 |
size : thm list, |
18008 | 53 |
simps : thm list} * theory |
15703 | 54 |
val rep_datatype : string list option -> (thmref * Attrib.src list) list list -> |
18008 | 55 |
(thmref * Attrib.src list) list list -> thmref * Attrib.src list -> theory -> |
5177 | 56 |
{distinct : thm list list, |
57 |
inject : thm list list, |
|
58 |
exhaustion : thm list, |
|
59 |
rec_thms : thm list, |
|
60 |
case_thms : thm list list, |
|
61 |
split_thms : (thm * thm) list, |
|
62 |
induction : thm, |
|
63 |
size : thm list, |
|
18008 | 64 |
simps : thm list} * theory |
5177 | 65 |
val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table |
6441 | 66 |
val print_datatypes : theory -> unit |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
67 |
val datatype_info : theory -> string -> DatatypeAux.datatype_info option |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
68 |
val datatype_info_err : theory -> string -> DatatypeAux.datatype_info |
18451 | 69 |
val is_datatype : theory -> string -> bool |
70 |
val get_datatype : theory -> string -> ((string * sort) list * string list) option |
|
71 |
val get_datatype_cons : theory -> string * string -> typ list option |
|
72 |
val get_case_const_data : theory -> string -> (string * int) list option |
|
18455 | 73 |
val get_all_datatype_cons : theory -> (string * string) list |
5177 | 74 |
val constrs_of : theory -> string -> term list option |
75 |
val case_const_of : theory -> string -> term option |
|
10121 | 76 |
val weak_case_congs_of : theory -> thm list |
6360 | 77 |
val setup: (theory -> theory) list |
5177 | 78 |
end; |
79 |
||
80 |
structure DatatypePackage : DATATYPE_PACKAGE = |
|
81 |
struct |
|
82 |
||
83 |
open DatatypeAux; |
|
84 |
||
5661 | 85 |
val quiet_mode = quiet_mode; |
86 |
||
6360 | 87 |
|
5177 | 88 |
(* data kind 'HOL/datatypes' *) |
89 |
||
16430 | 90 |
structure DatatypesData = TheoryDataFun |
91 |
(struct |
|
5177 | 92 |
val name = "HOL/datatypes"; |
93 |
type T = datatype_info Symtab.table; |
|
94 |
||
95 |
val empty = Symtab.empty; |
|
6556 | 96 |
val copy = I; |
16430 | 97 |
val extend = I; |
98 |
fun merge _ tabs : T = Symtab.merge (K true) tabs; |
|
5177 | 99 |
|
100 |
fun print sg tab = |
|
101 |
Pretty.writeln (Pretty.strs ("datatypes:" :: |
|
16364 | 102 |
map #1 (NameSpace.extern_table (Sign.type_space sg, tab)))); |
16430 | 103 |
end); |
5177 | 104 |
|
105 |
val get_datatypes = DatatypesData.get; |
|
106 |
val put_datatypes = DatatypesData.put; |
|
6441 | 107 |
val print_datatypes = DatatypesData.print; |
5177 | 108 |
|
109 |
||
110 |
(** theory information about datatypes **) |
|
111 |
||
17412 | 112 |
val datatype_info = Symtab.lookup o get_datatypes; |
5177 | 113 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
114 |
fun datatype_info_err thy name = (case datatype_info thy name of |
15531 | 115 |
SOME info => info |
116 |
| NONE => error ("Unknown datatype " ^ quote name)); |
|
5177 | 117 |
|
16430 | 118 |
fun constrs_of thy tname = (case datatype_info thy tname of |
15531 | 119 |
SOME {index, descr, ...} => |
17521 | 120 |
let val (_, _, constrs) = valOf (AList.lookup (op =) descr index) |
16430 | 121 |
in SOME (map (fn (cname, _) => Const (cname, Sign.the_const_type thy cname)) constrs) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
122 |
end |
15531 | 123 |
| _ => NONE); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
124 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
125 |
fun case_const_of thy tname = (case datatype_info thy tname of |
16430 | 126 |
SOME {case_name, ...} => SOME (Const (case_name, Sign.the_const_type thy case_name)) |
15531 | 127 |
| _ => NONE); |
5177 | 128 |
|
16430 | 129 |
val weak_case_congs_of = map (#weak_case_cong o #2) o Symtab.dest o get_datatypes; |
10121 | 130 |
|
5177 | 131 |
fun find_tname var Bi = |
132 |
let val frees = map dest_Free (term_frees Bi) |
|
14412
109cc0dc706b
find_tname now handles parameter renaming properly ("as they are printed").
berghofe
parents:
14174
diff
changeset
|
133 |
val params = rename_wrt_term Bi (Logic.strip_params Bi); |
17521 | 134 |
in case AList.lookup (op =) (frees @ params) var of |
15531 | 135 |
NONE => error ("No such variable in subgoal: " ^ quote var) |
136 |
| SOME(Type (tn, _)) => tn |
|
5177 | 137 |
| _ => error ("Cannot determine type of " ^ quote var) |
138 |
end; |
|
139 |
||
8279 | 140 |
fun infer_tname state i aterm = |
5177 | 141 |
let |
8279 | 142 |
val sign = Thm.sign_of_thm state; |
143 |
val (_, _, Bi, _) = Thm.dest_state (state, i) |
|
5177 | 144 |
val params = Logic.strip_params Bi; (*params of subgoal i*) |
145 |
val params = rev (rename_wrt_term Bi params); (*as they are printed*) |
|
146 |
val (types, sorts) = types_sorts state; |
|
17521 | 147 |
fun types' (a, ~1) = (case AList.lookup (op =) params a of NONE => types(a, ~1) | sm => sm) |
5177 | 148 |
| types' ixn = types ixn; |
8100 | 149 |
val (ct, _) = read_def_cterm (sign, types', sorts) [] false (aterm, TypeInfer.logicT); |
5177 | 150 |
in case #T (rep_cterm ct) of |
151 |
Type (tn, _) => tn |
|
152 |
| _ => error ("Cannot determine type of " ^ quote aterm) |
|
153 |
end; |
|
154 |
||
155 |
(*Warn if the (induction) variable occurs Free among the premises, which |
|
156 |
usually signals a mistake. But calls the tactic either way!*) |
|
8405 | 157 |
fun occs_in_prems tacf vars = |
5177 | 158 |
SUBGOAL (fn (Bi, i) => |
8405 | 159 |
(if exists (fn Free (a, _) => a mem vars) |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
160 |
(foldr add_term_frees [] (#2 (strip_context Bi))) |
8405 | 161 |
then warning "Induction variable occurs also among premises!" |
162 |
else (); |
|
163 |
tacf i)); |
|
5177 | 164 |
|
8689 | 165 |
|
5177 | 166 |
(* generic induction tactic for datatypes *) |
167 |
||
8689 | 168 |
local |
169 |
||
15531 | 170 |
fun prep_var (Var (ixn, _), SOME x) = SOME (ixn, x) |
171 |
| prep_var _ = NONE; |
|
8689 | 172 |
|
15570 | 173 |
fun prep_inst (concl, xs) = (*exception UnequalLengths *) |
11725 | 174 |
let val vs = InductAttrib.vars_of concl |
15570 | 175 |
in List.mapPartial prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end; |
8689 | 176 |
|
177 |
in |
|
178 |
||
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
179 |
fun gen_induct_tac inst_tac (varss, opt_rule) i state = |
5177 | 180 |
let |
8689 | 181 |
val (_, _, Bi, _) = Thm.dest_state (state, i); |
182 |
val {sign, ...} = Thm.rep_thm state; |
|
8672 | 183 |
val (rule, rule_name) = |
184 |
(case opt_rule of |
|
15531 | 185 |
SOME r => (r, "Induction rule") |
186 |
| NONE => |
|
15570 | 187 |
let val tn = find_tname (hd (List.mapPartial I (List.concat varss))) Bi |
16430 | 188 |
in (#induction (datatype_info_err sign tn), "Induction rule for type " ^ tn) end); |
8672 | 189 |
|
11725 | 190 |
val concls = HOLogic.dest_concls (Thm.concl_of rule); |
15570 | 191 |
val insts = List.concat (map prep_inst (concls ~~ varss)) handle UnequalLengths => |
8689 | 192 |
error (rule_name ^ " has different numbers of variables"); |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
193 |
in occs_in_prems (inst_tac insts rule) (map #2 insts) i state end; |
8689 | 194 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
195 |
fun induct_tac s = |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
196 |
gen_induct_tac Tactic.res_inst_tac' |
15531 | 197 |
(map (Library.single o SOME) (Syntax.read_idents s), NONE); |
8689 | 198 |
|
9747 | 199 |
fun induct_thm_tac th s = |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
200 |
gen_induct_tac Tactic.res_inst_tac' |
15531 | 201 |
([map SOME (Syntax.read_idents s)], SOME th); |
9747 | 202 |
|
8689 | 203 |
end; |
5177 | 204 |
|
8279 | 205 |
|
8437 | 206 |
(* generic case tactic for datatypes *) |
5177 | 207 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
208 |
fun case_inst_tac inst_tac t rule i state = |
8672 | 209 |
let |
210 |
val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop |
|
211 |
(hd (Logic.strip_assums_hyp (hd (Thm.prems_of rule)))); |
|
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
212 |
in inst_tac [(ixn, t)] rule i state end; |
8672 | 213 |
|
15531 | 214 |
fun gen_case_tac inst_tac (t, SOME rule) i state = |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
215 |
case_inst_tac inst_tac t rule i state |
15531 | 216 |
| gen_case_tac inst_tac (t, NONE) i state = |
8672 | 217 |
let val tn = infer_tname state i t in |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
218 |
if tn = HOLogic.boolN then inst_tac [(("P", 0), t)] case_split_thm i state |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
219 |
else case_inst_tac inst_tac t |
16430 | 220 |
(#exhaustion (datatype_info_err (Thm.sign_of_thm state) tn)) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
221 |
i state |
14471
5688b05b2575
case_tac no longer raises THM exception if goal number is out of range.
berghofe
parents:
14412
diff
changeset
|
222 |
end handle THM _ => Seq.empty; |
8672 | 223 |
|
15531 | 224 |
fun case_tac t = gen_case_tac Tactic.res_inst_tac' (t, NONE); |
8672 | 225 |
|
8279 | 226 |
|
227 |
||
8541 | 228 |
(** Isar tactic emulations **) |
229 |
||
8672 | 230 |
local |
231 |
||
8689 | 232 |
val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":"); |
233 |
val opt_rule = Scan.option (rule_spec |-- Attrib.local_thm); |
|
234 |
||
15703 | 235 |
val varss = |
236 |
Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift (Args.maybe Args.name)))); |
|
8672 | 237 |
|
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
238 |
val inst_tac = Method.bires_inst_tac false; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
239 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
240 |
fun induct_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
241 |
gen_induct_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
242 |
fun case_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
243 |
gen_case_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
244 |
|
8672 | 245 |
in |
8541 | 246 |
|
247 |
val tactic_emulations = |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
248 |
[("induct_tac", Method.goal_args_ctxt' (varss -- opt_rule) induct_meth, |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
249 |
"induct_tac emulation (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
250 |
("case_tac", Method.goal_args_ctxt' (Scan.lift Args.name -- opt_rule) case_meth, |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
251 |
"case_tac emulation (dynamic instantiation)")]; |
8672 | 252 |
|
253 |
end; |
|
8541 | 254 |
|
255 |
||
5177 | 256 |
|
8437 | 257 |
(** induct method setup **) |
258 |
||
259 |
(* case names *) |
|
260 |
||
261 |
local |
|
262 |
||
263 |
fun dt_recs (DtTFree _) = [] |
|
15570 | 264 |
| dt_recs (DtType (_, dts)) = List.concat (map dt_recs dts) |
8437 | 265 |
| dt_recs (DtRec i) = [i]; |
266 |
||
267 |
fun dt_cases (descr: descr) (_, args, constrs) = |
|
268 |
let |
|
17521 | 269 |
fun the_bname i = Sign.base_name (#1 (valOf (AList.lookup (op =) descr i))); |
15570 | 270 |
val bnames = map the_bname (distinct (List.concat (map dt_recs args))); |
8437 | 271 |
in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end; |
272 |
||
273 |
||
274 |
fun induct_cases descr = |
|
15570 | 275 |
DatatypeProp.indexify_names (List.concat (map (dt_cases descr) (map #2 descr))); |
8437 | 276 |
|
17521 | 277 |
fun exhaust_cases descr i = dt_cases descr (valOf (AList.lookup (op =) descr i)); |
8437 | 278 |
|
279 |
in |
|
280 |
||
281 |
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr); |
|
282 |
||
283 |
fun mk_case_names_exhausts descr new = |
|
284 |
map (RuleCases.case_names o exhaust_cases descr o #1) |
|
15570 | 285 |
(List.filter (fn ((_, (name, _, _))) => name mem_string new) descr); |
8437 | 286 |
|
287 |
end; |
|
288 |
||
17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset
|
289 |
fun name_notE th = |
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset
|
290 |
Thm.name_thm (Thm.name_of_thm th ^ "_E", th RS notE); |
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset
|
291 |
|
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
292 |
fun add_rules simps case_thms size_thms rec_thms inject distinct |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
293 |
weak_case_congs cong_att = |
18377 | 294 |
(snd o PureThy.add_thmss [(("simps", simps), []), |
15570 | 295 |
(("", List.concat case_thms @ size_thms @ |
296 |
List.concat distinct @ rec_thms), [Simplifier.simp_add_global]), |
|
16672 | 297 |
(("", size_thms @ rec_thms), [RecfunCodegen.add NONE]), |
15570 | 298 |
(("", List.concat inject), [iff_add_global]), |
17084
fb0a80aef0be
classical rules must have names for ATP integration
paulson
parents:
17057
diff
changeset
|
299 |
(("", map name_notE (List.concat distinct)), [Classical.safe_elim_global]), |
16672 | 300 |
(("", weak_case_congs), [cong_att])]); |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
301 |
|
8437 | 302 |
|
303 |
(* add_cases_induct *) |
|
8306 | 304 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
305 |
fun add_cases_induct infos induction = |
8306 | 306 |
let |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
307 |
val n = length (HOLogic.dest_concls (Thm.concl_of induction)); |
18462 | 308 |
fun proj i = ProjectRule.project induction (i + 1); |
8405 | 309 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
310 |
fun named_rules (name, {index, exhaustion, ...}: datatype_info) = |
18462 | 311 |
[(("", proj index), [InductAttrib.induct_type_global name]), |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
312 |
(("", exhaustion), [InductAttrib.cases_type_global name])]; |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
313 |
fun unnamed_rule i = |
18462 | 314 |
(("", proj i), [Drule.kind_internal, InductAttrib.induct_type_global ""]); |
315 |
in |
|
316 |
PureThy.add_thms |
|
317 |
(List.concat (map named_rules infos) @ |
|
318 |
map unnamed_rule (length infos upto n - 1)) #> snd #> |
|
319 |
PureThy.add_thmss [(("inducts", |
|
320 |
map (proj #> standard #> RuleCases.save induction) (0 upto n - 1)), [])] #> snd |
|
321 |
end; |
|
8306 | 322 |
|
5177 | 323 |
|
8405 | 324 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
325 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
326 |
|
7060 | 327 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
328 |
| stripT p = p; |
|
329 |
||
330 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
331 |
| stripC p = p; |
|
332 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
333 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
334 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
335 |
exception ConstrDistinct of term; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
336 |
|
16973 | 337 |
fun distinct_proc sg ss (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 338 |
(case (stripC (0, t1), stripC (0, t2)) of |
339 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
340 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
341 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
342 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
16430 | 343 |
(case (constrs_of sg tname1) of |
15531 | 344 |
SOME constrs => let val cnames = map (fst o dest_Const) constrs |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
345 |
in if cname1 mem cnames andalso cname2 mem cnames then |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
346 |
let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT)); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
347 |
val eq_ct = cterm_of sg eq_t; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
348 |
val Datatype_thy = theory "Datatype"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
349 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
16486 | 350 |
map (get_thm Datatype_thy o Name) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
351 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"] |
16430 | 352 |
in (case (#distinct (datatype_info_err sg tname1)) of |
15531 | 353 |
QuickAndDirty => SOME (Thm.invoke_oracle |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
354 |
Datatype_thy distinctN (sg, ConstrDistinct eq_t)) |
17956 | 355 |
| FewConstrs thms => SOME (Goal.prove sg [] [] eq_t (K |
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
356 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1, |
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
357 |
atac 2, resolve_tac thms 1, etac FalseE 1]))) |
17956 | 358 |
| ManyConstrs (thm, simpset) => SOME (Goal.prove sg [] [] eq_t (K |
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
359 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
17875 | 360 |
full_simp_tac (Simplifier.inherit_context ss simpset) 1, |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
361 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
362 |
eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1, |
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
363 |
etac FalseE 1])))) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
364 |
end |
15531 | 365 |
else NONE |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
366 |
end |
15531 | 367 |
| NONE => NONE) |
368 |
else NONE |
|
369 |
| _ => NONE) |
|
370 |
| _ => NONE) |
|
371 |
| distinct_proc sg _ _ = NONE; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
372 |
|
13462 | 373 |
val distinct_simproc = |
16430 | 374 |
Simplifier.simproc HOL.thy distinctN ["s = t"] distinct_proc; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
375 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
376 |
val dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
377 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
378 |
val simproc_setup = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
379 |
[Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t), |
17875 | 380 |
fn thy => ((change_simpset_of thy) (fn ss => ss addsimprocs [distinct_simproc]); thy)]; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
381 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
382 |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
383 |
(**** translation rules for case ****) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
384 |
|
18008 | 385 |
fun find_first f = Library.find_first f; |
386 |
||
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
387 |
fun case_tr sg [t, u] = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
388 |
let |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
389 |
fun case_error s name ts = raise TERM ("Error in case expression" ^ |
15570 | 390 |
getOpt (Option.map (curry op ^ " for datatype ") name, "") ^ ":\n" ^ s, ts); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
391 |
fun dest_case1 (Const ("_case1", _) $ t $ u) = (case strip_comb t of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
392 |
(Const (s, _), ts) => (Sign.intern_const sg s, ts) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
393 |
| (Free (s, _), ts) => (Sign.intern_const sg s, ts) |
15531 | 394 |
| _ => case_error "Head is not a constructor" NONE [t, u], u) |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
395 |
| dest_case1 t = raise TERM ("dest_case1", [t]); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
396 |
fun dest_case2 (Const ("_case2", _) $ t $ u) = t :: dest_case2 u |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
397 |
| dest_case2 t = [t]; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
398 |
val cases as ((cname, _), _) :: _ = map dest_case1 (dest_case2 u); |
16430 | 399 |
val tab = Symtab.dest (get_datatypes sg); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
400 |
val (cases', default) = (case split_last cases of |
15531 | 401 |
(cases', (("dummy_pattern", []), t)) => (cases', SOME t) |
402 |
| _ => (cases, NONE)) |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
403 |
fun abstr (Free (x, T), body) = Term.absfree (x, T, body) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
404 |
| abstr (Const ("_constrain", _) $ Free (x, T) $ tT, body) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
405 |
Syntax.const Syntax.constrainAbsC $ Term.absfree (x, T, body) $ tT |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
406 |
| abstr (Const ("Pair", _) $ x $ y, body) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
407 |
Syntax.const "split" $ abstr (x, abstr (y, body)) |
15531 | 408 |
| abstr (t, _) = case_error "Illegal pattern" NONE [t]; |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
409 |
in case find_first (fn (_, {descr, index, ...}) => |
15570 | 410 |
exists (equal cname o fst) (#3 (snd (List.nth (descr, index))))) tab of |
15531 | 411 |
NONE => case_error ("Not a datatype constructor: " ^ cname) NONE [u] |
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
412 |
| SOME (tname, {descr, sorts, case_name, index, ...}) => |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
413 |
let |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
414 |
val _ = if exists (equal "dummy_pattern" o fst o fst) cases' then |
15531 | 415 |
case_error "Illegal occurrence of '_' dummy pattern" (SOME tname) [u] else (); |
15570 | 416 |
val (_, (_, dts, constrs)) = List.nth (descr, index); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
417 |
fun find_case (cases, (s, dt)) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
418 |
(case find_first (equal s o fst o fst) cases' of |
15531 | 419 |
NONE => (case default of |
420 |
NONE => case_error ("No clause for constructor " ^ s) (SOME tname) [u] |
|
421 |
| SOME t => (cases, list_abs (map (rpair dummyT) (DatatypeProp.make_tnames |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
422 |
(map (typ_of_dtyp descr sorts) dt)), t))) |
15531 | 423 |
| SOME (c as ((_, vs), t)) => |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
424 |
if length dt <> length vs then |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
425 |
case_error ("Wrong number of arguments for constructor " ^ s) |
15531 | 426 |
(SOME tname) vs |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
427 |
else (cases \ c, foldr abstr t vs)) |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
428 |
val (cases'', fs) = foldl_map find_case (cases', constrs) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
429 |
in case (cases'', length constrs = length cases', default) of |
15531 | 430 |
([], true, SOME _) => |
431 |
case_error "Extra '_' dummy pattern" (SOME tname) [u] |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
432 |
| (_ :: _, _, _) => |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
433 |
let val extra = distinct (map (fst o fst) cases'') |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
434 |
in case extra \\ map fst constrs of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
435 |
[] => case_error ("More than one clause for constructor(s) " ^ |
15531 | 436 |
commas extra) (SOME tname) [u] |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
437 |
| extra' => case_error ("Illegal constructor(s): " ^ commas extra') |
15531 | 438 |
(SOME tname) [u] |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
439 |
end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
440 |
| _ => list_comb (Syntax.const case_name, fs) $ t |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
441 |
end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
442 |
end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
443 |
| case_tr sg ts = raise TERM ("case_tr", ts); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
444 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
445 |
fun case_tr' constrs sg ts = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
446 |
if length ts <> length constrs + 1 then raise Match else |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
447 |
let |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
448 |
val (fs, x) = split_last ts; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
449 |
fun strip_abs 0 t = ([], t) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
450 |
| strip_abs i (Abs p) = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
451 |
let val (x, u) = Syntax.atomic_abs_tr' p |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
452 |
in apfst (cons x) (strip_abs (i-1) u) end |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
453 |
| strip_abs i (Const ("split", _) $ t) = (case strip_abs (i+1) t of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
454 |
(v :: v' :: vs, u) => (Syntax.const "Pair" $ v $ v' :: vs, u)); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
455 |
fun is_dependent i t = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
456 |
let val k = length (strip_abs_vars t) - i |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
457 |
in k < 0 orelse exists (fn j => j >= k) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
458 |
(loose_bnos (strip_abs_body t)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
459 |
end; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
460 |
val cases = map (fn ((cname, dts), t) => |
16364 | 461 |
(Sign.extern_const sg cname, |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
462 |
strip_abs (length dts) t, is_dependent (length dts) t)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
463 |
(constrs ~~ fs); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
464 |
fun count_cases (cs, (_, _, true)) = cs |
17521 | 465 |
| count_cases (cs, (cname, (_, body), false)) = (case AList.lookup (op =) cs body of |
15531 | 466 |
NONE => (body, [cname]) :: cs |
17325 | 467 |
| SOME cnames => AList.update (op =) (body, cnames @ [cname]) cs); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
468 |
val cases' = sort (int_ord o Library.swap o pairself (length o snd)) |
15570 | 469 |
(Library.foldl count_cases ([], cases)); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
470 |
fun mk_case1 (cname, (vs, body), _) = Syntax.const "_case1" $ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
471 |
list_comb (Syntax.const cname, vs) $ body; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
472 |
in |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
473 |
Syntax.const "_case_syntax" $ x $ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
474 |
foldr1 (fn (t, u) => Syntax.const "_case2" $ t $ u) (map mk_case1 |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
475 |
(case cases' of |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
476 |
[] => cases |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
477 |
| (default, cnames) :: _ => |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
478 |
if length cnames = 1 then cases |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
479 |
else if length cnames = length constrs then |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
480 |
[hd cases, ("dummy_pattern", ([], default), false)] |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
481 |
else |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
482 |
filter_out (fn (cname, _, _) => cname mem cnames) cases @ |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
483 |
[("dummy_pattern", ([], default), false)])) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
484 |
end; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
485 |
|
15570 | 486 |
fun make_case_tr' case_names descr = List.concat (map |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
487 |
(fn ((_, (_, _, constrs)), case_name) => map (rpair (case_tr' constrs)) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
488 |
(NameSpace.accesses' case_name)) (descr ~~ case_names)); |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
489 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
490 |
val trfun_setup = |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
491 |
[Theory.add_advanced_trfuns ([], [("_case_syntax", case_tr)], [], [])]; |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
492 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
493 |
|
5177 | 494 |
(* prepare types *) |
495 |
||
496 |
fun read_typ sign ((Ts, sorts), str) = |
|
497 |
let |
|
17521 | 498 |
val T = Type.no_tvars (Sign.read_typ (sign, AList.lookup (op =) |
5177 | 499 |
(map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg |
500 |
in (Ts @ [T], add_typ_tfrees (T, sorts)) end; |
|
501 |
||
502 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
503 |
let |
|
504 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
505 |
TYPE (msg, _, _) => error msg; |
|
506 |
val sorts' = add_typ_tfrees (T, sorts) |
|
507 |
in (Ts @ [T], |
|
508 |
case duplicates (map fst sorts') of |
|
509 |
[] => sorts' |
|
510 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
511 |
end; |
|
512 |
||
513 |
||
514 |
(**** make datatype info ****) |
|
515 |
||
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
516 |
fun make_dt_info descr sorts induct reccomb_names rec_thms |
10121 | 517 |
(((((((((i, (_, (tname, _, _))), case_name), case_thms), |
518 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) = |
|
519 |
(tname, |
|
520 |
{index = i, |
|
521 |
descr = descr, |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
522 |
sorts = sorts, |
10121 | 523 |
rec_names = reccomb_names, |
524 |
rec_rewrites = rec_thms, |
|
525 |
case_name = case_name, |
|
526 |
case_rewrites = case_thms, |
|
527 |
induction = induct, |
|
528 |
exhaustion = exhaustion_thm, |
|
529 |
distinct = distinct_thm, |
|
530 |
inject = inject, |
|
531 |
nchotomy = nchotomy, |
|
532 |
case_cong = case_cong, |
|
533 |
weak_case_cong = weak_case_cong}); |
|
5177 | 534 |
|
535 |
||
536 |
(********************* axiomatic introduction of datatypes ********************) |
|
537 |
||
8437 | 538 |
fun add_and_get_axioms_atts label tnames attss ts thy = |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
539 |
foldr (fn (((tname, atts), t), (thy', axs)) => |
5177 | 540 |
let |
18377 | 541 |
val ([ax], thy'') = |
542 |
thy' |
|
543 |
|> Theory.add_path tname |
|
544 |
|> PureThy.add_axioms_i [((label, t), atts)]; |
|
5661 | 545 |
in (Theory.parent_path thy'', ax::axs) |
18377 | 546 |
end) (thy, []) (tnames ~~ attss ~~ ts) |> swap; |
8437 | 547 |
|
548 |
fun add_and_get_axioms label tnames = |
|
549 |
add_and_get_axioms_atts label tnames (replicate (length tnames) []); |
|
5177 | 550 |
|
551 |
fun add_and_get_axiomss label tnames tss thy = |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
552 |
foldr (fn ((tname, ts), (thy', axss)) => |
5177 | 553 |
let |
18377 | 554 |
val ([axs], thy'') = |
555 |
thy' |
|
556 |
|> Theory.add_path tname |
|
557 |
|> PureThy.add_axiomss_i [((label, ts), [])]; |
|
5661 | 558 |
in (Theory.parent_path thy'', axs::axss) |
18377 | 559 |
end) (thy, []) (tnames ~~ tss) |> swap; |
5177 | 560 |
|
8437 | 561 |
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
562 |
case_names_induct case_names_exhausts thy = |
|
5177 | 563 |
let |
15570 | 564 |
val descr' = List.concat descr; |
5177 | 565 |
val recTs = get_rec_types descr' sorts; |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
566 |
val used = foldr add_typ_tfree_names [] recTs; |
15570 | 567 |
val newTs = Library.take (length (hd descr), recTs); |
5177 | 568 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
569 |
val no_size = exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13480
diff
changeset
|
570 |
(fn dt => is_rec_type dt andalso not (null (fst (strip_dtyp dt)))) |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13480
diff
changeset
|
571 |
cargs) constrs) descr'; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
572 |
|
5177 | 573 |
(**** declare new types and constants ****) |
574 |
||
575 |
val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr); |
|
576 |
||
577 |
val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') => |
|
578 |
map (fn ((_, cargs), (cname, mx)) => |
|
579 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
580 |
(constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax); |
|
581 |
||
15457
1fbd4aba46e3
Adapted to modified interface of PureThy.get_thm(s).
berghofe
parents:
15444
diff
changeset
|
582 |
val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used; |
5177 | 583 |
|
584 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
585 |
val reccomb_names = if length descr' = 1 then [big_reccomb_name] else |
|
586 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
587 |
(1 upto (length descr'))); |
|
588 |
||
9739 | 589 |
val size_names = DatatypeProp.indexify_names |
15570 | 590 |
(map (fn T => name_of_typ T ^ "_size") (Library.drop (length (hd descr), recTs))); |
5177 | 591 |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12311
diff
changeset
|
592 |
val freeT = TFree (variant used "'t", HOLogic.typeS); |
5177 | 593 |
val case_fn_Ts = map (fn (i, (_, _, constrs)) => |
594 |
map (fn (_, cargs) => |
|
595 |
let val Ts = map (typ_of_dtyp descr' sorts) cargs |
|
596 |
in Ts ---> freeT end) constrs) (hd descr); |
|
597 |
||
598 |
val case_names = map (fn s => (s ^ "_case")) new_type_names; |
|
599 |
||
6305 | 600 |
val thy2' = thy |> |
5177 | 601 |
|
602 |
(** new types **) |
|
603 |
||
15570 | 604 |
curry (Library.foldr (fn (((name, mx), tvs), thy') => thy' |> |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
605 |
TypedefPackage.add_typedecls [(name, tvs, mx)])) |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
606 |
(types_syntax ~~ tyvars) |> |
5661 | 607 |
add_path flat_names (space_implode "_" new_type_names) |> |
5177 | 608 |
|
609 |
(** primrec combinators **) |
|
610 |
||
611 |
Theory.add_consts_i (map (fn ((name, T), T') => |
|
612 |
(name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) |
|
613 |
(reccomb_names ~~ recTs ~~ rec_result_Ts)) |> |
|
614 |
||
615 |
(** case combinators **) |
|
616 |
||
617 |
Theory.add_consts_i (map (fn ((name, T), Ts) => |
|
618 |
(name, Ts @ [T] ---> freeT, NoSyn)) |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
619 |
(case_names ~~ newTs ~~ case_fn_Ts)); |
6305 | 620 |
|
16430 | 621 |
val reccomb_names' = map (Sign.intern_const thy2') reccomb_names; |
622 |
val case_names' = map (Sign.intern_const thy2') case_names; |
|
6305 | 623 |
|
624 |
val thy2 = thy2' |> |
|
5177 | 625 |
|
626 |
(** size functions **) |
|
627 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
628 |
(if no_size then I else Theory.add_consts_i (map (fn (s, T) => |
5177 | 629 |
(Sign.base_name s, T --> HOLogic.natT, NoSyn)) |
15570 | 630 |
(size_names ~~ Library.drop (length (hd descr), recTs)))) |> |
5661 | 631 |
|
632 |
(** constructors **) |
|
633 |
||
634 |
parent_path flat_names |> |
|
15570 | 635 |
curry (Library.foldr (fn (((((_, (_, _, constrs)), T), tname), |
5661 | 636 |
constr_syntax'), thy') => thy' |> |
637 |
add_path flat_names tname |> |
|
638 |
Theory.add_consts_i (map (fn ((_, cargs), (cname, mx)) => |
|
639 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
640 |
(constrs ~~ constr_syntax')) |> |
|
641 |
parent_path flat_names)) |
|
642 |
(hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax); |
|
5177 | 643 |
|
644 |
(**** introduction of axioms ****) |
|
645 |
||
5661 | 646 |
val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2; |
9739 | 647 |
val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2; |
5661 | 648 |
|
18377 | 649 |
val ((([induct], [rec_thms]), inject), thy3) = |
650 |
thy2 |
|
651 |
|> Theory.add_path (space_implode "_" new_type_names) |
|
652 |
|> PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts), |
|
653 |
[case_names_induct])] |
|
654 |
||>> PureThy.add_axiomss_i [(("recs", rec_axs), [])] |
|
655 |
||> (if no_size then I else snd o PureThy.add_axiomss_i [(("size", size_axs), [])]) |
|
656 |
||> Theory.parent_path |
|
657 |
||>> add_and_get_axiomss "inject" new_type_names |
|
658 |
(DatatypeProp.make_injs descr sorts); |
|
16486 | 659 |
val size_thms = if no_size then [] else get_thms thy3 (Name "size"); |
18377 | 660 |
val (distinct, thy4) = add_and_get_axiomss "distinct" new_type_names |
5177 | 661 |
(DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3; |
8437 | 662 |
|
663 |
val exhaust_ts = DatatypeProp.make_casedists descr sorts; |
|
18377 | 664 |
val (exhaustion, thy5) = add_and_get_axioms_atts "exhaust" new_type_names |
8437 | 665 |
(map Library.single case_names_exhausts) exhaust_ts thy4; |
18377 | 666 |
val (case_thms, thy6) = add_and_get_axiomss "cases" new_type_names |
5177 | 667 |
(DatatypeProp.make_cases new_type_names descr sorts thy5) thy5; |
668 |
val (split_ts, split_asm_ts) = ListPair.unzip |
|
669 |
(DatatypeProp.make_splits new_type_names descr sorts thy6); |
|
18377 | 670 |
val (split, thy7) = add_and_get_axioms "split" new_type_names split_ts thy6; |
671 |
val (split_asm, thy8) = add_and_get_axioms "split_asm" new_type_names |
|
5177 | 672 |
split_asm_ts thy7; |
18377 | 673 |
val (nchotomys, thy9) = add_and_get_axioms "nchotomy" new_type_names |
5177 | 674 |
(DatatypeProp.make_nchotomys descr sorts) thy8; |
18377 | 675 |
val (case_congs, thy10) = add_and_get_axioms "case_cong" new_type_names |
5177 | 676 |
(DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9; |
18377 | 677 |
val (weak_case_congs, thy11) = add_and_get_axioms "weak_case_cong" new_type_names |
8601 | 678 |
(DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10; |
8405 | 679 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
680 |
val dt_infos = map (make_dt_info descr' sorts induct reccomb_names' rec_thms) |
6305 | 681 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names' ~~ case_thms ~~ |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
682 |
exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~ |
10121 | 683 |
nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 684 |
|
15570 | 685 |
val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
9386 | 686 |
val split_thms = split ~~ split_asm; |
5177 | 687 |
|
8601 | 688 |
val thy12 = thy11 |> |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
689 |
Theory.add_advanced_trfuns ([], [], make_case_tr' case_names' (hd descr), []) |> |
5661 | 690 |
Theory.add_path (space_implode "_" new_type_names) |> |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
691 |
add_rules simps case_thms size_thms rec_thms inject distinct |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
692 |
weak_case_congs Simplifier.cong_add_global |> |
17412 | 693 |
put_datatypes (fold Symtab.update dt_infos dt_info) |> |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
694 |
add_cases_induct dt_infos induct |> |
9386 | 695 |
Theory.parent_path |> |
18314 | 696 |
store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd |> |
13466 | 697 |
DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos); |
5177 | 698 |
in |
18008 | 699 |
({distinct = distinct, |
5177 | 700 |
inject = inject, |
701 |
exhaustion = exhaustion, |
|
702 |
rec_thms = rec_thms, |
|
703 |
case_thms = case_thms, |
|
9386 | 704 |
split_thms = split_thms, |
5177 | 705 |
induction = induct, |
706 |
size = size_thms, |
|
18008 | 707 |
simps = simps}, thy12) |
5177 | 708 |
end; |
709 |
||
710 |
||
711 |
(******************* definitional introduction of datatypes *******************) |
|
712 |
||
8437 | 713 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
714 |
case_names_induct case_names_exhausts thy = |
|
5177 | 715 |
let |
6360 | 716 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 717 |
|
18314 | 718 |
val ((inject, distinct, dist_rewrites, simproc_dists, induct), thy2) = thy |> |
5661 | 719 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
8437 | 720 |
types_syntax constr_syntax case_names_induct; |
5177 | 721 |
|
18314 | 722 |
val (casedist_thms, thy3) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr |
8437 | 723 |
sorts induct case_names_exhausts thy2; |
18314 | 724 |
val ((reccomb_names, rec_thms), thy4) = DatatypeAbsProofs.prove_primrec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
725 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3; |
18314 | 726 |
val ((case_thms, case_names), thy6) = DatatypeAbsProofs.prove_case_thms |
5661 | 727 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
18314 | 728 |
val (split_thms, thy7) = DatatypeAbsProofs.prove_split_thms new_type_names |
5177 | 729 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
18314 | 730 |
val (nchotomys, thy8) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 731 |
descr sorts casedist_thms thy7; |
18314 | 732 |
val (case_congs, thy9) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 733 |
descr sorts nchotomys case_thms thy8; |
18314 | 734 |
val (weak_case_congs, thy10) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 735 |
descr sorts thy9; |
18314 | 736 |
val (size_thms, thy11) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names |
8601 | 737 |
descr sorts reccomb_names rec_thms thy10; |
5177 | 738 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
739 |
val dt_infos = map (make_dt_info (List.concat descr) sorts induct reccomb_names rec_thms) |
5177 | 740 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
10121 | 741 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 742 |
|
15570 | 743 |
val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
5177 | 744 |
|
8601 | 745 |
val thy12 = thy11 |> |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
746 |
Theory.add_advanced_trfuns ([], [], make_case_tr' case_names (hd descr), []) |> |
5661 | 747 |
Theory.add_path (space_implode "_" new_type_names) |> |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
748 |
add_rules simps case_thms size_thms rec_thms inject distinct |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
749 |
weak_case_congs (Simplifier.change_global_ss (op addcongs)) |> |
17412 | 750 |
put_datatypes (fold Symtab.update dt_infos dt_info) |> |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
751 |
add_cases_induct dt_infos induct |> |
9386 | 752 |
Theory.parent_path |> |
18314 | 753 |
store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd |> |
13466 | 754 |
DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos); |
5177 | 755 |
in |
18008 | 756 |
({distinct = distinct, |
5177 | 757 |
inject = inject, |
758 |
exhaustion = casedist_thms, |
|
759 |
rec_thms = rec_thms, |
|
760 |
case_thms = case_thms, |
|
761 |
split_thms = split_thms, |
|
762 |
induction = induct, |
|
763 |
size = size_thms, |
|
18008 | 764 |
simps = simps}, thy12) |
5177 | 765 |
end; |
766 |
||
767 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
768 |
(*********************** declare existing type as datatype *********************) |
5177 | 769 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
770 |
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 = |
5177 | 771 |
let |
12922 | 772 |
val _ = Theory.requires thy0 "Inductive" "datatype representations"; |
773 |
||
18418
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
774 |
val (((distinct, inject), [induction]), thy1) = |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
775 |
thy0 |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
776 |
|> fold_map apply_theorems raw_distinct |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
777 |
||>> fold_map apply_theorems raw_inject |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
778 |
||>> apply_theorems [raw_induction]; |
6394 | 779 |
val sign = Theory.sign_of thy1; |
5177 | 780 |
|
781 |
val induction' = freezeT induction; |
|
782 |
||
783 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
784 |
Sign.string_of_term sign t); |
|
785 |
||
786 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
787 |
((tname, map dest_TFree Ts) handle TERM _ => err t) |
5177 | 788 |
| get_typ t = err t; |
789 |
||
8437 | 790 |
val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction'))); |
15570 | 791 |
val new_type_names = getOpt (alt_names, map fst dtnames); |
5177 | 792 |
|
793 |
fun get_constr t = (case Logic.strip_assums_concl t of |
|
794 |
_ $ (_ $ t') => (case head_of t' of |
|
795 |
Const (cname, cT) => (case strip_type cT of |
|
796 |
(Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts)) |
|
797 |
| _ => err t) |
|
798 |
| _ => err t) |
|
799 |
| _ => err t); |
|
800 |
||
801 |
fun make_dt_spec [] _ _ = [] |
|
802 |
| make_dt_spec ((tname, tvs)::dtnames') i constrs = |
|
803 |
let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs |
|
804 |
in (i, (tname, map DtTFree tvs, map snd constrs')):: |
|
805 |
(make_dt_spec dtnames' (i + 1) constrs'') |
|
806 |
end; |
|
807 |
||
808 |
val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction')); |
|
809 |
val sorts = add_term_tfrees (concl_of induction', []); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
810 |
val dt_info = get_datatypes thy1; |
5177 | 811 |
|
8437 | 812 |
val case_names_induct = mk_case_names_induct descr; |
813 |
val case_names_exhausts = mk_case_names_exhausts descr (map #1 dtnames); |
|
814 |
||
815 |
||
6427 | 816 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 817 |
|
18314 | 818 |
val (casedist_thms, thy2) = thy1 |> |
8437 | 819 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction |
820 |
case_names_exhausts; |
|
18314 | 821 |
val ((reccomb_names, rec_thms), thy3) = DatatypeAbsProofs.prove_primrec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
822 |
false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2; |
18314 | 823 |
val ((case_thms, case_names), thy4) = DatatypeAbsProofs.prove_case_thms false |
5177 | 824 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
18314 | 825 |
val (split_thms, thy5) = DatatypeAbsProofs.prove_split_thms |
5177 | 826 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
18314 | 827 |
val (nchotomys, thy6) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 828 |
[descr] sorts casedist_thms thy5; |
18314 | 829 |
val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 830 |
[descr] sorts nchotomys case_thms thy6; |
18314 | 831 |
val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 832 |
[descr] sorts thy7; |
18314 | 833 |
val (size_thms, thy9) = |
16430 | 834 |
if Context.exists_name "NatArith" thy8 then |
5661 | 835 |
DatatypeAbsProofs.prove_size_thms false new_type_names |
8601 | 836 |
[descr] sorts reccomb_names rec_thms thy8 |
18314 | 837 |
else ([], thy8); |
5177 | 838 |
|
18377 | 839 |
val ((_, [induction']), thy10) = |
840 |
thy9 |
|
841 |
|> store_thmss "inject" new_type_names inject |
|
842 |
||>> store_thmss "distinct" new_type_names distinct |
|
843 |
||> Theory.add_path (space_implode "_" new_type_names) |
|
844 |
||>> PureThy.add_thms [(("induct", induction), [case_names_induct])]; |
|
9149 | 845 |
|
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
846 |
val dt_infos = map (make_dt_info descr sorts induction' reccomb_names rec_thms) |
10121 | 847 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~ |
848 |
map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
|
5177 | 849 |
|
15570 | 850 |
val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
5177 | 851 |
|
9149 | 852 |
val thy11 = thy10 |> |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
853 |
Theory.add_advanced_trfuns ([], [], make_case_tr' case_names descr, []) |> |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
854 |
add_rules simps case_thms size_thms rec_thms inject distinct |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
855 |
weak_case_congs (Simplifier.change_global_ss (op addcongs)) |> |
17412 | 856 |
put_datatypes (fold Symtab.update dt_infos dt_info) |> |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
857 |
add_cases_induct dt_infos induction' |> |
9386 | 858 |
Theory.parent_path |> |
18314 | 859 |
(snd o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |> |
13466 | 860 |
DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos); |
5177 | 861 |
in |
18008 | 862 |
({distinct = distinct, |
5177 | 863 |
inject = inject, |
864 |
exhaustion = casedist_thms, |
|
865 |
rec_thms = rec_thms, |
|
866 |
case_thms = case_thms, |
|
867 |
split_thms = split_thms, |
|
8437 | 868 |
induction = induction', |
5177 | 869 |
size = size_thms, |
18008 | 870 |
simps = simps}, thy11) |
5177 | 871 |
end; |
872 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
873 |
val rep_datatype = gen_rep_datatype IsarThy.apply_theorems; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
874 |
val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
875 |
|
5177 | 876 |
|
11958 | 877 |
|
5177 | 878 |
(******************************** add datatype ********************************) |
879 |
||
14887 | 880 |
fun gen_add_datatype prep_typ err flat_names new_type_names dts thy = |
5177 | 881 |
let |
12922 | 882 |
val _ = Theory.requires thy "Datatype_Universe" "datatype definitions"; |
5177 | 883 |
|
884 |
(* this theory is used just for parsing *) |
|
885 |
||
886 |
val tmp_thy = thy |> |
|
5892 | 887 |
Theory.copy |> |
5177 | 888 |
Theory.add_types (map (fn (tvs, tname, mx, _) => |
889 |
(tname, length tvs, mx)) dts); |
|
890 |
||
6394 | 891 |
val sign = Theory.sign_of tmp_thy; |
5177 | 892 |
|
5661 | 893 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 894 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
895 |
let val full_tname = Sign.full_name sign (Syntax.type_name tname mx) |
|
896 |
in (case duplicates tvs of |
|
5661 | 897 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
898 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 899 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
900 |
" : " ^ commas dups)) |
|
901 |
end) dts); |
|
902 |
||
903 |
val _ = (case duplicates (map fst new_dts) @ duplicates new_type_names of |
|
904 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
|
905 |
||
906 |
fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) = |
|
907 |
let |
|
5661 | 908 |
fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) = |
5279 | 909 |
let |
15570 | 910 |
val (cargs', sorts'') = Library.foldl (prep_typ sign) (([], sorts'), cargs); |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
911 |
val _ = (case foldr add_typ_tfree_names [] cargs' \\ tvs of |
5279 | 912 |
[] => () |
913 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
5661 | 914 |
in (constrs @ [((if flat_names then Sign.full_name sign else |
915 |
Sign.full_name_path sign tname) (Syntax.const_name cname mx'), |
|
5177 | 916 |
map (dtyp_of_typ new_dts) cargs')], |
917 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
918 |
end handle ERROR => |
|
919 |
error ("The error above occured in constructor " ^ cname ^ |
|
920 |
" of datatype " ^ tname); |
|
921 |
||
922 |
val (constrs', constr_syntax', sorts') = |
|
15570 | 923 |
Library.foldl prep_constr (([], [], sorts), constrs) |
5177 | 924 |
|
8405 | 925 |
in |
5177 | 926 |
case duplicates (map fst constrs') of |
927 |
[] => |
|
928 |
(dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx), |
|
929 |
map DtTFree tvs, constrs'))], |
|
930 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
931 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
932 |
" in datatype " ^ tname) |
|
933 |
end; |
|
934 |
||
15570 | 935 |
val (dts', constr_syntax, sorts', i) = Library.foldl prep_dt_spec (([], [], [], 0), dts); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
936 |
val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts')); |
5177 | 937 |
val dt_info = get_datatypes thy; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
938 |
val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i; |
14887 | 939 |
val _ = check_nonempty descr handle (exn as Datatype_Empty s) => |
15661
9ef583b08647
reverted renaming of Some/None in comments and strings;
wenzelm
parents:
15574
diff
changeset
|
940 |
if err then error ("Nonemptiness check failed for datatype " ^ s) |
14887 | 941 |
else raise exn; |
5177 | 942 |
|
15570 | 943 |
val descr' = List.concat descr; |
8437 | 944 |
val case_names_induct = mk_case_names_induct descr'; |
945 |
val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts); |
|
5177 | 946 |
in |
947 |
(if (!quick_and_dirty) then add_datatype_axm else add_datatype_def) |
|
8437 | 948 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
949 |
case_names_induct case_names_exhausts thy |
|
5177 | 950 |
end; |
951 |
||
952 |
val add_datatype_i = gen_add_datatype cert_typ; |
|
14887 | 953 |
val add_datatype = gen_add_datatype read_typ true; |
5177 | 954 |
|
6360 | 955 |
|
18451 | 956 |
(** queries **) |
957 |
||
958 |
fun is_datatype thy dtco = |
|
959 |
Symtab.lookup (get_datatypes thy) dtco |
|
960 |
|> is_some; |
|
961 |
||
962 |
fun get_datatype thy dtco = |
|
963 |
dtco |
|
964 |
|> Symtab.lookup (get_datatypes thy) |
|
965 |
|> Option.map (fn info => (#sorts info, |
|
966 |
(get_first (fn (_, (dtco', _, cs)) => |
|
967 |
if dtco = dtco' |
|
968 |
then SOME (map fst cs) |
|
969 |
else NONE) (#descr info) |> the))); |
|
970 |
||
971 |
fun get_datatype_cons thy (co, dtco) = |
|
972 |
let |
|
973 |
val descr = |
|
974 |
dtco |
|
975 |
|> Symtab.lookup (get_datatypes thy) |
|
976 |
|> Option.map #descr |
|
977 |
|> these |
|
978 |
val one_descr = |
|
979 |
descr |
|
980 |
|> get_first (fn (_, (dtco', vs, cs)) => |
|
981 |
if dtco = dtco' |
|
982 |
then SOME (vs, cs) |
|
983 |
else NONE); |
|
984 |
in |
|
985 |
if is_some one_descr |
|
986 |
then |
|
987 |
the one_descr |
|
988 |
|> (fn (vs, cs) => |
|
989 |
co |
|
990 |
|> AList.lookup (op =) cs |
|
991 |
|> Option.map (map (DatatypeAux.typ_of_dtyp descr (map (rpair []) |
|
992 |
(map DatatypeAux.dest_DtTFree vs))))) |
|
993 |
else NONE |
|
994 |
end; |
|
995 |
||
996 |
fun get_case_const_data thy c = |
|
997 |
case Library.find_first (fn (_, {index, descr, case_name, ...}) => |
|
998 |
case_name = c |
|
999 |
) ((Symtab.dest o get_datatypes) thy) |
|
1000 |
of NONE => NONE |
|
1001 |
| SOME (_, {index, descr, ...}) => |
|
1002 |
(SOME o map (apsnd length) o #3 o the o AList.lookup (op =) descr) index; |
|
1003 |
||
1004 |
fun get_all_datatype_cons thy = |
|
1005 |
Symtab.fold (fn (dtco, _) => fold |
|
18455 | 1006 |
(fn co => cons (co, dtco)) |
1007 |
((snd o the oo get_datatype) thy dtco)) (get_datatypes thy) []; |
|
1008 |
||
18451 | 1009 |
|
1010 |
||
6360 | 1011 |
(** package setup **) |
1012 |
||
1013 |
(* setup theory *) |
|
1014 |
||
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
1015 |
val setup = [DatatypesData.init, Method.add_methods tactic_emulations] @ simproc_setup @ trfun_setup; |
6360 | 1016 |
|
1017 |
||
1018 |
(* outer syntax *) |
|
1019 |
||
17057 | 1020 |
local structure P = OuterParse and K = OuterKeyword in |
6360 | 1021 |
|
1022 |
val datatype_decl = |
|
6723 | 1023 |
Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix -- |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
1024 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix)); |
6360 | 1025 |
|
1026 |
fun mk_datatype args = |
|
1027 |
let |
|
15531 | 1028 |
val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args; |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
1029 |
val specs = map (fn ((((_, vs), t), mx), cons) => |
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
1030 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
18008 | 1031 |
in snd o add_datatype false names specs end; |
6360 | 1032 |
|
1033 |
val datatypeP = |
|
6723 | 1034 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
1035 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 1036 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1037 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1038 |
val rep_datatype_decl = |
6723 | 1039 |
Scan.option (Scan.repeat1 P.name) -- |
11958 | 1040 |
Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [[]] -- |
1041 |
Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [[]] -- |
|
6723 | 1042 |
(P.$$$ "induction" |-- P.!!! P.xthm); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1043 |
|
18008 | 1044 |
fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #2 o rep_datatype opt_ts dss iss ind; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1045 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1046 |
val rep_datatypeP = |
6723 | 1047 |
OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_decl |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1048 |
(rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype)); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1049 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1050 |
|
6479
b0448cab1b1e
rep_datatype syntax: 'induction' instead of 'induct';
wenzelm
parents:
6441
diff
changeset
|
1051 |
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"]; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1052 |
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP]; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1053 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1054 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
1055 |
|
6360 | 1056 |
|
5177 | 1057 |
end; |
1058 |
||
6360 | 1059 |
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage; |
1060 |
open BasicDatatypePackage; |
|
15704 | 1061 |