wenzelm@19
|
1 |
(* Title: Pure/sign.ML
|
clasohm@0
|
2 |
ID: $Id$
|
wenzelm@251
|
3 |
Author: Lawrence C Paulson and Markus Wenzel
|
clasohm@0
|
4 |
|
wenzelm@16442
|
5 |
Logical signature content: naming conventions, concrete syntax, type
|
wenzelm@18062
|
6 |
signature, polymorphic constants.
|
clasohm@0
|
7 |
*)
|
clasohm@0
|
8 |
|
wenzelm@16442
|
9 |
signature SIGN_THEORY =
|
wenzelm@3791
|
10 |
sig
|
wenzelm@16442
|
11 |
val add_defsort: string -> theory -> theory
|
wenzelm@16442
|
12 |
val add_defsort_i: sort -> theory -> theory
|
wenzelm@16442
|
13 |
val add_types: (bstring * int * mixfix) list -> theory -> theory
|
wenzelm@16442
|
14 |
val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory
|
wenzelm@16442
|
15 |
val add_nonterminals: bstring list -> theory -> theory
|
wenzelm@16442
|
16 |
val add_tyabbrs: (bstring * string list * string * mixfix) list -> theory -> theory
|
wenzelm@16442
|
17 |
val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> theory -> theory
|
wenzelm@16442
|
18 |
val add_syntax: (bstring * string * mixfix) list -> theory -> theory
|
wenzelm@16442
|
19 |
val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
|
wenzelm@20784
|
20 |
val add_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
|
wenzelm@20784
|
21 |
val add_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
|
wenzelm@20784
|
22 |
val del_modesyntax: Syntax.mode -> (bstring * string * mixfix) list -> theory -> theory
|
wenzelm@20784
|
23 |
val del_modesyntax_i: Syntax.mode -> (bstring * typ * mixfix) list -> theory -> theory
|
wenzelm@16442
|
24 |
val add_consts: (bstring * string * mixfix) list -> theory -> theory
|
wenzelm@16442
|
25 |
val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
|
paulson@1501
|
26 |
val add_trfuns:
|
wenzelm@4344
|
27 |
(string * (ast list -> ast)) list *
|
wenzelm@4344
|
28 |
(string * (term list -> term)) list *
|
wenzelm@4344
|
29 |
(string * (term list -> term)) list *
|
wenzelm@16442
|
30 |
(string * (ast list -> ast)) list -> theory -> theory
|
wenzelm@2385
|
31 |
val add_trfunsT:
|
wenzelm@16442
|
32 |
(string * (bool -> typ -> term list -> term)) list -> theory -> theory
|
wenzelm@14645
|
33 |
val add_advanced_trfuns:
|
wenzelm@21772
|
34 |
(string * (Proof.context -> ast list -> ast)) list *
|
wenzelm@21772
|
35 |
(string * (Proof.context -> term list -> term)) list *
|
wenzelm@21772
|
36 |
(string * (Proof.context -> term list -> term)) list *
|
wenzelm@21772
|
37 |
(string * (Proof.context -> ast list -> ast)) list -> theory -> theory
|
wenzelm@14645
|
38 |
val add_advanced_trfunsT:
|
wenzelm@21772
|
39 |
(string * (Proof.context -> bool -> typ -> term list -> term)) list -> theory -> theory
|
wenzelm@2693
|
40 |
val add_tokentrfuns:
|
wenzelm@23660
|
41 |
(string * string * (string -> output * int)) list -> theory -> theory
|
wenzelm@23660
|
42 |
val add_mode_tokentrfuns: string -> (string * (string -> output * int)) list
|
wenzelm@16442
|
43 |
-> theory -> theory
|
wenzelm@16442
|
44 |
val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
|
wenzelm@19258
|
45 |
val del_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
|
wenzelm@16442
|
46 |
val add_trrules_i: ast Syntax.trrule list -> theory -> theory
|
wenzelm@19258
|
47 |
val del_trrules_i: ast Syntax.trrule list -> theory -> theory
|
wenzelm@16442
|
48 |
val add_path: string -> theory -> theory
|
wenzelm@16442
|
49 |
val parent_path: theory -> theory
|
wenzelm@16442
|
50 |
val root_path: theory -> theory
|
wenzelm@16442
|
51 |
val absolute_path: theory -> theory
|
wenzelm@16442
|
52 |
val local_path: theory -> theory
|
wenzelm@19013
|
53 |
val no_base_names: theory -> theory
|
wenzelm@16442
|
54 |
val qualified_names: theory -> theory
|
wenzelm@19054
|
55 |
val sticky_prefix: string -> theory -> theory
|
wenzelm@16442
|
56 |
val restore_naming: theory -> theory -> theory
|
wenzelm@16442
|
57 |
end
|
clasohm@0
|
58 |
|
wenzelm@16442
|
59 |
signature SIGN =
|
wenzelm@5642
|
60 |
sig
|
wenzelm@16442
|
61 |
val rep_sg: theory ->
|
wenzelm@16442
|
62 |
{naming: NameSpace.naming,
|
wenzelm@16597
|
63 |
syn: Syntax.syntax,
|
wenzelm@16442
|
64 |
tsig: Type.tsig,
|
wenzelm@18062
|
65 |
consts: Consts.T}
|
wenzelm@16442
|
66 |
val naming_of: theory -> NameSpace.naming
|
wenzelm@16442
|
67 |
val base_name: string -> bstring
|
wenzelm@16442
|
68 |
val full_name: theory -> bstring -> string
|
wenzelm@16442
|
69 |
val full_name_path: theory -> string -> bstring -> string
|
wenzelm@16442
|
70 |
val declare_name: theory -> string -> NameSpace.T -> NameSpace.T
|
wenzelm@16442
|
71 |
val syn_of: theory -> Syntax.syntax
|
wenzelm@16442
|
72 |
val tsig_of: theory -> Type.tsig
|
wenzelm@19642
|
73 |
val classes_of: theory -> Sorts.algebra
|
wenzelm@21932
|
74 |
val all_classes: theory -> class list
|
wenzelm@19407
|
75 |
val super_classes: theory -> class -> class list
|
wenzelm@24732
|
76 |
val minimize_sort: theory -> sort -> sort
|
wenzelm@24732
|
77 |
val complete_sort: theory -> sort -> sort
|
wenzelm@16442
|
78 |
val defaultS: theory -> sort
|
wenzelm@16442
|
79 |
val subsort: theory -> sort * sort -> bool
|
wenzelm@16442
|
80 |
val of_sort: theory -> typ * sort -> bool
|
wenzelm@16442
|
81 |
val witness_sorts: theory -> sort list -> sort list -> (typ * sort) list
|
wenzelm@16442
|
82 |
val universal_witness: theory -> (typ * sort) option
|
wenzelm@16655
|
83 |
val all_sorts_nonempty: theory -> bool
|
wenzelm@24732
|
84 |
val is_logtype: theory -> string -> bool
|
wenzelm@16442
|
85 |
val typ_instance: theory -> typ * typ -> bool
|
wenzelm@19427
|
86 |
val typ_equiv: theory -> typ * typ -> bool
|
wenzelm@16941
|
87 |
val typ_match: theory -> typ * typ -> Type.tyenv -> Type.tyenv
|
wenzelm@16941
|
88 |
val typ_unify: theory -> typ * typ -> Type.tyenv * int -> Type.tyenv * int
|
wenzelm@18967
|
89 |
val consts_of: theory -> Consts.T
|
haftmann@17037
|
90 |
val the_const_constraint: theory -> string -> typ
|
wenzelm@16442
|
91 |
val const_type: theory -> string -> typ option
|
wenzelm@16442
|
92 |
val the_const_type: theory -> string -> typ
|
wenzelm@16442
|
93 |
val declared_tyname: theory -> string -> bool
|
wenzelm@16442
|
94 |
val declared_const: theory -> string -> bool
|
wenzelm@18062
|
95 |
val const_monomorphic: theory -> string -> bool
|
wenzelm@21183
|
96 |
val const_syntax_name: theory -> string -> string
|
wenzelm@18146
|
97 |
val const_typargs: theory -> string * typ -> typ list
|
wenzelm@18164
|
98 |
val const_instance: theory -> string * typ list -> typ
|
wenzelm@16442
|
99 |
val class_space: theory -> NameSpace.T
|
wenzelm@16442
|
100 |
val type_space: theory -> NameSpace.T
|
wenzelm@16442
|
101 |
val const_space: theory -> NameSpace.T
|
wenzelm@16442
|
102 |
val intern_class: theory -> xstring -> string
|
wenzelm@16442
|
103 |
val extern_class: theory -> string -> xstring
|
wenzelm@16442
|
104 |
val intern_type: theory -> xstring -> string
|
wenzelm@16442
|
105 |
val extern_type: theory -> string -> xstring
|
wenzelm@16442
|
106 |
val intern_const: theory -> xstring -> string
|
wenzelm@16442
|
107 |
val extern_const: theory -> string -> xstring
|
wenzelm@16442
|
108 |
val intern_sort: theory -> sort -> sort
|
wenzelm@16442
|
109 |
val extern_sort: theory -> sort -> sort
|
wenzelm@16442
|
110 |
val intern_typ: theory -> typ -> typ
|
wenzelm@16442
|
111 |
val extern_typ: theory -> typ -> typ
|
wenzelm@16442
|
112 |
val intern_term: theory -> term -> term
|
wenzelm@18994
|
113 |
val extern_term: (string -> xstring) -> theory -> term -> term
|
wenzelm@16442
|
114 |
val intern_tycons: theory -> typ -> typ
|
wenzelm@16442
|
115 |
val pretty_term: theory -> term -> Pretty.T
|
wenzelm@16442
|
116 |
val pretty_typ: theory -> typ -> Pretty.T
|
wenzelm@16442
|
117 |
val pretty_sort: theory -> sort -> Pretty.T
|
wenzelm@16442
|
118 |
val string_of_term: theory -> term -> string
|
wenzelm@16442
|
119 |
val string_of_typ: theory -> typ -> string
|
wenzelm@16442
|
120 |
val string_of_sort: theory -> sort -> string
|
wenzelm@16442
|
121 |
val pp: theory -> Pretty.pp
|
wenzelm@19462
|
122 |
val arity_number: theory -> string -> int
|
wenzelm@19462
|
123 |
val arity_sorts: theory -> string -> sort -> sort list
|
wenzelm@16442
|
124 |
val certify_class: theory -> class -> class
|
wenzelm@16442
|
125 |
val certify_sort: theory -> sort -> sort
|
wenzelm@16442
|
126 |
val certify_typ: theory -> typ -> typ
|
wenzelm@24273
|
127 |
val certify_typ_mode: Type.mode -> theory -> typ -> typ
|
wenzelm@24674
|
128 |
val certify': bool -> Pretty.pp -> bool -> Consts.T -> theory -> term -> term * typ * int
|
wenzelm@18967
|
129 |
val certify_term: theory -> term -> term * typ * int
|
wenzelm@18967
|
130 |
val certify_prop: theory -> term -> term * typ * int
|
wenzelm@16494
|
131 |
val cert_term: theory -> term -> term
|
wenzelm@16494
|
132 |
val cert_prop: theory -> term -> term
|
wenzelm@21741
|
133 |
val no_frees: Pretty.pp -> term -> term
|
wenzelm@18941
|
134 |
val no_vars: Pretty.pp -> term -> term
|
wenzelm@24981
|
135 |
val cert_def: Proof.context -> term -> (string * typ) * term
|
wenzelm@19244
|
136 |
val read_class: theory -> xstring -> class
|
wenzelm@19244
|
137 |
val read_arity: theory -> xstring * string list * string -> arity
|
wenzelm@19244
|
138 |
val cert_arity: theory -> arity -> arity
|
wenzelm@22765
|
139 |
val get_sort: theory ->
|
wenzelm@22765
|
140 |
(indexname -> sort option) -> (indexname * sort) list -> indexname -> sort
|
wenzelm@22683
|
141 |
val read_def_typ: theory * (indexname -> sort option) -> string -> typ
|
wenzelm@22683
|
142 |
val read_typ: theory -> string -> typ
|
wenzelm@22683
|
143 |
val read_typ_syntax: theory -> string -> typ
|
wenzelm@22683
|
144 |
val read_typ_abbrev: theory -> string -> typ
|
wenzelm@16442
|
145 |
val read_tyname: theory -> string -> typ
|
wenzelm@16442
|
146 |
val read_const: theory -> string -> term
|
wenzelm@18967
|
147 |
val read_def_terms': Pretty.pp -> (string -> bool) -> Syntax.syntax -> Consts.T ->
|
wenzelm@22696
|
148 |
(string -> string option) -> Proof.context ->
|
wenzelm@22696
|
149 |
(indexname -> typ option) * (indexname -> sort option) ->
|
wenzelm@20155
|
150 |
Name.context -> bool -> (string * typ) list -> term list * (indexname * typ) list
|
wenzelm@16442
|
151 |
val read_def_terms:
|
wenzelm@16442
|
152 |
theory * (indexname -> typ option) * (indexname -> sort option) ->
|
wenzelm@16442
|
153 |
string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
|
wenzelm@16442
|
154 |
val simple_read_term: theory -> typ -> string -> term
|
wenzelm@16494
|
155 |
val read_term: theory -> string -> term
|
wenzelm@16494
|
156 |
val read_prop: theory -> string -> term
|
wenzelm@24973
|
157 |
val declare_const: Markup.property list -> bstring * typ * mixfix -> theory -> term * theory
|
wenzelm@24949
|
158 |
val notation: bool -> Syntax.mode -> (term * mixfix) list -> theory -> theory
|
wenzelm@24776
|
159 |
val add_abbrev: string -> Markup.property list ->
|
wenzelm@24776
|
160 |
bstring * term -> theory -> (term * term) * theory
|
wenzelm@25049
|
161 |
val revert_abbrev: string -> string -> theory -> theory
|
wenzelm@16442
|
162 |
include SIGN_THEORY
|
wenzelm@24761
|
163 |
val add_const_constraint: string * typ option -> theory -> theory
|
wenzelm@22811
|
164 |
val primitive_class: string * class list -> theory -> theory
|
wenzelm@22811
|
165 |
val primitive_classrel: class * class -> theory -> theory
|
wenzelm@22811
|
166 |
val primitive_arity: arity -> theory -> theory
|
wenzelm@22796
|
167 |
val hide_classes: bool -> xstring list -> theory -> theory
|
wenzelm@22796
|
168 |
val hide_classes_i: bool -> string list -> theory -> theory
|
wenzelm@22796
|
169 |
val hide_types: bool -> xstring list -> theory -> theory
|
wenzelm@22796
|
170 |
val hide_types_i: bool -> string list -> theory -> theory
|
wenzelm@22796
|
171 |
val hide_consts: bool -> xstring list -> theory -> theory
|
wenzelm@22796
|
172 |
val hide_consts_i: bool -> string list -> theory -> theory
|
wenzelm@22796
|
173 |
val hide_names: bool -> string * xstring list -> theory -> theory
|
wenzelm@22796
|
174 |
val hide_names_i: bool -> string * string list -> theory -> theory
|
wenzelm@16442
|
175 |
end
|
wenzelm@5642
|
176 |
|
wenzelm@16442
|
177 |
structure Sign: SIGN =
|
wenzelm@143
|
178 |
struct
|
clasohm@0
|
179 |
|
wenzelm@16442
|
180 |
(** datatype sign **)
|
wenzelm@16337
|
181 |
|
wenzelm@16442
|
182 |
datatype sign = Sign of
|
wenzelm@18062
|
183 |
{naming: NameSpace.naming, (*common naming conventions*)
|
wenzelm@18062
|
184 |
syn: Syntax.syntax, (*concrete syntax for terms, types, sorts*)
|
wenzelm@18062
|
185 |
tsig: Type.tsig, (*order-sorted signature of types*)
|
wenzelm@18062
|
186 |
consts: Consts.T}; (*polymorphic constants*)
|
wenzelm@16442
|
187 |
|
wenzelm@16442
|
188 |
fun make_sign (naming, syn, tsig, consts) =
|
wenzelm@16442
|
189 |
Sign {naming = naming, syn = syn, tsig = tsig, consts = consts};
|
wenzelm@16442
|
190 |
|
wenzelm@16442
|
191 |
structure SignData = TheoryDataFun
|
wenzelm@22846
|
192 |
(
|
wenzelm@16442
|
193 |
type T = sign;
|
wenzelm@16442
|
194 |
val copy = I;
|
wenzelm@17405
|
195 |
fun extend (Sign {syn, tsig, consts, ...}) =
|
wenzelm@17405
|
196 |
make_sign (NameSpace.default_naming, syn, tsig, consts);
|
wenzelm@16442
|
197 |
|
wenzelm@18062
|
198 |
val empty =
|
wenzelm@18714
|
199 |
make_sign (NameSpace.default_naming, Syntax.basic_syn, Type.empty_tsig, Consts.empty);
|
wenzelm@16442
|
200 |
|
wenzelm@16442
|
201 |
fun merge pp (sign1, sign2) =
|
wenzelm@16442
|
202 |
let
|
wenzelm@18062
|
203 |
val Sign {naming = _, syn = syn1, tsig = tsig1, consts = consts1} = sign1;
|
wenzelm@18062
|
204 |
val Sign {naming = _, syn = syn2, tsig = tsig2, consts = consts2} = sign2;
|
wenzelm@16442
|
205 |
|
wenzelm@16442
|
206 |
val naming = NameSpace.default_naming;
|
wenzelm@16597
|
207 |
val syn = Syntax.merge_syntaxes syn1 syn2;
|
wenzelm@16442
|
208 |
val tsig = Type.merge_tsigs pp (tsig1, tsig2);
|
wenzelm@18062
|
209 |
val consts = Consts.merge (consts1, consts2);
|
wenzelm@18062
|
210 |
in make_sign (naming, syn, tsig, consts) end;
|
wenzelm@22846
|
211 |
);
|
wenzelm@16442
|
212 |
|
wenzelm@16442
|
213 |
fun rep_sg thy = SignData.get thy |> (fn Sign args => args);
|
wenzelm@16442
|
214 |
|
wenzelm@16442
|
215 |
fun map_sign f = SignData.map (fn Sign {naming, syn, tsig, consts} =>
|
wenzelm@16442
|
216 |
make_sign (f (naming, syn, tsig, consts)));
|
wenzelm@16442
|
217 |
|
wenzelm@16442
|
218 |
fun map_naming f = map_sign (fn (naming, syn, tsig, consts) => (f naming, syn, tsig, consts));
|
wenzelm@16442
|
219 |
fun map_syn f = map_sign (fn (naming, syn, tsig, consts) => (naming, f syn, tsig, consts));
|
wenzelm@16442
|
220 |
fun map_tsig f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, f tsig, consts));
|
wenzelm@16442
|
221 |
fun map_consts f = map_sign (fn (naming, syn, tsig, consts) => (naming, syn, tsig, f consts));
|
wenzelm@16442
|
222 |
|
wenzelm@16337
|
223 |
|
wenzelm@16337
|
224 |
(* naming *)
|
wenzelm@16337
|
225 |
|
wenzelm@16442
|
226 |
val naming_of = #naming o rep_sg;
|
wenzelm@16337
|
227 |
val base_name = NameSpace.base;
|
wenzelm@16337
|
228 |
val full_name = NameSpace.full o naming_of;
|
wenzelm@16442
|
229 |
fun full_name_path thy elems = NameSpace.full (NameSpace.add_path elems (naming_of thy));
|
wenzelm@16337
|
230 |
val declare_name = NameSpace.declare o naming_of;
|
wenzelm@14645
|
231 |
|
wenzelm@14645
|
232 |
|
wenzelm@14645
|
233 |
(* syntax *)
|
wenzelm@14645
|
234 |
|
wenzelm@16597
|
235 |
val syn_of = #syn o rep_sg;
|
wenzelm@14645
|
236 |
|
clasohm@0
|
237 |
|
wenzelm@16337
|
238 |
(* type signature *)
|
wenzelm@16337
|
239 |
|
wenzelm@16337
|
240 |
val tsig_of = #tsig o rep_sg;
|
wenzelm@24732
|
241 |
|
wenzelm@19642
|
242 |
val classes_of = #2 o #classes o Type.rep_tsig o tsig_of;
|
wenzelm@21932
|
243 |
val all_classes = Sorts.all_classes o classes_of;
|
wenzelm@21932
|
244 |
val minimal_classes = Sorts.minimal_classes o classes_of;
|
wenzelm@19642
|
245 |
val super_classes = Sorts.super_classes o classes_of;
|
wenzelm@24732
|
246 |
val minimize_sort = Sorts.minimize_sort o classes_of;
|
wenzelm@24732
|
247 |
val complete_sort = Sorts.complete_sort o classes_of;
|
wenzelm@24732
|
248 |
|
wenzelm@4844
|
249 |
val defaultS = Type.defaultS o tsig_of;
|
wenzelm@4568
|
250 |
val subsort = Type.subsort o tsig_of;
|
wenzelm@7640
|
251 |
val of_sort = Type.of_sort o tsig_of;
|
wenzelm@7640
|
252 |
val witness_sorts = Type.witness_sorts o tsig_of;
|
wenzelm@14784
|
253 |
val universal_witness = Type.universal_witness o tsig_of;
|
wenzelm@16655
|
254 |
val all_sorts_nonempty = is_some o universal_witness;
|
wenzelm@24732
|
255 |
val is_logtype = member (op =) o Type.logical_types o tsig_of;
|
wenzelm@24732
|
256 |
|
wenzelm@14784
|
257 |
val typ_instance = Type.typ_instance o tsig_of;
|
wenzelm@19427
|
258 |
fun typ_equiv thy (T, U) = typ_instance thy (T, U) andalso typ_instance thy (U, T);
|
wenzelm@16941
|
259 |
val typ_match = Type.typ_match o tsig_of;
|
wenzelm@16941
|
260 |
val typ_unify = Type.unify o tsig_of;
|
wenzelm@4256
|
261 |
|
wenzelm@4256
|
262 |
|
wenzelm@18062
|
263 |
(* polymorphic constants *)
|
wenzelm@16941
|
264 |
|
wenzelm@18062
|
265 |
val consts_of = #consts o rep_sg;
|
wenzelm@21722
|
266 |
val the_const_constraint = Consts.the_constraint o consts_of;
|
wenzelm@25042
|
267 |
val the_const_type = Consts.the_type o consts_of;
|
wenzelm@18062
|
268 |
val const_type = try o the_const_type;
|
wenzelm@21722
|
269 |
val const_monomorphic = Consts.is_monomorphic o consts_of;
|
wenzelm@21183
|
270 |
val const_syntax_name = Consts.syntax_name o consts_of;
|
wenzelm@18062
|
271 |
val const_typargs = Consts.typargs o consts_of;
|
wenzelm@18164
|
272 |
val const_instance = Consts.instance o consts_of;
|
wenzelm@4256
|
273 |
|
wenzelm@16894
|
274 |
val declared_tyname = Symtab.defined o #2 o #types o Type.rep_tsig o tsig_of;
|
wenzelm@24761
|
275 |
val declared_const = can o the_const_constraint;
|
wenzelm@620
|
276 |
|
wenzelm@402
|
277 |
|
clasohm@0
|
278 |
|
wenzelm@16337
|
279 |
(** intern / extern names **)
|
wenzelm@16337
|
280 |
|
wenzelm@16368
|
281 |
val class_space = #1 o #classes o Type.rep_tsig o tsig_of;
|
wenzelm@16368
|
282 |
val type_space = #1 o #types o Type.rep_tsig o tsig_of;
|
wenzelm@18967
|
283 |
val const_space = Consts.space_of o consts_of;
|
wenzelm@14645
|
284 |
|
wenzelm@16368
|
285 |
val intern_class = NameSpace.intern o class_space;
|
wenzelm@16368
|
286 |
val extern_class = NameSpace.extern o class_space;
|
wenzelm@16368
|
287 |
val intern_type = NameSpace.intern o type_space;
|
wenzelm@16368
|
288 |
val extern_type = NameSpace.extern o type_space;
|
wenzelm@16368
|
289 |
val intern_const = NameSpace.intern o const_space;
|
wenzelm@16368
|
290 |
val extern_const = NameSpace.extern o const_space;
|
wenzelm@16337
|
291 |
|
wenzelm@16337
|
292 |
val intern_sort = map o intern_class;
|
wenzelm@16337
|
293 |
val extern_sort = map o extern_class;
|
wenzelm@16337
|
294 |
|
wenzelm@16337
|
295 |
local
|
wenzelm@14645
|
296 |
|
wenzelm@18892
|
297 |
fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
|
wenzelm@18892
|
298 |
| map_typ f _ (TFree (x, S)) = TFree (x, map f S)
|
wenzelm@18892
|
299 |
| map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
|
wenzelm@18892
|
300 |
|
wenzelm@18892
|
301 |
fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
|
wenzelm@18892
|
302 |
| map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
|
wenzelm@18892
|
303 |
| map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
|
wenzelm@18892
|
304 |
| map_term _ _ _ (t as Bound _) = t
|
wenzelm@18892
|
305 |
| map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
|
wenzelm@18892
|
306 |
| map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
|
wenzelm@18892
|
307 |
|
wenzelm@18994
|
308 |
val add_classesT = Term.fold_atyps
|
wenzelm@18994
|
309 |
(fn TFree (_, S) => fold (insert (op =)) S
|
wenzelm@18994
|
310 |
| TVar (_, S) => fold (insert (op =)) S
|
wenzelm@18994
|
311 |
| _ => I);
|
wenzelm@18994
|
312 |
|
wenzelm@18994
|
313 |
fun add_tyconsT (Type (c, Ts)) = insert (op =) c #> fold add_tyconsT Ts
|
wenzelm@18994
|
314 |
| add_tyconsT _ = I;
|
wenzelm@18994
|
315 |
|
wenzelm@18994
|
316 |
val add_consts = Term.fold_aterms (fn Const (c, _) => insert (op =) c | _ => I);
|
wenzelm@18994
|
317 |
|
wenzelm@16337
|
318 |
fun mapping add_names f t =
|
wenzelm@16337
|
319 |
let
|
wenzelm@20664
|
320 |
fun f' (x: string) = let val y = f x in if x = y then NONE else SOME (x, y) end;
|
wenzelm@19482
|
321 |
val tab = map_filter f' (add_names t []);
|
wenzelm@18941
|
322 |
fun get x = the_default x (AList.lookup (op =) tab x);
|
wenzelm@16337
|
323 |
in get end;
|
wenzelm@16337
|
324 |
|
wenzelm@16442
|
325 |
fun typ_mapping f g thy T =
|
wenzelm@18892
|
326 |
T |> map_typ
|
wenzelm@18994
|
327 |
(mapping add_classesT (f thy) T)
|
wenzelm@18994
|
328 |
(mapping add_tyconsT (g thy) T);
|
wenzelm@14645
|
329 |
|
wenzelm@16442
|
330 |
fun term_mapping f g h thy t =
|
wenzelm@18892
|
331 |
t |> map_term
|
wenzelm@18994
|
332 |
(mapping (Term.fold_types add_classesT) (f thy) t)
|
wenzelm@18994
|
333 |
(mapping (Term.fold_types add_tyconsT) (g thy) t)
|
wenzelm@18994
|
334 |
(mapping add_consts (h thy) t);
|
wenzelm@16337
|
335 |
|
wenzelm@16337
|
336 |
in
|
wenzelm@14645
|
337 |
|
wenzelm@16368
|
338 |
val intern_typ = typ_mapping intern_class intern_type;
|
wenzelm@16368
|
339 |
val extern_typ = typ_mapping extern_class extern_type;
|
wenzelm@16368
|
340 |
val intern_term = term_mapping intern_class intern_type intern_const;
|
wenzelm@18994
|
341 |
fun extern_term h = term_mapping extern_class extern_type (K h);
|
wenzelm@16368
|
342 |
val intern_tycons = typ_mapping (K I) intern_type;
|
wenzelm@16337
|
343 |
|
wenzelm@16337
|
344 |
end;
|
wenzelm@14645
|
345 |
|
wenzelm@14645
|
346 |
|
wenzelm@14645
|
347 |
|
wenzelm@4249
|
348 |
(** pretty printing of terms, types etc. **)
|
wenzelm@3937
|
349 |
|
wenzelm@24921
|
350 |
val pretty_term = Syntax.pretty_term o ProofContext.init;
|
wenzelm@24921
|
351 |
val pretty_typ = Syntax.pretty_typ o ProofContext.init;
|
wenzelm@24921
|
352 |
val pretty_sort = Syntax.pretty_sort o ProofContext.init;
|
wenzelm@18857
|
353 |
|
wenzelm@24921
|
354 |
val string_of_term = Syntax.string_of_term o ProofContext.init;
|
wenzelm@24921
|
355 |
val string_of_typ = Syntax.string_of_typ o ProofContext.init;
|
wenzelm@24921
|
356 |
val string_of_sort = Syntax.string_of_sort o ProofContext.init;
|
wenzelm@3937
|
357 |
|
wenzelm@24921
|
358 |
(*pp operations -- deferred evaluation*)
|
wenzelm@24921
|
359 |
fun pp thy = Pretty.pp
|
wenzelm@24921
|
360 |
(fn x => pretty_term thy x,
|
wenzelm@24921
|
361 |
fn x => pretty_typ thy x,
|
wenzelm@24921
|
362 |
fn x => pretty_sort thy x,
|
wenzelm@24921
|
363 |
fn x => Syntax.pretty_classrel (ProofContext.init thy) x,
|
wenzelm@24921
|
364 |
fn x => Syntax.pretty_arity (ProofContext.init thy) x);
|
wenzelm@14828
|
365 |
|
wenzelm@3937
|
366 |
|
wenzelm@3937
|
367 |
|
wenzelm@16337
|
368 |
(** certify entities **) (*exception TYPE*)
|
wenzelm@8898
|
369 |
|
wenzelm@16337
|
370 |
(* certify wrt. type signature *)
|
wenzelm@8898
|
371 |
|
wenzelm@19462
|
372 |
val arity_number = Type.arity_number o tsig_of;
|
wenzelm@19462
|
373 |
fun arity_sorts thy = Type.arity_sorts (pp thy) (tsig_of thy);
|
wenzelm@19462
|
374 |
|
wenzelm@24273
|
375 |
val certify_class = Type.cert_class o tsig_of;
|
wenzelm@24273
|
376 |
val certify_sort = Type.cert_sort o tsig_of;
|
wenzelm@24273
|
377 |
val certify_typ = Type.cert_typ o tsig_of;
|
wenzelm@24273
|
378 |
fun certify_typ_mode mode = Type.cert_typ_mode mode o tsig_of;
|
wenzelm@10443
|
379 |
|
wenzelm@4961
|
380 |
|
wenzelm@18967
|
381 |
(* certify term/prop *)
|
wenzelm@4961
|
382 |
|
wenzelm@14987
|
383 |
local
|
nipkow@1494
|
384 |
|
wenzelm@16337
|
385 |
fun type_check pp tm =
|
wenzelm@4961
|
386 |
let
|
wenzelm@4961
|
387 |
fun err_appl why bs t T u U =
|
wenzelm@4961
|
388 |
let
|
wenzelm@10404
|
389 |
val xs = map Free bs; (*we do not rename here*)
|
wenzelm@4961
|
390 |
val t' = subst_bounds (xs, t);
|
wenzelm@4961
|
391 |
val u' = subst_bounds (xs, u);
|
wenzelm@16337
|
392 |
val msg = cat_lines
|
wenzelm@14828
|
393 |
(TypeInfer.appl_error (Syntax.pp_show_brackets pp) why t' T u' U);
|
wenzelm@16337
|
394 |
in raise TYPE (msg, [T, U], [t', u']) end;
|
wenzelm@4961
|
395 |
|
wenzelm@4961
|
396 |
fun typ_of (_, Const (_, T)) = T
|
wenzelm@4961
|
397 |
| typ_of (_, Free (_, T)) = T
|
wenzelm@4961
|
398 |
| typ_of (_, Var (_, T)) = T
|
skalberg@15570
|
399 |
| typ_of (bs, Bound i) = snd (List.nth (bs, i) handle Subscript =>
|
wenzelm@4961
|
400 |
raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
|
wenzelm@4961
|
401 |
| typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
|
wenzelm@4961
|
402 |
| typ_of (bs, t $ u) =
|
wenzelm@4961
|
403 |
let val T = typ_of (bs, t) and U = typ_of (bs, u) in
|
wenzelm@4961
|
404 |
(case T of
|
wenzelm@4961
|
405 |
Type ("fun", [T1, T2]) =>
|
wenzelm@14828
|
406 |
if T1 = U then T2 else err_appl "Incompatible operand type" bs t T u U
|
wenzelm@14828
|
407 |
| _ => err_appl "Operator not of function type" bs t T u U)
|
wenzelm@4961
|
408 |
end;
|
wenzelm@18967
|
409 |
in typ_of ([], tm) end;
|
wenzelm@4961
|
410 |
|
wenzelm@18967
|
411 |
fun err msg = raise TYPE (msg, [], []);
|
wenzelm@18967
|
412 |
|
wenzelm@18967
|
413 |
fun check_vars (t $ u) = (check_vars t; check_vars u)
|
wenzelm@18967
|
414 |
| check_vars (Abs (_, _, t)) = check_vars t
|
wenzelm@18967
|
415 |
| check_vars (Var (xi as (_, i), _)) =
|
wenzelm@18967
|
416 |
if i < 0 then err ("Malformed variable: " ^ quote (Term.string_of_vname xi)) else ()
|
wenzelm@18967
|
417 |
| check_vars _ = ();
|
clasohm@0
|
418 |
|
wenzelm@14987
|
419 |
in
|
wenzelm@14987
|
420 |
|
wenzelm@24674
|
421 |
fun certify' prop pp do_expand consts thy tm =
|
wenzelm@251
|
422 |
let
|
wenzelm@18967
|
423 |
val _ = check_vars tm;
|
wenzelm@20548
|
424 |
val tm' = Term.map_types (certify_typ thy) tm;
|
wenzelm@18967
|
425 |
val T = type_check pp tm';
|
wenzelm@18967
|
426 |
val _ = if prop andalso T <> propT then err "Term not of type prop" else ();
|
wenzelm@24674
|
427 |
val tm'' = Consts.certify pp (tsig_of thy) do_expand consts tm';
|
wenzelm@18967
|
428 |
in (if tm = tm'' then tm else tm'', T, Term.maxidx_of_term tm'') end;
|
wenzelm@169
|
429 |
|
wenzelm@24674
|
430 |
fun certify_term thy = certify' false (pp thy) true (consts_of thy) thy;
|
wenzelm@24674
|
431 |
fun certify_prop thy = certify' true (pp thy) true (consts_of thy) thy;
|
wenzelm@18967
|
432 |
|
wenzelm@24674
|
433 |
fun cert_term_abbrev thy = #1 o certify' false (pp thy) false (consts_of thy) thy;
|
wenzelm@18967
|
434 |
val cert_term = #1 oo certify_term;
|
wenzelm@18967
|
435 |
val cert_prop = #1 oo certify_prop;
|
wenzelm@251
|
436 |
|
wenzelm@14987
|
437 |
end;
|
wenzelm@14987
|
438 |
|
wenzelm@251
|
439 |
|
wenzelm@18941
|
440 |
(* specifications *)
|
wenzelm@18941
|
441 |
|
wenzelm@21741
|
442 |
fun no_variables kind add addT mk mkT pp tm =
|
wenzelm@21741
|
443 |
(case (add tm [], addT tm []) of
|
wenzelm@18941
|
444 |
([], []) => tm
|
wenzelm@21741
|
445 |
| (frees, tfrees) => error (Pretty.string_of (Pretty.block (Pretty.breaks
|
wenzelm@21741
|
446 |
(Pretty.str ("Illegal " ^ kind ^ " variable(s) in term:") ::
|
wenzelm@21741
|
447 |
map (Pretty.term pp o mk) frees @ map (Pretty.typ pp o mkT) tfrees)))));
|
wenzelm@21741
|
448 |
|
wenzelm@21741
|
449 |
val no_frees = no_variables "free" Term.add_frees Term.add_tfrees Free TFree;
|
wenzelm@21741
|
450 |
val no_vars = no_variables "schematic" Term.add_vars Term.add_tvars Var TVar;
|
wenzelm@18941
|
451 |
|
wenzelm@24981
|
452 |
fun cert_def ctxt tm =
|
wenzelm@18941
|
453 |
let val ((lhs, rhs), _) = tm
|
wenzelm@24981
|
454 |
|> no_vars (Syntax.pp ctxt)
|
wenzelm@18941
|
455 |
|> Logic.strip_imp_concl
|
wenzelm@24981
|
456 |
|> PrimitiveDefs.dest_def ctxt Term.is_Const (K false) (K false)
|
wenzelm@18941
|
457 |
in (Term.dest_Const (Term.head_of lhs), rhs) end
|
wenzelm@18941
|
458 |
handle TERM (msg, _) => error msg;
|
wenzelm@18941
|
459 |
|
wenzelm@18941
|
460 |
|
wenzelm@16337
|
461 |
|
wenzelm@16442
|
462 |
(** read and certify entities **) (*exception ERROR*)
|
wenzelm@16337
|
463 |
|
wenzelm@24273
|
464 |
(* classes *)
|
wenzelm@19244
|
465 |
|
wenzelm@19427
|
466 |
fun read_class thy c = certify_class thy (intern_class thy c)
|
wenzelm@19427
|
467 |
handle TYPE (msg, _, _) => error msg;
|
wenzelm@16337
|
468 |
|
wenzelm@16337
|
469 |
|
wenzelm@19244
|
470 |
(* type arities *)
|
wenzelm@19244
|
471 |
|
wenzelm@19244
|
472 |
fun prep_arity prep_tycon prep_sort thy (t, Ss, S) =
|
wenzelm@19244
|
473 |
let val arity = (prep_tycon thy t, map (prep_sort thy) Ss, prep_sort thy S)
|
wenzelm@19513
|
474 |
in Type.add_arity (pp thy) arity (tsig_of thy); arity end;
|
wenzelm@19244
|
475 |
|
wenzelm@24707
|
476 |
val read_arity = prep_arity intern_type Syntax.read_sort_global;
|
wenzelm@19244
|
477 |
val cert_arity = prep_arity (K I) certify_sort;
|
wenzelm@19244
|
478 |
|
wenzelm@19244
|
479 |
|
wenzelm@16337
|
480 |
(* types *)
|
wenzelm@16337
|
481 |
|
wenzelm@22765
|
482 |
fun get_sort thy def_sort raw_env =
|
wenzelm@22696
|
483 |
let
|
wenzelm@22765
|
484 |
val tsig = tsig_of thy;
|
wenzelm@22765
|
485 |
|
wenzelm@22696
|
486 |
fun eq ((xi, S), (xi', S')) =
|
wenzelm@22696
|
487 |
Term.eq_ix (xi, xi') andalso Type.eq_sort tsig (S, S');
|
wenzelm@22696
|
488 |
val env = distinct eq raw_env;
|
wenzelm@22696
|
489 |
val _ = (case duplicates (eq_fst (op =)) env of [] => ()
|
wenzelm@22696
|
490 |
| dups => error ("Inconsistent sort constraints for type variable(s) "
|
wenzelm@22696
|
491 |
^ commas_quote (map (Term.string_of_vname' o fst) dups)));
|
wenzelm@22696
|
492 |
|
wenzelm@22696
|
493 |
fun get xi =
|
wenzelm@22696
|
494 |
(case (AList.lookup (op =) env xi, def_sort xi) of
|
wenzelm@22696
|
495 |
(NONE, NONE) => Type.defaultS tsig
|
wenzelm@22696
|
496 |
| (NONE, SOME S) => S
|
wenzelm@22696
|
497 |
| (SOME S, NONE) => S
|
wenzelm@22696
|
498 |
| (SOME S, SOME S') =>
|
wenzelm@22696
|
499 |
if Type.eq_sort tsig (S, S') then S'
|
wenzelm@22696
|
500 |
else error ("Sort constraint inconsistent with default for type variable " ^
|
wenzelm@22696
|
501 |
quote (Term.string_of_vname' xi)));
|
wenzelm@22696
|
502 |
in get end;
|
wenzelm@22696
|
503 |
|
wenzelm@16337
|
504 |
local
|
wenzelm@16337
|
505 |
|
wenzelm@24273
|
506 |
fun gen_read_typ mode (thy, def_sort) str =
|
wenzelm@16337
|
507 |
let
|
wenzelm@24273
|
508 |
val ctxt = ProofContext.init thy;
|
wenzelm@24273
|
509 |
val syn = syn_of thy;
|
wenzelm@22696
|
510 |
val T = intern_tycons thy
|
wenzelm@24273
|
511 |
(Syntax.standard_parse_typ ctxt syn (get_sort thy def_sort) (intern_sort thy) str);
|
wenzelm@24273
|
512 |
in certify_typ_mode mode thy T handle TYPE (msg, _, _) => error msg end
|
wenzelm@18678
|
513 |
handle ERROR msg => cat_error msg ("The error(s) above occurred in type " ^ quote str);
|
wenzelm@16337
|
514 |
|
wenzelm@16337
|
515 |
in
|
wenzelm@16337
|
516 |
|
wenzelm@16442
|
517 |
fun no_def_sort thy = (thy: theory, K NONE);
|
wenzelm@16337
|
518 |
|
wenzelm@24273
|
519 |
val read_def_typ = gen_read_typ Type.mode_default;
|
wenzelm@24273
|
520 |
val read_typ = gen_read_typ Type.mode_default o no_def_sort;
|
wenzelm@24273
|
521 |
val read_typ_syntax = gen_read_typ Type.mode_syntax o no_def_sort;
|
wenzelm@24273
|
522 |
val read_typ_abbrev = gen_read_typ Type.mode_abbrev o no_def_sort;
|
wenzelm@16337
|
523 |
|
wenzelm@16337
|
524 |
end;
|
wenzelm@16337
|
525 |
|
wenzelm@16337
|
526 |
|
wenzelm@16368
|
527 |
(* type and constant names *)
|
wenzelm@15703
|
528 |
|
wenzelm@16442
|
529 |
fun read_tyname thy raw_c =
|
wenzelm@19462
|
530 |
let val c = intern_type thy raw_c
|
wenzelm@19462
|
531 |
in Type (c, replicate (arity_number thy c) dummyT) end;
|
wenzelm@15703
|
532 |
|
wenzelm@18967
|
533 |
val read_const = Consts.read_const o consts_of;
|
wenzelm@15703
|
534 |
|
wenzelm@15703
|
535 |
|
wenzelm@251
|
536 |
|
wenzelm@22696
|
537 |
(* read_def_terms -- read terms and infer types *) (*exception ERROR*)
|
wenzelm@251
|
538 |
|
wenzelm@2979
|
539 |
(*
|
wenzelm@16337
|
540 |
def_type: partial map from indexnames to types (constrains Frees and Vars)
|
wenzelm@16337
|
541 |
def_sort: partial map from indexnames to sorts (constrains TFrees and TVars)
|
wenzelm@20155
|
542 |
used: context of already used type variables
|
wenzelm@2979
|
543 |
freeze: if true then generated parameters are turned into TFrees, else TVars
|
wenzelm@2979
|
544 |
*)
|
wenzelm@2979
|
545 |
|
wenzelm@24233
|
546 |
fun read_def_terms'
|
wenzelm@24233
|
547 |
pp is_logtype syn consts map_free ctxt (def_type, def_sort) used freeze raw_args =
|
wenzelm@251
|
548 |
let
|
wenzelm@22696
|
549 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@24517
|
550 |
fun check_typs Ts = map (certify_typ thy) Ts
|
wenzelm@24517
|
551 |
handle TYPE (msg, _, _) => error msg;
|
wenzelm@22696
|
552 |
|
wenzelm@24485
|
553 |
fun infer args = TypeInfer.infer_types pp (tsig_of thy) check_typs
|
wenzelm@24761
|
554 |
(try (Consts.the_constraint consts)) def_type used ~1 (SOME freeze) args |>> map fst
|
wenzelm@24233
|
555 |
handle TYPE (msg, _, _) => error msg;
|
wenzelm@22696
|
556 |
|
wenzelm@24370
|
557 |
fun check T t = Exn.Result (singleton (fst o infer) (t, T))
|
wenzelm@24370
|
558 |
handle ERROR msg => Exn.Exn (ERROR msg);
|
wenzelm@24233
|
559 |
val map_const = try (#1 o Term.dest_Const o Consts.read_const consts);
|
wenzelm@24370
|
560 |
fun read T = Syntax.standard_parse_term pp (check T) (get_sort thy def_sort) map_const map_free
|
wenzelm@24233
|
561 |
(intern_tycons thy) (intern_sort thy) ctxt is_logtype syn T;
|
wenzelm@4249
|
562 |
in
|
wenzelm@24233
|
563 |
raw_args
|
wenzelm@24233
|
564 |
|> map (fn (s, raw_T) =>
|
wenzelm@24233
|
565 |
let val T = certify_typ thy raw_T handle TYPE (msg, _, _) => error msg
|
wenzelm@24233
|
566 |
in (read (#1 (TypeInfer.paramify_dummies T 0)) s, T) end)
|
wenzelm@24233
|
567 |
|> infer
|
wenzelm@4249
|
568 |
end;
|
clasohm@623
|
569 |
|
wenzelm@20230
|
570 |
fun read_def_terms (thy, types, sorts) used freeze sTs =
|
wenzelm@20230
|
571 |
let
|
wenzelm@20230
|
572 |
val pp = pp thy;
|
wenzelm@20230
|
573 |
val consts = consts_of thy;
|
wenzelm@24674
|
574 |
val cert_consts = Consts.certify pp (tsig_of thy) true consts;
|
wenzelm@22765
|
575 |
fun map_free x = if is_some (types (x, ~1)) then SOME x else NONE;
|
wenzelm@20230
|
576 |
val (ts, inst) =
|
wenzelm@22765
|
577 |
read_def_terms' pp (is_logtype thy) (syn_of thy) consts map_free
|
wenzelm@21772
|
578 |
(ProofContext.init thy) (types, sorts) (Name.make_context used) freeze sTs;
|
wenzelm@20230
|
579 |
in (map cert_consts ts, inst) end;
|
wenzelm@12068
|
580 |
|
wenzelm@16442
|
581 |
fun simple_read_term thy T s =
|
wenzelm@16442
|
582 |
let val ([t], _) = read_def_terms (thy, K NONE, K NONE) [] true [(s, T)]
|
wenzelm@20230
|
583 |
in t end handle ERROR msg => cat_error msg ("The error(s) above occurred for term " ^ s);
|
wenzelm@8802
|
584 |
|
wenzelm@22709
|
585 |
fun read_term thy = simple_read_term thy dummyT;
|
wenzelm@16494
|
586 |
fun read_prop thy = simple_read_term thy propT;
|
wenzelm@16494
|
587 |
|
wenzelm@8607
|
588 |
|
wenzelm@2979
|
589 |
|
wenzelm@16337
|
590 |
(** signature extension functions **) (*exception ERROR/TYPE*)
|
wenzelm@386
|
591 |
|
wenzelm@386
|
592 |
(* add default sort *)
|
wenzelm@386
|
593 |
|
wenzelm@16442
|
594 |
fun gen_add_defsort prep_sort s thy =
|
wenzelm@16442
|
595 |
thy |> map_tsig (Type.set_defsort (prep_sort thy s));
|
wenzelm@8898
|
596 |
|
wenzelm@24707
|
597 |
val add_defsort = gen_add_defsort Syntax.read_sort_global;
|
wenzelm@16337
|
598 |
val add_defsort_i = gen_add_defsort certify_sort;
|
wenzelm@386
|
599 |
|
wenzelm@386
|
600 |
|
wenzelm@386
|
601 |
(* add type constructors *)
|
wenzelm@386
|
602 |
|
wenzelm@16442
|
603 |
fun add_types types thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
|
wenzelm@14856
|
604 |
let
|
wenzelm@16597
|
605 |
val syn' = Syntax.extend_type_gram types syn;
|
wenzelm@16368
|
606 |
val decls = map (fn (a, n, mx) => (Syntax.type_name a mx, n)) types;
|
wenzelm@16442
|
607 |
val tsig' = Type.add_types naming decls tsig;
|
wenzelm@16442
|
608 |
in (naming, syn', tsig', consts) end);
|
wenzelm@16442
|
609 |
|
wenzelm@16442
|
610 |
fun add_typedecls decls thy =
|
wenzelm@16442
|
611 |
let
|
wenzelm@20664
|
612 |
fun type_of (a, vs: string list, mx) =
|
haftmann@18928
|
613 |
if not (has_duplicates (op =) vs) then (a, length vs, mx)
|
wenzelm@16442
|
614 |
else error ("Duplicate parameters in type declaration: " ^ quote a);
|
wenzelm@16442
|
615 |
in add_types (map type_of decls) thy end;
|
wenzelm@16337
|
616 |
|
wenzelm@16337
|
617 |
|
wenzelm@16337
|
618 |
(* add nonterminals *)
|
wenzelm@16337
|
619 |
|
wenzelm@16442
|
620 |
fun add_nonterminals ns thy = thy |> map_sign (fn (naming, syn, tsig, consts) =>
|
wenzelm@16337
|
621 |
let
|
wenzelm@16597
|
622 |
val syn' = Syntax.extend_consts ns syn;
|
wenzelm@16442
|
623 |
val tsig' = Type.add_nonterminals naming ns tsig;
|
wenzelm@16442
|
624 |
in (naming, syn', tsig', consts) end);
|
wenzelm@386
|
625 |
|
wenzelm@386
|
626 |
|
wenzelm@386
|
627 |
(* add type abbreviations *)
|
wenzelm@386
|
628 |
|
wenzelm@16442
|
629 |
fun gen_add_tyabbr prep_typ (a, vs, rhs, mx) thy =
|
wenzelm@16442
|
630 |
thy |> map_sign (fn (naming, syn, tsig, consts) =>
|
wenzelm@16337
|
631 |
let
|
wenzelm@16597
|
632 |
val syn' = Syntax.extend_type_gram [(a, length vs, mx)] syn;
|
wenzelm@16368
|
633 |
val a' = Syntax.type_name a mx;
|
wenzelm@24707
|
634 |
val abbr = (a', vs,
|
wenzelm@24707
|
635 |
certify_typ_mode Type.mode_syntax thy (prep_typ (ProofContext.init thy) rhs))
|
wenzelm@18678
|
636 |
handle ERROR msg => cat_error msg ("in type abbreviation " ^ quote a');
|
wenzelm@16442
|
637 |
val tsig' = Type.add_abbrevs naming [abbr] tsig;
|
wenzelm@16442
|
638 |
in (naming, syn', tsig', consts) end);
|
wenzelm@386
|
639 |
|
wenzelm@24707
|
640 |
val add_tyabbrs = fold (gen_add_tyabbr Syntax.parse_typ);
|
wenzelm@24273
|
641 |
val add_tyabbrs_i = fold (gen_add_tyabbr (K I));
|
wenzelm@14784
|
642 |
|
wenzelm@14784
|
643 |
|
wenzelm@16337
|
644 |
(* modify syntax *)
|
wenzelm@16337
|
645 |
|
wenzelm@20784
|
646 |
fun gen_syntax change_gram prep_typ mode args thy =
|
wenzelm@16337
|
647 |
let
|
wenzelm@24707
|
648 |
fun prep (c, T, mx) = (c,
|
wenzelm@24707
|
649 |
certify_typ_mode Type.mode_syntax thy (prep_typ (ProofContext.init thy) T), mx)
|
wenzelm@24273
|
650 |
handle ERROR msg =>
|
wenzelm@24273
|
651 |
cat_error msg ("in syntax declaration " ^ quote (Syntax.const_name c mx));
|
wenzelm@20784
|
652 |
in thy |> map_syn (change_gram (is_logtype thy) mode (map prep args)) end;
|
wenzelm@16337
|
653 |
|
wenzelm@16337
|
654 |
fun gen_add_syntax x = gen_syntax Syntax.extend_const_gram x;
|
wenzelm@386
|
655 |
|
wenzelm@24707
|
656 |
val add_modesyntax = gen_add_syntax Syntax.parse_typ;
|
wenzelm@24273
|
657 |
val add_modesyntax_i = gen_add_syntax (K I);
|
wenzelm@24959
|
658 |
val add_syntax = add_modesyntax Syntax.mode_default;
|
wenzelm@24959
|
659 |
val add_syntax_i = add_modesyntax_i Syntax.mode_default;
|
wenzelm@24707
|
660 |
val del_modesyntax = gen_syntax Syntax.remove_const_gram Syntax.parse_typ;
|
wenzelm@24273
|
661 |
val del_modesyntax_i = gen_syntax Syntax.remove_const_gram (K I);
|
wenzelm@3805
|
662 |
|
wenzelm@21661
|
663 |
fun const_syntax thy (Const (c, _), mx) = try (Consts.syntax (consts_of thy)) (c, mx)
|
wenzelm@21206
|
664 |
| const_syntax _ _ = NONE;
|
wenzelm@21206
|
665 |
|
wenzelm@24949
|
666 |
fun notation add mode args thy = thy
|
wenzelm@24949
|
667 |
|> (if add then add_modesyntax_i else del_modesyntax_i) mode (map_filter (const_syntax thy) args);
|
wenzelm@19658
|
668 |
|
wenzelm@16337
|
669 |
|
wenzelm@16337
|
670 |
(* add constants *)
|
wenzelm@386
|
671 |
|
wenzelm@17995
|
672 |
local
|
wenzelm@17995
|
673 |
|
wenzelm@24776
|
674 |
fun gen_add_consts prep_typ authentic tags raw_args thy =
|
wenzelm@386
|
675 |
let
|
wenzelm@24959
|
676 |
val prepT = Type.no_tvars o Term.no_dummyT o prep_typ thy;
|
wenzelm@19658
|
677 |
fun prep (raw_c, raw_T, raw_mx) =
|
wenzelm@19658
|
678 |
let
|
wenzelm@19658
|
679 |
val (c, mx) = Syntax.const_mixfix raw_c raw_mx;
|
wenzelm@24959
|
680 |
val full_c = full_name thy c;
|
wenzelm@24959
|
681 |
val c' = if authentic then Syntax.constN ^ full_c else c;
|
wenzelm@19658
|
682 |
val T = (prepT raw_T handle TYPE (msg, _, _) => error msg) handle ERROR msg =>
|
wenzelm@19658
|
683 |
cat_error msg ("in declaration of constant " ^ quote c);
|
wenzelm@24959
|
684 |
val T' = Compress.typ thy (Logic.varifyT T);
|
wenzelm@24959
|
685 |
in ((c, T'), (c', T', mx), Const (full_c, T)) end;
|
wenzelm@16337
|
686 |
val args = map prep raw_args;
|
wenzelm@16442
|
687 |
in
|
wenzelm@16442
|
688 |
thy
|
wenzelm@24776
|
689 |
|> map_consts (fold (Consts.declare authentic (naming_of thy) tags o #1) args)
|
wenzelm@19658
|
690 |
|> add_syntax_i (map #2 args)
|
wenzelm@24959
|
691 |
|> pair (map #3 args)
|
wenzelm@16442
|
692 |
end;
|
wenzelm@386
|
693 |
|
wenzelm@17995
|
694 |
in
|
wenzelm@17995
|
695 |
|
wenzelm@24959
|
696 |
val add_consts = snd oo gen_add_consts read_typ false [];
|
wenzelm@24959
|
697 |
val add_consts_i = snd oo gen_add_consts certify_typ false [];
|
wenzelm@24959
|
698 |
|
wenzelm@24959
|
699 |
fun declare_const tags arg = gen_add_consts certify_typ true tags [arg] #>> the_single;
|
wenzelm@386
|
700 |
|
wenzelm@17995
|
701 |
end;
|
wenzelm@17995
|
702 |
|
wenzelm@386
|
703 |
|
wenzelm@25049
|
704 |
(* abbreviations *)
|
wenzelm@18941
|
705 |
|
wenzelm@24776
|
706 |
fun add_abbrev mode tags (c, raw_t) thy =
|
wenzelm@18941
|
707 |
let
|
wenzelm@21741
|
708 |
val pp = pp thy;
|
wenzelm@25049
|
709 |
val prep_tm = Compress.term thy o no_frees pp o Term.no_dummy_patterns o cert_term_abbrev thy;
|
wenzelm@19806
|
710 |
val t = (prep_tm raw_t handle TYPE (msg, _, _) => error msg | TERM (msg, _) => error msg)
|
wenzelm@19366
|
711 |
handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c);
|
wenzelm@21696
|
712 |
val (res, consts') = consts_of thy
|
wenzelm@24776
|
713 |
|> Consts.abbreviate pp (tsig_of thy) (naming_of thy) mode tags (c, t);
|
wenzelm@25049
|
714 |
in (res, thy |> map_consts (K consts')) end;
|
wenzelm@25049
|
715 |
|
wenzelm@25049
|
716 |
fun revert_abbrev mode c = map_consts (Consts.revert_abbrev mode c);
|
wenzelm@18941
|
717 |
|
wenzelm@18941
|
718 |
|
wenzelm@16941
|
719 |
(* add constraints *)
|
wenzelm@16941
|
720 |
|
wenzelm@24761
|
721 |
fun add_const_constraint (c, opt_T) thy =
|
wenzelm@16941
|
722 |
let
|
wenzelm@19099
|
723 |
fun prepT raw_T =
|
wenzelm@24761
|
724 |
let val T = Logic.varifyT (Type.no_tvars (Term.no_dummyT (certify_typ thy raw_T)))
|
wenzelm@19099
|
725 |
in cert_term thy (Const (c, T)); T end
|
wenzelm@16941
|
726 |
handle TYPE (msg, _, _) => error msg;
|
wenzelm@19099
|
727 |
in thy |> map_consts (Consts.constrain (c, Option.map prepT opt_T)) end;
|
wenzelm@16941
|
728 |
|
wenzelm@16941
|
729 |
|
wenzelm@19513
|
730 |
(* primitive classes and arities *)
|
wenzelm@386
|
731 |
|
wenzelm@19513
|
732 |
fun primitive_class (bclass, classes) thy =
|
wenzelm@16442
|
733 |
thy |> map_sign (fn (naming, syn, tsig, consts) =>
|
wenzelm@16337
|
734 |
let
|
wenzelm@16597
|
735 |
val syn' = Syntax.extend_consts [bclass] syn;
|
wenzelm@19513
|
736 |
val tsig' = Type.add_class (pp thy) naming (bclass, classes) tsig;
|
wenzelm@16442
|
737 |
in (naming, syn', tsig', consts) end)
|
wenzelm@19391
|
738 |
|> add_consts_i [(Logic.const_of_class bclass, Term.a_itselfT --> propT, NoSyn)];
|
wenzelm@3791
|
739 |
|
wenzelm@19513
|
740 |
fun primitive_classrel arg thy = thy |> map_tsig (Type.add_classrel (pp thy) arg);
|
wenzelm@19513
|
741 |
fun primitive_arity arg thy = thy |> map_tsig (Type.add_arity (pp thy) arg);
|
wenzelm@421
|
742 |
|
wenzelm@421
|
743 |
|
wenzelm@14645
|
744 |
(* add translation functions *)
|
wenzelm@14645
|
745 |
|
wenzelm@15746
|
746 |
local
|
wenzelm@15746
|
747 |
|
wenzelm@15746
|
748 |
fun mk trs = map Syntax.mk_trfun trs;
|
wenzelm@15746
|
749 |
|
wenzelm@16597
|
750 |
fun gen_add_trfuns ext non_typed (atrs, trs, tr's, atr's) =
|
wenzelm@16597
|
751 |
map_syn (ext (mk atrs, mk trs, mk (map (apsnd non_typed) tr's), mk atr's));
|
wenzelm@14645
|
752 |
|
wenzelm@16597
|
753 |
fun gen_add_trfunsT ext tr's = map_syn (ext ([], [], mk tr's, []));
|
wenzelm@14645
|
754 |
|
wenzelm@15746
|
755 |
in
|
wenzelm@15746
|
756 |
|
wenzelm@16597
|
757 |
val add_trfuns = gen_add_trfuns Syntax.extend_trfuns Syntax.non_typed_tr';
|
wenzelm@16597
|
758 |
val add_trfunsT = gen_add_trfunsT Syntax.extend_trfuns;
|
wenzelm@16597
|
759 |
val add_advanced_trfuns = gen_add_trfuns Syntax.extend_advanced_trfuns Syntax.non_typed_tr'';
|
wenzelm@16597
|
760 |
val add_advanced_trfunsT = gen_add_trfunsT Syntax.extend_advanced_trfuns;
|
wenzelm@14645
|
761 |
|
wenzelm@15746
|
762 |
end;
|
wenzelm@15746
|
763 |
|
wenzelm@16597
|
764 |
val add_tokentrfuns = map_syn o Syntax.extend_tokentrfuns;
|
wenzelm@16442
|
765 |
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
|
wenzelm@14645
|
766 |
|
wenzelm@14645
|
767 |
|
wenzelm@19258
|
768 |
(* translation rules *)
|
wenzelm@4619
|
769 |
|
wenzelm@19258
|
770 |
fun gen_trrules f args thy = thy |> map_syn (fn syn =>
|
wenzelm@16442
|
771 |
let val rules = map (Syntax.map_trrule (apfst (intern_type thy))) args
|
wenzelm@21772
|
772 |
in f (ProofContext.init thy) (is_logtype thy) syn rules syn end);
|
wenzelm@8725
|
773 |
|
wenzelm@19258
|
774 |
val add_trrules = gen_trrules Syntax.extend_trrules;
|
wenzelm@19258
|
775 |
val del_trrules = gen_trrules Syntax.remove_trrules;
|
wenzelm@16597
|
776 |
val add_trrules_i = map_syn o Syntax.extend_trrules_i;
|
wenzelm@19258
|
777 |
val del_trrules_i = map_syn o Syntax.remove_trrules_i;
|
wenzelm@386
|
778 |
|
wenzelm@386
|
779 |
|
wenzelm@16337
|
780 |
(* modify naming *)
|
wenzelm@6546
|
781 |
|
wenzelm@19054
|
782 |
val add_path = map_naming o NameSpace.add_path;
|
wenzelm@19054
|
783 |
val no_base_names = map_naming NameSpace.no_base_names;
|
wenzelm@19054
|
784 |
val qualified_names = map_naming NameSpace.qualified_names;
|
wenzelm@19054
|
785 |
val sticky_prefix = map_naming o NameSpace.sticky_prefix;
|
wenzelm@19054
|
786 |
val restore_naming = map_naming o K o naming_of;
|
wenzelm@6546
|
787 |
|
wenzelm@19013
|
788 |
val parent_path = add_path "..";
|
wenzelm@19013
|
789 |
val root_path = add_path "/";
|
wenzelm@19013
|
790 |
val absolute_path = add_path "//";
|
wenzelm@16442
|
791 |
|
wenzelm@16442
|
792 |
fun local_path thy = thy |> root_path |> add_path (Context.theory_name thy);
|
wenzelm@16442
|
793 |
|
wenzelm@6546
|
794 |
|
wenzelm@16337
|
795 |
(* hide names *)
|
wenzelm@386
|
796 |
|
wenzelm@16442
|
797 |
fun hide_classes b xs thy = thy |> map_tsig (Type.hide_classes b (map (intern_class thy) xs));
|
wenzelm@16368
|
798 |
val hide_classes_i = map_tsig oo Type.hide_classes;
|
wenzelm@16442
|
799 |
fun hide_types b xs thy = thy |> map_tsig (Type.hide_types b (map (intern_type thy) xs));
|
wenzelm@16368
|
800 |
val hide_types_i = map_tsig oo Type.hide_types;
|
wenzelm@18062
|
801 |
fun hide_consts b xs thy = thy |> map_consts (fold (Consts.hide b o intern_const thy) xs);
|
wenzelm@18062
|
802 |
val hide_consts_i = map_consts oo (fold o Consts.hide);
|
wenzelm@386
|
803 |
|
wenzelm@17343
|
804 |
local
|
wenzelm@17343
|
805 |
|
wenzelm@17343
|
806 |
val kinds =
|
wenzelm@17343
|
807 |
[("class", (intern_class, can o certify_class, hide_classes_i)),
|
wenzelm@17343
|
808 |
("type", (intern_type, declared_tyname, hide_types_i)),
|
wenzelm@17343
|
809 |
("const", (intern_const, declared_const, hide_consts_i))];
|
wenzelm@17343
|
810 |
|
wenzelm@17343
|
811 |
fun gen_hide int b (kind, xnames) thy =
|
wenzelm@17343
|
812 |
(case AList.lookup (op =) kinds kind of
|
wenzelm@17343
|
813 |
SOME (intern, check, hide) =>
|
wenzelm@17343
|
814 |
let
|
wenzelm@17343
|
815 |
val names = if int then map (intern thy) xnames else xnames;
|
wenzelm@17343
|
816 |
val bads = filter_out (check thy) names;
|
wenzelm@17343
|
817 |
in
|
wenzelm@17343
|
818 |
if null bads then hide b names thy
|
wenzelm@17343
|
819 |
else error ("Attempt to hide undeclared item(s): " ^ commas_quote bads)
|
wenzelm@17343
|
820 |
end
|
wenzelm@17343
|
821 |
| NONE => error ("Bad name space specification: " ^ quote kind));
|
wenzelm@17343
|
822 |
|
wenzelm@17343
|
823 |
in
|
wenzelm@17343
|
824 |
|
wenzelm@17343
|
825 |
val hide_names = gen_hide true;
|
wenzelm@17343
|
826 |
val hide_names_i = gen_hide false;
|
wenzelm@17343
|
827 |
|
clasohm@0
|
828 |
end;
|
wenzelm@17343
|
829 |
|
wenzelm@17343
|
830 |
end;
|