author | berghofe |
Fri, 01 Jul 2005 14:13:40 +0200 | |
changeset 16645 | a152d6b21c31 |
parent 16424 | 18a07ad8fea8 |
child 16861 | 7446b4be013b |
permissions | -rw-r--r-- |
12453 | 1 |
(* Title: HOL/inductive_codegen.ML |
11537 | 2 |
ID: $Id$ |
11539 | 3 |
Author: Stefan Berghofer, TU Muenchen |
11537 | 4 |
|
11539 | 5 |
Code generator for inductive predicates. |
11537 | 6 |
*) |
7 |
||
8 |
signature INDUCTIVE_CODEGEN = |
|
9 |
sig |
|
16645 | 10 |
val add : string option -> theory attribute |
11537 | 11 |
val setup : (theory -> theory) list |
12 |
end; |
|
13 |
||
14 |
structure InductiveCodegen : INDUCTIVE_CODEGEN = |
|
15 |
struct |
|
16 |
||
17 |
open Codegen; |
|
18 |
||
12557 | 19 |
(**** theory data ****) |
20 |
||
16424 | 21 |
structure CodegenData = TheoryDataFun |
22 |
(struct |
|
12557 | 23 |
val name = "HOL/inductive_codegen"; |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
24 |
type T = |
16645 | 25 |
{intros : (thm * string) list Symtab.table, |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
26 |
graph : unit Graph.T, |
16645 | 27 |
eqns : (thm * string) list Symtab.table}; |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
28 |
val empty = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
29 |
{intros = Symtab.empty, graph = Graph.empty, eqns = Symtab.empty}; |
12557 | 30 |
val copy = I; |
16424 | 31 |
val extend = I; |
32 |
fun merge _ ({intros=intros1, graph=graph1, eqns=eqns1}, |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
33 |
{intros=intros2, graph=graph2, eqns=eqns2}) = |
16645 | 34 |
{intros = Symtab.merge_multi (Drule.eq_thm_prop o pairself fst) |
35 |
(intros1, intros2), |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
36 |
graph = Graph.merge (K true) (graph1, graph2), |
16645 | 37 |
eqns = Symtab.merge_multi (Drule.eq_thm_prop o pairself fst) |
38 |
(eqns1, eqns2)}; |
|
12557 | 39 |
fun print _ _ = (); |
16424 | 40 |
end); |
12557 | 41 |
|
42 |
||
43 |
fun warn thm = warning ("InductiveCodegen: Not a proper clause:\n" ^ |
|
44 |
string_of_thm thm); |
|
11537 | 45 |
|
14162
f05f299512e9
Fixed problem with "code ind" attribute that caused code generator to
berghofe
parents:
13105
diff
changeset
|
46 |
fun add_node (g, x) = Graph.new_node (x, ()) g handle Graph.DUP _ => g; |
f05f299512e9
Fixed problem with "code ind" attribute that caused code generator to
berghofe
parents:
13105
diff
changeset
|
47 |
|
16645 | 48 |
fun add optmod (p as (thy, thm)) = |
49 |
let |
|
50 |
val {intros, graph, eqns} = CodegenData.get thy; |
|
51 |
fun thyname_of s = (case optmod of |
|
52 |
NONE => thyname_of_const s thy | SOME s => s); |
|
12557 | 53 |
in (case concl_of thm of |
54 |
_ $ (Const ("op :", _) $ _ $ t) => (case head_of t of |
|
14162
f05f299512e9
Fixed problem with "code ind" attribute that caused code generator to
berghofe
parents:
13105
diff
changeset
|
55 |
Const (s, _) => |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
56 |
let val cs = foldr add_term_consts [] (prems_of thm) |
14162
f05f299512e9
Fixed problem with "code ind" attribute that caused code generator to
berghofe
parents:
13105
diff
changeset
|
57 |
in (CodegenData.put |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
58 |
{intros = Symtab.update ((s, |
16645 | 59 |
getOpt (Symtab.lookup (intros, s), []) @ |
60 |
[(thm, thyname_of s)]), intros), |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
61 |
graph = foldr (uncurry (Graph.add_edge o pair s)) |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
62 |
(Library.foldl add_node (graph, s :: cs)) cs, |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
63 |
eqns = eqns} thy, thm) |
14162
f05f299512e9
Fixed problem with "code ind" attribute that caused code generator to
berghofe
parents:
13105
diff
changeset
|
64 |
end |
12557 | 65 |
| _ => (warn thm; p)) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
66 |
| _ $ (Const ("op =", _) $ t $ _) => (case head_of t of |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
67 |
Const (s, _) => |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
68 |
(CodegenData.put {intros = intros, graph = graph, |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
69 |
eqns = Symtab.update ((s, |
16645 | 70 |
getOpt (Symtab.lookup (eqns, s), []) @ |
71 |
[(thm, thyname_of s)]), eqns)} thy, thm) |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
72 |
| _ => (warn thm; p)) |
12557 | 73 |
| _ => (warn thm; p)) |
12562 | 74 |
end; |
12557 | 75 |
|
76 |
fun get_clauses thy s = |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
77 |
let val {intros, graph, ...} = CodegenData.get thy |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
78 |
in case Symtab.lookup (intros, s) of |
15531 | 79 |
NONE => (case InductivePackage.get_inductive thy s of |
80 |
NONE => NONE |
|
16645 | 81 |
| SOME ({names, ...}, {intrs, ...}) => |
82 |
SOME (names, thyname_of_const s thy, |
|
83 |
preprocess thy intrs)) |
|
15531 | 84 |
| SOME _ => |
16645 | 85 |
let |
86 |
val SOME names = find_first |
|
87 |
(fn xs => s mem xs) (Graph.strong_conn graph); |
|
88 |
val intrs = List.concat (map |
|
89 |
(fn s => valOf (Symtab.lookup (intros, s))) names); |
|
90 |
val (_, (_, thyname)) = split_last intrs |
|
91 |
in SOME (names, thyname, preprocess thy (map fst intrs)) end |
|
14162
f05f299512e9
Fixed problem with "code ind" attribute that caused code generator to
berghofe
parents:
13105
diff
changeset
|
92 |
end; |
12557 | 93 |
|
94 |
||
95 |
(**** improper tuples ****) |
|
11537 | 96 |
|
97 |
fun prod_factors p (Const ("Pair", _) $ t $ u) = |
|
98 |
p :: prod_factors (1::p) t @ prod_factors (2::p) u |
|
99 |
| prod_factors p _ = []; |
|
100 |
||
101 |
fun split_prod p ps t = if p mem ps then (case t of |
|
102 |
Const ("Pair", _) $ t $ u => |
|
103 |
split_prod (1::p) ps t @ split_prod (2::p) ps u |
|
104 |
| _ => error "Inconsistent use of products") else [t]; |
|
105 |
||
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
106 |
fun full_split_prod (Const ("Pair", _) $ t $ u) = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
107 |
full_split_prod t @ full_split_prod u |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
108 |
| full_split_prod t = [t]; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
109 |
|
12557 | 110 |
datatype factors = FVar of int list list | FFix of int list list; |
111 |
||
112 |
exception Factors; |
|
113 |
||
114 |
fun mg_factor (FVar f) (FVar f') = FVar (f inter f') |
|
115 |
| mg_factor (FVar f) (FFix f') = |
|
116 |
if f' subset f then FFix f' else raise Factors |
|
117 |
| mg_factor (FFix f) (FVar f') = |
|
118 |
if f subset f' then FFix f else raise Factors |
|
119 |
| mg_factor (FFix f) (FFix f') = |
|
120 |
if f subset f' andalso f' subset f then FFix f else raise Factors; |
|
121 |
||
122 |
fun dest_factors (FVar f) = f |
|
123 |
| dest_factors (FFix f) = f; |
|
124 |
||
125 |
fun infer_factors sg extra_fs (fs, (optf, t)) = |
|
126 |
let fun err s = error (s ^ "\n" ^ Sign.string_of_term sg t) |
|
127 |
in (case (optf, strip_comb t) of |
|
15531 | 128 |
(SOME f, (Const (name, _), args)) => |
12557 | 129 |
(case assoc (extra_fs, name) of |
15570 | 130 |
NONE => overwrite (fs, (name, getOpt |
131 |
(Option.map (mg_factor f) (assoc (fs, name)), f))) |
|
15531 | 132 |
| SOME (fs', f') => (mg_factor f (FFix f'); |
15570 | 133 |
Library.foldl (infer_factors sg extra_fs) |
134 |
(fs, map (Option.map FFix) fs' ~~ args))) |
|
15531 | 135 |
| (SOME f, (Var ((name, _), _), [])) => |
15570 | 136 |
overwrite (fs, (name, getOpt |
137 |
(Option.map (mg_factor f) (assoc (fs, name)), f))) |
|
15531 | 138 |
| (NONE, _) => fs |
12557 | 139 |
| _ => err "Illegal term") |
140 |
handle Factors => err "Product factor mismatch in" |
|
141 |
end; |
|
142 |
||
11537 | 143 |
fun string_of_factors p ps = if p mem ps then |
144 |
"(" ^ string_of_factors (1::p) ps ^ ", " ^ string_of_factors (2::p) ps ^ ")" |
|
145 |
else "_"; |
|
146 |
||
12557 | 147 |
|
11537 | 148 |
(**** check if a term contains only constructor functions ****) |
149 |
||
150 |
fun is_constrt thy = |
|
151 |
let |
|
15570 | 152 |
val cnstrs = List.concat (List.concat (map |
11537 | 153 |
(map (fn (_, (_, _, cs)) => map (apsnd length) cs) o #descr o snd) |
154 |
(Symtab.dest (DatatypePackage.get_datatypes thy)))); |
|
155 |
fun check t = (case strip_comb t of |
|
156 |
(Var _, []) => true |
|
157 |
| (Const (s, _), ts) => (case assoc (cnstrs, s) of |
|
15531 | 158 |
NONE => false |
159 |
| SOME i => length ts = i andalso forall check ts) |
|
11537 | 160 |
| _ => false) |
161 |
in check end; |
|
162 |
||
163 |
(**** check if a type is an equality type (i.e. doesn't contain fun) ****) |
|
164 |
||
165 |
fun is_eqT (Type (s, Ts)) = s <> "fun" andalso forall is_eqT Ts |
|
166 |
| is_eqT _ = true; |
|
167 |
||
168 |
(**** mode inference ****) |
|
169 |
||
15204
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
170 |
fun string_of_mode (iss, is) = space_implode " -> " (map |
15531 | 171 |
(fn NONE => "X" |
172 |
| SOME js => enclose "[" "]" (commas (map string_of_int js))) |
|
173 |
(iss @ [SOME is])); |
|
15204
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
174 |
|
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
175 |
fun print_modes modes = message ("Inferred modes:\n" ^ |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
176 |
space_implode "\n" (map (fn (s, ms) => s ^ ": " ^ commas (map |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
177 |
string_of_mode ms)) modes)); |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
178 |
|
11537 | 179 |
val term_vs = map (fst o fst o dest_Var) o term_vars; |
15570 | 180 |
val terms_vs = distinct o List.concat o (map term_vs); |
11537 | 181 |
|
182 |
(** collect all Vars in a term (with duplicates!) **) |
|
183 |
fun term_vTs t = map (apfst fst o dest_Var) |
|
15570 | 184 |
(List.filter is_Var (foldl_aterms (op :: o Library.swap) ([], t))); |
11537 | 185 |
|
186 |
fun get_args _ _ [] = ([], []) |
|
187 |
| get_args is i (x::xs) = (if i mem is then apfst else apsnd) (cons x) |
|
188 |
(get_args is (i+1) xs); |
|
189 |
||
190 |
fun merge xs [] = xs |
|
191 |
| merge [] ys = ys |
|
192 |
| merge (x::xs) (y::ys) = if length x >= length y then x::merge xs (y::ys) |
|
193 |
else y::merge (x::xs) ys; |
|
194 |
||
195 |
fun subsets i j = if i <= j then |
|
196 |
let val is = subsets (i+1) j |
|
197 |
in merge (map (fn ks => i::ks) is) is end |
|
198 |
else [[]]; |
|
199 |
||
12557 | 200 |
fun cprod ([], ys) = [] |
201 |
| cprod (x :: xs, ys) = map (pair x) ys @ cprod (xs, ys); |
|
202 |
||
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
203 |
fun cprods xss = foldr (map op :: o cprod) [[]] xss; |
12557 | 204 |
|
205 |
datatype mode = Mode of (int list option list * int list) * mode option list; |
|
206 |
||
207 |
fun modes_of modes t = |
|
208 |
let |
|
15570 | 209 |
fun mk_modes name args = List.concat |
12557 | 210 |
(map (fn (m as (iss, is)) => map (Mode o pair m) (cprods (map |
15531 | 211 |
(fn (NONE, _) => [NONE] |
212 |
| (SOME js, arg) => map SOME |
|
15570 | 213 |
(List.filter (fn Mode ((_, js'), _) => js=js') (modes_of modes arg))) |
214 |
(iss ~~ args)))) (valOf (assoc (modes, name)))) |
|
12557 | 215 |
|
216 |
in (case strip_comb t of |
|
14163
5ffa75ce4919
Improved handling of modes for equality predicate, to avoid ill-typed
berghofe
parents:
14162
diff
changeset
|
217 |
(Const ("op =", Type (_, [T, _])), _) => |
5ffa75ce4919
Improved handling of modes for equality predicate, to avoid ill-typed
berghofe
parents:
14162
diff
changeset
|
218 |
[Mode (([], [1]), []), Mode (([], [2]), [])] @ |
5ffa75ce4919
Improved handling of modes for equality predicate, to avoid ill-typed
berghofe
parents:
14162
diff
changeset
|
219 |
(if is_eqT T then [Mode (([], [1, 2]), [])] else []) |
5ffa75ce4919
Improved handling of modes for equality predicate, to avoid ill-typed
berghofe
parents:
14162
diff
changeset
|
220 |
| (Const (name, _), args) => mk_modes name args |
13038 | 221 |
| (Var ((name, _), _), args) => mk_modes name args |
222 |
| (Free (name, _), args) => mk_modes name args) |
|
12557 | 223 |
end; |
224 |
||
225 |
datatype indprem = Prem of term list * term | Sidecond of term; |
|
226 |
||
11537 | 227 |
fun select_mode_prem thy modes vs ps = |
15570 | 228 |
find_first (isSome o snd) (ps ~~ map |
12557 | 229 |
(fn Prem (us, t) => find_first (fn Mode ((_, is), _) => |
11537 | 230 |
let |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
231 |
val (in_ts, out_ts) = get_args is 1 us; |
15570 | 232 |
val (out_ts', in_ts') = List.partition (is_constrt thy) out_ts; |
233 |
val vTs = List.concat (map term_vTs out_ts'); |
|
11537 | 234 |
val dupTs = map snd (duplicates vTs) @ |
15570 | 235 |
List.mapPartial (curry assoc vTs) vs; |
11537 | 236 |
in |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
237 |
terms_vs (in_ts @ in_ts') subset vs andalso |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
238 |
forall (is_eqT o fastype_of) in_ts' andalso |
12557 | 239 |
term_vs t subset vs andalso |
11537 | 240 |
forall is_eqT dupTs |
241 |
end) |
|
15660 | 242 |
(modes_of modes t handle Option => [Mode (([], []), [])]) |
15531 | 243 |
| Sidecond t => if term_vs t subset vs then SOME (Mode (([], []), [])) |
244 |
else NONE) ps); |
|
11537 | 245 |
|
12557 | 246 |
fun check_mode_clause thy arg_vs modes (iss, is) (ts, ps) = |
11537 | 247 |
let |
15570 | 248 |
val modes' = modes @ List.mapPartial |
15531 | 249 |
(fn (_, NONE) => NONE | (v, SOME js) => SOME (v, [([], js)])) |
12557 | 250 |
(arg_vs ~~ iss); |
15531 | 251 |
fun check_mode_prems vs [] = SOME vs |
12557 | 252 |
| check_mode_prems vs ps = (case select_mode_prem thy modes' vs ps of |
15531 | 253 |
NONE => NONE |
254 |
| SOME (x, _) => check_mode_prems |
|
12557 | 255 |
(case x of Prem (us, _) => vs union terms_vs us | _ => vs) |
11537 | 256 |
(filter_out (equal x) ps)); |
15570 | 257 |
val (in_ts, in_ts') = List.partition (is_constrt thy) (fst (get_args is 1 ts)); |
11537 | 258 |
val in_vs = terms_vs in_ts; |
259 |
val concl_vs = terms_vs ts |
|
260 |
in |
|
15570 | 261 |
forall is_eqT (map snd (duplicates (List.concat (map term_vTs in_ts)))) andalso |
15204
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
262 |
forall (is_eqT o fastype_of) in_ts' andalso |
11537 | 263 |
(case check_mode_prems (arg_vs union in_vs) ps of |
15531 | 264 |
NONE => false |
265 |
| SOME vs => concl_vs subset vs) |
|
11537 | 266 |
end; |
267 |
||
268 |
fun check_modes_pred thy arg_vs preds modes (p, ms) = |
|
15531 | 269 |
let val SOME rs = assoc (preds, p) |
15570 | 270 |
in (p, List.filter (fn m => case find_index |
15204
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
271 |
(not o check_mode_clause thy arg_vs modes m) rs of |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
272 |
~1 => true |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
273 |
| i => (message ("Clause " ^ string_of_int (i+1) ^ " of " ^ |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
274 |
p ^ " violates mode " ^ string_of_mode m); false)) ms) |
d15f85347fcb
- Inserted additional check for equality types in check_mode_clause that
berghofe
parents:
15126
diff
changeset
|
275 |
end; |
11537 | 276 |
|
277 |
fun fixp f x = |
|
278 |
let val y = f x |
|
279 |
in if x = y then x else fixp f y end; |
|
280 |
||
12557 | 281 |
fun infer_modes thy extra_modes factors arg_vs preds = fixp (fn modes => |
11537 | 282 |
map (check_modes_pred thy arg_vs preds (modes @ extra_modes)) modes) |
12557 | 283 |
(map (fn (s, (fs, f)) => (s, cprod (cprods (map |
15531 | 284 |
(fn NONE => [NONE] |
285 |
| SOME f' => map SOME (subsets 1 (length f' + 1))) fs), |
|
12557 | 286 |
subsets 1 (length f + 1)))) factors); |
11537 | 287 |
|
288 |
(**** code generation ****) |
|
289 |
||
290 |
fun mk_eq (x::xs) = |
|
291 |
let fun mk_eqs _ [] = [] |
|
292 |
| mk_eqs a (b::cs) = Pretty.str (a ^ " = " ^ b) :: mk_eqs b cs |
|
293 |
in mk_eqs x xs end; |
|
294 |
||
295 |
fun mk_tuple xs = Pretty.block (Pretty.str "(" :: |
|
15570 | 296 |
List.concat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @ |
11537 | 297 |
[Pretty.str ")"]); |
298 |
||
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
299 |
(* convert nested pairs to n-tuple *) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
300 |
|
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
301 |
fun conv_ntuple [_] t ps = ps |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
302 |
| conv_ntuple [_, _] t ps = ps |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
303 |
| conv_ntuple us t ps = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
304 |
let |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
305 |
val xs = map (fn i => Pretty.str ("x" ^ string_of_int i)) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
306 |
(1 upto length us); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
307 |
fun ntuple (ys as (x, T) :: xs) U = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
308 |
if T = U then (x, xs) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
309 |
else |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
310 |
let |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
311 |
val Type ("*", [U1, U2]) = U; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
312 |
val (p1, ys1) = ntuple ys U1; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
313 |
val (p2, ys2) = ntuple ys1 U2 |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
314 |
in (mk_tuple [p1, p2], ys2) end |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
315 |
in |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
316 |
[Pretty.str "Seq.map (fn", Pretty.brk 1, |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
317 |
fst (ntuple (xs ~~ map fastype_of us) (HOLogic.dest_setT (fastype_of t))), |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
318 |
Pretty.str " =>", Pretty.brk 1, mk_tuple xs, Pretty.str ")", |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
319 |
Pretty.brk 1, parens (Pretty.block ps)] |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
320 |
end; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
321 |
|
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
322 |
(* convert n-tuple to nested pairs *) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
323 |
|
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
324 |
fun conv_ntuple' fs T ps = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
325 |
let |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
326 |
fun mk_x i = Pretty.str ("x" ^ string_of_int i); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
327 |
fun conv i js (Type ("*", [T, U])) = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
328 |
if js mem fs then |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
329 |
let |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
330 |
val (p, i') = conv i (1::js) T; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
331 |
val (q, i'') = conv i' (2::js) U |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
332 |
in (mk_tuple [p, q], i'') end |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
333 |
else (mk_x i, i+1) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
334 |
| conv i js _ = (mk_x i, i+1) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
335 |
val (p, i) = conv 1 [] T |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
336 |
in |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
337 |
if i > 3 then |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
338 |
[Pretty.str "Seq.map (fn", Pretty.brk 1, |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
339 |
mk_tuple (map mk_x (1 upto i-1)), Pretty.str " =>", Pretty.brk 1, |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
340 |
p, Pretty.str ")", Pretty.brk 1, parens (Pretty.block ps)] |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
341 |
else ps |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
342 |
end; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
343 |
|
11537 | 344 |
fun mk_v ((names, vs), s) = (case assoc (vs, s) of |
15531 | 345 |
NONE => ((names, (s, [s])::vs), s) |
346 |
| SOME xs => let val s' = variant names s in |
|
11537 | 347 |
((s'::names, overwrite (vs, (s, s'::xs))), s') end); |
348 |
||
349 |
fun distinct_v (nvs, Var ((s, 0), T)) = |
|
350 |
apsnd (Var o rpair T o rpair 0) (mk_v (nvs, s)) |
|
351 |
| distinct_v (nvs, t $ u) = |
|
352 |
let |
|
353 |
val (nvs', t') = distinct_v (nvs, t); |
|
354 |
val (nvs'', u') = distinct_v (nvs', u); |
|
355 |
in (nvs'', t' $ u') end |
|
356 |
| distinct_v x = x; |
|
357 |
||
15061
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
358 |
fun is_exhaustive (Var _) = true |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
359 |
| is_exhaustive (Const ("Pair", _) $ t $ u) = |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
360 |
is_exhaustive t andalso is_exhaustive u |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
361 |
| is_exhaustive _ = false; |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
362 |
|
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
363 |
fun compile_match nvs eq_ps out_ps success_p can_fail = |
15570 | 364 |
let val eqs = List.concat (separate [Pretty.str " andalso", Pretty.brk 1] |
365 |
(map single (List.concat (map (mk_eq o snd) nvs) @ eq_ps))); |
|
11537 | 366 |
in |
367 |
Pretty.block |
|
368 |
([Pretty.str "(fn ", mk_tuple out_ps, Pretty.str " =>", Pretty.brk 1] @ |
|
369 |
(Pretty.block ((if eqs=[] then [] else Pretty.str "if " :: |
|
370 |
[Pretty.block eqs, Pretty.brk 1, Pretty.str "then "]) @ |
|
371 |
(success_p :: |
|
15061
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
372 |
(if eqs=[] then [] else [Pretty.brk 1, Pretty.str "else Seq.empty"]))) :: |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
373 |
(if can_fail then |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
374 |
[Pretty.brk 1, Pretty.str "| _ => Seq.empty)"] |
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
375 |
else [Pretty.str ")"]))) |
11537 | 376 |
end; |
377 |
||
16645 | 378 |
fun strip_spaces s = implode (fst (take_suffix (equal " ") (explode s))); |
379 |
||
380 |
fun modename thy thyname thyname' s (iss, is) = space_implode "__" |
|
381 |
(mk_const_id (sign_of thy) thyname thyname' (strip_spaces s) :: |
|
15570 | 382 |
map (space_implode "_" o map string_of_int) (List.mapPartial I iss @ [is])); |
11537 | 383 |
|
16645 | 384 |
fun compile_expr thy defs dep thyname brack thynames (gr, (NONE, t)) = |
385 |
apsnd single (invoke_codegen thy defs dep thyname brack (gr, t)) |
|
386 |
| compile_expr _ _ _ _ _ _ (gr, (SOME _, Var ((name, _), _))) = |
|
12557 | 387 |
(gr, [Pretty.str name]) |
16645 | 388 |
| compile_expr thy defs dep thyname brack thynames (gr, (SOME (Mode (mode, ms)), t)) = |
12557 | 389 |
let |
390 |
val (Const (name, _), args) = strip_comb t; |
|
391 |
val (gr', ps) = foldl_map |
|
16645 | 392 |
(compile_expr thy defs dep thyname true thynames) (gr, ms ~~ args); |
12557 | 393 |
in (gr', (if brack andalso not (null ps) then |
394 |
single o parens o Pretty.block else I) |
|
15570 | 395 |
(List.concat (separate [Pretty.brk 1] |
16645 | 396 |
([Pretty.str (modename thy thyname |
397 |
(if name = "op =" then "" |
|
398 |
else the (assoc (thynames, name))) name mode)] :: ps)))) |
|
12557 | 399 |
end; |
400 |
||
16645 | 401 |
fun compile_clause thy defs gr dep thyname all_vs arg_vs modes thynames (iss, is) (ts, ps) = |
11537 | 402 |
let |
15570 | 403 |
val modes' = modes @ List.mapPartial |
15531 | 404 |
(fn (_, NONE) => NONE | (v, SOME js) => SOME (v, [([], js)])) |
12557 | 405 |
(arg_vs ~~ iss); |
406 |
||
11537 | 407 |
fun check_constrt ((names, eqs), t) = |
408 |
if is_constrt thy t then ((names, eqs), t) else |
|
409 |
let val s = variant names "x"; |
|
410 |
in ((s::names, (s, t)::eqs), Var ((s, 0), fastype_of t)) end; |
|
411 |
||
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
412 |
fun compile_eq (gr, (s, t)) = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
413 |
apsnd (Pretty.block o cons (Pretty.str (s ^ " = ")) o single) |
16645 | 414 |
(invoke_codegen thy defs dep thyname false (gr, t)); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
415 |
|
12557 | 416 |
val (in_ts, out_ts) = get_args is 1 ts; |
11537 | 417 |
val ((all_vs', eqs), in_ts') = |
418 |
foldl_map check_constrt ((all_vs, []), in_ts); |
|
419 |
||
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
420 |
fun is_ind t = (case head_of t of |
15570 | 421 |
Const (s, _) => s = "op =" orelse isSome (assoc (modes, s)) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
422 |
| Var ((s, _), _) => s mem arg_vs); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
423 |
|
11537 | 424 |
fun compile_prems out_ts' vs names gr [] = |
425 |
let |
|
12453 | 426 |
val (gr2, out_ps) = foldl_map |
16645 | 427 |
(invoke_codegen thy defs dep thyname false) (gr, out_ts); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
428 |
val (gr3, eq_ps) = foldl_map compile_eq (gr2, eqs); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
429 |
val ((names', eqs'), out_ts'') = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
430 |
foldl_map check_constrt ((names, []), out_ts'); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
431 |
val (nvs, out_ts''') = foldl_map distinct_v |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
432 |
((names', map (fn x => (x, [x])) vs), out_ts''); |
12453 | 433 |
val (gr4, out_ps') = foldl_map |
16645 | 434 |
(invoke_codegen thy defs dep thyname false) (gr3, out_ts'''); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
435 |
val (gr5, eq_ps') = foldl_map compile_eq (gr4, eqs') |
11537 | 436 |
in |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
437 |
(gr5, compile_match (snd nvs) (eq_ps @ eq_ps') out_ps' |
11537 | 438 |
(Pretty.block [Pretty.str "Seq.single", Pretty.brk 1, mk_tuple out_ps]) |
15061
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
439 |
(exists (not o is_exhaustive) out_ts''')) |
11537 | 440 |
end |
441 |
| compile_prems out_ts vs names gr ps = |
|
442 |
let |
|
15570 | 443 |
val vs' = distinct (List.concat (vs :: map term_vs out_ts)); |
15531 | 444 |
val SOME (p, mode as SOME (Mode ((_, js), _))) = |
15126
54ae6c6ef3b1
Fixed bug in compile_clause that caused equality constraints
berghofe
parents:
15061
diff
changeset
|
445 |
select_mode_prem thy modes' vs' ps; |
11537 | 446 |
val ps' = filter_out (equal p) ps; |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
447 |
val ((names', eqs), out_ts') = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
448 |
foldl_map check_constrt ((names, []), out_ts); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
449 |
val (nvs, out_ts'') = foldl_map distinct_v |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
450 |
((names', map (fn x => (x, [x])) vs), out_ts'); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
451 |
val (gr0, out_ps) = foldl_map |
16645 | 452 |
(invoke_codegen thy defs dep thyname false) (gr, out_ts''); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
453 |
val (gr1, eq_ps) = foldl_map compile_eq (gr0, eqs) |
11537 | 454 |
in |
455 |
(case p of |
|
12557 | 456 |
Prem (us, t) => |
11537 | 457 |
let |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
458 |
val (in_ts, out_ts''') = get_args js 1 us; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
459 |
val (gr2, in_ps) = foldl_map |
16645 | 460 |
(invoke_codegen thy defs dep thyname false) (gr1, in_ts); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
461 |
val (gr3, ps) = if is_ind t then |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
462 |
apsnd (fn ps => ps @ [Pretty.brk 1, mk_tuple in_ps]) |
16645 | 463 |
(compile_expr thy defs dep thyname false thynames |
464 |
(gr2, (mode, t))) |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
465 |
else |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
466 |
apsnd (fn p => conv_ntuple us t |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
467 |
[Pretty.str "Seq.of_list", Pretty.brk 1, p]) |
16645 | 468 |
(invoke_codegen thy defs dep thyname true (gr2, t)); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
469 |
val (gr4, rest) = compile_prems out_ts''' vs' (fst nvs) gr3 ps'; |
11537 | 470 |
in |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
471 |
(gr4, compile_match (snd nvs) eq_ps out_ps |
12557 | 472 |
(Pretty.block (ps @ |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
473 |
[Pretty.str " :->", Pretty.brk 1, rest])) |
15061
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
474 |
(exists (not o is_exhaustive) out_ts'')) |
11537 | 475 |
end |
476 |
| Sidecond t => |
|
477 |
let |
|
16645 | 478 |
val (gr2, side_p) = invoke_codegen thy defs dep thyname true (gr1, t); |
11537 | 479 |
val (gr3, rest) = compile_prems [] vs' (fst nvs) gr2 ps'; |
480 |
in |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
481 |
(gr3, compile_match (snd nvs) eq_ps out_ps |
11537 | 482 |
(Pretty.block [Pretty.str "?? ", side_p, |
483 |
Pretty.str " :->", Pretty.brk 1, rest]) |
|
15061
61a52739cd82
Added simple check that allows code generator to produce code containing
berghofe
parents:
15031
diff
changeset
|
484 |
(exists (not o is_exhaustive) out_ts'')) |
11537 | 485 |
end) |
486 |
end; |
|
487 |
||
15126
54ae6c6ef3b1
Fixed bug in compile_clause that caused equality constraints
berghofe
parents:
15061
diff
changeset
|
488 |
val (gr', prem_p) = compile_prems in_ts' arg_vs all_vs' gr ps; |
11537 | 489 |
in |
490 |
(gr', Pretty.block [Pretty.str "Seq.single inp :->", Pretty.brk 1, prem_p]) |
|
491 |
end; |
|
492 |
||
16645 | 493 |
fun compile_pred thy defs gr dep thyname prfx all_vs arg_vs modes thynames s cls mode = |
494 |
let val (gr', cl_ps) = foldl_map (fn (gr, cl) => compile_clause thy defs |
|
495 |
gr dep thyname all_vs arg_vs modes thynames mode cl) (gr, cls) |
|
11537 | 496 |
in |
497 |
((gr', "and "), Pretty.block |
|
498 |
([Pretty.block (separate (Pretty.brk 1) |
|
16645 | 499 |
(Pretty.str (prfx ^ modename thy thyname thyname s mode) :: |
500 |
map Pretty.str arg_vs) @ |
|
11537 | 501 |
[Pretty.str " inp ="]), |
502 |
Pretty.brk 1] @ |
|
15570 | 503 |
List.concat (separate [Pretty.str " ++", Pretty.brk 1] (map single cl_ps)))) |
11537 | 504 |
end; |
505 |
||
16645 | 506 |
fun compile_preds thy defs gr dep thyname all_vs arg_vs modes thynames preds = |
11537 | 507 |
let val ((gr', _), prs) = foldl_map (fn ((gr, prfx), (s, cls)) => |
16645 | 508 |
foldl_map (fn ((gr', prfx'), mode) => compile_pred thy defs gr' |
509 |
dep thyname prfx' all_vs arg_vs modes thynames s cls mode) |
|
15570 | 510 |
((gr, prfx), valOf (assoc (modes, s)))) ((gr, "fun "), preds) |
11537 | 511 |
in |
15570 | 512 |
(gr', space_implode "\n\n" (map Pretty.string_of (List.concat prs)) ^ ";\n\n") |
11537 | 513 |
end; |
514 |
||
515 |
(**** processing of introduction rules ****) |
|
516 |
||
12557 | 517 |
exception Modes of |
518 |
(string * (int list option list * int list) list) list * |
|
16645 | 519 |
(string * (int list list option list * int list list)) list * |
520 |
string; |
|
12557 | 521 |
|
16645 | 522 |
fun lookup_modes gr dep = foldl (fn ((xs, ys, z), (xss, yss, zss)) => |
523 |
(xss @ xs, yss @ ys, zss @ map (rpair z o fst) ys)) ([], [], []) |
|
524 |
(map ((fn (SOME (Modes x), _, _) => x | _ => ([], [], "")) o Graph.get_node gr) |
|
525 |
(Graph.all_preds gr [dep])); |
|
12557 | 526 |
|
11537 | 527 |
fun print_factors factors = message ("Factors:\n" ^ |
12557 | 528 |
space_implode "\n" (map (fn (s, (fs, f)) => s ^ ": " ^ |
529 |
space_implode " -> " (map |
|
15531 | 530 |
(fn NONE => "X" | SOME f' => string_of_factors [] f') |
531 |
(fs @ [SOME f]))) factors)); |
|
11537 | 532 |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
533 |
fun prep_intrs intrs = map (rename_term o #prop o rep_thm o standard) intrs; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
534 |
|
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
535 |
fun constrain cs [] = [] |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
536 |
| constrain cs ((s, xs) :: ys) = (s, case assoc (cs, s) of |
15531 | 537 |
NONE => xs |
538 |
| SOME xs' => xs inter xs') :: constrain cs ys; |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
539 |
|
16645 | 540 |
fun mk_extra_defs thy defs gr dep names ts = |
15570 | 541 |
Library.foldl (fn (gr, name) => |
12557 | 542 |
if name mem names then gr |
543 |
else (case get_clauses thy name of |
|
15531 | 544 |
NONE => gr |
16645 | 545 |
| SOME (names, thyname, intrs) => |
546 |
mk_ind_def thy defs gr dep names thyname [] [] (prep_intrs intrs))) |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
547 |
(gr, foldr add_term_consts [] ts) |
12557 | 548 |
|
16645 | 549 |
and mk_ind_def thy defs gr dep names thyname modecs factorcs intrs = |
550 |
Graph.add_edge (hd names, dep) gr handle Graph.UNDEF _ => |
|
11537 | 551 |
let |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
552 |
val _ $ (_ $ _ $ u) = Logic.strip_imp_concl (hd intrs); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
553 |
val (_, args) = strip_comb u; |
15570 | 554 |
val arg_vs = List.concat (map term_vs args); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
555 |
|
14250
d09e92e7c2bf
Inserted additional checks in functions dest_prem and add_prod_factors, to
berghofe
parents:
14195
diff
changeset
|
556 |
fun dest_prem factors (_ $ (p as (Const ("op :", _) $ t $ u))) = |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
557 |
(case assoc (factors, case head_of u of |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
558 |
Const (name, _) => name | Var ((name, _), _) => name) of |
15531 | 559 |
NONE => Prem (full_split_prod t, u) |
560 |
| SOME f => Prem (split_prod [] f t, u)) |
|
12557 | 561 |
| dest_prem factors (_ $ ((eq as Const ("op =", _)) $ t $ u)) = |
562 |
Prem ([t, u], eq) |
|
563 |
| dest_prem factors (_ $ t) = Sidecond t; |
|
11537 | 564 |
|
12557 | 565 |
fun add_clause factors (clauses, intr) = |
11537 | 566 |
let |
567 |
val _ $ (_ $ t $ u) = Logic.strip_imp_concl intr; |
|
12557 | 568 |
val Const (name, _) = head_of u; |
569 |
val prems = map (dest_prem factors) (Logic.strip_imp_prems intr); |
|
11537 | 570 |
in |
15570 | 571 |
(overwrite (clauses, (name, getOpt (assoc (clauses, name), []) @ |
572 |
[(split_prod [] (valOf (assoc (factors, name))) t, prems)]))) |
|
11537 | 573 |
end; |
574 |
||
15570 | 575 |
fun check_set (Const (s, _)) = s mem names orelse isSome (get_clauses thy s) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
576 |
| check_set (Var ((s, _), _)) = s mem arg_vs |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
577 |
| check_set _ = false; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
578 |
|
12557 | 579 |
fun add_prod_factors extra_fs (fs, _ $ (Const ("op :", _) $ t $ u)) = |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
580 |
if check_set (head_of u) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
581 |
then infer_factors (sign_of thy) extra_fs |
15531 | 582 |
(fs, (SOME (FVar (prod_factors [] t)), u)) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
583 |
else fs |
12557 | 584 |
| add_prod_factors _ (fs, _) = fs; |
11537 | 585 |
|
16645 | 586 |
val gr' = mk_extra_defs thy defs |
587 |
(Graph.add_edge (hd names, dep) |
|
588 |
(Graph.new_node (hd names, (NONE, "", "")) gr)) (hd names) names intrs; |
|
589 |
val (extra_modes, extra_factors, extra_thynames) = lookup_modes gr' (hd names); |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
590 |
val fs = constrain factorcs (map (apsnd dest_factors) |
15570 | 591 |
(Library.foldl (add_prod_factors extra_factors) ([], List.concat (map (fn t => |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
592 |
Logic.strip_imp_concl t :: Logic.strip_imp_prems t) intrs)))); |
15570 | 593 |
val factors = List.mapPartial (fn (name, f) => |
15531 | 594 |
if name mem arg_vs then NONE |
595 |
else SOME (name, (map (curry assoc fs) arg_vs, f))) fs; |
|
12557 | 596 |
val clauses = |
15570 | 597 |
Library.foldl (add_clause (fs @ map (apsnd snd) extra_factors)) ([], intrs); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
598 |
val modes = constrain modecs |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
599 |
(infer_modes thy extra_modes factors arg_vs clauses); |
12557 | 600 |
val _ = print_factors factors; |
11537 | 601 |
val _ = print_modes modes; |
16645 | 602 |
val (gr'', s) = compile_preds thy defs gr' (hd names) thyname (terms_vs intrs) |
603 |
arg_vs (modes @ extra_modes) |
|
604 |
(map (rpair thyname o fst) factors @ extra_thynames) clauses; |
|
11537 | 605 |
in |
16645 | 606 |
(Graph.map_node (hd names) |
607 |
(K (SOME (Modes (modes, factors, thyname)), thyname, s)) gr'') |
|
608 |
end; |
|
11537 | 609 |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
610 |
fun find_mode s u modes is = (case find_first (fn Mode ((_, js), _) => is=js) |
15660 | 611 |
(modes_of modes u handle Option => []) of |
15531 | 612 |
NONE => error ("No such mode for " ^ s ^ ": " ^ string_of_mode ([], is)) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
613 |
| mode => mode); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
614 |
|
16645 | 615 |
fun mk_ind_call thy defs gr dep thyname t u is_query = (case head_of u of |
13038 | 616 |
Const (s, T) => (case (get_clauses thy s, get_assoc_code thy s T) of |
15531 | 617 |
(NONE, _) => NONE |
16645 | 618 |
| (SOME (names, thyname', intrs), NONE) => |
11537 | 619 |
let |
12565 | 620 |
fun mk_mode (((ts, mode), i), Const ("dummy_pattern", _)) = |
621 |
((ts, mode), i+1) |
|
11537 | 622 |
| mk_mode (((ts, mode), i), t) = ((ts @ [t], mode @ [i]), i+1); |
623 |
||
16645 | 624 |
val gr1 = mk_extra_defs thy defs |
625 |
(mk_ind_def thy defs gr dep names thyname' [] [] (prep_intrs intrs)) dep names [u]; |
|
626 |
val (modes, factors, thynames) = lookup_modes gr1 dep; |
|
15570 | 627 |
val ts = split_prod [] (snd (valOf (assoc (factors, s)))) t; |
12557 | 628 |
val (ts', is) = if is_query then |
15570 | 629 |
fst (Library.foldl mk_mode ((([], []), 1), ts)) |
11537 | 630 |
else (ts, 1 upto length ts); |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
631 |
val mode = find_mode s u modes is; |
12453 | 632 |
val (gr2, in_ps) = foldl_map |
16645 | 633 |
(invoke_codegen thy defs dep thyname false) (gr1, ts'); |
634 |
val (gr3, ps) = |
|
635 |
compile_expr thy defs dep thyname false thynames (gr2, (mode, u)) |
|
11537 | 636 |
in |
15531 | 637 |
SOME (gr3, Pretty.block |
12557 | 638 |
(ps @ [Pretty.brk 1, mk_tuple in_ps])) |
13038 | 639 |
end |
15531 | 640 |
| _ => NONE) |
641 |
| _ => NONE); |
|
11537 | 642 |
|
16645 | 643 |
fun list_of_indset thy defs gr dep thyname brack u = (case head_of u of |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
644 |
Const (s, T) => (case (get_clauses thy s, get_assoc_code thy s T) of |
15531 | 645 |
(NONE, _) => NONE |
16645 | 646 |
| (SOME (names, thyname', intrs), NONE) => |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
647 |
let |
16645 | 648 |
val gr1 = mk_extra_defs thy defs |
649 |
(mk_ind_def thy defs gr dep names thyname' [] [] (prep_intrs intrs)) dep names [u]; |
|
650 |
val (modes, factors, thynames) = lookup_modes gr1 dep; |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
651 |
val mode = find_mode s u modes []; |
16645 | 652 |
val (gr2, ps) = |
653 |
compile_expr thy defs dep thyname false thynames (gr1, (mode, u)) |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
654 |
in |
15531 | 655 |
SOME (gr2, (if brack then parens else I) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
656 |
(Pretty.block ([Pretty.str "Seq.list_of", Pretty.brk 1, |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
657 |
Pretty.str "("] @ |
15570 | 658 |
conv_ntuple' (snd (valOf (assoc (factors, s)))) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
659 |
(HOLogic.dest_setT (fastype_of u)) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
660 |
(ps @ [Pretty.brk 1, Pretty.str "()"]) @ |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
661 |
[Pretty.str ")"]))) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
662 |
end |
15531 | 663 |
| _ => NONE) |
664 |
| _ => NONE); |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
665 |
|
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
666 |
fun clause_of_eqn eqn = |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
667 |
let |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
668 |
val (t, u) = HOLogic.dest_eq (HOLogic.dest_Trueprop (concl_of eqn)); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
669 |
val (Const (s, T), ts) = strip_comb t; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
670 |
val (Ts, U) = strip_type T |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
671 |
in |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
672 |
rename_term |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
673 |
(Logic.list_implies (prems_of eqn, HOLogic.mk_Trueprop (HOLogic.mk_mem |
16645 | 674 |
(foldr1 HOLogic.mk_prod (ts @ [u]), Const (s ^ " ", |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
675 |
HOLogic.mk_setT (foldr1 HOLogic.mk_prodT (Ts @ [U]))))))) |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
676 |
end; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
677 |
|
16645 | 678 |
fun mk_fun thy defs name eqns dep thyname thyname' gr = |
679 |
let |
|
680 |
val fun_id = mk_const_id (sign_of thy) thyname' thyname' name; |
|
681 |
val call_id = mk_const_id (sign_of thy) thyname thyname' name |
|
682 |
in (Graph.add_edge (name, dep) gr handle Graph.UNDEF _ => |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
683 |
let |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
684 |
val clauses = map clause_of_eqn eqns; |
16645 | 685 |
val pname = name ^ " "; |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
686 |
val arity = length (snd (strip_comb (fst (HOLogic.dest_eq |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
687 |
(HOLogic.dest_Trueprop (concl_of (hd eqns))))))); |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
688 |
val mode = 1 upto arity; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
689 |
val vars = map (fn i => Pretty.str ("x" ^ string_of_int i)) mode; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
690 |
val s = Pretty.string_of (Pretty.block |
16645 | 691 |
[mk_app false (Pretty.str ("fun " ^ fun_id)) vars, Pretty.str " =", |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
692 |
Pretty.brk 1, Pretty.str "Seq.hd", Pretty.brk 1, |
16645 | 693 |
parens (Pretty.block [Pretty.str (modename thy thyname' thyname' pname ([], mode)), |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
694 |
Pretty.brk 1, mk_tuple vars])]) ^ ";\n\n"; |
16645 | 695 |
val gr' = mk_ind_def thy defs (Graph.add_edge (name, dep) |
696 |
(Graph.new_node (name, (NONE, thyname', s)) gr)) name [pname] thyname' |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
697 |
[(pname, [([], mode)])] |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
698 |
[(pname, map (fn i => replicate i 2) (0 upto arity-1))] |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
699 |
clauses; |
16645 | 700 |
val (modes, _, _) = lookup_modes gr' dep; |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
701 |
val _ = find_mode pname (snd (HOLogic.dest_mem (HOLogic.dest_Trueprop |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
702 |
(Logic.strip_imp_concl (hd clauses))))) modes mode |
16645 | 703 |
in gr' end, call_id) |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
704 |
end; |
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
705 |
|
16645 | 706 |
fun inductive_codegen thy defs gr dep thyname brack (Const ("op :", _) $ t $ u) = |
707 |
((case mk_ind_call thy defs gr dep thyname (Term.no_dummy_patterns t) u false of |
|
15531 | 708 |
NONE => NONE |
709 |
| SOME (gr', call_p) => SOME (gr', (if brack then parens else I) |
|
12453 | 710 |
(Pretty.block [Pretty.str "?! (", call_p, Pretty.str ")"]))) |
16645 | 711 |
handle TERM _ => mk_ind_call thy defs gr dep thyname t u true) |
712 |
| inductive_codegen thy defs gr dep thyname brack t = (case strip_comb t of |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
713 |
(Const (s, _), ts) => (case Symtab.lookup (#eqns (CodegenData.get thy), s) of |
16645 | 714 |
NONE => list_of_indset thy defs gr dep thyname brack t |
15531 | 715 |
| SOME eqns => |
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
716 |
let |
16645 | 717 |
val (_, (_, thyname')) = split_last eqns; |
718 |
val (gr', id) = mk_fun thy defs s (preprocess thy (map fst eqns)) |
|
719 |
dep thyname thyname' gr; |
|
720 |
val (gr'', ps) = foldl_map |
|
721 |
(invoke_codegen thy defs dep thyname true) (gr', ts); |
|
722 |
in SOME (gr'', mk_app brack (Pretty.str id) ps) |
|
15031
726dc9146bb1
- Added support for conditional equations whose premises involve
berghofe
parents:
14981
diff
changeset
|
723 |
end) |
15531 | 724 |
| _ => NONE); |
11537 | 725 |
|
12557 | 726 |
val setup = |
727 |
[add_codegen "inductive" inductive_codegen, |
|
728 |
CodegenData.init, |
|
16645 | 729 |
add_attribute "ind" |
730 |
(Scan.option (Args.$$$ "target" |-- Args.colon |-- Args.name) >> add)]; |
|
11537 | 731 |
|
732 |
end; |
|
12453 | 733 |
|
734 |
||
735 |
(**** combinators for code generated from inductive predicates ****) |
|
736 |
||
737 |
infix 5 :->; |
|
738 |
infix 3 ++; |
|
739 |
||
740 |
fun s :-> f = Seq.flat (Seq.map f s); |
|
741 |
||
742 |
fun s1 ++ s2 = Seq.append (s1, s2); |
|
743 |
||
744 |
fun ?? b = if b then Seq.single () else Seq.empty; |
|
745 |
||
15570 | 746 |
fun ?! s = isSome (Seq.pull s); |
12453 | 747 |
|
14859 | 748 |
fun op_61__1 x = Seq.single x; |
12453 | 749 |
|
14859 | 750 |
val op_61__2 = op_61__1; |
12557 | 751 |
|
14859 | 752 |
fun op_61__1_2 (x, y) = ?? (x = y); |