author | haftmann |
Tue, 29 Jul 2008 08:15:40 +0200 | |
changeset 27691 | ce171cbd4b93 |
parent 27353 | 71c4dd53d4cb |
child 28662 | 64ab5bb68d4c |
permissions | -rw-r--r-- |
4866 | 1 |
(* Title: HOL/Tools/typedef_package.ML |
2 |
ID: $Id$ |
|
16458 | 3 |
Author: Markus Wenzel and Stefan Berghofer, TU Muenchen |
4866 | 4 |
|
21352 | 5 |
Gordon/HOL-style type definitions: create a new syntactic type |
6 |
represented by a non-empty subset. |
|
4866 | 7 |
*) |
8 |
||
9 |
signature TYPEDEF_PACKAGE = |
|
10 |
sig |
|
19705 | 11 |
type info = |
12 |
{rep_type: typ, abs_type: typ, Rep_name: string, Abs_name: string, |
|
13 |
type_definition: thm, set_def: thm option, Rep: thm, Rep_inverse: thm, |
|
14 |
Abs_inverse: thm, Rep_inject: thm, Abs_inject: thm, Rep_cases: thm, |
|
15 |
Abs_cases: thm, Rep_induct: thm, Abs_induct: thm}; |
|
16 |
val get_info: theory -> string -> info option |
|
11827 | 17 |
val add_typedef: bool -> string option -> bstring * string list * mixfix -> |
20483
04aa552a83bc
TypedefPackage.add_typedef_* now yields name of introduced type constructor
haftmann
parents:
20462
diff
changeset
|
18 |
string -> (bstring * bstring) option -> tactic -> theory -> (string * info) * theory |
11827 | 19 |
val add_typedef_i: bool -> string option -> bstring * string list * mixfix -> |
20483
04aa552a83bc
TypedefPackage.add_typedef_* now yields name of introduced type constructor
haftmann
parents:
20462
diff
changeset
|
20 |
term -> (bstring * bstring) option -> tactic -> theory -> (string * info) * theory |
17339 | 21 |
val typedef: (bool * string) * (bstring * string list * mixfix) * string |
22 |
* (string * string) option -> theory -> Proof.state |
|
23 |
val typedef_i: (bool * string) * (bstring * string list * mixfix) * term |
|
24 |
* (string * string) option -> theory -> Proof.state |
|
25513 | 25 |
val interpretation: (string -> theory -> theory) -> theory -> theory |
25535 | 26 |
val setup: theory -> theory |
4866 | 27 |
end; |
28 |
||
29 |
structure TypedefPackage: TYPEDEF_PACKAGE = |
|
30 |
struct |
|
31 |
||
10280 | 32 |
(** theory context references **) |
33 |
||
11608 | 34 |
val type_definitionN = "Typedef.type_definition"; |
10280 | 35 |
|
13413 | 36 |
val Rep = thm "type_definition.Rep"; |
37 |
val Rep_inverse = thm "type_definition.Rep_inverse"; |
|
38 |
val Abs_inverse = thm "type_definition.Abs_inverse"; |
|
39 |
val Rep_inject = thm "type_definition.Rep_inject"; |
|
40 |
val Abs_inject = thm "type_definition.Abs_inject"; |
|
41 |
val Rep_cases = thm "type_definition.Rep_cases"; |
|
42 |
val Abs_cases = thm "type_definition.Abs_cases"; |
|
43 |
val Rep_induct = thm "type_definition.Rep_induct"; |
|
44 |
val Abs_induct = thm "type_definition.Abs_induct"; |
|
10280 | 45 |
|
46 |
||
47 |
||
17922 | 48 |
(** type definitions **) |
49 |
||
50 |
(* theory data *) |
|
15259 | 51 |
|
19705 | 52 |
type info = |
53 |
{rep_type: typ, abs_type: typ, Rep_name: string, Abs_name: string, |
|
54 |
type_definition: thm, set_def: thm option, Rep: thm, Rep_inverse: thm, |
|
55 |
Abs_inverse: thm, Rep_inject: thm, Abs_inject: thm, Rep_cases: thm, |
|
56 |
Abs_cases: thm, Rep_induct: thm, Abs_induct: thm}; |
|
19459 | 57 |
|
16458 | 58 |
structure TypedefData = TheoryDataFun |
22846 | 59 |
( |
19705 | 60 |
type T = info Symtab.table; |
15259 | 61 |
val empty = Symtab.empty; |
62 |
val copy = I; |
|
16458 | 63 |
val extend = I; |
19617 | 64 |
fun merge _ tabs : T = Symtab.merge (K true) tabs; |
22846 | 65 |
); |
15259 | 66 |
|
19705 | 67 |
val get_info = Symtab.lookup o TypedefData.get; |
68 |
fun put_info name info = TypedefData.map (Symtab.update (name, info)); |
|
15259 | 69 |
|
70 |
||
6383 | 71 |
(* prepare_typedef *) |
72 |
||
18678 | 73 |
fun err_in_typedef msg name = |
74 |
cat_error msg ("The error(s) above occurred in typedef " ^ quote name); |
|
6383 | 75 |
|
21352 | 76 |
fun declare_type_name a = Variable.declare_constraints (Logic.mk_type (TFree (a, dummyS))); |
77 |
||
25535 | 78 |
structure TypedefInterpretation = InterpretationFun(type T = string val eq = op =); |
79 |
val interpretation = TypedefInterpretation.interpretation; |
|
80 |
||
11822 | 81 |
fun prepare_typedef prep_term def name (t, vs, mx) raw_set opt_morphs thy = |
4866 | 82 |
let |
11608 | 83 |
val _ = Theory.requires thy "Typedef" "typedefs"; |
21352 | 84 |
val ctxt = ProofContext.init thy; |
16458 | 85 |
val full = Sign.full_name thy; |
4866 | 86 |
|
87 |
(*rhs*) |
|
10280 | 88 |
val full_name = full name; |
21352 | 89 |
val set = prep_term (ctxt |> fold declare_type_name vs) raw_set; |
90 |
val setT = Term.fastype_of set; |
|
17280 | 91 |
val rhs_tfrees = Term.add_tfrees set []; |
92 |
val rhs_tfreesT = Term.add_tfreesT setT []; |
|
4866 | 93 |
val oldT = HOLogic.dest_setT setT handle TYPE _ => |
24920 | 94 |
error ("Not a set type: " ^ quote (Syntax.string_of_typ ctxt setT)); |
11426
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
95 |
fun mk_nonempty A = |
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
96 |
HOLogic.mk_Trueprop (HOLogic.mk_exists ("x", oldT, HOLogic.mk_mem (Free ("x", oldT), A))); |
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
97 |
val goal = mk_nonempty set; |
19473 | 98 |
val goal_pat = mk_nonempty (Var (the_default (name, 0) (Syntax.read_variable name), setT)); |
4866 | 99 |
|
100 |
(*lhs*) |
|
17280 | 101 |
val defS = Sign.defaultS thy; |
19473 | 102 |
val lhs_tfrees = map (fn v => (v, the_default defS (AList.lookup (op =) rhs_tfrees v))) vs; |
17280 | 103 |
val args_setT = lhs_tfrees |
104 |
|> filter (member (op =) rhs_tfrees andf (not o member (op =) rhs_tfreesT)) |
|
105 |
|> map TFree; |
|
106 |
||
4866 | 107 |
val tname = Syntax.type_name t mx; |
10280 | 108 |
val full_tname = full tname; |
109 |
val newT = Type (full_tname, map TFree lhs_tfrees); |
|
4866 | 110 |
|
19473 | 111 |
val (Rep_name, Abs_name) = the_default ("Rep_" ^ name, "Abs_" ^ name) opt_morphs; |
19391 | 112 |
val setT' = map Term.itselfT args_setT ---> setT; |
17280 | 113 |
val setC = Term.list_comb (Const (full_name, setT'), map Logic.mk_type args_setT); |
10280 | 114 |
val RepC = Const (full Rep_name, newT --> oldT); |
115 |
val AbsC = Const (full Abs_name, oldT --> newT); |
|
4866 | 116 |
val x_new = Free ("x", newT); |
117 |
val y_old = Free ("y", oldT); |
|
10280 | 118 |
|
11822 | 119 |
val set' = if def then setC else set; |
4866 | 120 |
|
10280 | 121 |
val typedef_name = "type_definition_" ^ name; |
122 |
val typedefC = |
|
123 |
Const (type_definitionN, (newT --> oldT) --> (oldT --> newT) --> setT --> HOLogic.boolT); |
|
11426
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
124 |
val typedef_prop = |
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
125 |
Logic.mk_implies (goal, HOLogic.mk_Trueprop (typedefC $ RepC $ AbsC $ set')); |
19705 | 126 |
val typedef_deps = Term.fold_aterms (fn Const c => insert (op =) c | _ => I) set' []; |
4866 | 127 |
|
19705 | 128 |
fun add_def eq thy = |
129 |
if def then |
|
18358 | 130 |
thy |
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
27353
diff
changeset
|
131 |
|> PureThy.add_defs false [Thm.no_attributes eq] |
19705 | 132 |
|-> (fn [th] => pair (SOME th)) |
133 |
else (NONE, thy); |
|
18358 | 134 |
|
21352 | 135 |
fun typedef_result nonempty = |
25495 | 136 |
ObjectLogic.typedecl (t, vs, mx) |
25458
ba8f5e4fa336
separated typedecl module, providing typedecl command with interpretation
haftmann
parents:
24926
diff
changeset
|
137 |
#> snd |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24509
diff
changeset
|
138 |
#> Sign.add_consts_i |
17280 | 139 |
((if def then [(name, setT', NoSyn)] else []) @ |
6383 | 140 |
[(Rep_name, newT --> oldT, NoSyn), |
141 |
(Abs_name, oldT --> newT, NoSyn)]) |
|
24255 | 142 |
#> add_def (PrimitiveDefs.mk_defpair (setC, set)) |
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
27353
diff
changeset
|
143 |
##>> PureThy.add_axioms [((typedef_name, typedef_prop), |
20046 | 144 |
[apsnd (fn cond_axm => nonempty RS cond_axm)])] |
21352 | 145 |
##> Theory.add_deps "" (dest_Const RepC) typedef_deps |
146 |
##> Theory.add_deps "" (dest_Const AbsC) typedef_deps |
|
147 |
#-> (fn (set_def, [type_definition]) => fn thy1 => |
|
11822 | 148 |
let |
149 |
fun make th = Drule.standard (th OF [type_definition]); |
|
19342
094a1c071c8e
added functions for definitional code generation
haftmann
parents:
18964
diff
changeset
|
150 |
val abs_inject = make Abs_inject; |
094a1c071c8e
added functions for definitional code generation
haftmann
parents:
18964
diff
changeset
|
151 |
val abs_inverse = make Abs_inverse; |
18377 | 152 |
val ([Rep, Rep_inverse, Abs_inverse, Rep_inject, Abs_inject, |
19705 | 153 |
Rep_cases, Abs_cases, Rep_induct, Abs_induct], thy2) = |
154 |
thy1 |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24509
diff
changeset
|
155 |
|> Sign.add_path name |
12338
de0f4a63baa5
renamed class "term" to "type" (actually "HOL.type");
wenzelm
parents:
12043
diff
changeset
|
156 |
|> PureThy.add_thms |
11822 | 157 |
([((Rep_name, make Rep), []), |
158 |
((Rep_name ^ "_inverse", make Rep_inverse), []), |
|
19342
094a1c071c8e
added functions for definitional code generation
haftmann
parents:
18964
diff
changeset
|
159 |
((Abs_name ^ "_inverse", abs_inverse), []), |
11822 | 160 |
((Rep_name ^ "_inject", make Rep_inject), []), |
19342
094a1c071c8e
added functions for definitional code generation
haftmann
parents:
18964
diff
changeset
|
161 |
((Abs_name ^ "_inject", abs_inject), []), |
11822 | 162 |
((Rep_name ^ "_cases", make Rep_cases), |
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset
|
163 |
[RuleCases.case_names [Rep_name], Induct.cases_pred full_name]), |
11822 | 164 |
((Abs_name ^ "_cases", make Abs_cases), |
24830
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24712
diff
changeset
|
165 |
[RuleCases.case_names [Abs_name], Induct.cases_type full_tname]), |
11822 | 166 |
((Rep_name ^ "_induct", make Rep_induct), |
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset
|
167 |
[RuleCases.case_names [Rep_name], Induct.induct_pred full_name]), |
11822 | 168 |
((Abs_name ^ "_induct", make Abs_induct), |
24830
a7b3ab44d993
moved Pure/Isar/induct_attrib.ML and Provers/induct_method.ML to Tools/induct.ML;
wenzelm
parents:
24712
diff
changeset
|
169 |
[RuleCases.case_names [Abs_name], Induct.induct_type full_tname])]) |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24509
diff
changeset
|
170 |
||> Sign.parent_path; |
19705 | 171 |
val info = {rep_type = oldT, abs_type = newT, |
172 |
Rep_name = full Rep_name, Abs_name = full Abs_name, |
|
173 |
type_definition = type_definition, set_def = set_def, |
|
174 |
Rep = Rep, Rep_inverse = Rep_inverse, Abs_inverse = Abs_inverse, |
|
175 |
Rep_inject = Rep_inject, Abs_inject = Abs_inject, Rep_cases = Rep_cases, |
|
11822 | 176 |
Abs_cases = Abs_cases, Rep_induct = Rep_induct, Abs_induct = Abs_induct}; |
25535 | 177 |
in |
178 |
thy2 |
|
179 |
|> put_info full_tname info |
|
180 |
|> TypedefInterpretation.data full_tname |
|
181 |
|> pair (full_tname, info) |
|
182 |
end); |
|
6383 | 183 |
|
4866 | 184 |
|
185 |
(* errors *) |
|
186 |
||
187 |
fun show_names pairs = commas_quote (map fst pairs); |
|
188 |
||
189 |
val illegal_vars = |
|
190 |
if null (term_vars set) andalso null (term_tvars set) then [] |
|
191 |
else ["Illegal schematic variable(s) on rhs"]; |
|
192 |
||
193 |
val dup_lhs_tfrees = |
|
18964 | 194 |
(case duplicates (op =) lhs_tfrees of [] => [] |
4866 | 195 |
| dups => ["Duplicate type variables on lhs: " ^ show_names dups]); |
196 |
||
197 |
val extra_rhs_tfrees = |
|
17280 | 198 |
(case fold (remove (op =)) lhs_tfrees rhs_tfrees of [] => [] |
4866 | 199 |
| extras => ["Extra type variables on rhs: " ^ show_names extras]); |
200 |
||
201 |
val illegal_frees = |
|
202 |
(case term_frees set of [] => [] |
|
203 |
| xs => ["Illegal variables on rhs: " ^ show_names (map dest_Free xs)]); |
|
204 |
||
205 |
val errs = illegal_vars @ dup_lhs_tfrees @ extra_rhs_tfrees @ illegal_frees; |
|
11426
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
206 |
val _ = if null errs then () else error (cat_lines errs); |
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
207 |
|
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
208 |
(*test theory errors now!*) |
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
209 |
val test_thy = Theory.copy thy; |
21352 | 210 |
val _ = test_thy |
19342
094a1c071c8e
added functions for definitional code generation
haftmann
parents:
18964
diff
changeset
|
211 |
|> typedef_result (setmp quick_and_dirty true (SkipProof.make_thm test_thy) goal); |
11426
f280d4b29a2c
abtract non-emptiness statements (no longer use Eps);
wenzelm
parents:
10697
diff
changeset
|
212 |
|
21352 | 213 |
in (set, goal, goal_pat, typedef_result) end |
18678 | 214 |
handle ERROR msg => err_in_typedef msg name; |
4866 | 215 |
|
216 |
||
6383 | 217 |
(* add_typedef interfaces *) |
4866 | 218 |
|
17339 | 219 |
local |
220 |
||
17922 | 221 |
fun gen_typedef prep_term def opt_name typ set opt_morphs tac thy = |
6383 | 222 |
let |
17922 | 223 |
val name = the_default (#1 typ) opt_name; |
21352 | 224 |
val (set, goal, _, typedef_result) = |
11822 | 225 |
prepare_typedef prep_term def name typ set opt_morphs thy; |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26478
diff
changeset
|
226 |
val non_empty = Goal.prove_global thy [] [] goal (K tac) |
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26478
diff
changeset
|
227 |
handle ERROR msg => cat_error msg |
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26478
diff
changeset
|
228 |
("Failed to prove non-emptiness of " ^ quote (Syntax.string_of_term_global thy set)); |
26478 | 229 |
in typedef_result non_empty thy end; |
4866 | 230 |
|
17339 | 231 |
in |
232 |
||
24509
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24255
diff
changeset
|
233 |
val add_typedef = gen_typedef Syntax.read_term; |
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24255
diff
changeset
|
234 |
val add_typedef_i = gen_typedef Syntax.check_term; |
4866 | 235 |
|
17339 | 236 |
end; |
4866 | 237 |
|
17339 | 238 |
|
239 |
(* Isar typedef interface *) |
|
6383 | 240 |
|
17339 | 241 |
local |
242 |
||
243 |
fun gen_typedef prep_term ((def, name), typ, set, opt_morphs) thy = |
|
11822 | 244 |
let |
19705 | 245 |
val (_, goal, goal_pat, typedef_result) = |
13443 | 246 |
prepare_typedef prep_term def name typ set opt_morphs thy; |
21352 | 247 |
fun after_qed [[th]] = ProofContext.theory (snd o typedef_result th); |
21434 | 248 |
in Proof.theorem_i NONE after_qed [[(goal, [goal_pat])]] (ProofContext.init thy) end; |
17339 | 249 |
|
250 |
in |
|
6383 | 251 |
|
24509
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24255
diff
changeset
|
252 |
val typedef = gen_typedef Syntax.read_term; |
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24255
diff
changeset
|
253 |
val typedef_i = gen_typedef Syntax.check_term; |
17339 | 254 |
|
19705 | 255 |
end; |
15259 | 256 |
|
257 |
||
258 |
||
6383 | 259 |
(** outer syntax **) |
260 |
||
17057 | 261 |
local structure P = OuterParse and K = OuterKeyword in |
6383 | 262 |
|
27353
71c4dd53d4cb
moved global keywords from OuterSyntax to OuterKeyword, tuned interfaces;
wenzelm
parents:
26939
diff
changeset
|
263 |
val _ = OuterKeyword.keyword "morphisms"; |
24867 | 264 |
|
17339 | 265 |
val typedef_decl = |
16126
3ba9eb7ea366
fixed outer syntax: allow type_args with parentheses;
wenzelm
parents:
15570
diff
changeset
|
266 |
Scan.optional (P.$$$ "(" |-- |
3ba9eb7ea366
fixed outer syntax: allow type_args with parentheses;
wenzelm
parents:
15570
diff
changeset
|
267 |
((P.$$$ "open" >> K false) -- Scan.option P.name || P.name >> (fn s => (true, SOME s))) |
3ba9eb7ea366
fixed outer syntax: allow type_args with parentheses;
wenzelm
parents:
15570
diff
changeset
|
268 |
--| P.$$$ ")") (true, NONE) -- |
11744 | 269 |
(P.type_args -- P.name) -- P.opt_infix -- (P.$$$ "=" |-- P.term) -- |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12694
diff
changeset
|
270 |
Scan.option (P.$$$ "morphisms" |-- P.!!! (P.name -- P.name)); |
6357 | 271 |
|
17339 | 272 |
fun mk_typedef ((((((def, opt_name), (vs, t)), mx), A), morphs)) = |
19473 | 273 |
typedef ((def, the_default (Syntax.type_name t mx) opt_name), (t, vs, mx), A, morphs); |
6357 | 274 |
|
24867 | 275 |
val _ = |
6723 | 276 |
OuterSyntax.command "typedef" "HOL type definition (requires non-emptiness proof)" K.thy_goal |
17339 | 277 |
(typedef_decl >> (Toplevel.print oo (Toplevel.theory_to_proof o mk_typedef))); |
6357 | 278 |
|
25535 | 279 |
val setup = TypedefInterpretation.init; |
280 |
||
4866 | 281 |
end; |
6383 | 282 |
|
283 |
end; |