author | wenzelm |
Thu, 29 Oct 2009 13:21:38 +0100 | |
changeset 33303 | 1e1210f31207 |
parent 33244 | db230399f890 |
child 33313 | f6acebef3ea1 |
permissions | -rw-r--r-- |
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31689
diff
changeset
|
1 |
(* Title: HOL/Tools/datatype.ML |
11539 | 2 |
Author: Stefan Berghofer, TU Muenchen |
5177 | 3 |
|
6360 | 4 |
Datatype package for Isabelle/HOL. |
5177 | 5 |
*) |
6 |
||
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31689
diff
changeset
|
7 |
signature DATATYPE = |
6360 | 8 |
sig |
31735 | 9 |
include DATATYPE_COMMON |
10 |
val add_datatype : config -> string list -> (string list * binding * mixfix * |
|
31783
cfbe9609ceb1
add_datatypes does not yield particular rules any longer
haftmann
parents:
31781
diff
changeset
|
11 |
(binding * typ list * mixfix) list) list -> theory -> string list * theory |
31735 | 12 |
val datatype_cmd : string list -> (string list * binding * mixfix * |
13 |
(binding * string list * mixfix) list) list -> theory -> theory |
|
31781
861e675f01e6
add_datatype interface yields type names and less rules
haftmann
parents:
31775
diff
changeset
|
14 |
val rep_datatype : config -> (string list -> Proof.context -> Proof.context) |
31735 | 15 |
-> string list option -> term list -> theory -> Proof.state |
16 |
val rep_datatype_cmd : string list option -> string list -> theory -> Proof.state |
|
31784 | 17 |
val get_info : theory -> string -> info option |
18 |
val the_info : theory -> string -> info |
|
19 |
val the_descr : theory -> string list |
|
31735 | 20 |
-> descr * (string * sort) list * string list |
31868 | 21 |
* string * (string list * string list) * (typ list * typ list) |
31784 | 22 |
val the_spec : theory -> string -> (string * sort) list * (string * typ list) list |
32911 | 23 |
val all_distincts : theory -> typ list -> thm list list |
31784 | 24 |
val get_constrs : theory -> string -> (string * typ) list option |
25 |
val get_all : theory -> info Symtab.table |
|
32896
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
26 |
val info_of_constr : theory -> string * typ -> info option |
31784 | 27 |
val info_of_case : theory -> string -> info option |
31735 | 28 |
val interpretation : (config -> string list -> theory -> theory) -> theory -> theory |
32671 | 29 |
val make_case : Proof.context -> DatatypeCase.config -> string list -> term -> |
31735 | 30 |
(term * term) list -> term * (term * (int * bool)) list |
31 |
val strip_case : Proof.context -> bool -> term -> (term * (term * term) list) option |
|
33244 | 32 |
val read_typ: theory -> string -> (string * sort) list -> typ * (string * sort) list |
18708 | 33 |
val setup: theory -> theory |
5177 | 34 |
end; |
35 |
||
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31689
diff
changeset
|
36 |
structure Datatype : DATATYPE = |
5177 | 37 |
struct |
38 |
||
39 |
open DatatypeAux; |
|
40 |
||
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
41 |
(** theory data **) |
6360 | 42 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
43 |
(* data management *) |
5177 | 44 |
|
16430 | 45 |
structure DatatypesData = TheoryDataFun |
22846 | 46 |
( |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
47 |
type T = |
31735 | 48 |
{types: info Symtab.table, |
32896
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
49 |
constrs: (string * info) list Symtab.table, |
31735 | 50 |
cases: info Symtab.table}; |
5177 | 51 |
|
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
52 |
val empty = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
53 |
{types = Symtab.empty, constrs = Symtab.empty, cases = Symtab.empty}; |
6556 | 54 |
val copy = I; |
16430 | 55 |
val extend = I; |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
56 |
fun merge _ |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
57 |
({types = types1, constrs = constrs1, cases = cases1}, |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
58 |
{types = types2, constrs = constrs2, cases = cases2}) = |
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
59 |
{types = Symtab.merge (K true) (types1, types2), |
32896
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
60 |
constrs = Symtab.join (K (AList.merge (op =) (K true))) (constrs1, constrs2), |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
61 |
cases = Symtab.merge (K true) (cases1, cases2)}; |
22846 | 62 |
); |
5177 | 63 |
|
31784 | 64 |
val get_all = #types o DatatypesData.get; |
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
65 |
val get_info = Symtab.lookup o get_all; |
33303
1e1210f31207
separate "inner_rule" tag indicates parts of induction rules -- avoids unclear overlap with "internal" tag;
wenzelm
parents:
33244
diff
changeset
|
66 |
|
1e1210f31207
separate "inner_rule" tag indicates parts of induction rules -- avoids unclear overlap with "internal" tag;
wenzelm
parents:
33244
diff
changeset
|
67 |
fun the_info thy name = |
1e1210f31207
separate "inner_rule" tag indicates parts of induction rules -- avoids unclear overlap with "internal" tag;
wenzelm
parents:
33244
diff
changeset
|
68 |
(case get_info thy name of |
1e1210f31207
separate "inner_rule" tag indicates parts of induction rules -- avoids unclear overlap with "internal" tag;
wenzelm
parents:
33244
diff
changeset
|
69 |
SOME info => info |
1e1210f31207
separate "inner_rule" tag indicates parts of induction rules -- avoids unclear overlap with "internal" tag;
wenzelm
parents:
33244
diff
changeset
|
70 |
| NONE => error ("Unknown datatype " ^ quote name)); |
5177 | 71 |
|
32896
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
72 |
fun info_of_constr thy (c, T) = |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
73 |
let |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
74 |
val tab = Symtab.lookup_list ((#constrs o DatatypesData.get) thy) c; |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
75 |
val hint = case strip_type T of (_, Type (tyco, _)) => SOME tyco | _ => NONE; |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
76 |
val default = if null tab then NONE |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
77 |
else SOME (snd (Library.last_elem tab)) |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
78 |
(*conservative wrt. overloaded constructors*); |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
79 |
in case hint |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
80 |
of NONE => default |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
81 |
| SOME tyco => case AList.lookup (op =) tab tyco |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
82 |
of NONE => default (*permissive*) |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
83 |
| SOME info => SOME info |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
84 |
end; |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
85 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
86 |
val info_of_case = Symtab.lookup o #cases o DatatypesData.get; |
5177 | 87 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
88 |
fun register (dt_infos : (string * info) list) = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
89 |
DatatypesData.map (fn {types, constrs, cases} => |
32896
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
90 |
{types = types |> fold Symtab.update dt_infos, |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
91 |
constrs = constrs |> fold (fn (constr, dtname_info) => |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
92 |
Symtab.map_default (constr, []) (cons dtname_info)) |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
93 |
(maps (fn (dtname, info as {descr, index, ...}) => |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
94 |
map (rpair (dtname, info) o fst) |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
95 |
(#3 (the (AList.lookup op = descr index)))) dt_infos), |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
96 |
cases = cases |> fold Symtab.update |
99cd75a18b78
lookup for datatype constructors considers type annotations to resolve overloading
haftmann
parents:
32731
diff
changeset
|
97 |
(map (fn (_, info as {case_name, ...}) => (case_name, info)) dt_infos)}); |
22777
2fc921376a86
- Moved parse / print translations for case to datatype_case.ML
berghofe
parents:
22709
diff
changeset
|
98 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
99 |
(* complex queries *) |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6851
diff
changeset
|
100 |
|
31784 | 101 |
fun the_spec thy dtco = |
18518 | 102 |
let |
31784 | 103 |
val info as { descr, index, sorts = raw_sorts, ... } = the_info thy dtco; |
26093 | 104 |
val SOME (_, dtys, raw_cos) = AList.lookup (op =) descr index; |
105 |
val sorts = map ((fn v => (v, (the o AList.lookup (op =) raw_sorts) v)) |
|
106 |
o DatatypeAux.dest_DtTFree) dtys; |
|
107 |
val cos = map |
|
108 |
(fn (co, tys) => (co, map (DatatypeAux.typ_of_dtyp descr sorts) tys)) raw_cos; |
|
109 |
in (sorts, cos) end; |
|
18518 | 110 |
|
31784 | 111 |
fun the_descr thy (raw_tycos as raw_tyco :: _) = |
31604 | 112 |
let |
31784 | 113 |
val info = the_info thy raw_tyco; |
31604 | 114 |
val descr = #descr info; |
115 |
||
116 |
val SOME (_, dtys, raw_cos) = AList.lookup (op =) descr (#index info); |
|
117 |
val vs = map ((fn v => (v, (the o AList.lookup (op =) (#sorts info)) v)) |
|
118 |
o dest_DtTFree) dtys; |
|
119 |
||
120 |
fun is_DtTFree (DtTFree _) = true |
|
121 |
| is_DtTFree _ = false |
|
122 |
val k = find_index (fn (_, (_, dTs, _)) => not (forall is_DtTFree dTs)) descr; |
|
123 |
val protoTs as (dataTs, _) = chop k descr |
|
124 |
|> (pairself o map) (fn (_, (tyco, dTs, _)) => (tyco, map (typ_of_dtyp descr vs) dTs)); |
|
125 |
||
126 |
val tycos = map fst dataTs; |
|
33038 | 127 |
val _ = if eq_set (op =) (tycos, raw_tycos) then () |
31604 | 128 |
else error ("Type constructors " ^ commas (map quote raw_tycos) |
32374 | 129 |
^ " do not belong exhaustively to one mutual recursive datatype"); |
31604 | 130 |
|
131 |
val (Ts, Us) = (pairself o map) Type protoTs; |
|
132 |
||
133 |
val names = map Long_Name.base_name (the_default tycos (#alt_names info)); |
|
134 |
val (auxnames, _) = Name.make_context names |
|
31868 | 135 |
|> fold_map (yield_singleton Name.variants o name_of_typ) Us; |
136 |
val prefix = space_implode "_" names; |
|
31604 | 137 |
|
31868 | 138 |
in (descr, vs, tycos, prefix, (names, auxnames), (Ts, Us)) end; |
31604 | 139 |
|
32911 | 140 |
fun all_distincts thy Ts = |
141 |
let |
|
142 |
fun add_tycos (Type (tyco, Ts)) = insert (op =) tyco #> fold add_tycos Ts |
|
143 |
| add_tycos _ = I; |
|
144 |
val tycos = fold add_tycos Ts []; |
|
145 |
in map_filter (Option.map #distinct o get_info thy) tycos end; |
|
146 |
||
31784 | 147 |
fun get_constrs thy dtco = |
148 |
case try (the_spec thy) dtco |
|
19346 | 149 |
of SOME (sorts, cos) => |
150 |
let |
|
151 |
fun subst (v, sort) = TVar ((v, 0), sort); |
|
152 |
fun subst_ty (TFree v) = subst v |
|
153 |
| subst_ty ty = ty; |
|
154 |
val dty = Type (dtco, map subst sorts); |
|
155 |
fun mk_co (co, tys) = (co, map (Term.map_atyps subst_ty) tys ---> dty); |
|
156 |
in SOME (map mk_co cos) end |
|
157 |
| NONE => NONE; |
|
18518 | 158 |
|
5177 | 159 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
160 |
(** various auxiliary **) |
8437 | 161 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
162 |
(* prepare datatype specifications *) |
5177 | 163 |
|
33244 | 164 |
fun read_typ thy str sorts = |
5177 | 165 |
let |
27277
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
166 |
val ctxt = ProofContext.init thy |
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
167 |
|> fold (Variable.declare_typ o TFree) sorts; |
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
168 |
val T = Syntax.read_typ ctxt str; |
33244 | 169 |
in (T, Term.add_tfreesT T sorts) end; |
5177 | 170 |
|
33244 | 171 |
fun cert_typ sign raw_T sorts = |
5177 | 172 |
let |
33244 | 173 |
val T = Type.no_tvars (Sign.certify_typ sign raw_T) |
174 |
handle TYPE (msg, _, _) => error msg; |
|
27277
7b7ce2d7fafe
export read_typ/cert_typ -- version with regular context operations;
wenzelm
parents:
27261
diff
changeset
|
175 |
val sorts' = Term.add_tfreesT T sorts; |
33244 | 176 |
val _ = |
18964 | 177 |
case duplicates (op =) (map fst sorts') of |
33244 | 178 |
[] => () |
179 |
| dups => error ("Inconsistent sort constraints for " ^ commas dups) |
|
180 |
in (T, sorts') end; |
|
181 |
||
5177 | 182 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
183 |
(* case names *) |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
184 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
185 |
local |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
186 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
187 |
fun dt_recs (DtTFree _) = [] |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
188 |
| dt_recs (DtType (_, dts)) = maps dt_recs dts |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
189 |
| dt_recs (DtRec i) = [i]; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
190 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
191 |
fun dt_cases (descr: descr) (_, args, constrs) = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
192 |
let |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
193 |
fun the_bname i = Long_Name.base_name (#1 (the (AList.lookup (op =) descr i))); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
194 |
val bnames = map the_bname (distinct (op =) (maps dt_recs args)); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
195 |
in map (fn (c, _) => space_implode "_" (Long_Name.base_name c :: bnames)) constrs end; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
196 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
197 |
fun induct_cases descr = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
198 |
DatatypeProp.indexify_names (maps (dt_cases descr) (map #2 descr)); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
199 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
200 |
fun exhaust_cases descr i = dt_cases descr (the (AList.lookup (op =) descr i)); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
201 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
202 |
in |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
203 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
204 |
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
205 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
206 |
fun mk_case_names_exhausts descr new = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
207 |
map (RuleCases.case_names o exhaust_cases descr o #1) |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
208 |
(filter (fn ((_, (name, _, _))) => member (op =) new name) descr); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
209 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
210 |
end; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
211 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
212 |
(* translation rules for case *) |
5177 | 213 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
214 |
fun make_case ctxt = DatatypeCase.make_case |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
215 |
(info_of_constr (ProofContext.theory_of ctxt)) ctxt; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
216 |
|
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
217 |
fun strip_case ctxt = DatatypeCase.strip_case |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
218 |
(info_of_case (ProofContext.theory_of ctxt)); |
5177 | 219 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
220 |
fun add_case_tr' case_names thy = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
221 |
Sign.add_advanced_trfuns ([], [], |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
222 |
map (fn case_name => |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
223 |
let val case_name' = Sign.const_syntax_name thy case_name |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
224 |
in (case_name', DatatypeCase.case_tr' info_of_case case_name') |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
225 |
end) case_names, []) thy; |
5177 | 226 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
227 |
val trfun_setup = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
228 |
Sign.add_advanced_trfuns ([], |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
229 |
[("_case_syntax", DatatypeCase.case_tr true info_of_constr)], |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
230 |
[], []); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
231 |
|
33062 | 232 |
|
233 |
(** document antiquotation **) |
|
5177 | 234 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
235 |
val _ = ThyOutput.antiquotation "datatype" Args.tyname |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
236 |
(fn {source = src, context = ctxt, ...} => fn dtco => |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
237 |
let |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
238 |
val thy = ProofContext.theory_of ctxt; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
239 |
val (vs, cos) = the_spec thy dtco; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
240 |
val ty = Type (dtco, map TFree vs); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
241 |
fun pretty_typ_bracket (ty as Type (_, _ :: _)) = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
242 |
Pretty.enclose "(" ")" [Syntax.pretty_typ ctxt ty] |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
243 |
| pretty_typ_bracket ty = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
244 |
Syntax.pretty_typ ctxt ty; |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
245 |
fun pretty_constr (co, tys) = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
246 |
(Pretty.block o Pretty.breaks) |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
247 |
(Syntax.pretty_term ctxt (Const (co, tys ---> ty)) :: |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
248 |
map pretty_typ_bracket tys); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
249 |
val pretty_datatype = |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
250 |
Pretty.block |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
251 |
(Pretty.command "datatype" :: Pretty.brk 1 :: |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
252 |
Syntax.pretty_typ ctxt ty :: |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
253 |
Pretty.str " =" :: Pretty.brk 1 :: |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
254 |
flat (separate [Pretty.brk 1, Pretty.str "| "] |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
255 |
(map (single o pretty_constr) cos))); |
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
256 |
in ThyOutput.output (ThyOutput.maybe_pretty_source (K pretty_datatype) src [()]) end); |
5177 | 257 |
|
258 |
||
32721
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
259 |
(** abstract theory extensions relative to a datatype characterisation **) |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
260 |
|
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
261 |
structure DatatypeInterpretation = InterpretationFun |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
262 |
(type T = config * string list val eq: T * T -> bool = eq_snd op =); |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
263 |
fun interpretation f = DatatypeInterpretation.interpretation (uncurry f); |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
264 |
|
32729 | 265 |
fun make_dt_info alt_names descr sorts induct inducts rec_names rec_rewrites |
266 |
(index, (((((((((((_, (tname, _, _))), inject), distinct), |
|
267 |
exhaust), nchotomy), case_name), case_rewrites), case_cong), weak_case_cong), (split, split_asm))) = |
|
268 |
(tname, |
|
269 |
{index = index, |
|
270 |
alt_names = alt_names, |
|
271 |
descr = descr, |
|
272 |
sorts = sorts, |
|
273 |
inject = inject, |
|
274 |
distinct = distinct, |
|
275 |
induct = induct, |
|
276 |
inducts = inducts, |
|
277 |
exhaust = exhaust, |
|
278 |
nchotomy = nchotomy, |
|
279 |
rec_names = rec_names, |
|
280 |
rec_rewrites = rec_rewrites, |
|
281 |
case_name = case_name, |
|
282 |
case_rewrites = case_rewrites, |
|
283 |
case_cong = case_cong, |
|
284 |
weak_case_cong = weak_case_cong, |
|
285 |
split = split, |
|
286 |
split_asm = split_asm}); |
|
287 |
||
32728
2c55fc50f670
further unification of datatype and rep_datatype
haftmann
parents:
32727
diff
changeset
|
288 |
fun derive_datatype_props config dt_names alt_names descr sorts |
32907 | 289 |
induct inject distinct thy1 = |
32721
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
290 |
let |
32729 | 291 |
val thy2 = thy1 |> Theory.checkpoint; |
32728
2c55fc50f670
further unification of datatype and rep_datatype
haftmann
parents:
32727
diff
changeset
|
292 |
val flat_descr = flat descr; |
32719 | 293 |
val new_type_names = map Long_Name.base_name (the_default dt_names alt_names); |
32728
2c55fc50f670
further unification of datatype and rep_datatype
haftmann
parents:
32727
diff
changeset
|
294 |
val _ = message config ("Deriving properties for datatype(s) " ^ commas_quote new_type_names); |
32729 | 295 |
|
296 |
val (exhaust, thy3) = DatatypeAbsProofs.prove_casedist_thms config new_type_names |
|
297 |
descr sorts induct (mk_case_names_exhausts flat_descr dt_names) thy2; |
|
298 |
val (nchotomys, thy4) = DatatypeAbsProofs.prove_nchotomys config new_type_names |
|
299 |
descr sorts exhaust thy3; |
|
300 |
val ((rec_names, rec_rewrites), thy5) = DatatypeAbsProofs.prove_primrec_thms |
|
301 |
config new_type_names descr sorts (#inject o the o Symtab.lookup (get_all thy4)) |
|
32915
a7a97960054b
more appropriate abstraction over distinctness rules
haftmann
parents:
32911
diff
changeset
|
302 |
inject (distinct, all_distincts thy2 (get_rec_types flat_descr sorts)) |
32911 | 303 |
induct thy4; |
32729 | 304 |
val ((case_rewrites, case_names), thy6) = DatatypeAbsProofs.prove_case_thms |
305 |
config new_type_names descr sorts rec_names rec_rewrites thy5; |
|
306 |
val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names |
|
307 |
descr sorts nchotomys case_rewrites thy6; |
|
308 |
val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names |
|
309 |
descr sorts thy7; |
|
32731 | 310 |
val (splits, thy9) = DatatypeAbsProofs.prove_split_thms |
32907 | 311 |
config new_type_names descr sorts inject distinct exhaust case_rewrites thy8; |
5177 | 312 |
|
32731 | 313 |
val inducts = Project_Rule.projections (ProofContext.init thy2) induct; |
32729 | 314 |
val dt_infos = map_index (make_dt_info alt_names flat_descr sorts induct inducts rec_names rec_rewrites) |
32907 | 315 |
(hd descr ~~ inject ~~ distinct ~~ exhaust ~~ nchotomys ~~ |
32731 | 316 |
case_names ~~ case_rewrites ~~ case_congs ~~ weak_case_congs ~~ splits); |
31781
861e675f01e6
add_datatype interface yields type names and less rules
haftmann
parents:
31775
diff
changeset
|
317 |
val dt_names = map fst dt_infos; |
32731 | 318 |
val prfx = Binding.qualify true (space_implode "_" new_type_names); |
32907 | 319 |
val simps = flat (inject @ distinct @ case_rewrites) @ rec_rewrites; |
32731 | 320 |
val named_rules = flat (map_index (fn (index, tname) => |
321 |
[((Binding.empty, [nth inducts index]), [Induct.induct_type tname]), |
|
322 |
((Binding.empty, [nth exhaust index]), [Induct.cases_type tname])]) dt_names); |
|
323 |
val unnamed_rules = map (fn induct => |
|
33303
1e1210f31207
separate "inner_rule" tag indicates parts of induction rules -- avoids unclear overlap with "internal" tag;
wenzelm
parents:
33244
diff
changeset
|
324 |
((Binding.empty, [induct]), [RuleCases.inner_rule, Induct.induct_type ""])) |
32731 | 325 |
(Library.drop (length dt_names, inducts)); |
32720 | 326 |
in |
327 |
thy9 |
|
32731 | 328 |
|> PureThy.add_thmss ([((prfx (Binding.name "simps"), simps), []), |
329 |
((prfx (Binding.name "inducts"), inducts), []), |
|
330 |
((prfx (Binding.name "splits"), maps (fn (x, y) => [x, y]) splits), []), |
|
32907 | 331 |
((Binding.empty, flat case_rewrites @ flat distinct @ rec_rewrites), |
32731 | 332 |
[Simplifier.simp_add]), |
333 |
((Binding.empty, rec_rewrites), [Code.add_default_eqn_attribute]), |
|
334 |
((Binding.empty, flat inject), [iff_add]), |
|
32907 | 335 |
((Binding.empty, map (fn th => th RS notE) (flat distinct)), |
32731 | 336 |
[Classical.safe_elim NONE]), |
337 |
((Binding.empty, weak_case_congs), [Simplifier.attrib (op addcongs)])] |
|
338 |
@ named_rules @ unnamed_rules) |
|
32720 | 339 |
|> snd |
32730 | 340 |
|> add_case_tr' case_names |
341 |
|> register dt_infos |
|
32720 | 342 |
|> DatatypeInterpretation.data (config, dt_names) |
343 |
|> pair dt_names |
|
344 |
end; |
|
5177 | 345 |
|
32721
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
346 |
|
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
347 |
(** declare existing type as datatype **) |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
348 |
|
32729 | 349 |
fun prove_rep_datatype config dt_names alt_names descr sorts raw_inject half_distinct raw_induct thy1 = |
32721
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
350 |
let |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
351 |
val raw_distinct = (map o maps) (fn thm => [thm, thm RS not_sym]) half_distinct; |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
352 |
val new_type_names = map Long_Name.base_name (the_default dt_names alt_names); |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
353 |
val (((inject, distinct), [induct]), thy2) = |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
354 |
thy1 |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
355 |
|> store_thmss "inject" new_type_names raw_inject |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
356 |
||>> store_thmss "distinct" new_type_names raw_distinct |
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
357 |
||> Sign.add_path (space_implode "_" new_type_names) |
32729 | 358 |
||>> PureThy.add_thms [((Binding.name "induct", raw_induct), [mk_case_names_induct descr])] |
359 |
||> Sign.restore_naming thy1; |
|
32722 | 360 |
in |
361 |
thy2 |
|
32728
2c55fc50f670
further unification of datatype and rep_datatype
haftmann
parents:
32727
diff
changeset
|
362 |
|> derive_datatype_props config dt_names alt_names [descr] sorts |
32907 | 363 |
induct inject distinct |
32722 | 364 |
end; |
32721
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
365 |
|
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
366 |
fun gen_rep_datatype prep_term config after_qed alt_names raw_ts thy = |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
367 |
let |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
368 |
fun constr_of_term (Const (c, T)) = (c, T) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
369 |
| constr_of_term t = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
370 |
error ("Not a constant: " ^ Syntax.string_of_term_global thy t); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
371 |
fun no_constr (c, T) = error ("Bad constructor: " |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
372 |
^ Sign.extern_const thy c ^ "::" |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
373 |
^ Syntax.string_of_typ_global thy T); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
374 |
fun type_of_constr (cT as (_, T)) = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
375 |
let |
29270
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29064
diff
changeset
|
376 |
val frees = OldTerm.typ_tfrees T; |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
377 |
val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) T |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
378 |
handle TYPE _ => no_constr cT |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
379 |
val _ = if has_duplicates (eq_fst (op =)) vs then no_constr cT else (); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
380 |
val _ = if length frees <> length vs then no_constr cT else (); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
381 |
in (tyco, (vs, cT)) end; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
382 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
383 |
val raw_cs = AList.group (op =) (map (type_of_constr o constr_of_term o prep_term thy) raw_ts); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
384 |
val _ = case map_filter (fn (tyco, _) => |
31784 | 385 |
if Symtab.defined (get_all thy) tyco then SOME tyco else NONE) raw_cs |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
386 |
of [] => () |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
387 |
| tycos => error ("Type(s) " ^ commas (map quote tycos) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
388 |
^ " already represented inductivly"); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
389 |
val raw_vss = maps (map (map snd o fst) o snd) raw_cs; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
390 |
val ms = case distinct (op =) (map length raw_vss) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
391 |
of [n] => 0 upto n - 1 |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
392 |
| _ => error ("Different types in given constructors"); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
393 |
fun inter_sort m = map (fn xs => nth xs m) raw_vss |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
394 |
|> Library.foldr1 (Sorts.inter_sort (Sign.classes_of thy)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
395 |
val sorts = map inter_sort ms; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
396 |
val vs = Name.names Name.context Name.aT sorts; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
397 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
398 |
fun norm_constr (raw_vs, (c, T)) = (c, map_atyps |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
399 |
(TFree o (the o AList.lookup (op =) (map fst raw_vs ~~ vs)) o fst o dest_TFree) T); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
400 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
401 |
val cs = map (apsnd (map norm_constr)) raw_cs; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
402 |
val dtyps_of_typ = map (dtyp_of_typ (map (rpair (map fst vs) o fst) cs)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
403 |
o fst o strip_type; |
32719 | 404 |
val dt_names = map fst cs; |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
405 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
406 |
fun mk_spec (i, (tyco, constr)) = (i, (tyco, |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
407 |
map (DtTFree o fst) vs, |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
408 |
(map o apsnd) dtyps_of_typ constr)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
409 |
val descr = map_index mk_spec cs; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
410 |
val injs = DatatypeProp.make_injs [descr] vs; |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
411 |
val half_distincts = map snd (DatatypeProp.make_distincts [descr] vs); |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
412 |
val ind = DatatypeProp.make_ind [descr] vs; |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27277
diff
changeset
|
413 |
val rules = (map o map o map) Logic.close_form [[[ind]], injs, half_distincts]; |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
414 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
415 |
fun after_qed' raw_thms = |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
416 |
let |
32729 | 417 |
val [[[raw_induct]], raw_inject, half_distinct] = |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
418 |
unflat rules (map Drule.zero_var_indexes_list raw_thms); |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
419 |
(*FIXME somehow dubious*) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
420 |
in |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
421 |
ProofContext.theory_result |
32729 | 422 |
(prove_rep_datatype config dt_names alt_names descr vs raw_inject half_distinct raw_induct) |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
423 |
#-> after_qed |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
424 |
end; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
425 |
in |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
426 |
thy |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
427 |
|> ProofContext.init |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
428 |
|> Proof.theorem_i NONE after_qed' ((map o map) (rpair []) (flat rules)) |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
429 |
end; |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
430 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
431 |
val rep_datatype = gen_rep_datatype Sign.cert_term; |
31735 | 432 |
val rep_datatype_cmd = gen_rep_datatype Syntax.read_term_global default_config (K I); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
433 |
|
5177 | 434 |
|
32717
0e787c721fa3
re-established reasonable inner outline for module
haftmann
parents:
32712
diff
changeset
|
435 |
(** definitional introduction of datatypes **) |
11958 | 436 |
|
32721
a5fcc7960681
emerging common infrastructure for datatype and rep_datatype
haftmann
parents:
32720
diff
changeset
|
437 |
fun gen_add_datatype prep_typ config new_type_names dts thy = |
5177 | 438 |
let |
20820
58693343905f
removed obsolete Datatype_Universe.thy (cf. Datatype.thy);
wenzelm
parents:
20715
diff
changeset
|
439 |
val _ = Theory.requires thy "Datatype" "datatype definitions"; |
5177 | 440 |
|
441 |
(* this theory is used just for parsing *) |
|
442 |
val tmp_thy = thy |> |
|
5892 | 443 |
Theory.copy |> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24711
diff
changeset
|
444 |
Sign.add_types (map (fn (tvs, tname, mx, _) => |
5177 | 445 |
(tname, length tvs, mx)) dts); |
446 |
||
5661 | 447 |
val (tyvars, _, _, _)::_ = dts; |
5177 | 448 |
val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) => |
30345 | 449 |
let val full_tname = Sign.full_name tmp_thy (Binding.map_name (Syntax.type_name mx) tname) |
18964 | 450 |
in (case duplicates (op =) tvs of |
33038 | 451 |
[] => if eq_set (op =) (tyvars, tvs) then ((full_tname, tvs), (tname, mx)) |
5661 | 452 |
else error ("Mutually recursive datatypes must have same type parameters") |
30345 | 453 |
| dups => error ("Duplicate parameter(s) for datatype " ^ quote (Binding.str_of tname) ^ |
5177 | 454 |
" : " ^ commas dups)) |
455 |
end) dts); |
|
32728
2c55fc50f670
further unification of datatype and rep_datatype
haftmann
parents:
32727
diff
changeset
|
456 |
val dt_names = map fst new_dts; |
5177 | 457 |
|
18964 | 458 |
val _ = (case duplicates (op =) (map fst new_dts) @ duplicates (op =) new_type_names of |
5177 | 459 |
[] => () | dups => error ("Duplicate datatypes: " ^ commas dups)); |
460 |
||
31361
3e900a2acaed
Fixed broken code dealing with alternative names.
berghofe
parents:
31247
diff
changeset
|
461 |
fun prep_dt_spec ((tvs, tname, mx, constrs), tname') (dts', constr_syntax, sorts, i) = |
5177 | 462 |
let |
21045 | 463 |
fun prep_constr (cname, cargs, mx') (constrs, constr_syntax', sorts') = |
5279 | 464 |
let |
33244 | 465 |
val (cargs', sorts'') = fold_map (prep_typ tmp_thy) cargs sorts'; |
466 |
val _ = |
|
467 |
(case subtract (op =) tvs (fold (curry OldTerm.add_typ_tfree_names) cargs' []) of |
|
5279 | 468 |
[] => () |
469 |
| vs => error ("Extra type variables on rhs: " ^ commas vs)) |
|
32124 | 470 |
in (constrs @ [(Sign.full_name_path tmp_thy tname' |
30345 | 471 |
(Binding.map_name (Syntax.const_name mx') cname), |
5177 | 472 |
map (dtyp_of_typ new_dts) cargs')], |
473 |
constr_syntax' @ [(cname, mx')], sorts'') |
|
30345 | 474 |
end handle ERROR msg => cat_error msg |
475 |
("The error above occured in constructor " ^ quote (Binding.str_of cname) ^ |
|
476 |
" of datatype " ^ quote (Binding.str_of tname)); |
|
5177 | 477 |
|
478 |
val (constrs', constr_syntax', sorts') = |
|
21045 | 479 |
fold prep_constr constrs ([], [], sorts) |
5177 | 480 |
|
8405 | 481 |
in |
18964 | 482 |
case duplicates (op =) (map fst constrs') of |
5177 | 483 |
[] => |
30345 | 484 |
(dts' @ [(i, (Sign.full_name tmp_thy (Binding.map_name (Syntax.type_name mx) tname), |
5177 | 485 |
map DtTFree tvs, constrs'))], |
486 |
constr_syntax @ [constr_syntax'], sorts', i + 1) |
|
487 |
| dups => error ("Duplicate constructors " ^ commas dups ^ |
|
30345 | 488 |
" in datatype " ^ quote (Binding.str_of tname)) |
5177 | 489 |
end; |
490 |
||
31361
3e900a2acaed
Fixed broken code dealing with alternative names.
berghofe
parents:
31247
diff
changeset
|
491 |
val (dts', constr_syntax, sorts', i) = |
3e900a2acaed
Fixed broken code dealing with alternative names.
berghofe
parents:
31247
diff
changeset
|
492 |
fold prep_dt_spec (dts ~~ new_type_names) ([], [], [], 0); |
33040 | 493 |
val sorts = sorts' @ (map (rpair (Sign.defaultS tmp_thy)) (subtract (op =) (map fst sorts') tyvars)); |
31784 | 494 |
val dt_info = get_all thy; |
20597 | 495 |
val (descr, _) = unfold_datatypes tmp_thy dts' sorts dt_info dts' i; |
14887 | 496 |
val _ = check_nonempty descr handle (exn as Datatype_Empty s) => |
31668
a616e56a5ec8
datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents:
31604
diff
changeset
|
497 |
if #strict config then error ("Nonemptiness check failed for datatype " ^ s) |
14887 | 498 |
else raise exn; |
32729 | 499 |
|
500 |
val _ = message config ("Constructing datatype(s) " ^ commas_quote new_type_names); |
|
32907 | 501 |
val ((inject, distinct, induct), thy') = thy |> |
32729 | 502 |
DatatypeRepProofs.representation_proofs config dt_info new_type_names descr sorts |
503 |
types_syntax constr_syntax (mk_case_names_induct (flat descr)); |
|
5177 | 504 |
in |
32729 | 505 |
derive_datatype_props config dt_names (SOME new_type_names) descr sorts |
32907 | 506 |
induct inject distinct thy' |
5177 | 507 |
end; |
508 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
509 |
val add_datatype = gen_add_datatype cert_typ; |
31735 | 510 |
val datatype_cmd = snd ooo gen_add_datatype read_typ default_config; |
5177 | 511 |
|
6360 | 512 |
|
513 |
(** package setup **) |
|
514 |
||
515 |
(* setup theory *) |
|
516 |
||
18708 | 517 |
val setup = |
24626
85eceef2edc7
introduced generic concepts for theory interpretators
haftmann
parents:
24624
diff
changeset
|
518 |
trfun_setup #> |
24711 | 519 |
DatatypeInterpretation.init; |
6360 | 520 |
|
521 |
(* outer syntax *) |
|
522 |
||
31735 | 523 |
local |
6360 | 524 |
|
31735 | 525 |
structure P = OuterParse and K = OuterKeyword |
6360 | 526 |
|
31735 | 527 |
fun prep_datatype_decls args = |
6360 | 528 |
let |
30345 | 529 |
val names = map |
530 |
(fn ((((NONE, _), t), _), _) => Binding.name_of t | ((((SOME t, _), _), _), _) => t) args; |
|
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12708
diff
changeset
|
531 |
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
|
532 |
(vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args; |
31735 | 533 |
in (names, specs) end; |
534 |
||
535 |
val parse_datatype_decl = |
|
536 |
(Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.binding -- P.opt_infix -- |
|
537 |
(P.$$$ "=" |-- P.enum1 "|" (P.binding -- Scan.repeat P.typ -- P.opt_mixfix))); |
|
538 |
||
539 |
val parse_datatype_decls = P.and_list1 parse_datatype_decl >> prep_datatype_decls; |
|
540 |
||
541 |
in |
|
6360 | 542 |
|
24867 | 543 |
val _ = |
6723 | 544 |
OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl |
31735 | 545 |
(parse_datatype_decls >> (fn (names, specs) => Toplevel.theory (datatype_cmd names specs))); |
6360 | 546 |
|
24867 | 547 |
val _ = |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
548 |
OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_goal |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
549 |
(Scan.option (P.$$$ "(" |-- Scan.repeat1 P.name --| P.$$$ ")") -- Scan.repeat1 P.term |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
550 |
>> (fn (alt_names, ts) => Toplevel.print |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27097
diff
changeset
|
551 |
o Toplevel.theory_to_proof (rep_datatype_cmd alt_names ts))); |
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
552 |
|
30391
d930432adb13
adapted to simplified ThyOutput.antiquotation interface;
wenzelm
parents:
30364
diff
changeset
|
553 |
end; |
d930432adb13
adapted to simplified ThyOutput.antiquotation interface;
wenzelm
parents:
30364
diff
changeset
|
554 |
|
6385
5a6570458d9e
rep_datatype: '_i' version, attributes, outer syntax;
wenzelm
parents:
6360
diff
changeset
|
555 |
end; |