author | haftmann |
Sat, 20 Aug 2011 01:21:22 +0200 | |
changeset 44323 | 4b5b430eb00e |
parent 43684 | 85388f5570c4 |
child 45211 | 3dd426ae6bea |
permissions | -rw-r--r-- |
24219 | 1 |
(* Title: Pure/Isar/code.ML |
2 |
Author: Florian Haftmann, TU Muenchen |
|
3 |
||
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
4 |
Abstract executable ingredients of theory. Management of data |
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
5 |
dependent on executable ingredients as synchronized cache; purged |
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
6 |
on any change of underlying executable ingredients. |
24219 | 7 |
*) |
8 |
||
9 |
signature CODE = |
|
10 |
sig |
|
31957 | 11 |
(*constants*) |
12 |
val check_const: theory -> term -> string |
|
13 |
val read_bare_const: theory -> string -> string * typ |
|
14 |
val read_const: theory -> string -> string |
|
31962 | 15 |
val string_of_const: theory -> string -> string |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
16 |
val cert_signature: theory -> typ -> typ |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
17 |
val read_signature: theory -> string -> typ |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
18 |
val const_typ: theory -> string -> typ |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
19 |
val subst_signatures: theory -> term -> term |
31962 | 20 |
val args_number: theory -> string -> int |
31957 | 21 |
|
31156 | 22 |
(*constructor sets*) |
23 |
val constrset_of_consts: theory -> (string * typ) list |
|
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
24 |
-> string * ((string * sort) list * (string * ((string * sort) list * typ list)) list) |
31156 | 25 |
|
34874 | 26 |
(*code equations and certificates*) |
31962 | 27 |
val mk_eqn: theory -> thm * bool -> thm * bool |
28 |
val mk_eqn_warning: theory -> thm -> (thm * bool) option |
|
29 |
val mk_eqn_liberal: theory -> thm -> (thm * bool) option |
|
31156 | 30 |
val assert_eqn: theory -> thm * bool -> thm * bool |
31957 | 31 |
val const_typ_eqn: theory -> thm -> string * typ |
34895 | 32 |
val expand_eta: theory -> int -> thm -> thm |
33 |
type cert |
|
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
34 |
val empty_cert: theory -> string -> cert |
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
35 |
val cert_of_eqns: theory -> string -> (thm * bool) list -> cert |
34874 | 36 |
val constrain_cert: theory -> sort list -> cert -> cert |
35226 | 37 |
val typargs_deps_of_cert: theory -> cert -> (string * sort) list * (string * typ list) list |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
38 |
val equations_of_cert: theory -> cert -> ((string * sort) list * typ) |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
39 |
* (((term * string option) list * (term * string option)) * (thm option * bool)) list |
35226 | 40 |
val bare_thms_of_cert: theory -> cert -> thm list |
34895 | 41 |
val pretty_cert: theory -> cert -> Pretty.T list |
31156 | 42 |
|
31962 | 43 |
(*executable code*) |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
44 |
val add_type: string -> theory -> theory |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
45 |
val add_type_cmd: string -> theory -> theory |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
46 |
val add_signature: string * typ -> theory -> theory |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
47 |
val add_signature_cmd: string * string -> theory -> theory |
31156 | 48 |
val add_datatype: (string * typ) list -> theory -> theory |
49 |
val add_datatype_cmd: string list -> theory -> theory |
|
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
50 |
val datatype_interpretation: |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
51 |
(string * ((string * sort) list * (string * ((string * sort) list * typ list)) list) |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
52 |
-> theory -> theory) -> theory -> theory |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
53 |
val add_abstype: thm -> theory -> theory |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
54 |
val abstype_interpretation: |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
55 |
(string * ((string * sort) list * ((string * ((string * sort) list * typ)) * (string * thm))) |
31156 | 56 |
-> theory -> theory) -> theory -> theory |
28368 | 57 |
val add_eqn: thm -> theory -> theory |
31088 | 58 |
val add_nbe_eqn: thm -> theory -> theory |
28368 | 59 |
val add_default_eqn: thm -> theory -> theory |
28703 | 60 |
val add_default_eqn_attribute: attribute |
61 |
val add_default_eqn_attrib: Attrib.src |
|
37425 | 62 |
val add_nbe_default_eqn: thm -> theory -> theory |
63 |
val add_nbe_default_eqn_attribute: attribute |
|
64 |
val add_nbe_default_eqn_attrib: Attrib.src |
|
28368 | 65 |
val del_eqn: thm -> theory -> theory |
66 |
val del_eqns: string -> theory -> theory |
|
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24837
diff
changeset
|
67 |
val add_case: thm -> theory -> theory |
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24837
diff
changeset
|
68 |
val add_undefined: string -> theory -> theory |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
69 |
val get_type: theory -> string |
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
70 |
-> ((string * sort) list * (string * ((string * sort) list * typ list)) list) * bool |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
71 |
val get_type_of_constr_or_abstr: theory -> string -> (string * bool) option |
35226 | 72 |
val is_constr: theory -> string -> bool |
73 |
val is_abstr: theory -> string -> bool |
|
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
74 |
val get_cert: theory -> ((thm * bool) list -> (thm * bool) list) -> string -> cert |
30023
55954f726043
permissive check for pattern discipline in case schemes
haftmann
parents:
29970
diff
changeset
|
75 |
val get_case_scheme: theory -> string -> (int * (int * string list)) option |
37438 | 76 |
val get_case_cong: theory -> string -> thm option |
31890
e943b039f0ac
an intermediate step towards a refined translation of cases
haftmann
parents:
31642
diff
changeset
|
77 |
val undefineds: theory -> string list |
24219 | 78 |
val print_codesetup: theory -> unit |
31957 | 79 |
|
80 |
(*infrastructure*) |
|
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
81 |
val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory |
24219 | 82 |
end; |
83 |
||
84 |
signature CODE_DATA_ARGS = |
|
85 |
sig |
|
86 |
type T |
|
87 |
val empty: T |
|
88 |
end; |
|
89 |
||
90 |
signature CODE_DATA = |
|
91 |
sig |
|
92 |
type T |
|
39397 | 93 |
val change: theory option -> (T -> T) -> T |
94 |
val change_yield: theory option -> (T -> 'a * T) -> 'a * T |
|
24219 | 95 |
end; |
96 |
||
97 |
signature PRIVATE_CODE = |
|
98 |
sig |
|
99 |
include CODE |
|
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
100 |
val declare_data: Object.T -> serial |
24219 | 101 |
val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a) |
34251 | 102 |
-> theory -> ('a -> 'b * 'a) -> 'b * 'a |
24219 | 103 |
end; |
104 |
||
105 |
structure Code : PRIVATE_CODE = |
|
106 |
struct |
|
107 |
||
31962 | 108 |
(** auxiliary **) |
109 |
||
110 |
(* printing *) |
|
31156 | 111 |
|
39134
917b4b6ba3d2
turned show_sorts/show_types into proper configuration options;
wenzelm
parents:
39020
diff
changeset
|
112 |
fun string_of_typ thy = |
917b4b6ba3d2
turned show_sorts/show_types into proper configuration options;
wenzelm
parents:
39020
diff
changeset
|
113 |
Syntax.string_of_typ (Config.put show_sorts true (Syntax.init_pretty_global thy)); |
31962 | 114 |
|
42359 | 115 |
fun string_of_const thy c = |
42360 | 116 |
let val ctxt = Proof_Context.init_global thy in |
42359 | 117 |
case AxClass.inst_of_param thy c of |
118 |
SOME (c, tyco) => |
|
42360 | 119 |
Proof_Context.extern_const ctxt c ^ " " ^ enclose "[" "]" |
120 |
(Proof_Context.extern_type ctxt tyco) |
|
121 |
| NONE => Proof_Context.extern_const ctxt c |
|
42359 | 122 |
end; |
31156 | 123 |
|
31962 | 124 |
|
125 |
(* constants *) |
|
31156 | 126 |
|
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
127 |
fun typ_equiv tys = Type.raw_instance tys andalso Type.raw_instance (swap tys); |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
128 |
|
31962 | 129 |
fun check_bare_const thy t = case try dest_Const t |
130 |
of SOME c_ty => c_ty |
|
131 |
| NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t); |
|
31156 | 132 |
|
40362
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
133 |
fun check_unoverload thy (c, ty) = |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
134 |
let |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
135 |
val c' = AxClass.unoverload_const thy (c, ty); |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
136 |
val ty_decl = Sign.the_const_type thy c'; |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
137 |
in if Sign.typ_equiv thy |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
138 |
(Type.strip_sorts ty_decl, Type.strip_sorts (Logic.varifyT_global ty)) then c' |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
139 |
else error ("Type\n" ^ string_of_typ thy ty |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
140 |
^ "\nof constant " ^ quote c |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
141 |
^ "\nis too specific compared to declared type\n" |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
142 |
^ string_of_typ thy ty_decl) |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
143 |
end; |
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
144 |
|
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
145 |
fun check_const thy = check_unoverload thy o check_bare_const thy; |
31962 | 146 |
|
147 |
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy; |
|
148 |
||
40362
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
149 |
fun read_const thy = check_unoverload thy o read_bare_const thy; |
31156 | 150 |
|
32872
019201eb7e07
variables in type schemes must be renamed simultaneously with variables in equations
haftmann
parents:
32738
diff
changeset
|
151 |
|
31962 | 152 |
(** data store **) |
153 |
||
35226 | 154 |
(* datatypes *) |
155 |
||
43634 | 156 |
datatype typ_spec = Constructors of (string * ((string * sort) list * typ list)) list * |
157 |
string list (*references to associated case constructors*) |
|
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
158 |
| Abstractor of (string * ((string * sort) list * typ)) * (string * thm); |
31962 | 159 |
|
43634 | 160 |
fun constructors_of (Constructors (cos, _)) = (cos, false) |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
161 |
| constructors_of (Abstractor ((co, (vs, ty)), _)) = ([(co, (vs, [ty]))], true); |
35226 | 162 |
|
43638 | 163 |
fun case_consts_of (Constructors (_, case_consts)) = case_consts |
164 |
| case_consts_of (Abstractor _) = []; |
|
35226 | 165 |
|
166 |
(* functions *) |
|
31962 | 167 |
|
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
168 |
datatype fun_spec = Default of (thm * bool) list * (thm * bool) list lazy |
43634 | 169 |
(* (cache for default equations, lazy computation of default equations) |
170 |
-- helps to restore natural order of default equations *) |
|
35226 | 171 |
| Eqns of (thm * bool) list |
172 |
| Proj of term * string |
|
173 |
| Abstr of thm * string; |
|
31962 | 174 |
|
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
175 |
val empty_fun_spec = Default ([], Lazy.value []); |
31962 | 176 |
|
35226 | 177 |
fun is_default (Default _) = true |
178 |
| is_default _ = false; |
|
179 |
||
180 |
fun associated_abstype (Abstr (_, tyco)) = SOME tyco |
|
181 |
| associated_abstype _ = NONE; |
|
31962 | 182 |
|
183 |
||
184 |
(* executable code data *) |
|
185 |
||
186 |
datatype spec = Spec of { |
|
187 |
history_concluded: bool, |
|
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
188 |
signatures: int Symtab.table * typ Symtab.table, |
35226 | 189 |
functions: ((bool * fun_spec) * (serial * fun_spec) list) Symtab.table |
31962 | 190 |
(*with explicit history*), |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
191 |
types: ((serial * ((string * sort) list * typ_spec)) list) Symtab.table |
31962 | 192 |
(*with explicit history*), |
37438 | 193 |
cases: ((int * (int * string list)) * thm) Symtab.table * unit Symtab.table |
31962 | 194 |
}; |
195 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
196 |
fun make_spec (history_concluded, ((signatures, functions), (types, cases))) = |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
197 |
Spec { history_concluded = history_concluded, |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
198 |
signatures = signatures, functions = functions, types = types, cases = cases }; |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
199 |
fun map_spec f (Spec { history_concluded = history_concluded, signatures = signatures, |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
200 |
functions = functions, types = types, cases = cases }) = |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
201 |
make_spec (f (history_concluded, ((signatures, functions), (types, cases)))); |
35226 | 202 |
fun merge_spec (Spec { history_concluded = _, signatures = (tycos1, sigs1), functions = functions1, |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
203 |
types = types1, cases = (cases1, undefs1) }, |
35226 | 204 |
Spec { history_concluded = _, signatures = (tycos2, sigs2), functions = functions2, |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
205 |
types = types2, cases = (cases2, undefs2) }) = |
31156 | 206 |
let |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
207 |
val signatures = (Symtab.merge (op =) (tycos1, tycos2), |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
208 |
Symtab.merge typ_equiv (sigs1, sigs2)); |
42707
42d607a9ae65
improving merge of code specifications by removing code equations of constructors after merging two theories
bulwahn
parents:
42375
diff
changeset
|
209 |
val types = Symtab.join (K (AList.merge (op =) (K true))) (types1, types2); |
43639
9cba66fb109a
correction: do not assume that case const index covered all cases
haftmann
parents:
43638
diff
changeset
|
210 |
val case_consts_of' = (maps case_consts_of o map (snd o snd o hd o snd) o Symtab.dest); |
35226 | 211 |
fun merge_functions ((_, history1), (_, history2)) = |
31962 | 212 |
let |
213 |
val raw_history = AList.merge (op = : serial * serial -> bool) |
|
35226 | 214 |
(K true) (history1, history2); |
215 |
val filtered_history = filter_out (is_default o snd) raw_history; |
|
31962 | 216 |
val history = if null filtered_history |
217 |
then raw_history else filtered_history; |
|
218 |
in ((false, (snd o hd) history), history) end; |
|
43638 | 219 |
val all_datatype_specs = map (snd o snd o hd o snd) (Symtab.dest types); |
220 |
val all_constructors = maps (map fst o fst o constructors_of) all_datatype_specs; |
|
43639
9cba66fb109a
correction: do not assume that case const index covered all cases
haftmann
parents:
43638
diff
changeset
|
221 |
val invalidated_case_consts = union (op =) (case_consts_of' types1) (case_consts_of' types2) |
9cba66fb109a
correction: do not assume that case const index covered all cases
haftmann
parents:
43638
diff
changeset
|
222 |
|> subtract (op =) (maps case_consts_of all_datatype_specs) |
42707
42d607a9ae65
improving merge of code specifications by removing code equations of constructors after merging two theories
bulwahn
parents:
42375
diff
changeset
|
223 |
val functions = Symtab.join (K merge_functions) (functions1, functions2) |
42d607a9ae65
improving merge of code specifications by removing code equations of constructors after merging two theories
bulwahn
parents:
42375
diff
changeset
|
224 |
|> fold (fn c => Symtab.map_entry c (apfst (K (true, empty_fun_spec)))) all_constructors; |
43638 | 225 |
val cases = (Symtab.merge (K true) (cases1, cases2) |
43639
9cba66fb109a
correction: do not assume that case const index covered all cases
haftmann
parents:
43638
diff
changeset
|
226 |
|> fold Symtab.delete invalidated_case_consts, Symtab.merge (K true) (undefs1, undefs2)); |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
227 |
in make_spec (false, ((signatures, functions), (types, cases))) end; |
31962 | 228 |
|
229 |
fun history_concluded (Spec { history_concluded, ... }) = history_concluded; |
|
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
230 |
fun the_signatures (Spec { signatures, ... }) = signatures; |
35226 | 231 |
fun the_functions (Spec { functions, ... }) = functions; |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
232 |
fun the_types (Spec { types, ... }) = types; |
31962 | 233 |
fun the_cases (Spec { cases, ... }) = cases; |
32544 | 234 |
val map_history_concluded = map_spec o apfst; |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
235 |
val map_signatures = map_spec o apsnd o apfst o apfst; |
35226 | 236 |
val map_functions = map_spec o apsnd o apfst o apsnd; |
237 |
val map_typs = map_spec o apsnd o apsnd o apfst; |
|
31962 | 238 |
val map_cases = map_spec o apsnd o apsnd o apsnd; |
239 |
||
240 |
||
241 |
(* data slots dependent on executable code *) |
|
242 |
||
243 |
(*private copy avoids potential conflict of table exceptions*) |
|
31971
8c1b845ed105
renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents:
31962
diff
changeset
|
244 |
structure Datatab = Table(type key = int val ord = int_ord); |
31962 | 245 |
|
246 |
local |
|
247 |
||
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
248 |
type kind = { empty: Object.T }; |
31962 | 249 |
|
43684 | 250 |
val kinds = Synchronized.var "Code_Data" (Datatab.empty: kind Datatab.table); |
31962 | 251 |
|
43684 | 252 |
fun invoke f k = |
253 |
(case Datatab.lookup (Synchronized.value kinds) k of |
|
254 |
SOME kind => f kind |
|
255 |
| NONE => raise Fail "Invalid code data identifier"); |
|
31962 | 256 |
|
257 |
in |
|
258 |
||
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
259 |
fun declare_data empty = |
31962 | 260 |
let |
261 |
val k = serial (); |
|
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
262 |
val kind = { empty = empty }; |
43684 | 263 |
val _ = Synchronized.change kinds (Datatab.update (k, kind)); |
31962 | 264 |
in k end; |
265 |
||
266 |
fun invoke_init k = invoke (fn kind => #empty kind) k; |
|
267 |
||
268 |
end; (*local*) |
|
269 |
||
270 |
||
271 |
(* theory store *) |
|
272 |
||
273 |
local |
|
274 |
||
275 |
type data = Object.T Datatab.table; |
|
34244 | 276 |
fun empty_dataref () = Synchronized.var "code data" (NONE : (data * theory_ref) option); |
31962 | 277 |
|
34244 | 278 |
structure Code_Data = Theory_Data |
31962 | 279 |
( |
34244 | 280 |
type T = spec * (data * theory_ref) option Synchronized.var; |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
281 |
val empty = (make_spec (false, (((Symtab.empty, Symtab.empty), Symtab.empty), |
34244 | 282 |
(Symtab.empty, (Symtab.empty, Symtab.empty)))), empty_dataref ()); |
41472
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
40844
diff
changeset
|
283 |
val extend = I (* FIXME empty_dataref!?! *) |
34244 | 284 |
fun merge ((spec1, _), (spec2, _)) = |
285 |
(merge_spec (spec1, spec2), empty_dataref ()); |
|
31962 | 286 |
); |
287 |
||
288 |
in |
|
289 |
||
35226 | 290 |
|
31962 | 291 |
(* access to executable code *) |
292 |
||
293 |
val the_exec = fst o Code_Data.get; |
|
294 |
||
34244 | 295 |
fun map_exec_purge f = Code_Data.map (fn (exec, _) => (f exec, empty_dataref ())); |
31962 | 296 |
|
35226 | 297 |
fun change_fun_spec delete c f = (map_exec_purge o map_functions |
298 |
o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, empty_fun_spec), []))) |
|
299 |
o apfst) (fn (_, spec) => (true, f spec)); |
|
31962 | 300 |
|
301 |
||
302 |
(* tackling equation history *) |
|
303 |
||
304 |
fun continue_history thy = if (history_concluded o the_exec) thy |
|
305 |
then thy |
|
306 |
|> (Code_Data.map o apfst o map_history_concluded) (K false) |
|
307 |
|> SOME |
|
308 |
else NONE; |
|
309 |
||
310 |
fun conclude_history thy = if (history_concluded o the_exec) thy |
|
311 |
then NONE |
|
312 |
else thy |
|
313 |
|> (Code_Data.map o apfst) |
|
39020 | 314 |
((map_functions o Symtab.map) (fn _ => fn ((changed, current), history) => |
31962 | 315 |
((false, current), |
316 |
if changed then (serial (), current) :: history else history)) |
|
317 |
#> map_history_concluded (K true)) |
|
318 |
|> SOME; |
|
319 |
||
34244 | 320 |
val _ = Context.>> (Context.map_theory (Theory.at_begin continue_history #> Theory.at_end conclude_history)); |
31962 | 321 |
|
322 |
||
323 |
(* access to data dependent on abstract executable code *) |
|
324 |
||
34244 | 325 |
fun change_yield_data (kind, mk, dest) theory f = |
31962 | 326 |
let |
34244 | 327 |
val dataref = (snd o Code_Data.get) theory; |
34251 | 328 |
val (datatab, thy_ref) = case Synchronized.value dataref |
329 |
of SOME (datatab, thy_ref) => if Theory.eq_thy (theory, Theory.deref thy_ref) |
|
330 |
then (datatab, thy_ref) |
|
331 |
else (Datatab.empty, Theory.check_thy theory) |
|
332 |
| NONE => (Datatab.empty, Theory.check_thy theory) |
|
34244 | 333 |
val data = case Datatab.lookup datatab kind |
334 |
of SOME data => data |
|
335 |
| NONE => invoke_init kind; |
|
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
336 |
val result as (_, data') = f (dest data); |
34244 | 337 |
val _ = Synchronized.change dataref |
338 |
((K o SOME) (Datatab.update (kind, mk data') datatab, thy_ref)); |
|
339 |
in result end; |
|
31962 | 340 |
|
341 |
end; (*local*) |
|
342 |
||
343 |
||
344 |
(** foundation **) |
|
345 |
||
346 |
(* constants *) |
|
347 |
||
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
348 |
fun arity_number thy tyco = case Symtab.lookup ((fst o the_signatures o the_exec) thy) tyco |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
349 |
of SOME n => n |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
350 |
| NONE => Sign.arity_number thy tyco; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
351 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
352 |
fun build_tsig thy = |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
353 |
let |
42375
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
354 |
val ctxt = Syntax.init_pretty_global thy; |
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
355 |
val (tycos, _) = the_signatures (the_exec thy); |
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
356 |
val decls = #types (Type.rep_tsig (Sign.tsig_of thy)) |
34272 | 357 |
|> snd |
358 |
|> Symtab.fold (fn (tyco, n) => |
|
359 |
Symtab.update (tyco, Type.LogicalType n)) tycos; |
|
360 |
in |
|
361 |
Type.empty_tsig |
|
42375
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
362 |
|> Symtab.fold (fn (tyco, Type.LogicalType n) => Type.add_type ctxt Name_Space.default_naming |
34272 | 363 |
(Binding.qualified_name tyco, n) | _ => I) decls |
364 |
end; |
|
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
365 |
|
42375
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
366 |
fun cert_signature thy = |
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
367 |
Logic.varifyT_global o Type.cert_typ (build_tsig thy) o Type.no_tvars; |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
368 |
|
42375
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
369 |
fun read_signature thy = |
774df7c59508
report Name_Space.declare/define, relatively to context;
wenzelm
parents:
42360
diff
changeset
|
370 |
cert_signature thy o Type.strip_sorts o Syntax.parse_typ (Proof_Context.init_global thy); |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
371 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
372 |
fun expand_signature thy = Type.cert_typ_mode Type.mode_syntax (Sign.tsig_of thy); |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
373 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
374 |
fun lookup_typ thy = Symtab.lookup ((snd o the_signatures o the_exec) thy); |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
375 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
376 |
fun const_typ thy c = case lookup_typ thy c |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
377 |
of SOME ty => ty |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
378 |
| NONE => (Type.strip_sorts o Sign.the_const_type thy) c; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
379 |
|
40844 | 380 |
fun args_number thy = length o binder_types o const_typ thy; |
40764
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
381 |
|
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
382 |
fun subst_signature thy c ty = |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
383 |
let |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
384 |
fun mk_subst (Type (_, tys1)) (Type (_, tys2)) = |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
385 |
fold2 mk_subst tys1 tys2 |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
386 |
| mk_subst ty (TVar (v, _)) = Vartab.update (v, ([], ty)) |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
387 |
in case lookup_typ thy c |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
388 |
of SOME ty' => Envir.subst_type (mk_subst ty (expand_signature thy ty') Vartab.empty) ty' |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
389 |
| NONE => ty |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
390 |
end; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
391 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
392 |
fun subst_signatures thy = map_aterms (fn Const (c, ty) => Const (c, subst_signature thy c ty) | t => t); |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
393 |
|
40764
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
394 |
fun logical_typscheme thy (c, ty) = |
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
395 |
(map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty); |
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
396 |
|
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
397 |
fun typscheme thy (c, ty) = logical_typscheme thy (c, subst_signature thy c ty); |
31962 | 398 |
|
399 |
||
400 |
(* datatypes *) |
|
31156 | 401 |
|
35226 | 402 |
fun no_constr thy s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c |
403 |
^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s); |
|
404 |
||
40803 | 405 |
fun analyze_constructor thy (c, raw_ty) = |
31156 | 406 |
let |
35226 | 407 |
val _ = Thm.cterm_of thy (Const (c, raw_ty)); |
408 |
val ty = subst_signature thy c raw_ty; |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
409 |
val ty_decl = (Logic.unvarifyT_global o const_typ thy) c; |
31156 | 410 |
fun last_typ c_ty ty = |
411 |
let |
|
33531 | 412 |
val tfrees = Term.add_tfreesT ty []; |
40844 | 413 |
val (tyco, vs) = (apsnd o map) dest_TFree (dest_Type (body_type ty)) |
35226 | 414 |
handle TYPE _ => no_constr thy "bad type" c_ty |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
415 |
val _ = if tyco = "fun" then no_constr thy "bad type" c_ty else (); |
33531 | 416 |
val _ = if has_duplicates (eq_fst (op =)) vs |
35226 | 417 |
then no_constr thy "duplicate type variables in datatype" c_ty else (); |
33531 | 418 |
val _ = if length tfrees <> length vs |
35226 | 419 |
then no_constr thy "type variables missing in datatype" c_ty else (); |
31156 | 420 |
in (tyco, vs) end; |
35226 | 421 |
val (tyco, _) = last_typ (c, ty) ty_decl; |
422 |
val (_, vs) = last_typ (c, ty) ty; |
|
423 |
in ((tyco, map snd vs), (c, (map fst vs, ty))) end; |
|
424 |
||
425 |
fun constrset_of_consts thy cs = |
|
426 |
let |
|
427 |
val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c |
|
428 |
then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs; |
|
31156 | 429 |
fun add ((tyco', sorts'), c) ((tyco, sorts), cs) = |
430 |
let |
|
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
431 |
val _ = if (tyco' : string) <> tyco |
31156 | 432 |
then error "Different type constructors in constructor set" |
433 |
else (); |
|
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
434 |
val sorts'' = |
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
435 |
map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts |
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
436 |
in ((tyco, sorts''), c :: cs) end; |
31156 | 437 |
fun inst vs' (c, (vs, ty)) = |
438 |
let |
|
439 |
val the_v = the o AList.lookup (op =) (vs ~~ vs'); |
|
40803 | 440 |
val ty' = map_type_tfree (fn (v, _) => TFree (the_v v)) ty; |
40764
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
441 |
val (vs'', _) = logical_typscheme thy (c, ty'); |
40844 | 442 |
in (c, (vs'', binder_types ty')) end; |
40803 | 443 |
val c' :: cs' = map (analyze_constructor thy) cs; |
31156 | 444 |
val ((tyco, sorts), cs'') = fold add cs' (apsnd single c'); |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
445 |
val vs = Name.invent_names Name.context Name.aT sorts; |
31156 | 446 |
val cs''' = map (inst vs) cs''; |
447 |
in (tyco, (vs, rev cs''')) end; |
|
448 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
449 |
fun get_type_entry thy tyco = case these (Symtab.lookup ((the_types o the_exec) thy) tyco) |
35226 | 450 |
of (_, entry) :: _ => SOME entry |
451 |
| _ => NONE; |
|
31962 | 452 |
|
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
453 |
fun get_type thy tyco = case get_type_entry thy tyco |
35226 | 454 |
of SOME (vs, spec) => apfst (pair vs) (constructors_of spec) |
455 |
| NONE => arity_number thy tyco |
|
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
456 |
|> Name.invent Name.context Name.aT |
35226 | 457 |
|> map (rpair []) |
458 |
|> rpair [] |
|
459 |
|> rpair false; |
|
460 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
461 |
fun get_abstype_spec thy tyco = case get_type_entry thy tyco |
35226 | 462 |
of SOME (vs, Abstractor spec) => (vs, spec) |
36122 | 463 |
| _ => error ("Not an abstract type: " ^ tyco); |
35226 | 464 |
|
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
465 |
fun get_type_of_constr_or_abstr thy c = |
40844 | 466 |
case (body_type o const_typ thy) c |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
467 |
of Type (tyco, _) => let val ((_, cos), abstract) = get_type thy tyco |
35226 | 468 |
in if member (op =) (map fst cos) c then SOME (tyco, abstract) else NONE end |
31962 | 469 |
| _ => NONE; |
470 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
471 |
fun is_constr thy c = case get_type_of_constr_or_abstr thy c |
35226 | 472 |
of SOME (_, false) => true |
473 |
| _ => false; |
|
474 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
475 |
fun is_abstr thy c = case get_type_of_constr_or_abstr thy c |
35226 | 476 |
of SOME (_, true) => true |
477 |
| _ => false; |
|
31962 | 478 |
|
31156 | 479 |
|
34874 | 480 |
(* bare code equations *) |
31156 | 481 |
|
35226 | 482 |
(* convention for variables: |
483 |
?x ?'a for free-floating theorems (e.g. in the data store) |
|
484 |
?x 'a for certificates |
|
485 |
x 'a for final representation of equations |
|
486 |
*) |
|
487 |
||
31156 | 488 |
exception BAD_THM of string; |
489 |
fun bad_thm msg = raise BAD_THM msg; |
|
490 |
fun error_thm f thm = f thm handle BAD_THM msg => error msg; |
|
31642 | 491 |
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE) |
31156 | 492 |
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE; |
493 |
||
494 |
fun is_linear thm = |
|
495 |
let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm |
|
496 |
in not (has_duplicates (op =) ((fold o fold_aterms) |
|
497 |
(fn Var (v, _) => cons v | _ => I) args [])) end; |
|
498 |
||
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
499 |
fun check_decl_ty thy (c, ty) = |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
500 |
let |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
501 |
val ty_decl = Sign.the_const_type thy c; |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
502 |
in if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty) then () |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
503 |
else bad_thm ("Type\n" ^ string_of_typ thy ty |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
504 |
^ "\nof constant " ^ quote c |
40362
82a066bff182
Code.check_const etc.: reject too specific types
haftmann
parents:
40316
diff
changeset
|
505 |
^ "\nis too specific compared to declared type\n" |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
506 |
^ string_of_typ thy ty_decl) |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
507 |
end; |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
508 |
|
35226 | 509 |
fun check_eqn thy { allow_nonlinear, allow_consts, allow_pats } thm (lhs, rhs) = |
31156 | 510 |
let |
34894 | 511 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm); |
31156 | 512 |
fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v |
34894 | 513 |
| Free _ => bad "Illegal free variable in equation" |
31156 | 514 |
| _ => I) t []; |
515 |
fun tvars_of t = fold_term_types (fn _ => |
|
516 |
fold_atyps (fn TVar (v, _) => insert (op =) v |
|
34894 | 517 |
| TFree _ => bad "Illegal free type variable in equation")) t []; |
31156 | 518 |
val lhs_vs = vars_of lhs; |
519 |
val rhs_vs = vars_of rhs; |
|
520 |
val lhs_tvs = tvars_of lhs; |
|
521 |
val rhs_tvs = tvars_of rhs; |
|
522 |
val _ = if null (subtract (op =) lhs_vs rhs_vs) |
|
523 |
then () |
|
34894 | 524 |
else bad "Free variables on right hand side of equation"; |
31156 | 525 |
val _ = if null (subtract (op =) lhs_tvs rhs_tvs) |
526 |
then () |
|
34894 | 527 |
else bad "Free type variables on right hand side of equation"; |
528 |
val (head, args) = strip_comb lhs; |
|
31156 | 529 |
val (c, ty) = case head |
530 |
of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty) |
|
34894 | 531 |
| _ => bad "Equation not headed by constant"; |
532 |
fun check _ (Abs _) = bad "Abstraction on left hand side of equation" |
|
31156 | 533 |
| check 0 (Var _) = () |
34894 | 534 |
| check _ (Var _) = bad "Variable with application on left hand side of equation" |
31156 | 535 |
| check n (t1 $ t2) = (check (n+1) t1; check 0 t2) |
34894 | 536 |
| check n (Const (c_ty as (c, ty))) = |
35226 | 537 |
if allow_pats then let |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
538 |
val c' = AxClass.unoverload_const thy c_ty |
40844 | 539 |
in if n = (length o binder_types o subst_signature thy c') ty |
35226 | 540 |
then if allow_consts orelse is_constr thy c' |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
541 |
then () |
34894 | 542 |
else bad (quote c ^ " is not a constructor, on left hand side of equation") |
543 |
else bad ("Partially applied constant " ^ quote c ^ " on left hand side of equation") |
|
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
544 |
end else bad ("Pattern not allowed here, but constant " ^ quote c ^ " encountered on left hand side") |
31156 | 545 |
val _ = map (check 0) args; |
35226 | 546 |
val _ = if allow_nonlinear orelse is_linear thm then () |
34894 | 547 |
else bad "Duplicate variables on left hand side of equation"; |
548 |
val _ = if (is_none o AxClass.class_of_param thy) c then () |
|
549 |
else bad "Overloaded constant as head in equation"; |
|
550 |
val _ = if not (is_constr thy c) then () |
|
551 |
else bad "Constructor as head in equation"; |
|
35226 | 552 |
val _ = if not (is_abstr thy c) then () |
553 |
else bad "Abstractor as head in equation"; |
|
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
554 |
val _ = check_decl_ty thy (c, ty); |
35226 | 555 |
in () end; |
556 |
||
557 |
fun gen_assert_eqn thy check_patterns (thm, proper) = |
|
558 |
let |
|
559 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm); |
|
560 |
val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm |
|
561 |
handle TERM _ => bad "Not an equation" |
|
562 |
| THM _ => bad "Not a proper equation"; |
|
563 |
val _ = check_eqn thy { allow_nonlinear = not proper, |
|
564 |
allow_consts = not (proper andalso check_patterns), allow_pats = true } thm (lhs, rhs); |
|
31156 | 565 |
in (thm, proper) end; |
566 |
||
35226 | 567 |
fun assert_abs_eqn thy some_tyco thm = |
568 |
let |
|
569 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm); |
|
570 |
val (full_lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm |
|
571 |
handle TERM _ => bad "Not an equation" |
|
572 |
| THM _ => bad "Not a proper equation"; |
|
573 |
val (rep, lhs) = dest_comb full_lhs |
|
574 |
handle TERM _ => bad "Not an abstract equation"; |
|
36202
43ea1f28fc7c
explicit check sorts in abstract certificates; abstractor is part of dependencies
haftmann
parents:
36122
diff
changeset
|
575 |
val (rep_const, ty) = dest_Const rep; |
40187
9b6e918682d5
more general treatment of type argument in code certificates for operations on abstract types
haftmann
parents:
39811
diff
changeset
|
576 |
val (tyco, Ts) = (dest_Type o domain_type) ty |
39552 | 577 |
handle TERM _ => bad "Not an abstract equation" |
578 |
| TYPE _ => bad "Not an abstract equation"; |
|
35226 | 579 |
val _ = case some_tyco of SOME tyco' => if tyco = tyco' then () |
580 |
else bad ("Abstract type mismatch:" ^ quote tyco ^ " vs. " ^ quote tyco') |
|
581 |
| NONE => (); |
|
36202
43ea1f28fc7c
explicit check sorts in abstract certificates; abstractor is part of dependencies
haftmann
parents:
36122
diff
changeset
|
582 |
val (vs', (_, (rep', _))) = get_abstype_spec thy tyco; |
35226 | 583 |
val _ = if rep_const = rep' then () |
584 |
else bad ("Projection mismatch: " ^ quote rep_const ^ " vs. " ^ quote rep'); |
|
585 |
val _ = check_eqn thy { allow_nonlinear = false, |
|
586 |
allow_consts = false, allow_pats = false } thm (lhs, rhs); |
|
40564 | 587 |
val _ = if forall2 (fn T => fn (_, sort) => Sign.of_sort thy (T, sort)) Ts vs' then () |
40187
9b6e918682d5
more general treatment of type argument in code certificates for operations on abstract types
haftmann
parents:
39811
diff
changeset
|
588 |
else error ("Type arguments do not satisfy sort constraints of abstype certificate."); |
35226 | 589 |
in (thm, tyco) end; |
590 |
||
34894 | 591 |
fun assert_eqn thy = error_thm (gen_assert_eqn thy true); |
31962 | 592 |
|
42360 | 593 |
fun meta_rewrite thy = Local_Defs.meta_rewrite_rule (Proof_Context.init_global thy); |
31156 | 594 |
|
34894 | 595 |
fun mk_eqn thy = error_thm (gen_assert_eqn thy false) o |
31962 | 596 |
apfst (meta_rewrite thy); |
597 |
||
598 |
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm)) |
|
34894 | 599 |
o warning_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy; |
31962 | 600 |
|
601 |
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm)) |
|
34894 | 602 |
o try_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy; |
31156 | 603 |
|
35226 | 604 |
fun mk_abs_eqn thy = error_thm (assert_abs_eqn thy NONE) o meta_rewrite thy; |
605 |
||
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
606 |
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of; |
31156 | 607 |
|
31957 | 608 |
fun const_typ_eqn thy thm = |
31156 | 609 |
let |
32640
ba6531df2c64
corrected order of type variables in code equations; more precise certificate for cases
haftmann
parents:
32544
diff
changeset
|
610 |
val (c, ty) = head_eqn thm; |
31156 | 611 |
val c' = AxClass.unoverload_const thy (c, ty); |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
612 |
(*permissive wrt. to overloaded constants!*) |
31156 | 613 |
in (c', ty) end; |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
614 |
|
31957 | 615 |
fun const_eqn thy = fst o const_typ_eqn thy; |
31156 | 616 |
|
35226 | 617 |
fun const_abs_eqn thy = AxClass.unoverload_const thy o dest_Const o fst o strip_comb o snd |
618 |
o dest_comb o fst o Logic.dest_equals o Thm.plain_prop_of; |
|
619 |
||
620 |
fun mk_proj tyco vs ty abs rep = |
|
621 |
let |
|
622 |
val ty_abs = Type (tyco, map TFree vs); |
|
623 |
val xarg = Var (("x", 0), ty); |
|
624 |
in Logic.mk_equals (Const (rep, ty_abs --> ty) $ (Const (abs, ty --> ty_abs) $ xarg), xarg) end; |
|
625 |
||
34895 | 626 |
|
627 |
(* technical transformations of code equations *) |
|
628 |
||
629 |
fun expand_eta thy k thm = |
|
630 |
let |
|
631 |
val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm; |
|
632 |
val (_, args) = strip_comb lhs; |
|
633 |
val l = if k = ~1 |
|
634 |
then (length o fst o strip_abs) rhs |
|
635 |
else Int.max (0, k - length args); |
|
636 |
val (raw_vars, _) = Term.strip_abs_eta l rhs; |
|
637 |
val vars = burrow_fst (Name.variant_list (map (fst o fst) (Term.add_vars lhs []))) |
|
638 |
raw_vars; |
|
639 |
fun expand (v, ty) thm = Drule.fun_cong_rule thm |
|
640 |
(Thm.cterm_of thy (Var ((v, 0), ty))); |
|
641 |
in |
|
642 |
thm |
|
643 |
|> fold expand vars |
|
644 |
|> Conv.fconv_rule Drule.beta_eta_conversion |
|
645 |
end; |
|
646 |
||
647 |
fun same_arity thy thms = |
|
31962 | 648 |
let |
34895 | 649 |
val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals; |
650 |
val k = fold (Integer.max o num_args_of o Thm.prop_of) thms 0; |
|
651 |
in map (expand_eta thy k) thms end; |
|
652 |
||
653 |
fun mk_desymbolization pre post mk vs = |
|
654 |
let |
|
655 |
val names = map (pre o fst o fst) vs |
|
656 |
|> map (Name.desymbolize false) |
|
657 |
|> Name.variant_list [] |
|
658 |
|> map post; |
|
659 |
in map_filter (fn (((v, i), x), v') => |
|
660 |
if v = v' andalso i = 0 then NONE |
|
661 |
else SOME (((v, i), x), mk ((v', 0), x))) (vs ~~ names) |
|
662 |
end; |
|
663 |
||
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
664 |
fun desymbolize_tvars thms = |
34895 | 665 |
let |
666 |
val tvs = fold (Term.add_tvars o Thm.prop_of) thms []; |
|
667 |
val tvar_subst = mk_desymbolization (unprefix "'") (prefix "'") TVar tvs; |
|
668 |
in map (Thm.certify_instantiate (tvar_subst, [])) thms end; |
|
669 |
||
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
670 |
fun desymbolize_vars thm = |
34895 | 671 |
let |
672 |
val vs = Term.add_vars (Thm.prop_of thm) []; |
|
673 |
val var_subst = mk_desymbolization I I Var vs; |
|
674 |
in Thm.certify_instantiate ([], var_subst) thm end; |
|
675 |
||
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
676 |
fun canonize_thms thy = desymbolize_tvars #> same_arity thy #> map desymbolize_vars; |
31156 | 677 |
|
34874 | 678 |
|
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
679 |
(* abstype certificates *) |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
680 |
|
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
681 |
fun check_abstype_cert thy proto_thm = |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
682 |
let |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
683 |
val thm = (AxClass.unoverload thy o meta_rewrite thy) proto_thm; |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
684 |
fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm); |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
685 |
val (lhs, rhs) = Logic.dest_equals (Thm.plain_prop_of thm) |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
686 |
handle TERM _ => bad "Not an equation" |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
687 |
| THM _ => bad "Not a proper equation"; |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
688 |
val ((abs, raw_ty), ((rep, rep_ty), param)) = (apsnd (apfst dest_Const o dest_comb) |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
689 |
o apfst dest_Const o dest_comb) lhs |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
690 |
handle TERM _ => bad "Not an abstype certificate"; |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
691 |
val _ = pairself (fn c => if (is_some o AxClass.class_of_param thy) c |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
692 |
then error ("Is a class parameter: " ^ string_of_const thy c) else ()) (abs, rep); |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
693 |
val _ = check_decl_ty thy (abs, raw_ty); |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
694 |
val _ = check_decl_ty thy (rep, rep_ty); |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
695 |
val _ = (fst o dest_Var) param |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
696 |
handle TERM _ => bad "Not an abstype certificate"; |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
697 |
val _ = if param = rhs then () else bad "Not an abstype certificate"; |
40803 | 698 |
val ((tyco, sorts), (abs, (vs, ty'))) = analyze_constructor thy (abs, Logic.unvarifyT_global raw_ty); |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
699 |
val ty = domain_type ty'; |
40764
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
700 |
val (vs', _) = logical_typscheme thy (abs, ty'); |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
701 |
in (tyco, (vs ~~ sorts, ((abs, (vs', ty)), (rep, thm)))) end; |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
702 |
|
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
703 |
|
34874 | 704 |
(* code equation certificates *) |
705 |
||
34895 | 706 |
fun build_head thy (c, ty) = |
707 |
Thm.cterm_of thy (Logic.mk_equals (Free ("HEAD", ty), Const (c, ty))); |
|
34874 | 708 |
|
34895 | 709 |
fun get_head thy cert_thm = |
710 |
let |
|
711 |
val [head] = (#hyps o Thm.crep_thm) cert_thm; |
|
712 |
val (_, Const (c, ty)) = (Logic.dest_equals o Thm.term_of) head; |
|
713 |
in (typscheme thy (c, ty), head) end; |
|
714 |
||
35226 | 715 |
fun typscheme_projection thy = |
716 |
typscheme thy o dest_Const o fst o dest_comb o fst o Logic.dest_equals; |
|
717 |
||
718 |
fun typscheme_abs thy = |
|
719 |
typscheme thy o dest_Const o fst o strip_comb o snd o dest_comb o fst o Logic.dest_equals o Thm.prop_of; |
|
720 |
||
721 |
fun constrain_thm thy vs sorts thm = |
|
722 |
let |
|
723 |
val mapping = map2 (fn (v, sort) => fn sort' => |
|
724 |
(v, Sorts.inter_sort (Sign.classes_of thy) (sort, sort'))) vs sorts; |
|
725 |
val inst = map2 (fn (v, sort) => fn (_, sort') => |
|
726 |
(((v, 0), sort), TFree (v, sort'))) vs mapping; |
|
40803 | 727 |
val subst = (map_types o map_type_tfree) |
728 |
(fn (v, _) => TFree (v, the (AList.lookup (op =) mapping v))); |
|
35226 | 729 |
in |
730 |
thm |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
731 |
|> Thm.varifyT_global |
35226 | 732 |
|> Thm.certify_instantiate (inst, []) |
733 |
|> pair subst |
|
734 |
end; |
|
735 |
||
736 |
fun concretify_abs thy tyco abs_thm = |
|
737 |
let |
|
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
738 |
val (_, ((c, _), (_, cert))) = get_abstype_spec thy tyco; |
35226 | 739 |
val lhs = (fst o Logic.dest_equals o Thm.prop_of) abs_thm |
740 |
val ty = fastype_of lhs; |
|
741 |
val ty_abs = (fastype_of o snd o dest_comb) lhs; |
|
742 |
val abs = Thm.cterm_of thy (Const (c, ty --> ty_abs)); |
|
743 |
val raw_concrete_thm = Drule.transitive_thm OF [Thm.symmetric cert, Thm.combination (Thm.reflexive abs) abs_thm]; |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
744 |
in (c, (Thm.varifyT_global o zero_var_indexes) raw_concrete_thm) end; |
35226 | 745 |
|
746 |
fun add_rhss_of_eqn thy t = |
|
747 |
let |
|
748 |
val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy) t; |
|
749 |
fun add_const (Const (c, ty)) = insert (op =) (c, Sign.const_typargs thy (c, ty)) |
|
750 |
| add_const _ = I |
|
39568
839a0446630b
corrected long-overlooked slip: the Pure equality of a code equation is no part of the code equation itself
haftmann
parents:
39552
diff
changeset
|
751 |
val add_consts = fold_aterms add_const |
839a0446630b
corrected long-overlooked slip: the Pure equality of a code equation is no part of the code equation itself
haftmann
parents:
39552
diff
changeset
|
752 |
in add_consts rhs o fold add_consts args end; |
35226 | 753 |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
754 |
fun dest_eqn thy = |
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
755 |
apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy o Logic.unvarify_global; |
35226 | 756 |
|
757 |
abstype cert = Equations of thm * bool list |
|
758 |
| Projection of term * string |
|
759 |
| Abstract of thm * string |
|
760 |
with |
|
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
761 |
|
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
762 |
fun empty_cert thy c = |
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
763 |
let |
40761
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
764 |
val raw_ty = Logic.unvarifyT_global (const_typ thy c); |
40764
1a8875eacacd
typscheme with signatures is inappropriate when building empty certificate;
haftmann
parents:
40761
diff
changeset
|
765 |
val (vs, _) = logical_typscheme thy (c, raw_ty); |
40761
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
766 |
val sortargs = case AxClass.class_of_param thy c |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
767 |
of SOME class => [[class]] |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
768 |
| NONE => (case get_type_of_constr_or_abstr thy c |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
769 |
of SOME (tyco, _) => (map snd o fst o the) |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
770 |
(AList.lookup (op =) ((snd o fst o get_type thy) tyco) c) |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
771 |
| NONE => replicate (length vs) []); |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
772 |
val the_sort = the o AList.lookup (op =) (map fst vs ~~ sortargs); |
1ef64dcb24b7
corrected: use canonical variables of type scheme uniformly
haftmann
parents:
40758
diff
changeset
|
773 |
val ty = map_type_tfree (fn (v, _) => TFree (v, the_sort v)) raw_ty |
34895 | 774 |
val chead = build_head thy (c, ty); |
35226 | 775 |
in Equations (Thm.weaken chead Drule.dummy_thm, []) end; |
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
776 |
|
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
777 |
fun cert_of_eqns thy c [] = empty_cert thy c |
34895 | 778 |
| cert_of_eqns thy c raw_eqns = |
34874 | 779 |
let |
34895 | 780 |
val eqns = burrow_fst (canonize_thms thy) raw_eqns; |
781 |
val _ = map (assert_eqn thy) eqns; |
|
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
782 |
val (thms, propers) = split_list eqns; |
34895 | 783 |
val _ = map (fn thm => if c = const_eqn thy thm then () |
784 |
else error ("Wrong head of code equation,\nexpected constant " |
|
785 |
^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)) thms; |
|
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
786 |
fun tvars_of T = rev (Term.add_tvarsT T []); |
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
787 |
val vss = map (tvars_of o snd o head_eqn) thms; |
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
788 |
fun inter_sorts vs = |
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
789 |
fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs []; |
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
790 |
val sorts = map_transpose inter_sorts vss; |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43326
diff
changeset
|
791 |
val vts = Name.invent_names Name.context Name.aT sorts; |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
792 |
val thms' = |
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
793 |
map2 (fn vs => Thm.certify_instantiate (vs ~~ map TFree vts, [])) vss thms; |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
794 |
val head_thm = Thm.symmetric (Thm.assume (build_head thy (head_eqn (hd thms')))); |
34874 | 795 |
fun head_conv ct = if can Thm.dest_comb ct |
796 |
then Conv.fun_conv head_conv ct |
|
797 |
else Conv.rewr_conv head_thm ct; |
|
798 |
val rewrite_head = Conv.fconv_rule (Conv.arg1_conv head_conv); |
|
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
799 |
val cert_thm = Conjunction.intr_balanced (map rewrite_head thms'); |
35226 | 800 |
in Equations (cert_thm, propers) end; |
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
801 |
|
35226 | 802 |
fun cert_of_proj thy c tyco = |
803 |
let |
|
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
804 |
val (vs, ((abs, (_, ty)), (rep, _))) = get_abstype_spec thy tyco; |
35226 | 805 |
val _ = if c = rep then () else |
806 |
error ("Wrong head of projection,\nexpected constant " ^ string_of_const thy rep); |
|
807 |
in Projection (mk_proj tyco vs ty abs rep, tyco) end; |
|
808 |
||
809 |
fun cert_of_abs thy tyco c raw_abs_thm = |
|
34874 | 810 |
let |
35226 | 811 |
val abs_thm = singleton (canonize_thms thy) raw_abs_thm; |
812 |
val _ = assert_abs_eqn thy (SOME tyco) abs_thm; |
|
813 |
val _ = if c = const_abs_eqn thy abs_thm then () |
|
814 |
else error ("Wrong head of abstract code equation,\nexpected constant " |
|
815 |
^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy abs_thm); |
|
36615
88756a5a92fc
renamed Thm.freezeT to Thm.legacy_freezeT -- it is based on Type.legacy_freeze;
wenzelm
parents:
36610
diff
changeset
|
816 |
in Abstract (Thm.legacy_freezeT abs_thm, tyco) end; |
34874 | 817 |
|
35226 | 818 |
fun constrain_cert thy sorts (Equations (cert_thm, propers)) = |
819 |
let |
|
820 |
val ((vs, _), head) = get_head thy cert_thm; |
|
821 |
val (subst, cert_thm') = cert_thm |
|
822 |
|> Thm.implies_intr head |
|
823 |
|> constrain_thm thy vs sorts; |
|
824 |
val head' = Thm.term_of head |
|
825 |
|> subst |
|
826 |
|> Thm.cterm_of thy; |
|
827 |
val cert_thm'' = cert_thm' |
|
828 |
|> Thm.elim_implies (Thm.assume head'); |
|
829 |
in Equations (cert_thm'', propers) end |
|
830 |
| constrain_cert thy _ (cert as Projection _) = |
|
831 |
cert |
|
832 |
| constrain_cert thy sorts (Abstract (abs_thm, tyco)) = |
|
833 |
Abstract (snd (constrain_thm thy (fst (typscheme_abs thy abs_thm)) sorts abs_thm), tyco); |
|
834 |
||
835 |
fun typscheme_of_cert thy (Equations (cert_thm, _)) = |
|
836 |
fst (get_head thy cert_thm) |
|
837 |
| typscheme_of_cert thy (Projection (proj, _)) = |
|
838 |
typscheme_projection thy proj |
|
839 |
| typscheme_of_cert thy (Abstract (abs_thm, _)) = |
|
840 |
typscheme_abs thy abs_thm; |
|
34874 | 841 |
|
35226 | 842 |
fun typargs_deps_of_cert thy (Equations (cert_thm, propers)) = |
843 |
let |
|
844 |
val vs = (fst o fst) (get_head thy cert_thm); |
|
845 |
val equations = if null propers then [] else |
|
846 |
Thm.prop_of cert_thm |
|
847 |
|> Logic.dest_conjunction_balanced (length propers); |
|
848 |
in (vs, fold (add_rhss_of_eqn thy) equations []) end |
|
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
849 |
| typargs_deps_of_cert thy (Projection (t, _)) = |
35226 | 850 |
(fst (typscheme_projection thy t), add_rhss_of_eqn thy t []) |
851 |
| typargs_deps_of_cert thy (Abstract (abs_thm, tyco)) = |
|
852 |
let |
|
853 |
val vs = fst (typscheme_abs thy abs_thm); |
|
854 |
val (_, concrete_thm) = concretify_abs thy tyco abs_thm; |
|
36202
43ea1f28fc7c
explicit check sorts in abstract certificates; abstractor is part of dependencies
haftmann
parents:
36122
diff
changeset
|
855 |
in (vs, add_rhss_of_eqn thy (map_types Logic.unvarifyT_global (Thm.prop_of concrete_thm)) []) end; |
34895 | 856 |
|
35226 | 857 |
fun equations_of_cert thy (cert as Equations (cert_thm, propers)) = |
858 |
let |
|
859 |
val tyscm = typscheme_of_cert thy cert; |
|
860 |
val thms = if null propers then [] else |
|
861 |
cert_thm |
|
35624 | 862 |
|> Local_Defs.expand [snd (get_head thy cert_thm)] |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
863 |
|> Thm.varifyT_global |
35226 | 864 |
|> Conjunction.elim_balanced (length propers); |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
865 |
fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, NONE)); |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
866 |
in (tyscm, map (abstractions o dest_eqn thy o Thm.prop_of) thms ~~ (map SOME thms ~~ propers)) end |
35226 | 867 |
| equations_of_cert thy (Projection (t, tyco)) = |
868 |
let |
|
869 |
val (_, ((abs, _), _)) = get_abstype_spec thy tyco; |
|
870 |
val tyscm = typscheme_projection thy t; |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
871 |
val t' = map_types Logic.varifyT_global t; |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
872 |
fun abstractions (args, rhs) = (map (rpair (SOME abs)) args, (rhs, NONE)); |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
873 |
in (tyscm, [((abstractions o dest_eqn thy) t', (NONE, true))]) end |
35226 | 874 |
| equations_of_cert thy (Abstract (abs_thm, tyco)) = |
875 |
let |
|
876 |
val tyscm = typscheme_abs thy abs_thm; |
|
877 |
val (abs, concrete_thm) = concretify_abs thy tyco abs_thm; |
|
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
878 |
fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, (SOME abs))); |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
879 |
in |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
880 |
(tyscm, [((abstractions o dest_eqn thy o Thm.prop_of) concrete_thm, |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
881 |
(SOME (Thm.varifyT_global abs_thm), true))]) |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
882 |
end; |
34895 | 883 |
|
35226 | 884 |
fun pretty_cert thy (cert as Equations _) = |
885 |
(map_filter (Option.map (Display.pretty_thm_global thy o AxClass.overload thy) o fst o snd) |
|
886 |
o snd o equations_of_cert thy) cert |
|
887 |
| pretty_cert thy (Projection (t, _)) = |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
888 |
[Syntax.pretty_term_global thy (map_types Logic.varifyT_global t)] |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
889 |
| pretty_cert thy (Abstract (abs_thm, _)) = |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
890 |
[(Display.pretty_thm_global thy o AxClass.overload thy o Thm.varifyT_global) abs_thm]; |
35226 | 891 |
|
892 |
fun bare_thms_of_cert thy (cert as Equations _) = |
|
893 |
(map_filter (fn (_, (some_thm, proper)) => if proper then some_thm else NONE) |
|
894 |
o snd o equations_of_cert thy) cert |
|
35376
212b1dc5212d
use abstract code cerficates for bare code theorems
haftmann
parents:
35373
diff
changeset
|
895 |
| bare_thms_of_cert thy (Projection _) = [] |
212b1dc5212d
use abstract code cerficates for bare code theorems
haftmann
parents:
35373
diff
changeset
|
896 |
| bare_thms_of_cert thy (Abstract (abs_thm, tyco)) = |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35624
diff
changeset
|
897 |
[Thm.varifyT_global (snd (concretify_abs thy tyco abs_thm))]; |
34895 | 898 |
|
899 |
end; |
|
34891
99b9a6290446
code certificates as integral part of code generation
haftmann
parents:
34874
diff
changeset
|
900 |
|
34874 | 901 |
|
35226 | 902 |
(* code certificate access *) |
903 |
||
904 |
fun retrieve_raw thy c = |
|
905 |
Symtab.lookup ((the_functions o the_exec) thy) c |
|
906 |
|> Option.map (snd o fst) |
|
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
907 |
|> the_default empty_fun_spec |
34874 | 908 |
|
35226 | 909 |
fun get_cert thy f c = case retrieve_raw thy c |
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
910 |
of Default (_, eqns_lazy) => Lazy.force eqns_lazy |
35226 | 911 |
|> (map o apfst) (Thm.transfer thy) |
912 |
|> f |
|
913 |
|> (map o apfst) (AxClass.unoverload thy) |
|
914 |
|> cert_of_eqns thy c |
|
915 |
| Eqns eqns => eqns |
|
916 |
|> (map o apfst) (Thm.transfer thy) |
|
917 |
|> f |
|
918 |
|> (map o apfst) (AxClass.unoverload thy) |
|
919 |
|> cert_of_eqns thy c |
|
920 |
| Proj (_, tyco) => |
|
921 |
cert_of_proj thy c tyco |
|
922 |
| Abstr (abs_thm, tyco) => abs_thm |
|
923 |
|> Thm.transfer thy |
|
924 |
|> AxClass.unoverload thy |
|
925 |
|> cert_of_abs thy tyco c; |
|
31962 | 926 |
|
927 |
||
928 |
(* cases *) |
|
31156 | 929 |
|
930 |
fun case_certificate thm = |
|
931 |
let |
|
932 |
val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals |
|
32640
ba6531df2c64
corrected order of type variables in code equations; more precise certificate for cases
haftmann
parents:
32544
diff
changeset
|
933 |
o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm; |
31156 | 934 |
val _ = case head of Free _ => true |
935 |
| Var _ => true |
|
936 |
| _ => raise TERM ("case_cert", []); |
|
937 |
val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr; |
|
938 |
val (Const (case_const, _), raw_params) = strip_comb case_expr; |
|
939 |
val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params; |
|
940 |
val _ = if n = ~1 then raise TERM ("case_cert", []) else (); |
|
941 |
val params = map (fst o dest_Var) (nth_drop n raw_params); |
|
942 |
fun dest_case t = |
|
943 |
let |
|
944 |
val (head' $ t_co, rhs) = Logic.dest_equals t; |
|
945 |
val _ = if head' = head then () else raise TERM ("case_cert", []); |
|
946 |
val (Const (co, _), args) = strip_comb t_co; |
|
947 |
val (Var (param, _), args') = strip_comb rhs; |
|
948 |
val _ = if args' = args then () else raise TERM ("case_cert", []); |
|
949 |
in (param, co) end; |
|
950 |
fun analyze_cases cases = |
|
951 |
let |
|
952 |
val co_list = fold (AList.update (op =) o dest_case) cases []; |
|
953 |
in map (the o AList.lookup (op =) co_list) params end; |
|
954 |
fun analyze_let t = |
|
955 |
let |
|
956 |
val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t; |
|
957 |
val _ = if head' = head then () else raise TERM ("case_cert", []); |
|
958 |
val _ = if arg' = arg then () else raise TERM ("case_cert", []); |
|
959 |
val _ = if [param'] = params then () else raise TERM ("case_cert", []); |
|
960 |
in [] end; |
|
961 |
fun analyze (cases as [let_case]) = |
|
962 |
(analyze_cases cases handle Bind => analyze_let let_case) |
|
963 |
| analyze cases = analyze_cases cases; |
|
964 |
in (case_const, (n, analyze cases)) end; |
|
965 |
||
966 |
fun case_cert thm = case_certificate thm |
|
967 |
handle Bind => error "bad case certificate" |
|
968 |
| TERM _ => error "bad case certificate"; |
|
969 |
||
37438 | 970 |
fun get_case_scheme thy = Option.map fst o Symtab.lookup ((fst o the_cases o the_exec) thy); |
971 |
fun get_case_cong thy = Option.map snd o Symtab.lookup ((fst o the_cases o the_exec) thy); |
|
24219 | 972 |
|
31962 | 973 |
val undefineds = Symtab.keys o snd o the_cases o the_exec; |
24219 | 974 |
|
975 |
||
31962 | 976 |
(* diagnostic *) |
24219 | 977 |
|
978 |
fun print_codesetup thy = |
|
979 |
let |
|
42360 | 980 |
val ctxt = Proof_Context.init_global thy; |
24844
98c006a30218
certificates for code generator case expressions
haftmann
parents:
24837
diff
changeset
|
981 |
val exec = the_exec thy; |
35226 | 982 |
fun pretty_equations const thms = |
24219 | 983 |
(Pretty.block o Pretty.fbreaks) ( |
35226 | 984 |
Pretty.str (string_of_const thy const) :: map (Display.pretty_thm ctxt) thms |
24219 | 985 |
); |
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
986 |
fun pretty_function (const, Default (_, eqns_lazy)) = pretty_equations const (map fst (Lazy.force eqns_lazy)) |
35226 | 987 |
| pretty_function (const, Eqns eqns) = pretty_equations const (map fst eqns) |
988 |
| pretty_function (const, Proj (proj, _)) = Pretty.block |
|
989 |
[Pretty.str (string_of_const thy const), Pretty.fbrk, Syntax.pretty_term ctxt proj] |
|
990 |
| pretty_function (const, Abstr (thm, _)) = pretty_equations const [thm]; |
|
991 |
fun pretty_typ (tyco, vs) = Pretty.str |
|
992 |
(string_of_typ thy (Type (tyco, map TFree vs))); |
|
993 |
fun pretty_typspec (typ, (cos, abstract)) = if null cos |
|
994 |
then pretty_typ typ |
|
995 |
else (Pretty.block o Pretty.breaks) ( |
|
996 |
pretty_typ typ |
|
997 |
:: Pretty.str "=" |
|
998 |
:: (if abstract then [Pretty.str "(abstract)"] else []) |
|
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
999 |
@ separate (Pretty.str "|") (map (fn (c, (_, [])) => Pretty.str (string_of_const thy c) |
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
1000 |
| (c, (_, tys)) => |
35226 | 1001 |
(Pretty.block o Pretty.breaks) |
1002 |
(Pretty.str (string_of_const thy c) |
|
1003 |
:: Pretty.str "of" |
|
1004 |
:: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos) |
|
1005 |
); |
|
37438 | 1006 |
fun pretty_case (const, ((_, (_, [])), _)) = Pretty.str (string_of_const thy const) |
1007 |
| pretty_case (const, ((_, (_, cos)), _)) = (Pretty.block o Pretty.breaks) [ |
|
34901 | 1008 |
Pretty.str (string_of_const thy const), Pretty.str "with", |
1009 |
(Pretty.block o Pretty.commas o map (Pretty.str o string_of_const thy)) cos]; |
|
35226 | 1010 |
val functions = the_functions exec |
24423
ae9cd0e92423
overloaded definitions accompanied by explicit constants
haftmann
parents:
24283
diff
changeset
|
1011 |
|> Symtab.dest |
28695 | 1012 |
|> (map o apsnd) (snd o fst) |
24219 | 1013 |
|> sort (string_ord o pairself fst); |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1014 |
val datatypes = the_types exec |
24219 | 1015 |
|> Symtab.dest |
35226 | 1016 |
|> map (fn (tyco, (_, (vs, spec)) :: _) => |
1017 |
((tyco, vs), constructors_of spec)) |
|
1018 |
|> sort (string_ord o pairself (fst o fst)); |
|
34901 | 1019 |
val cases = Symtab.dest ((fst o the_cases o the_exec) thy); |
1020 |
val undefineds = Symtab.keys ((snd o the_cases o the_exec) thy); |
|
24219 | 1021 |
in |
1022 |
(Pretty.writeln o Pretty.chunks) [ |
|
1023 |
Pretty.block ( |
|
34901 | 1024 |
Pretty.str "code equations:" :: Pretty.fbrk |
35226 | 1025 |
:: (Pretty.fbreaks o map pretty_function) functions |
24219 | 1026 |
), |
25968 | 1027 |
Pretty.block ( |
34901 | 1028 |
Pretty.str "datatypes:" :: Pretty.fbrk |
35226 | 1029 |
:: (Pretty.fbreaks o map pretty_typspec) datatypes |
34901 | 1030 |
), |
1031 |
Pretty.block ( |
|
1032 |
Pretty.str "cases:" :: Pretty.fbrk |
|
1033 |
:: (Pretty.fbreaks o map pretty_case) cases |
|
1034 |
), |
|
1035 |
Pretty.block ( |
|
1036 |
Pretty.str "undefined:" :: Pretty.fbrk |
|
1037 |
:: (Pretty.commas o map (Pretty.str o string_of_const thy)) undefineds |
|
24219 | 1038 |
) |
1039 |
] |
|
1040 |
end; |
|
1041 |
||
1042 |
||
31962 | 1043 |
(** declaring executable ingredients **) |
1044 |
||
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1045 |
(* constant signatures *) |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1046 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1047 |
fun add_type tyco thy = |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1048 |
case Symtab.lookup ((snd o #types o Type.rep_tsig o Sign.tsig_of) thy) tyco |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1049 |
of SOME (Type.Abbreviation (vs, _, _)) => |
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
1050 |
(map_exec_purge o map_signatures o apfst) |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1051 |
(Symtab.update (tyco, length vs)) thy |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1052 |
| _ => error ("No such type abbreviation: " ^ quote tyco); |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1053 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1054 |
fun add_type_cmd s thy = add_type (Sign.intern_type thy s) thy; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1055 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1056 |
fun gen_add_signature prep_const prep_signature (raw_c, raw_ty) thy = |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1057 |
let |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1058 |
val c = prep_const thy raw_c; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1059 |
val ty = prep_signature thy raw_ty; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1060 |
val ty' = expand_signature thy ty; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1061 |
val ty'' = Sign.the_const_type thy c; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1062 |
val _ = if typ_equiv (ty', ty'') then () else |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1063 |
error ("Illegal constant signature: " ^ Syntax.string_of_typ_global thy ty); |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1064 |
in |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1065 |
thy |
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
1066 |
|> (map_exec_purge o map_signatures o apsnd) (Symtab.update (c, ty)) |
33940
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1067 |
end; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1068 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1069 |
val add_signature = gen_add_signature (K I) cert_signature; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1070 |
val add_signature_cmd = gen_add_signature read_const read_signature; |
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1071 |
|
317933ce3712
crude support for type aliasses and corresponding constant signatures
haftmann
parents:
33756
diff
changeset
|
1072 |
|
31962 | 1073 |
(* code equations *) |
1074 |
||
35226 | 1075 |
fun gen_add_eqn default (raw_thm, proper) thy = |
33075 | 1076 |
let |
35226 | 1077 |
val thm = Thm.close_derivation raw_thm; |
1078 |
val c = const_eqn thy thm; |
|
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1079 |
fun update_subsume thy (thm, proper) eqns = |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1080 |
let |
39811 | 1081 |
val args_of = snd o chop_while is_Var o rev o snd o strip_comb |
39791
a91430778479
redundancy check: drop trailing Var arguments (avoids eta problems with equations)
haftmann
parents:
39568
diff
changeset
|
1082 |
o map_types Type.strip_sorts o fst o Logic.dest_equals o Thm.plain_prop_of; |
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1083 |
val args = args_of thm; |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1084 |
val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1); |
39794
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1085 |
fun matches_args args' = |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1086 |
let |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1087 |
val k = length args' - length args |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1088 |
in if k >= 0 |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1089 |
then Pattern.matchess thy (args, (map incr_idx o drop k) args') |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1090 |
else false |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1091 |
end; |
37460
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1092 |
fun drop (thm', proper') = if (proper orelse not proper') |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1093 |
andalso matches_args (args_of thm') then |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1094 |
(warning ("Code generator: dropping subsumed code equation\n" ^ |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1095 |
Display.string_of_thm_global thy thm'); true) |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1096 |
else false; |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1097 |
in (thm, proper) :: filter_out drop eqns end; |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1098 |
fun natural_order thy_ref eqns = |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1099 |
(eqns, Lazy.lazy (fn () => fold (update_subsume (Theory.deref thy_ref)) eqns [])) |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1100 |
fun add_eqn' true (Default (eqns, _)) = |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1101 |
Default (natural_order (Theory.check_thy thy) ((thm, proper) :: eqns)) |
910b2422571d
drop subsumed default equations (requires a little bit unfortunate laziness)
haftmann
parents:
37448
diff
changeset
|
1102 |
(*this restores the natural order and drops syntactic redundancies*) |
39794
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1103 |
| add_eqn' true fun_spec = fun_spec |
51451d73c3d4
corrected subsumption check: arguments have been reversed; addition of default equations to non-default equations is identity
haftmann
parents:
39791
diff
changeset
|
1104 |
| add_eqn' false (Eqns eqns) = Eqns (update_subsume thy (thm, proper) eqns) |
35226 | 1105 |
| add_eqn' false _ = Eqns [(thm, proper)]; |
1106 |
in change_fun_spec false c (add_eqn' default) thy end; |
|
31962 | 1107 |
|
1108 |
fun add_eqn thm thy = |
|
1109 |
gen_add_eqn false (mk_eqn thy (thm, true)) thy; |
|
1110 |
||
1111 |
fun add_warning_eqn thm thy = |
|
1112 |
case mk_eqn_warning thy thm |
|
1113 |
of SOME eqn => gen_add_eqn false eqn thy |
|
1114 |
| NONE => thy; |
|
1115 |
||
37425 | 1116 |
fun add_nbe_eqn thm thy = |
1117 |
gen_add_eqn false (mk_eqn thy (thm, false)) thy; |
|
1118 |
||
31962 | 1119 |
fun add_default_eqn thm thy = |
1120 |
case mk_eqn_liberal thy thm |
|
1121 |
of SOME eqn => gen_add_eqn true eqn thy |
|
1122 |
| NONE => thy; |
|
1123 |
||
1124 |
val add_default_eqn_attribute = Thm.declaration_attribute |
|
1125 |
(fn thm => Context.mapping (add_default_eqn thm) I); |
|
1126 |
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute); |
|
1127 |
||
37425 | 1128 |
fun add_nbe_default_eqn thm thy = |
1129 |
gen_add_eqn true (mk_eqn thy (thm, false)) thy; |
|
1130 |
||
1131 |
val add_nbe_default_eqn_attribute = Thm.declaration_attribute |
|
1132 |
(fn thm => Context.mapping (add_nbe_default_eqn thm) I); |
|
1133 |
val add_nbe_default_eqn_attrib = Attrib.internal (K add_nbe_default_eqn_attribute); |
|
1134 |
||
35226 | 1135 |
fun add_abs_eqn raw_thm thy = |
1136 |
let |
|
1137 |
val (abs_thm, tyco) = (apfst Thm.close_derivation o mk_abs_eqn thy) raw_thm; |
|
1138 |
val c = const_abs_eqn thy abs_thm; |
|
1139 |
in change_fun_spec false c (K (Abstr (abs_thm, tyco))) thy end; |
|
1140 |
||
31962 | 1141 |
fun del_eqn thm thy = case mk_eqn_liberal thy thm |
35226 | 1142 |
of SOME (thm, _) => let |
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
1143 |
fun del_eqn' (Default _) = empty_fun_spec |
35226 | 1144 |
| del_eqn' (Eqns eqns) = |
1145 |
Eqns (filter_out (fn (thm', _) => Thm.eq_thm_prop (thm, thm')) eqns) |
|
1146 |
| del_eqn' spec = spec |
|
1147 |
in change_fun_spec true (const_eqn thy thm) del_eqn' thy end |
|
31962 | 1148 |
| NONE => thy; |
1149 |
||
35226 | 1150 |
fun del_eqns c = change_fun_spec true c (K empty_fun_spec); |
34244 | 1151 |
|
1152 |
||
1153 |
(* cases *) |
|
1154 |
||
40758
4f2c3e842ef8
consider sort constraints for datatype constructors when constructing the empty equation certificate;
haftmann
parents:
40726
diff
changeset
|
1155 |
fun case_cong thy case_const (num_args, (pos, _)) = |
37438 | 1156 |
let |
43326
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
42707
diff
changeset
|
1157 |
val ([x, y], ctxt) = fold_map Name.variant ["A", "A'"] Name.context; |
47cf4bc789aa
simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents:
42707
diff
changeset
|
1158 |
val (zs, _) = fold_map Name.variant (replicate (num_args - 1) "") ctxt; |
37438 | 1159 |
val (ws, vs) = chop pos zs; |
37448
3bd4b3809bee
explicit type variable arguments for constructors
haftmann
parents:
37438
diff
changeset
|
1160 |
val T = Logic.unvarifyT_global (Sign.the_const_type thy case_const); |
40844 | 1161 |
val Ts = binder_types T; |
37438 | 1162 |
val T_cong = nth Ts pos; |
1163 |
fun mk_prem z = Free (z, T_cong); |
|
1164 |
fun mk_concl z = list_comb (Const (case_const, T), map2 (curry Free) (ws @ z :: vs) Ts); |
|
1165 |
val (prem, concl) = pairself Logic.mk_equals (pairself mk_prem (x, y), pairself mk_concl (x, y)); |
|
37521 | 1166 |
fun tac { context, prems } = Simplifier.rewrite_goals_tac prems |
42360 | 1167 |
THEN ALLGOALS (Proof_Context.fact_tac [Drule.reflexive_thm]); |
37438 | 1168 |
in Skip_Proof.prove_global thy (x :: y :: zs) [prem] concl tac end; |
1169 |
||
34244 | 1170 |
fun add_case thm thy = |
1171 |
let |
|
43634 | 1172 |
val (case_const, (k, cos)) = case_cert thm; |
1173 |
val _ = case filter_out (is_constr thy) cos |
|
34244 | 1174 |
of [] => () |
1175 |
| cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs)); |
|
43634 | 1176 |
val entry = (1 + Int.max (1, length cos), (k, cos)); |
1177 |
fun register_case cong = (map_cases o apfst) |
|
1178 |
(Symtab.update (case_const, (entry, cong))); |
|
1179 |
fun register_for_constructors (Constructors (cos', cases)) = |
|
1180 |
Constructors (cos', |
|
1181 |
if exists (fn (co, _) => member (op =) cos co) cos' |
|
1182 |
then insert (op =) case_const cases |
|
1183 |
else cases) |
|
1184 |
| register_for_constructors (x as Abstractor _) = x; |
|
1185 |
val register_type = (map_typs o Symtab.map) |
|
1186 |
(K ((map o apsnd o apsnd) register_for_constructors)); |
|
37438 | 1187 |
in |
1188 |
thy |
|
1189 |
|> Theory.checkpoint |
|
1190 |
|> `(fn thy => case_cong thy case_const entry) |
|
43634 | 1191 |
|-> (fn cong => map_exec_purge (register_case cong #> register_type)) |
37438 | 1192 |
end; |
34244 | 1193 |
|
1194 |
fun add_undefined c thy = |
|
1195 |
(map_exec_purge o map_cases o apsnd) (Symtab.update (c, ())) thy; |
|
1196 |
||
1197 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1198 |
(* types *) |
34244 | 1199 |
|
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1200 |
fun register_type (tyco, vs_spec) thy = |
34244 | 1201 |
let |
35226 | 1202 |
val (old_constrs, some_old_proj) = |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1203 |
case these (Symtab.lookup ((the_types o the_exec) thy) tyco) |
43634 | 1204 |
of (_, (_, Constructors (cos, _))) :: _ => (map fst cos, NONE) |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
1205 |
| (_, (_, Abstractor ((co, _), (proj, _)))) :: _ => ([co], SOME proj) |
43636
63654984ba54
centralized deletion of equations for constructors; corrected misunderstanding what `old functions` are supposed to be
haftmann
parents:
43634
diff
changeset
|
1206 |
| [] => ([], NONE); |
63654984ba54
centralized deletion of equations for constructors; corrected misunderstanding what `old functions` are supposed to be
haftmann
parents:
43634
diff
changeset
|
1207 |
val outdated_funs1 = (map fst o fst o constructors_of o snd) vs_spec; |
63654984ba54
centralized deletion of equations for constructors; corrected misunderstanding what `old functions` are supposed to be
haftmann
parents:
43634
diff
changeset
|
1208 |
val outdated_funs2 = case some_old_proj |
63654984ba54
centralized deletion of equations for constructors; corrected misunderstanding what `old functions` are supposed to be
haftmann
parents:
43634
diff
changeset
|
1209 |
of NONE => [] |
35226 | 1210 |
| SOME old_proj => Symtab.fold |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
1211 |
(fn (c, ((_, spec), _)) => |
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
1212 |
if member (op =) (the_list (associated_abstype spec)) tyco |
35226 | 1213 |
then insert (op =) c else I) |
43637
f41b0d6dec99
corrected misunderstanding what `old functions` are supposed to be
haftmann
parents:
43636
diff
changeset
|
1214 |
((the_functions o the_exec) thy) [old_proj]; |
34244 | 1215 |
fun drop_outdated_cases cases = fold Symtab.delete_safe |
37438 | 1216 |
(Symtab.fold (fn (c, ((_, (_, cos)), _)) => |
35226 | 1217 |
if exists (member (op =) old_constrs) cos |
34244 | 1218 |
then insert (op =) c else I) cases []) cases; |
1219 |
in |
|
1220 |
thy |
|
43636
63654984ba54
centralized deletion of equations for constructors; corrected misunderstanding what `old functions` are supposed to be
haftmann
parents:
43634
diff
changeset
|
1221 |
|> fold del_eqns (outdated_funs1 @ outdated_funs2) |
34244 | 1222 |
|> map_exec_purge |
35226 | 1223 |
((map_typs o Symtab.map_default (tyco, [])) (cons (serial (), vs_spec)) |
34244 | 1224 |
#> (map_cases o apfst) drop_outdated_cases) |
1225 |
end; |
|
1226 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1227 |
fun unoverload_const_typ thy (c, ty) = (AxClass.unoverload_const thy (c, ty), ty); |
34244 | 1228 |
|
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1229 |
structure Datatype_Interpretation = |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1230 |
Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool); |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1231 |
|
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1232 |
fun datatype_interpretation f = Datatype_Interpretation.interpretation |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
1233 |
(fn (tyco, _) => fn thy => f (tyco, fst (get_type thy tyco)) thy); |
35226 | 1234 |
|
1235 |
fun add_datatype proto_constrs thy = |
|
1236 |
let |
|
1237 |
val constrs = map (unoverload_const_typ thy) proto_constrs; |
|
1238 |
val (tyco, (vs, cos)) = constrset_of_consts thy constrs; |
|
1239 |
in |
|
1240 |
thy |
|
43634 | 1241 |
|> register_type (tyco, (vs, Constructors (cos, []))) |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1242 |
|> Datatype_Interpretation.data (tyco, serial ()) |
35226 | 1243 |
end; |
1244 |
||
1245 |
fun add_datatype_cmd raw_constrs thy = |
|
1246 |
add_datatype (map (read_bare_const thy) raw_constrs) thy; |
|
1247 |
||
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1248 |
structure Abstype_Interpretation = |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1249 |
Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool); |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1250 |
|
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1251 |
fun abstype_interpretation f = Abstype_Interpretation.interpretation |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1252 |
(fn (tyco, _) => fn thy => f (tyco, get_abstype_spec thy tyco) thy); |
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1253 |
|
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
1254 |
fun add_abstype proto_thm thy = |
34244 | 1255 |
let |
40726
16dcfedc4eb7
keep type variable arguments of datatype constructors in bookkeeping
haftmann
parents:
40564
diff
changeset
|
1256 |
val (tyco, (vs, (abs_ty as (abs, (_, ty)), (rep, cert)))) = |
36209
566be5d48090
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
haftmann
parents:
36202
diff
changeset
|
1257 |
error_thm (check_abstype_cert thy) proto_thm; |
35226 | 1258 |
in |
1259 |
thy |
|
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
1260 |
|> register_type (tyco, (vs, Abstractor (abs_ty, (rep, cert)))) |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
1261 |
|> change_fun_spec false rep ((K o Proj) |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
1262 |
(map_types Logic.varifyT_global (mk_proj tyco vs ty abs rep), tyco)) |
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
1263 |
|> Abstype_Interpretation.data (tyco, serial ()) |
35226 | 1264 |
end; |
34244 | 1265 |
|
35226 | 1266 |
|
1267 |
(** infrastructure **) |
|
34244 | 1268 |
|
41472
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
40844
diff
changeset
|
1269 |
(* cf. src/HOL/Tools/recfun_codegen.ML *) |
32070 | 1270 |
|
33522 | 1271 |
structure Code_Target_Attr = Theory_Data |
1272 |
( |
|
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1273 |
type T = (string -> thm -> theory -> theory) option; |
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1274 |
val empty = NONE; |
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1275 |
val extend = I; |
41493 | 1276 |
val merge = merge_options; |
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1277 |
); |
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1278 |
|
32070 | 1279 |
fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f)); |
1280 |
||
1281 |
fun code_target_attr prefix thm thy = |
|
1282 |
let |
|
1283 |
val attr = the_default ((K o K) I) (Code_Target_Attr.get thy); |
|
1284 |
in thy |> add_warning_eqn thm |> attr prefix thm end; |
|
35226 | 1285 |
|
1286 |
||
32070 | 1287 |
(* setup *) |
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1288 |
|
31962 | 1289 |
val _ = Context.>> (Context.map_theory |
1290 |
(let |
|
1291 |
fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I); |
|
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1292 |
val code_attribute_parser = |
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1293 |
Args.del |-- Scan.succeed (mk_attribute del_eqn) |
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1294 |
|| Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn) |
36112
7fa17a225852
user interface for abstract datatypes is an attribute, not a command
haftmann
parents:
35845
diff
changeset
|
1295 |
|| Args.$$$ "abstype" |-- Scan.succeed (mk_attribute add_abstype) |
35226 | 1296 |
|| Args.$$$ "abstract" |-- Scan.succeed (mk_attribute add_abs_eqn) |
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1297 |
|| (Args.$$$ "target" |-- Args.colon |-- Args.name >> |
32070 | 1298 |
(mk_attribute o code_target_attr)) |
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1299 |
|| Scan.succeed (mk_attribute add_warning_eqn); |
31962 | 1300 |
in |
35299
4f4d5bf4ea08
proper distinction of code datatypes and abstypes
haftmann
parents:
35226
diff
changeset
|
1301 |
Datatype_Interpretation.init |
31998
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1302 |
#> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser) |
2c7a24f74db9
code attributes use common underscore convention
haftmann
parents:
31971
diff
changeset
|
1303 |
"declare theorems for code generation" |
31962 | 1304 |
end)); |
1305 |
||
24219 | 1306 |
end; (*struct*) |
1307 |
||
1308 |
||
35226 | 1309 |
(* type-safe interfaces for data dependent on executable code *) |
24219 | 1310 |
|
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
1311 |
functor Code_Data(Data: CODE_DATA_ARGS): CODE_DATA = |
24219 | 1312 |
struct |
1313 |
||
1314 |
type T = Data.T; |
|
1315 |
exception Data of T; |
|
1316 |
fun dest (Data x) = x |
|
1317 |
||
34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33977
diff
changeset
|
1318 |
val kind = Code.declare_data (Data Data.empty); |
24219 | 1319 |
|
1320 |
val data_op = (kind, Data, dest); |
|
1321 |
||
39397 | 1322 |
fun change_yield (SOME thy) f = Code.change_yield_data data_op thy f |
1323 |
| change_yield NONE f = f Data.empty |
|
1324 |
||
1325 |
fun change some_thy f = snd (change_yield some_thy (pair () o f)); |
|
24219 | 1326 |
|
1327 |
end; |
|
1328 |
||
28143 | 1329 |
structure Code : CODE = struct open Code; end; |