author | wenzelm |
Mon, 09 Jun 2008 17:07:11 +0200 | |
changeset 27097 | 9a6db5d8ee8c |
parent 27002 | 215d64dc971e |
child 27104 | 791607529f6d |
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 |
||
27097 | 8 |
signature DATATYPE_PACKAGE = |
6360 | 9 |
sig |
27097 | 10 |
val quiet_mode : bool ref |
11 |
val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table |
|
12 |
val print_datatypes : theory -> unit |
|
13 |
val get_datatype : theory -> string -> DatatypeAux.datatype_info option |
|
14 |
val the_datatype : theory -> string -> DatatypeAux.datatype_info |
|
15 |
val datatype_of_constr : theory -> string -> DatatypeAux.datatype_info option |
|
16 |
val datatype_of_case : theory -> string -> DatatypeAux.datatype_info option |
|
17 |
val the_datatype_spec : theory -> string -> (string * sort) list * (string * typ list) list |
|
18 |
val get_datatype_constrs : theory -> string -> (string * typ) list option |
|
19 |
val construction_interpretation : theory |
|
20 |
-> {atom : typ -> 'a, dtyp : string -> 'a, rtyp : string -> 'a list -> 'a} |
|
21 |
-> (string * sort) list -> string list |
|
22 |
-> (string * (string * 'a list) list) list |
|
6360 | 23 |
val induct_tac : string -> int -> tactic |
9747 | 24 |
val induct_thm_tac : thm -> string -> int -> tactic |
8437 | 25 |
val case_tac : string -> int -> tactic |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
26 |
val distinct_simproc : simproc |
27097 | 27 |
val make_case : Proof.context -> bool -> string list -> term -> |
28 |
(term * term) list -> term * (term * (int * bool)) list |
|
29 |
val strip_case : Proof.context -> bool -> term -> (term * (term * term) list) option |
|
30 |
val interpretation : (string list -> theory -> theory) -> theory -> theory |
|
18728 | 31 |
val rep_datatype_i : string list option -> (thm list * attribute list) list list -> |
32 |
(thm list * attribute list) list list -> (thm list * attribute list) -> |
|
18008 | 33 |
theory -> |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
34 |
{distinct : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
35 |
inject : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
36 |
exhaustion : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
37 |
rec_thms : thm list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
38 |
case_thms : thm list list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
39 |
split_thms : (thm * thm) list, |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
40 |
induction : thm, |
18008 | 41 |
simps : thm list} * theory |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26267
diff
changeset
|
42 |
val rep_datatype : string list option -> (Facts.ref * Attrib.src list) list list -> |
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26267
diff
changeset
|
43 |
(Facts.ref * Attrib.src list) list list -> Facts.ref * Attrib.src list -> theory -> |
5177 | 44 |
{distinct : thm list list, |
45 |
inject : thm list list, |
|
46 |
exhaustion : thm list, |
|
47 |
rec_thms : thm list, |
|
48 |
case_thms : thm list list, |
|
49 |
split_thms : (thm * thm) list, |
|
50 |
induction : thm, |
|
18008 | 51 |
simps : thm list} * theory |
27097 | 52 |
val add_datatype_i : bool -> bool -> string list -> (string list * bstring * mixfix * |
53 |
(bstring * typ list * mixfix) list) list -> theory -> |
|
54 |
{distinct : thm list list, |
|
55 |
inject : thm list list, |
|
56 |
exhaustion : thm list, |
|
57 |
rec_thms : thm list, |
|
58 |
case_thms : thm list list, |
|
59 |
split_thms : (thm * thm) list, |
|
60 |
induction : thm, |
|
61 |
simps : thm list} * theory |
|
62 |
val add_datatype : bool -> string list -> (string list * bstring * mixfix * |
|
63 |
(bstring * string list * mixfix) list) list -> theory -> |
|
64 |
{distinct : thm list list, |
|
65 |
inject : thm list list, |
|
66 |
exhaustion : thm list, |
|
67 |
rec_thms : thm list, |
|
68 |
case_thms : thm list list, |
|
69 |
split_thms : (thm * thm) list, |
|
70 |
induction : thm, |
|
71 |
simps : thm list} * theory |
|
18708 | 72 |
val setup: theory -> theory |
5177 | 73 |
end; |
74 |
||
75 |
structure DatatypePackage : DATATYPE_PACKAGE = |
|
76 |
struct |
|
77 |
||
78 |
open DatatypeAux; |
|
79 |
||
5661 | 80 |
val quiet_mode = quiet_mode; |
81 |
||
6360 | 82 |
|
22846 | 83 |
(* theory data *) |
5177 | 84 |
|
16430 | 85 |
structure DatatypesData = TheoryDataFun |
22846 | 86 |
( |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
87 |
type T = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
88 |
{types: datatype_info Symtab.table, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
89 |
constrs: datatype_info Symtab.table, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
90 |
cases: datatype_info Symtab.table}; |
5177 | 91 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
92 |
val empty = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
93 |
{types = Symtab.empty, constrs = Symtab.empty, cases = Symtab.empty}; |
6556 | 94 |
val copy = I; |
16430 | 95 |
val extend = I; |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
96 |
fun merge _ |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
97 |
({types = types1, constrs = constrs1, cases = cases1}, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
98 |
{types = types2, constrs = constrs2, cases = cases2}) = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
99 |
{types = Symtab.merge (K true) (types1, types2), |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
100 |
constrs = Symtab.merge (K true) (constrs1, constrs2), |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
101 |
cases = Symtab.merge (K true) (cases1, cases2)}; |
22846 | 102 |
); |
5177 | 103 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
104 |
val get_datatypes = #types o DatatypesData.get; |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
105 |
val map_datatypes = DatatypesData.map; |
22846 | 106 |
|
107 |
fun print_datatypes thy = |
|
108 |
Pretty.writeln (Pretty.strs ("datatypes:" :: |
|
109 |
map #1 (NameSpace.extern_table (Sign.type_space thy, get_datatypes thy)))); |
|
5177 | 110 |
|
111 |
||
112 |
(** theory information about datatypes **) |
|
113 |
||
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
114 |
fun put_dt_infos (dt_infos : (string * datatype_info) list) = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
115 |
map_datatypes (fn {types, constrs, cases} => |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
116 |
{types = fold Symtab.update dt_infos types, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
117 |
constrs = fold Symtab.update |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
118 |
(maps (fn (_, info as {descr, index, ...}) => map (rpair info o fst) |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
119 |
(#3 (the (AList.lookup op = descr index)))) dt_infos) constrs, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
120 |
cases = fold Symtab.update |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
121 |
(map (fn (_, info as {case_name, ...}) => (case_name, info)) dt_infos) |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
122 |
cases}); |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
123 |
|
19346 | 124 |
val get_datatype = Symtab.lookup o get_datatypes; |
5177 | 125 |
|
19346 | 126 |
fun the_datatype thy name = (case get_datatype thy name of |
15531 | 127 |
SOME info => info |
128 |
| NONE => error ("Unknown datatype " ^ quote name)); |
|
5177 | 129 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
130 |
val datatype_of_constr = Symtab.lookup o #constrs o DatatypesData.get; |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
131 |
val datatype_of_case = Symtab.lookup o #cases o DatatypesData.get; |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
132 |
|
19346 | 133 |
fun get_datatype_descr thy dtco = |
134 |
get_datatype thy dtco |
|
24711 | 135 |
|> Option.map (fn info as { descr, index, ... } => |
19346 | 136 |
(info, (((fn SOME (_, dtys, cos) => (dtys, cos)) o AList.lookup (op =) descr) index))); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
137 |
|
25537 | 138 |
fun the_datatype_spec thy dtco = |
18518 | 139 |
let |
26093 | 140 |
val info as { descr, index, sorts = raw_sorts, ... } = the_datatype thy dtco; |
141 |
val SOME (_, dtys, raw_cos) = AList.lookup (op =) descr index; |
|
142 |
val sorts = map ((fn v => (v, (the o AList.lookup (op =) raw_sorts) v)) |
|
143 |
o DatatypeAux.dest_DtTFree) dtys; |
|
144 |
val cos = map |
|
145 |
(fn (co, tys) => (co, map (DatatypeAux.typ_of_dtyp descr sorts) tys)) raw_cos; |
|
146 |
in (sorts, cos) end; |
|
18518 | 147 |
|
19346 | 148 |
fun get_datatype_constrs thy dtco = |
25537 | 149 |
case try (the_datatype_spec thy) dtco |
19346 | 150 |
of SOME (sorts, cos) => |
151 |
let |
|
152 |
fun subst (v, sort) = TVar ((v, 0), sort); |
|
153 |
fun subst_ty (TFree v) = subst v |
|
154 |
| subst_ty ty = ty; |
|
155 |
val dty = Type (dtco, map subst sorts); |
|
156 |
fun mk_co (co, tys) = (co, map (Term.map_atyps subst_ty) tys ---> dty); |
|
157 |
in SOME (map mk_co cos) end |
|
158 |
| NONE => NONE; |
|
18518 | 159 |
|
26267
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
160 |
fun construction_interpretation thy { atom, dtyp, rtyp } sorts tycos = |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
161 |
let |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
162 |
val descr = (#descr o the_datatype thy o hd) tycos; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
163 |
val k = length tycos; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
164 |
val descr_of = the o AList.lookup (op =) descr; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
165 |
fun interpT (T as DtTFree _) = atom (typ_of_dtyp descr sorts T) |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
166 |
| interpT (T as DtType (tyco, Ts)) = if is_rec_type T |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
167 |
then rtyp tyco (map interpT Ts) |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
168 |
else atom (typ_of_dtyp descr sorts T) |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
169 |
| interpT (DtRec l) = if l < k then (dtyp o #1 o descr_of) l |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
170 |
else let val (tyco, Ts, _) = descr_of l |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
171 |
in rtyp tyco (map interpT Ts) end; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
172 |
fun interpC (c, Ts) = (c, map interpT Ts); |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
173 |
fun interpK (_, (tyco, _, cs)) = (tyco, map interpC cs); |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
174 |
in map interpK (Library.take (k, descr)) end; |
ba710daf77a7
added combinator for interpretation of construction of datatype
haftmann
parents:
26111
diff
changeset
|
175 |
|
5177 | 176 |
fun find_tname var Bi = |
177 |
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
|
178 |
val params = rename_wrt_term Bi (Logic.strip_params Bi); |
17521 | 179 |
in case AList.lookup (op =) (frees @ params) var of |
15531 | 180 |
NONE => error ("No such variable in subgoal: " ^ quote var) |
181 |
| SOME(Type (tn, _)) => tn |
|
5177 | 182 |
| _ => error ("Cannot determine type of " ^ quote var) |
183 |
end; |
|
184 |
||
8279 | 185 |
fun infer_tname state i aterm = |
5177 | 186 |
let |
22578 | 187 |
val sign = Thm.theory_of_thm state; |
8279 | 188 |
val (_, _, Bi, _) = Thm.dest_state (state, i) |
5177 | 189 |
val params = Logic.strip_params Bi; (*params of subgoal i*) |
190 |
val params = rev (rename_wrt_term Bi params); (*as they are printed*) |
|
191 |
val (types, sorts) = types_sorts state; |
|
17521 | 192 |
fun types' (a, ~1) = (case AList.lookup (op =) params a of NONE => types(a, ~1) | sm => sm) |
5177 | 193 |
| types' ixn = types ixn; |
22709 | 194 |
val ([ct], _) = Thm.read_def_cterms (sign, types', sorts) [] false [(aterm, dummyT)]; |
5177 | 195 |
in case #T (rep_cterm ct) of |
196 |
Type (tn, _) => tn |
|
197 |
| _ => error ("Cannot determine type of " ^ quote aterm) |
|
198 |
end; |
|
199 |
||
200 |
(*Warn if the (induction) variable occurs Free among the premises, which |
|
201 |
usually signals a mistake. But calls the tactic either way!*) |
|
8405 | 202 |
fun occs_in_prems tacf vars = |
5177 | 203 |
SUBGOAL (fn (Bi, i) => |
21045 | 204 |
(if exists (fn (a, _) => member (op =) vars a) |
205 |
(fold Term.add_frees (#2 (strip_context Bi)) []) |
|
8405 | 206 |
then warning "Induction variable occurs also among premises!" |
207 |
else (); |
|
208 |
tacf i)); |
|
5177 | 209 |
|
8689 | 210 |
|
5177 | 211 |
(* generic induction tactic for datatypes *) |
212 |
||
8689 | 213 |
local |
214 |
||
15531 | 215 |
fun prep_var (Var (ixn, _), SOME x) = SOME (ixn, x) |
216 |
| prep_var _ = NONE; |
|
8689 | 217 |
|
21045 | 218 |
fun prep_inst (concl, xs) = (*exception Library.UnequalLengths*) |
24830
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24770
diff
changeset
|
219 |
let val vs = Induct.vars_of concl |
21045 | 220 |
in map_filter prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end; |
8689 | 221 |
|
222 |
in |
|
223 |
||
24711 | 224 |
fun gen_induct_tac inst_tac (varss, opt_rule) i state = |
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
225 |
SUBGOAL (fn (Bi,_) => |
5177 | 226 |
let |
8672 | 227 |
val (rule, rule_name) = |
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
228 |
case opt_rule of |
21045 | 229 |
SOME r => (r, "Induction rule") |
230 |
| NONE => |
|
231 |
let val tn = find_tname (hd (map_filter I (flat varss))) Bi |
|
22598 | 232 |
val thy = Thm.theory_of_thm state |
24711 | 233 |
in (#induction (the_datatype thy tn), "Induction rule for type " ^ tn) |
21045 | 234 |
end |
11725 | 235 |
val concls = HOLogic.dest_concls (Thm.concl_of rule); |
21045 | 236 |
val insts = maps prep_inst (concls ~~ varss) handle Library.UnequalLengths => |
8689 | 237 |
error (rule_name ^ " has different numbers of variables"); |
18751
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
238 |
in occs_in_prems (inst_tac insts rule) (map #2 insts) i end) |
38dc4ff2a32b
bugfix: induct_tac no longer raises THM "dest_state"
paulson
parents:
18728
diff
changeset
|
239 |
i state; |
8689 | 240 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
241 |
fun induct_tac s = |
15444
4f14c151d9f1
induct_tac and case_tac no longer depend on Syntax.string_of_vname.
berghofe
parents:
14981
diff
changeset
|
242 |
gen_induct_tac Tactic.res_inst_tac' |
21045 | 243 |
(map (single o SOME) (Syntax.read_idents s), NONE); |
8689 | 244 |
|
9747 | 245 |
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
|
246 |
gen_induct_tac Tactic.res_inst_tac' |
15531 | 247 |
([map SOME (Syntax.read_idents s)], SOME th); |
9747 | 248 |
|
8689 | 249 |
end; |
5177 | 250 |
|
8279 | 251 |
|
8437 | 252 |
(* generic case tactic for datatypes *) |
5177 | 253 |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
254 |
fun case_inst_tac inst_tac t rule i state = |
8672 | 255 |
let |
256 |
val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop |
|
257 |
(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
|
258 |
in inst_tac [(ixn, t)] rule i state end; |
8672 | 259 |
|
15531 | 260 |
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
|
261 |
case_inst_tac inst_tac t rule i state |
15531 | 262 |
| gen_case_tac inst_tac (t, NONE) i state = |
8672 | 263 |
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
|
264 |
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
|
265 |
else case_inst_tac inst_tac t |
22578 | 266 |
(#exhaustion (the_datatype (Thm.theory_of_thm state) tn)) |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
267 |
i state |
14471
5688b05b2575
case_tac no longer raises THM exception if goal number is out of range.
berghofe
parents:
14412
diff
changeset
|
268 |
end handle THM _ => Seq.empty; |
8672 | 269 |
|
15531 | 270 |
fun case_tac t = gen_case_tac Tactic.res_inst_tac' (t, NONE); |
8672 | 271 |
|
8279 | 272 |
|
273 |
||
8541 | 274 |
(** Isar tactic emulations **) |
275 |
||
8672 | 276 |
local |
277 |
||
8689 | 278 |
val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":"); |
18988 | 279 |
val opt_rule = Scan.option (rule_spec |-- Attrib.thm); |
8689 | 280 |
|
15703 | 281 |
val varss = |
282 |
Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift (Args.maybe Args.name)))); |
|
8672 | 283 |
|
20328 | 284 |
val inst_tac = RuleInsts.bires_inst_tac false; |
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
285 |
|
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
286 |
fun induct_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
287 |
gen_induct_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
288 |
fun case_meth ctxt (varss, opt_rule) = |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
289 |
gen_case_tac (inst_tac ctxt) (varss, opt_rule); |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
290 |
|
8672 | 291 |
in |
8541 | 292 |
|
293 |
val tactic_emulations = |
|
14174
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
294 |
[("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
|
295 |
"induct_tac emulation (dynamic instantiation)"), |
f3cafd2929d5
Methods rule_tac etc support static (Isar) contexts.
ballarin
parents:
13641
diff
changeset
|
296 |
("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
|
297 |
"case_tac emulation (dynamic instantiation)")]; |
8672 | 298 |
|
299 |
end; |
|
8541 | 300 |
|
301 |
||
5177 | 302 |
|
8437 | 303 |
(** induct method setup **) |
304 |
||
305 |
(* case names *) |
|
306 |
||
307 |
local |
|
308 |
||
309 |
fun dt_recs (DtTFree _) = [] |
|
21045 | 310 |
| dt_recs (DtType (_, dts)) = maps dt_recs dts |
8437 | 311 |
| dt_recs (DtRec i) = [i]; |
312 |
||
313 |
fun dt_cases (descr: descr) (_, args, constrs) = |
|
314 |
let |
|
21045 | 315 |
fun the_bname i = Sign.base_name (#1 (the (AList.lookup (op =) descr i))); |
316 |
val bnames = map the_bname (distinct (op =) (maps dt_recs args)); |
|
8437 | 317 |
in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end; |
318 |
||
319 |
||
320 |
fun induct_cases descr = |
|
21045 | 321 |
DatatypeProp.indexify_names (maps (dt_cases descr) (map #2 descr)); |
8437 | 322 |
|
21045 | 323 |
fun exhaust_cases descr i = dt_cases descr (the (AList.lookup (op =) descr i)); |
8437 | 324 |
|
325 |
in |
|
326 |
||
327 |
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr); |
|
328 |
||
329 |
fun mk_case_names_exhausts descr new = |
|
330 |
map (RuleCases.case_names o exhaust_cases descr o #1) |
|
21045 | 331 |
(filter (fn ((_, (name, _, _))) => member (op =) new name) descr); |
8437 | 332 |
|
333 |
end; |
|
334 |
||
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
335 |
fun add_rules simps case_thms rec_thms inject distinct |
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
336 |
weak_case_congs cong_att = |
21127 | 337 |
PureThy.add_thmss [(("simps", simps), []), |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
338 |
(("", flat case_thms @ |
21045 | 339 |
flat distinct @ rec_thms), [Simplifier.simp_add]), |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
340 |
(("", rec_thms), [RecfunCodegen.add_default]), |
21127 | 341 |
(("", flat inject), [iff_add]), |
21689
58abd6d8abd1
Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents:
21646
diff
changeset
|
342 |
(("", map (fn th => th RS notE) (flat distinct)), [Classical.safe_elim NONE]), |
21127 | 343 |
(("", weak_case_congs), [cong_att])] |
344 |
#> snd; |
|
11345
cd605c85e421
improved iff_add_global, new function add_rules factoring out common behaviour
oheimb
parents:
10930
diff
changeset
|
345 |
|
8437 | 346 |
|
347 |
(* add_cases_induct *) |
|
8306 | 348 |
|
19874 | 349 |
fun add_cases_induct infos induction thy = |
8306 | 350 |
let |
19874 | 351 |
val inducts = ProjectRule.projections (ProofContext.init thy) induction; |
8405 | 352 |
|
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
353 |
fun named_rules (name, {index, exhaustion, ...}: datatype_info) = |
24830
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24770
diff
changeset
|
354 |
[(("", nth inducts index), [Induct.induct_type name]), |
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24770
diff
changeset
|
355 |
(("", exhaustion), [Induct.cases_type name])]; |
11805
b110a1ea90da
declare projected induction rules stemming from nested recursion;
wenzelm
parents:
11725
diff
changeset
|
356 |
fun unnamed_rule i = |
24830
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24770
diff
changeset
|
357 |
(("", nth inducts i), [PureThy.kind_internal, Induct.induct_type ""]); |
18462 | 358 |
in |
19874 | 359 |
thy |> PureThy.add_thms |
21045 | 360 |
(maps named_rules infos @ |
19874 | 361 |
map unnamed_rule (length infos upto length inducts - 1)) |> snd |
362 |
|> PureThy.add_thmss [(("inducts", inducts), [])] |> snd |
|
18462 | 363 |
end; |
8306 | 364 |
|
5177 | 365 |
|
8405 | 366 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
367 |
(**** simplification procedure for showing distinctness of constructors ****) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
368 |
|
7060 | 369 |
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T) |
370 |
| stripT p = p; |
|
371 |
||
372 |
fun stripC (i, f $ x) = stripC (i + 1, f) |
|
373 |
| stripC p = p; |
|
374 |
||
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
375 |
val distinctN = "constr_distinct"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
376 |
|
25537 | 377 |
fun distinct_rule thy ss tname eq_t = case #distinct (the_datatype thy tname) of |
26533
aeef55a3d1d5
Deleted code for axiomatic introduction of datatypes. Instead, the package
berghofe
parents:
26496
diff
changeset
|
378 |
FewConstrs thms => Goal.prove (Simplifier.the_context ss) [] [] eq_t (K |
25537 | 379 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1, |
380 |
atac 2, resolve_tac thms 1, etac FalseE 1])) |
|
381 |
| ManyConstrs (thm, simpset) => |
|
382 |
let |
|
383 |
val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] = |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
384 |
map (PureThy.get_thm (ThyInfo.the_theory "Datatype" thy)) |
25537 | 385 |
["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"]; |
386 |
in |
|
387 |
Goal.prove (Simplifier.the_context ss) [] [] eq_t (K |
|
388 |
(EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1, |
|
389 |
full_simp_tac (Simplifier.inherit_context ss simpset) 1, |
|
390 |
REPEAT (dresolve_tac [In0_inject, In1_inject] 1), |
|
391 |
eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1, |
|
392 |
etac FalseE 1])) |
|
393 |
end; |
|
394 |
||
19539 | 395 |
fun distinct_proc thy ss (t as Const ("op =", _) $ t1 $ t2) = |
7060 | 396 |
(case (stripC (0, t1), stripC (0, t2)) of |
397 |
((i, Const (cname1, T1)), (j, Const (cname2, T2))) => |
|
398 |
(case (stripT (0, T1), stripT (0, T2)) of |
|
399 |
((i', Type (tname1, _)), (j', Type (tname2, _))) => |
|
400 |
if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then |
|
19539 | 401 |
(case (get_datatype_descr thy) tname1 of |
19346 | 402 |
SOME (_, (_, constrs)) => let val cnames = map fst constrs |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
403 |
in if cname1 mem cnames andalso cname2 mem cnames then |
25537 | 404 |
SOME (distinct_rule thy ss tname1 |
405 |
(Logic.mk_equals (t, Const ("False", HOLogic.boolT)))) |
|
15531 | 406 |
else NONE |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
407 |
end |
15531 | 408 |
| NONE => NONE) |
409 |
else NONE |
|
410 |
| _ => NONE) |
|
411 |
| _ => NONE) |
|
20054 | 412 |
| distinct_proc _ _ _ = NONE; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
413 |
|
13462 | 414 |
val distinct_simproc = |
16430 | 415 |
Simplifier.simproc HOL.thy distinctN ["s = t"] distinct_proc; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
416 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
417 |
val dist_ss = HOL_ss addsimprocs [distinct_simproc]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
418 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
419 |
val simproc_setup = |
26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26343
diff
changeset
|
420 |
Simplifier.map_simpset (fn ss => ss addsimprocs [distinct_simproc]); |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
421 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
422 |
|
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
423 |
(**** translation rules for case ****) |
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
424 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
425 |
fun make_case ctxt = DatatypeCase.make_case |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
426 |
(datatype_of_constr (ProofContext.theory_of ctxt)) ctxt; |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
427 |
|
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
428 |
fun strip_case ctxt = DatatypeCase.strip_case |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
429 |
(datatype_of_case (ProofContext.theory_of ctxt)); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
430 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
431 |
fun add_case_tr' case_names thy = |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
432 |
Sign.add_advanced_trfuns ([], [], |
24711 | 433 |
map (fn case_name => |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
434 |
let val case_name' = Sign.const_syntax_name thy case_name |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
435 |
in (case_name', DatatypeCase.case_tr' datatype_of_case case_name') |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
436 |
end) case_names, []) thy; |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
437 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
438 |
val trfun_setup = |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
439 |
Sign.add_advanced_trfuns ([], |
24349 | 440 |
[("_case_syntax", DatatypeCase.case_tr true datatype_of_constr)], |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
441 |
[], []); |
14799
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
442 |
|
a405aadff16c
Added more flexible parse / print translations for case expressions.
berghofe
parents:
14471
diff
changeset
|
443 |
|
5177 | 444 |
(* prepare types *) |
445 |
||
446 |
fun read_typ sign ((Ts, sorts), str) = |
|
447 |
let |
|
22675
acf10be7dcca
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22598
diff
changeset
|
448 |
val T = Type.no_tvars (Sign.read_def_typ (sign, AList.lookup (op =) |
5177 | 449 |
(map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg |
450 |
in (Ts @ [T], add_typ_tfrees (T, sorts)) end; |
|
451 |
||
452 |
fun cert_typ sign ((Ts, sorts), raw_T) = |
|
453 |
let |
|
454 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle |
|
455 |
TYPE (msg, _, _) => error msg; |
|
456 |
val sorts' = add_typ_tfrees (T, sorts) |
|
457 |
in (Ts @ [T], |
|
18964 | 458 |
case duplicates (op =) (map fst sorts') of |
5177 | 459 |
[] => sorts' |
460 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups)) |
|
461 |
end; |
|
462 |
||
463 |
||
464 |
(**** make datatype info ****) |
|
465 |
||
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
466 |
fun make_dt_info alt_names descr sorts induct reccomb_names rec_thms |
10121 | 467 |
(((((((((i, (_, (tname, _, _))), case_name), case_thms), |
468 |
exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) = |
|
469 |
(tname, |
|
470 |
{index = i, |
|
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
471 |
alt_names = alt_names, |
10121 | 472 |
descr = descr, |
18319
c52b139ebde0
Added new component "sorts" to record datatype_info.
berghofe
parents:
18314
diff
changeset
|
473 |
sorts = sorts, |
10121 | 474 |
rec_names = reccomb_names, |
475 |
rec_rewrites = rec_thms, |
|
476 |
case_name = case_name, |
|
477 |
case_rewrites = case_thms, |
|
478 |
induction = induct, |
|
479 |
exhaustion = exhaustion_thm, |
|
480 |
distinct = distinct_thm, |
|
481 |
inject = inject, |
|
482 |
nchotomy = nchotomy, |
|
483 |
case_cong = case_cong, |
|
484 |
weak_case_cong = weak_case_cong}); |
|
5177 | 485 |
|
24711 | 486 |
structure DatatypeInterpretation = InterpretationFun(type T = string list val eq = op =); |
487 |
val interpretation = DatatypeInterpretation.interpretation; |
|
24626
85eceef2edc7
introduced generic concepts for theory interpretators
haftmann
parents:
24624
diff
changeset
|
488 |
|
5177 | 489 |
|
490 |
(******************* definitional introduction of datatypes *******************) |
|
491 |
||
8437 | 492 |
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
493 |
case_names_induct case_names_exhausts thy = |
|
5177 | 494 |
let |
6360 | 495 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 496 |
|
18314 | 497 |
val ((inject, distinct, dist_rewrites, simproc_dists, induct), thy2) = thy |> |
5661 | 498 |
DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts |
8437 | 499 |
types_syntax constr_syntax case_names_induct; |
5177 | 500 |
|
18314 | 501 |
val (casedist_thms, thy3) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr |
8437 | 502 |
sorts induct case_names_exhausts thy2; |
18314 | 503 |
val ((reccomb_names, rec_thms), thy4) = DatatypeAbsProofs.prove_primrec_thms |
20054 | 504 |
flat_names new_type_names descr sorts dt_info inject dist_rewrites |
505 |
(Simplifier.theory_context thy3 dist_ss) induct thy3; |
|
18314 | 506 |
val ((case_thms, case_names), thy6) = DatatypeAbsProofs.prove_case_thms |
5661 | 507 |
flat_names new_type_names descr sorts reccomb_names rec_thms thy4; |
18314 | 508 |
val (split_thms, thy7) = DatatypeAbsProofs.prove_split_thms new_type_names |
5177 | 509 |
descr sorts inject dist_rewrites casedist_thms case_thms thy6; |
18314 | 510 |
val (nchotomys, thy8) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 511 |
descr sorts casedist_thms thy7; |
18314 | 512 |
val (case_congs, thy9) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 513 |
descr sorts nchotomys case_thms thy8; |
18314 | 514 |
val (weak_case_congs, thy10) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 515 |
descr sorts thy9; |
5177 | 516 |
|
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
517 |
val dt_infos = map (make_dt_info NONE (flat descr) sorts induct reccomb_names rec_thms) |
5177 | 518 |
((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~ |
10121 | 519 |
casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
5177 | 520 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
521 |
val simps = flat (distinct @ inject @ case_thms) @ rec_thms; |
5177 | 522 |
|
18518 | 523 |
val thy12 = |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
524 |
thy10 |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
525 |
|> add_case_tr' case_names |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
526 |
|> Sign.add_path (space_implode "_" new_type_names) |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
527 |
|> add_rules simps case_thms rec_thms inject distinct |
18728 | 528 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
529 |
|> put_dt_infos dt_infos |
18518 | 530 |
|> add_cases_induct dt_infos induct |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
531 |
|> Sign.parent_path |
18518 | 532 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd |
24711 | 533 |
|> DatatypeInterpretation.data (map fst dt_infos); |
5177 | 534 |
in |
18008 | 535 |
({distinct = distinct, |
5177 | 536 |
inject = inject, |
537 |
exhaustion = casedist_thms, |
|
538 |
rec_thms = rec_thms, |
|
539 |
case_thms = case_thms, |
|
540 |
split_thms = split_thms, |
|
541 |
induction = induct, |
|
18008 | 542 |
simps = simps}, thy12) |
5177 | 543 |
end; |
544 |
||
545 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
546 |
(*********************** declare existing type as datatype *********************) |
5177 | 547 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
548 |
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 = |
5177 | 549 |
let |
18418
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
550 |
val (((distinct, inject), [induction]), thy1) = |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
551 |
thy0 |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
552 |
|> fold_map apply_theorems raw_distinct |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
553 |
||>> fold_map apply_theorems raw_inject |
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
554 |
||>> apply_theorems [raw_induction]; |
5177 | 555 |
|
22598 | 556 |
val ((_, [induction']), _) = |
557 |
Variable.importT_thms [induction] (Variable.thm_context induction); |
|
5177 | 558 |
|
559 |
fun err t = error ("Ill-formed predicate in induction rule: " ^ |
|
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26533
diff
changeset
|
560 |
Syntax.string_of_term_global thy1 t); |
5177 | 561 |
|
562 |
fun get_typ (t as _ $ Var (_, Type (tname, Ts))) = |
|
25888
48cc198b9ac5
Eliminated DatatypeAux.dest_TFree to avoid clashes
berghofe
parents:
25677
diff
changeset
|
563 |
((tname, map (fst o dest_TFree) Ts) handle TERM _ => err t) |
5177 | 564 |
| get_typ t = err t; |
565 |
||
8437 | 566 |
val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction'))); |
15570 | 567 |
val new_type_names = getOpt (alt_names, map fst dtnames); |
5177 | 568 |
|
569 |
fun get_constr t = (case Logic.strip_assums_concl t of |
|
570 |
_ $ (_ $ t') => (case head_of t' of |
|
571 |
Const (cname, cT) => (case strip_type cT of |
|
572 |
(Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts)) |
|
573 |
| _ => err t) |
|
574 |
| _ => err t) |
|
575 |
| _ => err t); |
|
576 |
||
577 |
fun make_dt_spec [] _ _ = [] |
|
578 |
| make_dt_spec ((tname, tvs)::dtnames') i constrs = |
|
579 |
let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs |
|
580 |
in (i, (tname, map DtTFree tvs, map snd constrs')):: |
|
581 |
(make_dt_spec dtnames' (i + 1) constrs'') |
|
582 |
end; |
|
583 |
||
584 |
val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction')); |
|
585 |
val sorts = add_term_tfrees (concl_of induction', []); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
586 |
val dt_info = get_datatypes thy1; |
5177 | 587 |
|
21419 | 588 |
val (case_names_induct, case_names_exhausts) = |
589 |
(mk_case_names_induct descr, mk_case_names_exhausts descr (map #1 dtnames)); |
|
8437 | 590 |
|
6427 | 591 |
val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names); |
5177 | 592 |
|
18314 | 593 |
val (casedist_thms, thy2) = thy1 |> |
8437 | 594 |
DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction |
595 |
case_names_exhausts; |
|
18314 | 596 |
val ((reccomb_names, rec_thms), thy3) = DatatypeAbsProofs.prove_primrec_thms |
20054 | 597 |
false new_type_names [descr] sorts dt_info inject distinct |
598 |
(Simplifier.theory_context thy2 dist_ss) induction thy2; |
|
18314 | 599 |
val ((case_thms, case_names), thy4) = DatatypeAbsProofs.prove_case_thms false |
5177 | 600 |
new_type_names [descr] sorts reccomb_names rec_thms thy3; |
18314 | 601 |
val (split_thms, thy5) = DatatypeAbsProofs.prove_split_thms |
5177 | 602 |
new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4; |
18314 | 603 |
val (nchotomys, thy6) = DatatypeAbsProofs.prove_nchotomys new_type_names |
5177 | 604 |
[descr] sorts casedist_thms thy5; |
18314 | 605 |
val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names |
5177 | 606 |
[descr] sorts nchotomys case_thms thy6; |
18314 | 607 |
val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
8601 | 608 |
[descr] sorts thy7; |
5177 | 609 |
|
18377 | 610 |
val ((_, [induction']), thy10) = |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
611 |
thy8 |
18377 | 612 |
|> store_thmss "inject" new_type_names inject |
613 |
||>> store_thmss "distinct" new_type_names distinct |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
614 |
||> Sign.add_path (space_implode "_" new_type_names) |
18377 | 615 |
||>> PureThy.add_thms [(("induct", induction), [case_names_induct])]; |
9149 | 616 |
|
25677
8b2ddc6e7be1
- Removed redundant head_len field in datatype_info
berghofe
parents:
25537
diff
changeset
|
617 |
val dt_infos = map (make_dt_info alt_names descr sorts induction' reccomb_names rec_thms) |
10121 | 618 |
((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~ |
619 |
map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs); |
|
5177 | 620 |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
621 |
val simps = flat (distinct @ inject @ case_thms) @ rec_thms; |
5177 | 622 |
|
19599 | 623 |
val thy11 = |
624 |
thy10 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
625 |
|> add_case_tr' case_names |
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24626
diff
changeset
|
626 |
|> add_rules simps case_thms rec_thms inject distinct |
19599 | 627 |
weak_case_congs (Simplifier.attrib (op addcongs)) |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
628 |
|> put_dt_infos dt_infos |
19599 | 629 |
|> add_cases_induct dt_infos induction' |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
630 |
|> Sign.parent_path |
19599 | 631 |
|> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |
632 |
|> snd |
|
24711 | 633 |
|> DatatypeInterpretation.data (map fst dt_infos); |
5177 | 634 |
in |
18008 | 635 |
({distinct = distinct, |
5177 | 636 |
inject = inject, |
637 |
exhaustion = casedist_thms, |
|
638 |
rec_thms = rec_thms, |
|
639 |
case_thms = case_thms, |
|
640 |
split_thms = split_thms, |
|
8437 | 641 |
induction = induction', |
18008 | 642 |
simps = simps}, thy11) |
5177 | 643 |
end; |
644 |
||
21350 | 645 |
val rep_datatype = gen_rep_datatype IsarCmd.apply_theorems; |
646 |
val rep_datatype_i = gen_rep_datatype IsarCmd.apply_theorems_i; |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
647 |
|
5177 | 648 |
|
11958 | 649 |
|
5177 | 650 |
(******************************** add datatype ********************************) |
651 |
||
14887 | 652 |
fun gen_add_datatype prep_typ err flat_names new_type_names dts thy = |
5177 | 653 |
let |
20820
58693343905f
removed obsolete Datatype_Universe.thy (cf. Datatype.thy);
wenzelm
parents:
20715
diff
changeset
|
654 |
val _ = Theory.requires thy "Datatype" "datatype definitions"; |
5177 | 655 |
|
656 |
(* this theory is used just for parsing *) |
|
657 |
||
658 |
val tmp_thy = thy |> |
|
5892 | 659 |
Theory.copy |> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
660 |
Sign.add_types (map (fn (tvs, tname, mx, _) => |
5177 | 661 |
(tname, length tvs, mx)) dts); |
662 |
||
5661 | 663 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 664 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
20597 | 665 |
let val full_tname = Sign.full_name tmp_thy (Syntax.type_name tname mx) |
18964 | 666 |
in (case duplicates (op =) tvs of |
5661 | 667 |
[] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
668 |
else error ("Mutually recursive datatypes must have same type parameters") |
|
5177 | 669 |
| dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^ |
670 |
" : " ^ commas dups)) |
|
671 |
end) dts); |
|
672 |
||
18964 | 673 |
val _ = (case duplicates (op =) (map fst new_dts) @ duplicates (op =) new_type_names of |
5177 | 674 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
675 |
||
21045 | 676 |
fun prep_dt_spec (tvs, tname, mx, constrs) (dts', constr_syntax, sorts, i) = |
5177 | 677 |
let |
21045 | 678 |
fun prep_constr (cname, cargs, mx') (constrs, constr_syntax', sorts') = |
5279 | 679 |
let |
20597 | 680 |
val (cargs', sorts'') = Library.foldl (prep_typ tmp_thy) (([], sorts'), cargs); |
21045 | 681 |
val _ = (case fold (curry add_typ_tfree_names) cargs' [] \\ tvs of |
5279 | 682 |
[] => () |
683 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
20597 | 684 |
in (constrs @ [((if flat_names then Sign.full_name tmp_thy else |
685 |
Sign.full_name_path tmp_thy tname) (Syntax.const_name cname mx'), |
|
5177 | 686 |
map (dtyp_of_typ new_dts) cargs')], |
687 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
18678 | 688 |
end handle ERROR msg => |
689 |
cat_error msg ("The error above occured in constructor " ^ cname ^ |
|
5177 | 690 |
" of datatype " ^ tname); |
691 |
||
692 |
val (constrs', constr_syntax', sorts') = |
|
21045 | 693 |
fold prep_constr constrs ([], [], sorts) |
5177 | 694 |
|
8405 | 695 |
in |
18964 | 696 |
case duplicates (op =) (map fst constrs') of |
5177 | 697 |
[] => |
20597 | 698 |
(dts' @ [(i, (Sign.full_name tmp_thy (Syntax.type_name tname mx), |
5177 | 699 |
map DtTFree tvs, constrs'))], |
700 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
701 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
702 |
" in datatype " ^ tname) |
|
703 |
end; |
|
704 |
||
21045 | 705 |
val (dts', constr_syntax, sorts', i) = fold prep_dt_spec dts ([], [], [], 0); |
20597 | 706 |
val sorts = sorts' @ (map (rpair (Sign.defaultS tmp_thy)) (tyvars \\ map fst sorts')); |
5177 | 707 |
val dt_info = get_datatypes thy; |
20597 | 708 |
val (descr, _) = unfold_datatypes tmp_thy dts' sorts dt_info dts' i; |
14887 | 709 |
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
|
710 |
if err then error ("Nonemptiness check failed for datatype " ^ s) |
14887 | 711 |
else raise exn; |
5177 | 712 |
|
21045 | 713 |
val descr' = flat descr; |
8437 | 714 |
val case_names_induct = mk_case_names_induct descr'; |
715 |
val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts); |
|
5177 | 716 |
in |
26533
aeef55a3d1d5
Deleted code for axiomatic introduction of datatypes. Instead, the package
berghofe
parents:
26496
diff
changeset
|
717 |
add_datatype_def |
8437 | 718 |
flat_names new_type_names descr sorts types_syntax constr_syntax dt_info |
719 |
case_names_induct case_names_exhausts thy |
|
5177 | 720 |
end; |
721 |
||
722 |
val add_datatype_i = gen_add_datatype cert_typ; |
|
14887 | 723 |
val add_datatype = gen_add_datatype read_typ true; |
5177 | 724 |
|
6360 | 725 |
|
26111 | 726 |
(** a datatype antiquotation **) |
727 |
||
728 |
local |
|
729 |
||
730 |
val sym_datatype = Pretty.str "\\isacommand{datatype}"; |
|
731 |
val sym_binder = Pretty.str "{\\isacharequal}"; |
|
732 |
val sym_of = Pretty.str "of"; |
|
733 |
val sym_sep = Pretty.str "{\\isacharbar}"; |
|
734 |
||
735 |
in |
|
736 |
||
737 |
fun args_datatype (ctxt, args) = |
|
738 |
let |
|
739 |
val (tyco, (ctxt', args')) = Args.tyname (ctxt, args); |
|
740 |
val thy = Context.theory_of ctxt'; |
|
741 |
val spec = the_datatype_spec thy tyco; |
|
742 |
in ((tyco, spec), (ctxt', args')) end; |
|
743 |
||
744 |
fun pretty_datatype ctxt (dtco, (vs, cos)) = |
|
745 |
let |
|
746 |
val ty = Type (dtco, map TFree vs); |
|
747 |
fun pretty_typ_br ty = |
|
748 |
let |
|
749 |
val p = Syntax.pretty_typ ctxt ty; |
|
750 |
val s = explode (Pretty.str_of p); |
|
751 |
in if member (op =) s " " then Pretty.enclose "(" ")" [p] |
|
752 |
else p |
|
753 |
end; |
|
754 |
fun pretty_constr (co, []) = |
|
755 |
Syntax.pretty_term ctxt (Const (co, ty)) |
|
756 |
| pretty_constr (co, [ty']) = |
|
757 |
(Pretty.block o Pretty.breaks) |
|
758 |
[Syntax.pretty_term ctxt (Const (co, ty' --> ty)), |
|
759 |
sym_of, Syntax.pretty_typ ctxt ty'] |
|
760 |
| pretty_constr (co, tys) = |
|
761 |
(Pretty.block o Pretty.breaks) |
|
762 |
(Syntax.pretty_term ctxt (Const (co, tys ---> ty)) :: |
|
763 |
sym_of :: map pretty_typ_br tys); |
|
764 |
in (Pretty.block o Pretty.breaks) ( |
|
765 |
sym_datatype |
|
766 |
:: Syntax.pretty_typ ctxt ty |
|
767 |
:: sym_binder |
|
768 |
:: separate sym_sep (map pretty_constr cos) |
|
769 |
) end |
|
770 |
||
771 |
end; |
|
18451 | 772 |
|
6360 | 773 |
(** package setup **) |
774 |
||
775 |
(* setup theory *) |
|
776 |
||
18708 | 777 |
val setup = |
27002
215d64dc971e
moved distinctness_limit to datatype_rep_proofs.ML
haftmann
parents:
26939
diff
changeset
|
778 |
DatatypeRepProofs.distinctness_limit_setup #> |
24098
f1eb34ae33af
replaced dtK ref by datatype_distinctness_limit configuration option;
wenzelm
parents:
22994
diff
changeset
|
779 |
Method.add_methods tactic_emulations #> |
f1eb34ae33af
replaced dtK ref by datatype_distinctness_limit configuration option;
wenzelm
parents:
22994
diff
changeset
|
780 |
simproc_setup #> |
24626
85eceef2edc7
introduced generic concepts for theory interpretators
haftmann
parents:
24624
diff
changeset
|
781 |
trfun_setup #> |
24711 | 782 |
DatatypeInterpretation.init; |
6360 | 783 |
|
784 |
||
785 |
(* outer syntax *) |
|
786 |
||
17057 | 787 |
local structure P = OuterParse and K = OuterKeyword in |
6360 | 788 |
|
24867 | 789 |
val _ = OuterSyntax.keywords ["distinct", "inject", "induction"]; |
790 |
||
6360 | 791 |
val datatype_decl = |
6723 | 792 |
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
|
793 |
(P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix)); |
6360 | 794 |
|
795 |
fun mk_datatype args = |
|
796 |
let |
|
15531 | 797 |
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
|
798 |
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
|
799 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
18008 | 800 |
in snd o add_datatype false names specs end; |
6360 | 801 |
|
24867 | 802 |
val _ = |
6723 | 803 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
804 |
(P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype)); |
|
6360 | 805 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
806 |
|
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
807 |
val rep_datatype_decl = |
6723 | 808 |
Scan.option (Scan.repeat1 P.name) -- |
22101 | 809 |
Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 SpecParse.xthms1)) [[]] -- |
810 |
Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 SpecParse.xthms1)) [[]] -- |
|
811 |
(P.$$$ "induction" |-- P.!!! SpecParse.xthm); |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
812 |
|
18008 | 813 |
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
|
814 |
|
24867 | 815 |
val _ = |
6723 | 816 |
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
|
817 |
(rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype)); |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
818 |
|
26111 | 819 |
val _ = |
820 |
ThyOutput.add_commands [("datatype", |
|
821 |
ThyOutput.args args_datatype (ThyOutput.output pretty_datatype))]; |
|
822 |
||
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
823 |
end; |
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
824 |
|
6360 | 825 |
|
5177 | 826 |
end; |
827 |