author | berghofe |
Wed, 17 Mar 2004 14:00:45 +0100 | |
changeset 14471 | 5688b05b2575 |
parent 14412 | 109cc0dc706b |
child 14799 | a405aadff16c |
permissions | -rw-r--r-- |
5177 | 1 |
(* Title: HOL/Tools/datatype_package.ML |
2 |
ID: $Id$ |
|
11539 | 3 |
Author: Stefan Berghofer, TU Muenchen |
4 |
License: GPL (GNU GENERAL PUBLIC LICENSE) |
|
5177 | 5 |
|
6360 | 6 |
Datatype package for Isabelle/HOL. |
5177 | 7 |
*) |
8 |
||
6360 | 9 |
signature BASIC_DATATYPE_PACKAGE = |
10 |
sig |
|
11 |
val induct_tac : string -> int -> tactic |
|
9747 | 12 |
val induct_thm_tac : thm -> string -> int -> tactic |
8437 | 13 |
val case_tac : string -> int -> tactic |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
14 |
val distinct_simproc : simproc |
6360 | 15 |
end; |
16 |
||
5177 | 17 |
signature DATATYPE_PACKAGE = |
18 |
sig |
|
6360 | 19 |
include BASIC_DATATYPE_PACKAGE |
5661 | 20 |
val quiet_mode : bool ref |
21 |
val add_datatype : bool -> string list -> (string list * bstring * mixfix * |
|
22 |
(bstring * string list * mixfix) list) list -> theory -> theory * |
|
5177 | 23 |
{distinct : thm list list, |
24 |
inject : thm list list, |
|
25 |
exhaustion : thm list, |
|
26 |
rec_thms : thm list, |
|
27 |
case_thms : thm list list, |
|
28 |
split_thms : (thm * thm) list, |
|
29 |
induction : thm, |
|
30 |
size : thm list, |
|
31 |
simps : thm list} |
|
5661 | 32 |
val add_datatype_i : bool -> string list -> (string list * bstring * mixfix * |
33 |
(bstring * typ list * mixfix) list) list -> theory -> theory * |
|
5177 | 34 |
{distinct : thm list list, |
35 |
inject : thm list list, |
|
36 |
exhaustion : thm list, |
|
37 |
rec_thms : thm list, |
|
38 |
case_thms : thm list list, |
|
39 |
split_thms : (thm * thm) list, |
|
40 |
induction : thm, |
|
41 |
size : thm list, |
|
42 |
simps : thm list} |
|
12708 | 43 |
val rep_datatype_i : string list option -> (thm list * theory attribute list) list list -> |
44 |
(thm list * theory attribute list) list list -> (thm list * theory attribute list) -> |
|
45 |
theory -> theory * |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
46 |
{distinct : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
47 |
inject : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
48 |
exhaustion : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
49 |
rec_thms : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
50 |
case_thms : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
51 |
split_thms : (thm * thm) list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
52 |
induction : thm, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
53 |
size : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
54 |
simps : thm list} |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
55 |
val rep_datatype : string list option -> (xstring * Args.src list) list list -> |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
56 |
(xstring * Args.src list) list list -> xstring * Args.src list -> theory -> theory * |
5177 | 57 |
{distinct : thm list list, |
58 |
inject : thm list list, |
|
59 |
exhaustion : thm list, |
|
60 |
rec_thms : thm list, |
|
61 |
case_thms : thm list list, |
|
62 |
split_thms : (thm * thm) list, |
|
63 |
induction : thm, |
|
64 |
size : thm list, |
|
65 |
simps : thm list} |
|
66 |
val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table |
|
10121 | 67 |
val get_datatypes_sg : Sign.sg -> DatatypeAux.datatype_info Symtab.table |
6441 | 68 |
val print_datatypes : theory -> unit |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
69 |
val datatype_info_sg : Sign.sg -> string -> DatatypeAux.datatype_info option |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
70 |
val datatype_info : theory -> string -> DatatypeAux.datatype_info option |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
71 |
val datatype_info_sg_err : Sign.sg -> string -> DatatypeAux.datatype_info |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
72 |
val datatype_info_err : theory -> string -> DatatypeAux.datatype_info |
5177 | 73 |
val constrs_of : theory -> string -> term list option |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
74 |
val constrs_of_sg : Sign.sg -> string -> term list option |
5177 | 75 |
val case_const_of : theory -> string -> term option |
10121 | 76 |
val weak_case_congs_of : theory -> thm list |
77 |
val weak_case_congs_of_sg : Sign.sg -> thm list |
|
6360 | 78 |
val setup: (theory -> theory) list |
5177 | 79 |
end; |
80 |
||
81 |
structure DatatypePackage : DATATYPE_PACKAGE = |
|
82 |
struct |
|
83 |
||
84 |
open DatatypeAux; |
|
85 |
||
5661 | 86 |
val quiet_mode = quiet_mode; |
87 |
||
6360 | 88 |
|
5177 | 89 |
(* data kind 'HOL/datatypes' *) |
90 |
||
91 |
structure DatatypesArgs = |
|
92 |
struct |
|
93 |
val name = "HOL/datatypes"; |
|
94 |
type T = datatype_info Symtab.table; |
|
95 |
||
96 |
val empty = Symtab.empty; |
|
6556 | 97 |
val copy = I; |
5177 | 98 |
val prep_ext = I; |
99 |
val merge: T * T -> T = Symtab.merge (K true); |
|
100 |
||
101 |
fun print sg tab = |
|
102 |
Pretty.writeln (Pretty.strs ("datatypes:" :: |
|
6851 | 103 |
map #1 (Sign.cond_extern_table sg Sign.typeK tab))); |
5177 | 104 |
end; |
105 |
||
106 |
structure DatatypesData = TheoryDataFun(DatatypesArgs); |
|
107 |
val get_datatypes_sg = DatatypesData.get_sg; |
|
108 |
val get_datatypes = DatatypesData.get; |
|
109 |
val put_datatypes = DatatypesData.put; |
|
6441 | 110 |
val print_datatypes = DatatypesData.print; |
5177 | 111 |
|
112 |
||
113 |
(** theory information about datatypes **) |
|
114 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
115 |
fun datatype_info_sg sg name = Symtab.lookup (get_datatypes_sg sg, name); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
116 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
117 |
fun datatype_info_sg_err sg name = (case datatype_info_sg sg name of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
118 |
Some info => info |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
119 |
| None => error ("Unknown datatype " ^ quote name)); |
5177 | 120 |
|
6394 | 121 |
val datatype_info = datatype_info_sg o Theory.sign_of; |
5177 | 122 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
123 |
fun datatype_info_err thy name = (case datatype_info thy name of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
124 |
Some info => info |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
125 |
| None => error ("Unknown datatype " ^ quote name)); |
5177 | 126 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
127 |
fun constrs_of_sg sg tname = (case datatype_info_sg sg tname of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
128 |
Some {index, descr, ...} => |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
129 |
let val (_, _, constrs) = the (assoc (descr, index)) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
130 |
in Some (map (fn (cname, _) => Const (cname, the (Sign.const_type sg cname))) constrs) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
131 |
end |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
132 |
| _ => None); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
133 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
134 |
val constrs_of = constrs_of_sg o Theory.sign_of; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
135 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
136 |
fun case_const_of thy tname = (case datatype_info thy tname of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
137 |
Some {case_name, ...} => Some (Const (case_name, the (Sign.const_type |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
138 |
(Theory.sign_of thy) case_name))) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
139 |
| _ => None); |
5177 | 140 |
|
10121 | 141 |
val weak_case_congs_of_sg = map (#weak_case_cong o #2) o Symtab.dest o get_datatypes_sg; |
142 |
val weak_case_congs_of = weak_case_congs_of_sg o Theory.sign_of; |
|
143 |
||
5177 | 144 |
fun find_tname var Bi = |
145 |
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
|
146 |
val params = rename_wrt_term Bi (Logic.strip_params Bi); |
5177 | 147 |
in case assoc (frees @ params, var) of |
148 |
None => error ("No such variable in subgoal: " ^ quote var) |
|
149 |
| Some(Type (tn, _)) => tn |
|
150 |
| _ => error ("Cannot determine type of " ^ quote var) |
|
151 |
end; |
|
152 |
||
8279 | 153 |
fun infer_tname state i aterm = |
5177 | 154 |
let |
8279 | 155 |
val sign = Thm.sign_of_thm state; |
156 |
val (_, _, Bi, _) = Thm.dest_state (state, i) |
|
5177 | 157 |
val params = Logic.strip_params Bi; (*params of subgoal i*) |
158 |
val params = rev (rename_wrt_term Bi params); (*as they are printed*) |
|
159 |
val (types, sorts) = types_sorts state; |
|
160 |
fun types' (a, ~1) = (case assoc (params, a) of None => types(a, ~1) | sm => sm) |
|
161 |
| types' ixn = types ixn; |
|
8100 | 162 |
val (ct, _) = read_def_cterm (sign, types', sorts) [] false (aterm, TypeInfer.logicT); |
5177 | 163 |
in case #T (rep_cterm ct) of |
164 |
Type (tn, _) => tn |
|
165 |
| _ => error ("Cannot determine type of " ^ quote aterm) |
|
166 |
end; |
|
167 |
||
168 |
(*Warn if the (induction) variable occurs Free among the premises, which |
|
169 |
usually signals a mistake. But calls the tactic either way!*) |
|
8405 | 170 |
fun occs_in_prems tacf vars = |
5177 | 171 |
SUBGOAL (fn (Bi, i) => |
8405 | 172 |
(if exists (fn Free (a, _) => a mem vars) |
173 |
(foldr add_term_frees (#2 (strip_context Bi), [])) |
|
174 |
then warning "Induction variable occurs also among premises!" |
|
175 |
else (); |
|
176 |
tacf i)); |
|
5177 | 177 |
|
8689 | 178 |
|
5177 | 179 |
(* generic induction tactic for datatypes *) |
180 |
||
8689 | 181 |
local |
182 |
||
183 |
fun prep_var (Var (ixn, _), Some x) = Some (implode (tl (explode (Syntax.string_of_vname ixn))), x) |
|
184 |
| prep_var _ = None; |
|
185 |
||
186 |
fun prep_inst (concl, xs) = (*exception LIST*) |
|
11725 | 187 |
let val vs = InductAttrib.vars_of concl |
8689 | 188 |
in mapfilter prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end; |
189 |
||
190 |
in |
|
191 |
||
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
192 |
fun gen_induct_tac inst_tac (varss, opt_rule) i state = |
5177 | 193 |
let |
8689 | 194 |
val (_, _, Bi, _) = Thm.dest_state (state, i); |
195 |
val {sign, ...} = Thm.rep_thm state; |
|
8672 | 196 |
val (rule, rule_name) = |
197 |
(case opt_rule of |
|
198 |
Some r => (r, "Induction rule") |
|
199 |
| None => |
|
8689 | 200 |
let val tn = find_tname (hd (mapfilter I (flat varss))) Bi |
8672 | 201 |
in (#induction (datatype_info_sg_err sign tn), "Induction rule for type " ^ tn) end); |
202 |
||
11725 | 203 |
val concls = HOLogic.dest_concls (Thm.concl_of rule); |
8697 | 204 |
val insts = flat (map prep_inst (concls ~~ varss)) handle LIST _ => |
8689 | 205 |
error (rule_name ^ " has different numbers of variables"); |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
206 |
in occs_in_prems (inst_tac insts rule) (map #2 insts) i state end; |
8689 | 207 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
208 |
fun induct_tac s = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
209 |
gen_induct_tac Tactic.res_inst_tac |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
210 |
(map (Library.single o Some) (Syntax.read_idents s), None); |
8689 | 211 |
|
9747 | 212 |
fun induct_thm_tac th s = |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
213 |
gen_induct_tac Tactic.res_inst_tac |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
214 |
([map Some (Syntax.read_idents s)], Some th); |
9747 | 215 |
|
8689 | 216 |
end; |
5177 | 217 |
|
8279 | 218 |
|
8437 | 219 |
(* generic case tactic for datatypes *) |
5177 | 220 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
221 |
fun case_inst_tac inst_tac t rule i state = |
8672 | 222 |
let |
223 |
val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop |
|
224 |
(hd (Logic.strip_assums_hyp (hd (Thm.prems_of rule)))); |
|
225 |
val exh_vname = implode (tl (explode (Syntax.string_of_vname ixn))); |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
226 |
in inst_tac [(exh_vname, t)] rule i state end; |
8672 | 227 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
228 |
fun gen_case_tac inst_tac (t, Some rule) i state = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
229 |
case_inst_tac inst_tac t rule i state |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
230 |
| gen_case_tac inst_tac (t, None) i state = |
8672 | 231 |
let val tn = infer_tname state i t in |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
232 |
if tn = HOLogic.boolN then inst_tac [("P", t)] case_split_thm i state |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
233 |
else case_inst_tac inst_tac t |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
234 |
(#exhaustion (datatype_info_sg_err (Thm.sign_of_thm state) tn)) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
235 |
i state |
14471
5688b05b2575
case_tac no longer raises THM exception if goal number is out of range.
berghofe
parents:
14412
diff
changeset
|
236 |
end handle THM _ => Seq.empty; |
8672 | 237 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
238 |
fun case_tac t = gen_case_tac Tactic.res_inst_tac (t, None); |
8672 | 239 |
|
8279 | 240 |
|
241 |
||
8541 | 242 |
(** Isar tactic emulations **) |
243 |
||
8672 | 244 |
local |
245 |
||
8689 | 246 |
val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":"); |
247 |
val opt_rule = Scan.option (rule_spec |-- Attrib.local_thm); |
|
248 |
||
249 |
val varss = Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift Args.name_dummy))); |
|
8672 | 250 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
251 |
fun mk_ixn (vars, s) = (fst (Term.dest_Var (Syntax.read_var ("?" ^ vars))), s) |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
252 |
handle _ => error (vars ^ " not a variable name"); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
253 |
fun inst_tac ctxt sinsts = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
254 |
Method.bires_inst_tac false ctxt (map mk_ixn sinsts); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
255 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
256 |
fun induct_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
257 |
gen_induct_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
258 |
fun case_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
259 |
gen_case_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
260 |
|
8672 | 261 |
in |
8541 | 262 |
|
263 |
val tactic_emulations = |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
264 |
[("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
|
265 |
"induct_tac emulation (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
266 |
("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
|
267 |
"case_tac emulation (dynamic instantiation)")]; |
8672 | 268 |
|
269 |
end; |
|
8541 | 270 |
|
271 |
||
5177 | 272 |
|
8437 | 273 |
(** induct method setup **) |
274 |
||
275 |
(* case names *) |
|
276 |
||
277 |
local |
|
278 |
||
279 |
fun dt_recs (DtTFree _) = [] |
|
280 |
| dt_recs (DtType (_, dts)) = flat (map dt_recs dts) |
|
281 |
| dt_recs (DtRec i) = [i]; |
|
282 |
||
283 |
fun dt_cases (descr: descr) (_, args, constrs) = |
|
284 |
let |
|
285 |
fun the_bname i = Sign.base_name (#1 (the (assoc (descr, i)))); |
|
286 |
val bnames = map the_bname (distinct (flat (map dt_recs args))); |
|
287 |
in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end; |
|
288 |
||
289 |
||
290 |
fun induct_cases descr = |
|
291 |
DatatypeProp.indexify_names (flat (map (dt_cases descr) (map #2 descr))); |
|
292 |
||
293 |
fun exhaust_cases descr i = dt_cases descr (the (assoc (descr, i))); |
|
294 |
||
295 |
in |
|
296 |
||
297 |
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr); |
|
298 |
||
299 |
fun mk_case_names_exhausts descr new = |
|
300 |
map (RuleCases.case_names o exhaust_cases descr o #1) |
|
301 |
(filter (fn ((_, (name, _, _))) => name mem_string new) descr); |
|
302 |
||
303 |
end; |
|
304 |
||
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
305 |
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
|
306 |
weak_case_congs cong_att = |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
307 |
(#1 o PureThy.add_thmss [(("simps", simps), []), |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
308 |
(("", flat case_thms @ size_thms @ |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
309 |
flat distinct @ rec_thms), [Simplifier.simp_add_global]), |
12448
473cb9f9e237
Recursive equations to be used for code generation are now registered
berghofe
parents:
12338
diff
changeset
|
310 |
(("", size_thms @ rec_thms), [RecfunCodegen.add]), |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
311 |
(("", flat inject), [iff_add_global]), |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
312 |
(("", flat distinct RL [notE]), [Classical.safe_elim_global]), |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
313 |
(("", weak_case_congs), [cong_att])]); |
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
314 |
|
8437 | 315 |
|
316 |
(* add_cases_induct *) |
|
8306 | 317 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
318 |
fun add_cases_induct infos induction = |
8306 | 319 |
let |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
320 |
val n = length (HOLogic.dest_concls (Thm.concl_of induction)); |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
321 |
fun proj i thm = |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
322 |
if n = 1 then thm |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
323 |
else (if i + 1 < n then (fn th => th RS conjunct1) else I) |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
324 |
(Library.funpow i (fn th => th RS conjunct2) thm) |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
325 |
|> Drule.zero_var_indexes |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
326 |
|> RuleCases.save thm; |
8405 | 327 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
328 |
fun named_rules (name, {index, exhaustion, ...}: datatype_info) = |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
329 |
[(("", proj index induction), [InductAttrib.induct_type_global name]), |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
330 |
(("", exhaustion), [InductAttrib.cases_type_global name])]; |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
331 |
fun unnamed_rule i = |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
332 |
(("", proj i induction), [InductAttrib.induct_type_global ""]); |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
333 |
val rules = flat (map named_rules infos) @ map unnamed_rule (length infos upto n - 1); |
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
334 |
in #1 o PureThy.add_thms rules end; |
8306 | 335 |
|
5177 | 336 |
|
8405 | 337 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
338 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
339 |
|
7060 | 340 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
341 |
| stripT p = p; |
|
342 |
||
343 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
344 |
| stripC p = p; |
|
345 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
346 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
347 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
348 |
exception ConstrDistinct of term; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
349 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
350 |
fun distinct_proc sg _ (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 351 |
(case (stripC (0, t1), stripC (0, t2)) of |
352 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
353 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
354 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
355 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
356 |
(case (constrs_of_sg sg tname1) of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
357 |
Some constrs => let val cnames = map (fst o dest_Const) constrs |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
358 |
in if cname1 mem cnames andalso cname2 mem cnames then |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
359 |
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
|
360 |
val eq_ct = cterm_of sg eq_t; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
361 |
val Datatype_thy = theory "Datatype"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
362 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
363 |
map (get_thm Datatype_thy) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
364 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"] |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
365 |
in (case (#distinct (datatype_info_sg_err sg tname1)) of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
366 |
QuickAndDirty => Some (Thm.invoke_oracle |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
367 |
Datatype_thy distinctN (sg, ConstrDistinct eq_t)) |
13480
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
368 |
| FewConstrs thms => Some (Tactic.prove sg [] [] eq_t (K |
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
369 |
(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
|
370 |
atac 2, resolve_tac thms 1, etac FalseE 1]))) |
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
371 |
| ManyConstrs (thm, ss) => Some (Tactic.prove sg [] [] eq_t (K |
bb72bd43c6c3
use Tactic.prove instead of prove_goalw_cterm in internal proofs!
wenzelm
parents:
13466
diff
changeset
|
372 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
373 |
full_simp_tac ss 1, |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
374 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
375 |
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
|
376 |
etac FalseE 1])))) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
377 |
end |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
378 |
else None |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
379 |
end |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
380 |
| None => None) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
381 |
else None |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
382 |
| _ => None) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
383 |
| _ => None) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
384 |
| distinct_proc sg _ _ = None; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
385 |
|
13462 | 386 |
val distinct_simproc = |
387 |
Simplifier.simproc (Theory.sign_of HOL.thy) distinctN ["s = t"] distinct_proc; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
388 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
389 |
val dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
390 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
391 |
val simproc_setup = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
392 |
[Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t), |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
393 |
fn thy => (simpset_ref_of thy := simpset_of thy addsimprocs [distinct_simproc]; thy)]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
394 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
395 |
|
5177 | 396 |
(* prepare types *) |
397 |
||
398 |
fun read_typ sign ((Ts, sorts), str) = |
|
399 |
let |
|
400 |
val T = Type.no_tvars (Sign.read_typ (sign, (curry assoc) |
|
401 |
(map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg |
|
402 |
in (Ts @ [T], add_typ_tfrees (T, sorts)) end; |
|
403 |
||
404 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
405 |
let |
|
406 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
407 |
TYPE (msg, _, _) => error msg; |
|
408 |
val sorts' = add_typ_tfrees (T, sorts) |
|
409 |
in (Ts @ [T], |
|
410 |
case duplicates (map fst sorts') of |
|
411 |
[] => sorts' |
|
412 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
413 |
end; |
|
414 |
||
415 |
||
416 |
(**** make datatype info ****) |
|
417 |
||
418 |
fun make_dt_info descr induct reccomb_names rec_thms |
|
10121 | 419 |
(((((((((i, (_, (tname, _, _))), case_name), case_thms), |
420 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) = |
|
421 |
(tname, |
|
422 |
{index = i, |
|
423 |
descr = descr, |
|
424 |
rec_names = reccomb_names, |
|
425 |
rec_rewrites = rec_thms, |
|
426 |
case_name = case_name, |
|
427 |
case_rewrites = case_thms, |
|
428 |
induction = induct, |
|
429 |
exhaustion = exhaustion_thm, |
|
430 |
distinct = distinct_thm, |
|
431 |
inject = inject, |
|
432 |
nchotomy = nchotomy, |
|
433 |
case_cong = case_cong, |
|
434 |
weak_case_cong = weak_case_cong}); |
|
5177 | 435 |
|
436 |
||
437 |
(********************* axiomatic introduction of datatypes ********************) |
|
438 |
||
8437 | 439 |
fun add_and_get_axioms_atts label tnames attss ts thy = |
440 |
foldr (fn (((tname, atts), t), (thy', axs)) => |
|
5177 | 441 |
let |
8437 | 442 |
val (thy'', [ax]) = thy' |> |
5661 | 443 |
Theory.add_path tname |> |
8437 | 444 |
PureThy.add_axioms_i [((label, t), atts)]; |
5661 | 445 |
in (Theory.parent_path thy'', ax::axs) |
8437 | 446 |
end) (tnames ~~ attss ~~ ts, (thy, [])); |
447 |
||
448 |
fun add_and_get_axioms label tnames = |
|
449 |
add_and_get_axioms_atts label tnames (replicate (length tnames) []); |
|
5177 | 450 |
|
451 |
fun add_and_get_axiomss label tnames tss thy = |
|
452 |
foldr (fn ((tname, ts), (thy', axss)) => |
|
453 |
let |
|
8437 | 454 |
val (thy'', [axs]) = thy' |> |
5661 | 455 |
Theory.add_path tname |> |
5177 | 456 |
PureThy.add_axiomss_i [((label, ts), [])]; |
5661 | 457 |
in (Theory.parent_path thy'', axs::axss) |
5177 | 458 |
end) (tnames ~~ tss, (thy, [])); |
459 |
||
8437 | 460 |
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
461 |
case_names_induct case_names_exhausts thy = |
|
5177 | 462 |
let |
463 |
val descr' = flat descr; |
|
464 |
val recTs = get_rec_types descr' sorts; |
|
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5279
diff
changeset
|
465 |
val used = foldr add_typ_tfree_names (recTs, []); |
5177 | 466 |
val newTs = take (length (hd descr), recTs); |
467 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
468 |
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
|
469 |
(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
|
470 |
cargs) constrs) descr'; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
471 |
|
5177 | 472 |
(**** declare new types and constants ****) |
473 |
||
474 |
val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr); |
|
475 |
||
476 |
val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') => |
|
477 |
map (fn ((_, cargs), (cname, mx)) => |
|
478 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
479 |
(constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax); |
|
480 |
||
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5279
diff
changeset
|
481 |
val rec_result_Ts = map TFree (variantlist (replicate (length descr') "'t", used) ~~ |
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12311
diff
changeset
|
482 |
replicate (length descr') HOLogic.typeS); |
5177 | 483 |
|
484 |
val reccomb_fn_Ts = flat (map (fn (i, (_, _, constrs)) => |
|
485 |
map (fn (_, cargs) => |
|
486 |
let |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
487 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
488 |
val recs = filter (is_rec_type o fst) (cargs ~~ Ts); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
489 |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13480
diff
changeset
|
490 |
fun mk_argT (dt, T) = |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
13480
diff
changeset
|
491 |
binder_types T ---> nth_elem (body_index dt, rec_result_Ts); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
492 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
493 |
val argTs = Ts @ map mk_argT recs |
5177 | 494 |
in argTs ---> nth_elem (i, rec_result_Ts) |
495 |
end) constrs) descr'); |
|
496 |
||
497 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
498 |
val reccomb_names = if length descr' = 1 then [big_reccomb_name] else |
|
499 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
500 |
(1 upto (length descr'))); |
|
501 |
||
9739 | 502 |
val size_names = DatatypeProp.indexify_names |
503 |
(map (fn T => name_of_typ T ^ "_size") (drop (length (hd descr), recTs))); |
|
5177 | 504 |
|
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12311
diff
changeset
|
505 |
val freeT = TFree (variant used "'t", HOLogic.typeS); |
5177 | 506 |
val case_fn_Ts = map (fn (i, (_, _, constrs)) => |
507 |
map (fn (_, cargs) => |
|
508 |
let val Ts = map (typ_of_dtyp descr' sorts) cargs |
|
509 |
in Ts ---> freeT end) constrs) (hd descr); |
|
510 |
||
511 |
val case_names = map (fn s => (s ^ "_case")) new_type_names; |
|
512 |
||
6305 | 513 |
val thy2' = thy |> |
5177 | 514 |
|
515 |
(** new types **) |
|
516 |
||
517 |
curry (foldr (fn (((name, mx), tvs), thy') => thy' |> |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
518 |
TypedefPackage.add_typedecls [(name, tvs, mx)])) |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
519 |
(types_syntax ~~ tyvars) |> |
5661 | 520 |
add_path flat_names (space_implode "_" new_type_names) |> |
5177 | 521 |
|
522 |
(** primrec combinators **) |
|
523 |
||
524 |
Theory.add_consts_i (map (fn ((name, T), T') => |
|
525 |
(name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) |
|
526 |
(reccomb_names ~~ recTs ~~ rec_result_Ts)) |> |
|
527 |
||
528 |
(** case combinators **) |
|
529 |
||
530 |
Theory.add_consts_i (map (fn ((name, T), Ts) => |
|
531 |
(name, Ts @ [T] ---> freeT, NoSyn)) |
|
532 |
(case_names ~~ newTs ~~ case_fn_Ts)) |> |
|
6305 | 533 |
Theory.add_trrules_i (DatatypeProp.make_case_trrules new_type_names descr); |
534 |
||
6394 | 535 |
val reccomb_names' = map (Sign.intern_const (Theory.sign_of thy2')) reccomb_names; |
536 |
val case_names' = map (Sign.intern_const (Theory.sign_of thy2')) case_names; |
|
6305 | 537 |
|
538 |
val thy2 = thy2' |> |
|
5177 | 539 |
|
540 |
(** size functions **) |
|
541 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
542 |
(if no_size then I else Theory.add_consts_i (map (fn (s, T) => |
5177 | 543 |
(Sign.base_name s, T --> HOLogic.natT, NoSyn)) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
544 |
(size_names ~~ drop (length (hd descr), recTs)))) |> |
5661 | 545 |
|
546 |
(** constructors **) |
|
547 |
||
548 |
parent_path flat_names |> |
|
549 |
curry (foldr (fn (((((_, (_, _, constrs)), T), tname), |
|
550 |
constr_syntax'), thy') => thy' |> |
|
551 |
add_path flat_names tname |> |
|
552 |
Theory.add_consts_i (map (fn ((_, cargs), (cname, mx)) => |
|
553 |
(cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx)) |
|
554 |
(constrs ~~ constr_syntax')) |> |
|
555 |
parent_path flat_names)) |
|
556 |
(hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax); |
|
5177 | 557 |
|
558 |
(**** introduction of axioms ****) |
|
559 |
||
5661 | 560 |
val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2; |
9739 | 561 |
val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2; |
5661 | 562 |
|
8437 | 563 |
val (thy3, (([induct], [rec_thms]), inject)) = |
564 |
thy2 |> |
|
5661 | 565 |
Theory.add_path (space_implode "_" new_type_names) |> |
10911
eb5721204b38
proper induction rule for arbitrarily branching datatype;
wenzelm
parents:
10525
diff
changeset
|
566 |
PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts), |
13340
9b0332344ae2
Simplified proof of induction rule for datatypes involving function types.
berghofe
parents:
12922
diff
changeset
|
567 |
[case_names_induct])] |>>> |
8437 | 568 |
PureThy.add_axiomss_i [(("recs", rec_axs), [])] |>> |
569 |
(if no_size then I else #1 o PureThy.add_axiomss_i [(("size", size_axs), [])]) |>> |
|
570 |
Theory.parent_path |>>> |
|
5177 | 571 |
add_and_get_axiomss "inject" new_type_names |
572 |
(DatatypeProp.make_injs descr sorts); |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
573 |
val size_thms = if no_size then [] else get_thms thy3 "size"; |
5177 | 574 |
val (thy4, distinct) = add_and_get_axiomss "distinct" new_type_names |
575 |
(DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3; |
|
8437 | 576 |
|
577 |
val exhaust_ts = DatatypeProp.make_casedists descr sorts; |
|
578 |
val (thy5, exhaustion) = add_and_get_axioms_atts "exhaust" new_type_names |
|
579 |
(map Library.single case_names_exhausts) exhaust_ts thy4; |
|
5177 | 580 |
val (thy6, case_thms) = add_and_get_axiomss "cases" new_type_names |
581 |
(DatatypeProp.make_cases new_type_names descr sorts thy5) thy5; |
|
582 |
val (split_ts, split_asm_ts) = ListPair.unzip |
|
583 |
(DatatypeProp.make_splits new_type_names descr sorts thy6); |
|
584 |
val (thy7, split) = add_and_get_axioms "split" new_type_names split_ts thy6; |
|
585 |
val (thy8, split_asm) = add_and_get_axioms "split_asm" new_type_names |
|
586 |
split_asm_ts thy7; |
|
587 |
val (thy9, nchotomys) = add_and_get_axioms "nchotomy" new_type_names |
|
588 |
(DatatypeProp.make_nchotomys descr sorts) thy8; |
|
589 |
val (thy10, case_congs) = add_and_get_axioms "case_cong" new_type_names |
|
590 |
(DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9; |
|
8601 | 591 |
val (thy11, weak_case_congs) = add_and_get_axioms "weak_case_cong" new_type_names |
592 |
(DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10; |
|
8405 | 593 |
|
6305 | 594 |
val dt_infos = map (make_dt_info descr' induct reccomb_names' rec_thms) |
595 |
((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
|
596 |
exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~ |
10121 | 597 |
nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 598 |
|
599 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
|
9386 | 600 |
val split_thms = split ~~ split_asm; |
5177 | 601 |
|
8601 | 602 |
val thy12 = thy11 |> |
5661 | 603 |
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
|
604 |
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
|
605 |
weak_case_congs Simplifier.cong_add_global |> |
5177 | 606 |
put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |> |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
607 |
add_cases_induct dt_infos induct |> |
9386 | 608 |
Theory.parent_path |> |
13466 | 609 |
(#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |> |
610 |
DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos); |
|
5177 | 611 |
in |
8601 | 612 |
(thy12, |
5177 | 613 |
{distinct = distinct, |
614 |
inject = inject, |
|
615 |
exhaustion = exhaustion, |
|
616 |
rec_thms = rec_thms, |
|
617 |
case_thms = case_thms, |
|
9386 | 618 |
split_thms = split_thms, |
5177 | 619 |
induction = induct, |
620 |
size = size_thms, |
|
621 |
simps = simps}) |
|
622 |
end; |
|
623 |
||
624 |
||
625 |
(******************* definitional introduction of datatypes *******************) |
|
626 |
||
8437 | 627 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
628 |
case_names_induct case_names_exhausts thy = |
|
5177 | 629 |
let |
6360 | 630 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 631 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
632 |
val (thy2, inject, distinct, dist_rewrites, simproc_dists, induct) = thy |> |
5661 | 633 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
8437 | 634 |
types_syntax constr_syntax case_names_induct; |
5177 | 635 |
|
8437 | 636 |
val (thy3, casedist_thms) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr |
637 |
sorts induct case_names_exhausts thy2; |
|
8478 | 638 |
val (thy4, (reccomb_names, rec_thms)) = DatatypeAbsProofs.prove_primrec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
639 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3; |
8437 | 640 |
val (thy6, (case_thms, case_names)) = DatatypeAbsProofs.prove_case_thms |
5661 | 641 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
5177 | 642 |
val (thy7, split_thms) = DatatypeAbsProofs.prove_split_thms new_type_names |
643 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
|
644 |
val (thy8, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names |
|
645 |
descr sorts casedist_thms thy7; |
|
646 |
val (thy9, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names |
|
647 |
descr sorts nchotomys case_thms thy8; |
|
8601 | 648 |
val (thy10, weak_case_congs) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
649 |
descr sorts thy9; |
|
650 |
val (thy11, size_thms) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names |
|
651 |
descr sorts reccomb_names rec_thms thy10; |
|
5177 | 652 |
|
653 |
val dt_infos = map (make_dt_info (flat descr) induct reccomb_names rec_thms) |
|
654 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
|
10121 | 655 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 656 |
|
657 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
|
658 |
||
8601 | 659 |
val thy12 = thy11 |> |
5661 | 660 |
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
|
661 |
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
|
662 |
weak_case_congs (Simplifier.change_global_ss (op addcongs)) |> |
5177 | 663 |
put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |> |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
664 |
add_cases_induct dt_infos induct |> |
9386 | 665 |
Theory.parent_path |> |
13466 | 666 |
(#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |> |
667 |
DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos); |
|
5177 | 668 |
in |
8601 | 669 |
(thy12, |
5177 | 670 |
{distinct = distinct, |
671 |
inject = inject, |
|
672 |
exhaustion = casedist_thms, |
|
673 |
rec_thms = rec_thms, |
|
674 |
case_thms = case_thms, |
|
675 |
split_thms = split_thms, |
|
676 |
induction = induct, |
|
677 |
size = size_thms, |
|
678 |
simps = simps}) |
|
679 |
end; |
|
680 |
||
681 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
682 |
(*********************** declare existing type as datatype *********************) |
5177 | 683 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
684 |
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 = |
5177 | 685 |
let |
12922 | 686 |
val _ = Theory.requires thy0 "Inductive" "datatype representations"; |
687 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
688 |
fun app_thmss srcs thy = foldl_map (fn (thy, x) => apply_theorems x thy) (thy, srcs); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
689 |
fun app_thm src thy = apsnd Library.hd (apply_theorems [src] thy); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
690 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
691 |
val (((thy1, induction), inject), distinct) = thy0 |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
692 |
|> app_thmss raw_distinct |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
693 |
|> apfst (app_thmss raw_inject) |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
694 |
|> apfst (apfst (app_thm raw_induction)); |
6394 | 695 |
val sign = Theory.sign_of thy1; |
5177 | 696 |
|
697 |
val induction' = freezeT induction; |
|
698 |
||
699 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
700 |
Sign.string_of_term sign t); |
|
701 |
||
702 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
703 |
((tname, map dest_TFree Ts) handle TERM _ => err t) |
5177 | 704 |
| get_typ t = err t; |
705 |
||
8437 | 706 |
val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction'))); |
5177 | 707 |
val new_type_names = if_none alt_names (map fst dtnames); |
708 |
||
709 |
fun get_constr t = (case Logic.strip_assums_concl t of |
|
710 |
_ $ (_ $ t') => (case head_of t' of |
|
711 |
Const (cname, cT) => (case strip_type cT of |
|
712 |
(Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts)) |
|
713 |
| _ => err t) |
|
714 |
| _ => err t) |
|
715 |
| _ => err t); |
|
716 |
||
717 |
fun make_dt_spec [] _ _ = [] |
|
718 |
| make_dt_spec ((tname, tvs)::dtnames') i constrs = |
|
719 |
let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs |
|
720 |
in (i, (tname, map DtTFree tvs, map snd constrs')):: |
|
721 |
(make_dt_spec dtnames' (i + 1) constrs'') |
|
722 |
end; |
|
723 |
||
724 |
val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction')); |
|
725 |
val sorts = add_term_tfrees (concl_of induction', []); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
726 |
val dt_info = get_datatypes thy1; |
5177 | 727 |
|
8437 | 728 |
val case_names_induct = mk_case_names_induct descr; |
729 |
val case_names_exhausts = mk_case_names_exhausts descr (map #1 dtnames); |
|
730 |
||
731 |
||
6427 | 732 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 733 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
734 |
val (thy2, casedist_thms) = thy1 |> |
8437 | 735 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction |
736 |
case_names_exhausts; |
|
8478 | 737 |
val (thy3, (reccomb_names, rec_thms)) = DatatypeAbsProofs.prove_primrec_thms |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
738 |
false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2; |
8437 | 739 |
val (thy4, (case_thms, case_names)) = DatatypeAbsProofs.prove_case_thms false |
5177 | 740 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
741 |
val (thy5, split_thms) = DatatypeAbsProofs.prove_split_thms |
|
742 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
|
743 |
val (thy6, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names |
|
744 |
[descr] sorts casedist_thms thy5; |
|
745 |
val (thy7, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names |
|
746 |
[descr] sorts nchotomys case_thms thy6; |
|
8601 | 747 |
val (thy8, weak_case_congs) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
748 |
[descr] sorts thy7; |
|
749 |
val (thy9, size_thms) = |
|
10930 | 750 |
if Sign.exists_stamp "NatArith" (Theory.sign_of thy8) then |
5661 | 751 |
DatatypeAbsProofs.prove_size_thms false new_type_names |
8601 | 752 |
[descr] sorts reccomb_names rec_thms thy8 |
753 |
else (thy8, []); |
|
5177 | 754 |
|
9149 | 755 |
val (thy10, [induction']) = thy9 |> |
756 |
(#1 o store_thmss "inject" new_type_names inject) |> |
|
757 |
(#1 o store_thmss "distinct" new_type_names distinct) |> |
|
758 |
Theory.add_path (space_implode "_" new_type_names) |> |
|
759 |
PureThy.add_thms [(("induct", induction), [case_names_induct])]; |
|
760 |
||
761 |
val dt_infos = map (make_dt_info descr induction' reccomb_names rec_thms) |
|
10121 | 762 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~ |
763 |
map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
|
5177 | 764 |
|
765 |
val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms; |
|
766 |
||
9149 | 767 |
val thy11 = thy10 |> |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
768 |
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
|
769 |
weak_case_congs (Simplifier.change_global_ss (op addcongs)) |> |
9149 | 770 |
put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |> |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
771 |
add_cases_induct dt_infos induction' |> |
9386 | 772 |
Theory.parent_path |> |
13466 | 773 |
(#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |> |
774 |
DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos); |
|
5177 | 775 |
in |
9149 | 776 |
(thy11, |
5177 | 777 |
{distinct = distinct, |
778 |
inject = inject, |
|
779 |
exhaustion = casedist_thms, |
|
780 |
rec_thms = rec_thms, |
|
781 |
case_thms = case_thms, |
|
782 |
split_thms = split_thms, |
|
8437 | 783 |
induction = induction', |
5177 | 784 |
size = size_thms, |
785 |
simps = simps}) |
|
786 |
end; |
|
787 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
788 |
val rep_datatype = gen_rep_datatype IsarThy.apply_theorems; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
789 |
val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
790 |
|
5177 | 791 |
|
11958 | 792 |
|
5177 | 793 |
(******************************** add datatype ********************************) |
794 |
||
5661 | 795 |
fun gen_add_datatype prep_typ flat_names new_type_names dts thy = |
5177 | 796 |
let |
12922 | 797 |
val _ = Theory.requires thy "Datatype_Universe" "datatype definitions"; |
5177 | 798 |
|
799 |
(* this theory is used just for parsing *) |
|
800 |
||
801 |
val tmp_thy = thy |> |
|
5892 | 802 |
Theory.copy |> |
5177 | 803 |
Theory.add_types (map (fn (tvs, tname, mx, _) => |
804 |
(tname, length tvs, mx)) dts); |
|
805 |
||
6394 | 806 |
val sign = Theory.sign_of tmp_thy; |
5177 | 807 |
|
5661 | 808 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 809 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
810 |
let val full_tname = Sign.full_name sign (Syntax.type_name tname mx) |
|
811 |
in (case duplicates tvs of |
|
5661 | 812 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
813 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 814 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
815 |
" : " ^ commas dups)) |
|
816 |
end) dts); |
|
817 |
||
818 |
val _ = (case duplicates (map fst new_dts) @ duplicates new_type_names of |
|
819 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
|
820 |
||
821 |
fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) = |
|
822 |
let |
|
5661 | 823 |
fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) = |
5279 | 824 |
let |
825 |
val (cargs', sorts'') = foldl (prep_typ sign) (([], sorts'), cargs); |
|
826 |
val _ = (case foldr add_typ_tfree_names (cargs', []) \\ tvs of |
|
827 |
[] => () |
|
828 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
5661 | 829 |
in (constrs @ [((if flat_names then Sign.full_name sign else |
830 |
Sign.full_name_path sign tname) (Syntax.const_name cname mx'), |
|
5177 | 831 |
map (dtyp_of_typ new_dts) cargs')], |
832 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
833 |
end handle ERROR => |
|
834 |
error ("The error above occured in constructor " ^ cname ^ |
|
835 |
" of datatype " ^ tname); |
|
836 |
||
837 |
val (constrs', constr_syntax', sorts') = |
|
838 |
foldl prep_constr (([], [], sorts), constrs) |
|
839 |
||
8405 | 840 |
in |
5177 | 841 |
case duplicates (map fst constrs') of |
842 |
[] => |
|
843 |
(dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx), |
|
844 |
map DtTFree tvs, constrs'))], |
|
845 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
846 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
847 |
" in datatype " ^ tname) |
|
848 |
end; |
|
849 |
||
5661 | 850 |
val (dts', constr_syntax, sorts', i) = foldl prep_dt_spec (([], [], [], 0), dts); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
851 |
val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts')); |
5177 | 852 |
val dt_info = get_datatypes thy; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
853 |
val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i; |
5177 | 854 |
val _ = check_nonempty descr; |
855 |
||
8437 | 856 |
val descr' = flat descr; |
857 |
val case_names_induct = mk_case_names_induct descr'; |
|
858 |
val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts); |
|
5177 | 859 |
in |
860 |
(if (!quick_and_dirty) then add_datatype_axm else add_datatype_def) |
|
8437 | 861 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
862 |
case_names_induct case_names_exhausts thy |
|
5177 | 863 |
end; |
864 |
||
865 |
val add_datatype_i = gen_add_datatype cert_typ; |
|
866 |
val add_datatype = gen_add_datatype read_typ; |
|
867 |
||
6360 | 868 |
|
869 |
(** package setup **) |
|
870 |
||
871 |
(* setup theory *) |
|
872 |
||
8541 | 873 |
val setup = [DatatypesData.init, Method.add_methods tactic_emulations] @ simproc_setup; |
6360 | 874 |
|
875 |
||
876 |
(* outer syntax *) |
|
877 |
||
6723 | 878 |
local structure P = OuterParse and K = OuterSyntax.Keyword in |
6360 | 879 |
|
880 |
val datatype_decl = |
|
6723 | 881 |
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
|
882 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix)); |
6360 | 883 |
|
884 |
fun mk_datatype args = |
|
885 |
let |
|
886 |
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
|
887 |
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
|
888 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
6360 | 889 |
in #1 o add_datatype false names specs end; |
890 |
||
891 |
val datatypeP = |
|
6723 | 892 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
893 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 894 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
895 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
896 |
val rep_datatype_decl = |
6723 | 897 |
Scan.option (Scan.repeat1 P.name) -- |
11958 | 898 |
Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [[]] -- |
899 |
Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [[]] -- |
|
6723 | 900 |
(P.$$$ "induction" |-- P.!!! P.xthm); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
901 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
902 |
fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #1 o rep_datatype opt_ts dss iss ind; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
903 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
904 |
val rep_datatypeP = |
6723 | 905 |
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
|
906 |
(rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype)); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
907 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
908 |
|
6479
b0448cab1b1e
rep_datatype syntax: 'induction' instead of 'induct';
wenzelm
parents:
6441
diff
changeset
|
909 |
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"]; |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
910 |
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP]; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
911 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
912 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
913 |
|
6360 | 914 |
|
5177 | 915 |
end; |
916 |
||
6360 | 917 |
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage; |
918 |
open BasicDatatypePackage; |