Moved function params_of to inductive_package.ML.
(* Title: HOL/inductive_codegen.ML
ID: $Id$
Author: Stefan Berghofer, TU Muenchen
Code generator for inductive predicates.
*)
signature INDUCTIVE_CODEGEN =
sig
val add : string option -> int option -> attribute
val setup : theory -> theory
end;
structure InductiveCodegen : INDUCTIVE_CODEGEN =
struct
open Codegen;
(**** theory data ****)
fun merge_rules tabs =
Symtab.join (fn _ => AList.merge (Thm.eq_thm_prop) (K true)) tabs;
structure CodegenData = TheoryDataFun
(struct
val name = "HOL/inductive_codegen";
type T =
{intros : (thm * (string * int)) list Symtab.table,
graph : unit Graph.T,
eqns : (thm * string) list Symtab.table};
val empty =
{intros = Symtab.empty, graph = Graph.empty, eqns = Symtab.empty};
val copy = I;
val extend = I;
fun merge _ ({intros=intros1, graph=graph1, eqns=eqns1},
{intros=intros2, graph=graph2, eqns=eqns2}) =
{intros = merge_rules (intros1, intros2),
graph = Graph.merge (K true) (graph1, graph2),
eqns = merge_rules (eqns1, eqns2)};
fun print _ _ = ();
end);
fun warn thm = warning ("InductiveCodegen: Not a proper clause:\n" ^
string_of_thm thm);
fun add_node (g, x) = Graph.new_node (x, ()) g handle Graph.DUP _ => g;
fun add optmod optnparms = Thm.declaration_attribute (fn thm => Context.mapping (fn thy =>
let
val {intros, graph, eqns} = CodegenData.get thy;
fun thyname_of s = (case optmod of
NONE => thyname_of_const s thy | SOME s => s);
in (case Option.map strip_comb (try HOLogic.dest_Trueprop (concl_of thm)) of
SOME (Const ("op =", _), [t, _]) => (case head_of t of
Const (s, _) =>
CodegenData.put {intros = intros, graph = graph,
eqns = eqns |> Symtab.map_default (s, [])
(AList.update Thm.eq_thm_prop (thm, thyname_of s))} thy
| _ => (warn thm; thy))
| SOME (Const (s, _), _) =>
let
val cs = foldr add_term_consts [] (prems_of thm);
val rules = Symtab.lookup_list intros s;
val nparms = (case optnparms of
SOME k => k
| NONE => (case rules of
[] => (case try (InductivePackage.the_inductive (ProofContext.init thy)) s of
SOME (_, {raw_induct, ...}) =>
length (InductivePackage.params_of raw_induct)
| NONE => 0)
| xs => snd (snd (snd (split_last xs)))))
in CodegenData.put
{intros = intros |>
Symtab.update (s, (AList.update Thm.eq_thm_prop
(thm, (thyname_of s, nparms)) rules)),
graph = foldr (uncurry (Graph.add_edge o pair s))
(Library.foldl add_node (graph, s :: cs)) cs,
eqns = eqns} thy
end
| _ => (warn thm; thy))
end) I);
fun get_clauses thy s =
let val {intros, graph, ...} = CodegenData.get thy
in case Symtab.lookup intros s of
NONE => (case try (InductivePackage.the_inductive (ProofContext.init thy)) s of
NONE => NONE
| SOME ({names, ...}, {intrs, raw_induct, ...}) =>
SOME (names, thyname_of_const s thy,
length (InductivePackage.params_of raw_induct),
preprocess thy intrs))
| SOME _ =>
let
val SOME names = find_first
(fn xs => member (op =) xs s) (Graph.strong_conn graph);
val intrs as (_, (thyname, nparms)) :: _ =
maps (the o Symtab.lookup intros) names;
in SOME (names, thyname, nparms, preprocess thy (map fst (rev intrs))) end
end;
(**** check if a term contains only constructor functions ****)
fun is_constrt thy =
let
val cnstrs = List.concat (List.concat (map
(map (fn (_, (_, _, cs)) => map (apsnd length) cs) o #descr o snd)
(Symtab.dest (DatatypePackage.get_datatypes thy))));
fun check t = (case strip_comb t of
(Var _, []) => true
| (Const (s, _), ts) => (case AList.lookup (op =) cnstrs s of
NONE => false
| SOME i => length ts = i andalso forall check ts)
| _ => false)
in check end;
(**** check if a type is an equality type (i.e. doesn't contain fun) ****)
fun is_eqT (Type (s, Ts)) = s <> "fun" andalso forall is_eqT Ts
| is_eqT _ = true;
(**** mode inference ****)
fun string_of_mode (iss, is) = space_implode " -> " (map
(fn NONE => "X"
| SOME js => enclose "[" "]" (commas (map string_of_int js)))
(iss @ [SOME is]));
fun print_modes modes = message ("Inferred modes:\n" ^
space_implode "\n" (map (fn (s, ms) => s ^ ": " ^ commas (map
string_of_mode ms)) modes));
val term_vs = map (fst o fst o dest_Var) o term_vars;
val terms_vs = distinct (op =) o List.concat o (map term_vs);
(** collect all Vars in a term (with duplicates!) **)
fun term_vTs tm =
fold_aterms (fn Var ((x, _), T) => cons (x, T) | _ => I) tm [];
fun get_args _ _ [] = ([], [])
| get_args is i (x::xs) = (if i mem is then apfst else apsnd) (cons x)
(get_args is (i+1) xs);
fun merge xs [] = xs
| merge [] ys = ys
| merge (x::xs) (y::ys) = if length x >= length y then x::merge xs (y::ys)
else y::merge (x::xs) ys;
fun subsets i j = if i <= j then
let val is = subsets (i+1) j
in merge (map (fn ks => i::ks) is) is end
else [[]];
fun cprod ([], ys) = []
| cprod (x :: xs, ys) = map (pair x) ys @ cprod (xs, ys);
fun cprods xss = foldr (map op :: o cprod) [[]] xss;
datatype mode = Mode of (int list option list * int list) * int list * mode option list;
fun modes_of modes t =
let
val ks = 1 upto length (binder_types (fastype_of t));
val default = [Mode (([], ks), ks, [])];
fun mk_modes name args = Option.map (List.concat o
map (fn (m as (iss, is)) =>
let
val (args1, args2) =
if length args < length iss then
error ("Too few arguments for inductive predicate " ^ name)
else chop (length iss) args;
val k = length args2;
val prfx = 1 upto k
in
if not (is_prefix op = prfx is) then [] else
let val is' = map (fn i => i - k) (List.drop (is, k))
in map (fn x => Mode (m, is', x)) (cprods (map
(fn (NONE, _) => [NONE]
| (SOME js, arg) => map SOME (List.filter
(fn Mode (_, js', _) => js=js') (modes_of modes arg)))
(iss ~~ args1)))
end
end)) (AList.lookup op = modes name)
in (case strip_comb t of
(Const ("op =", Type (_, [T, _])), _) =>
[Mode (([], [1]), [1], []), Mode (([], [2]), [2], [])] @
(if is_eqT T then [Mode (([], [1, 2]), [1, 2], [])] else [])
| (Const (name, _), args) => the_default default (mk_modes name args)
| (Var ((name, _), _), args) => the (mk_modes name args)
| (Free (name, _), args) => the (mk_modes name args)
| _ => default)
end;
datatype indprem = Prem of term list * term | Sidecond of term;
fun select_mode_prem thy modes vs ps =
find_first (is_some o snd) (ps ~~ map
(fn Prem (us, t) => find_first (fn Mode (_, is, _) =>
let
val (in_ts, out_ts) = get_args is 1 us;
val (out_ts', in_ts') = List.partition (is_constrt thy) out_ts;
val vTs = List.concat (map term_vTs out_ts');
val dupTs = map snd (duplicates (op =) vTs) @
List.mapPartial (AList.lookup (op =) vTs) vs;
in
terms_vs (in_ts @ in_ts') subset vs andalso
forall (is_eqT o fastype_of) in_ts' andalso
term_vs t subset vs andalso
forall is_eqT dupTs
end)
(modes_of modes t handle Option => [Mode (([], []), [], [])])
| Sidecond t => if term_vs t subset vs then SOME (Mode (([], []), [], []))
else NONE) ps);
fun check_mode_clause thy arg_vs modes (iss, is) (ts, ps) =
let
val modes' = modes @ List.mapPartial
(fn (_, NONE) => NONE | (v, SOME js) => SOME (v, [([], js)]))
(arg_vs ~~ iss);
fun check_mode_prems vs [] = SOME vs
| check_mode_prems vs ps = (case select_mode_prem thy modes' vs ps of
NONE => NONE
| SOME (x, _) => check_mode_prems
(case x of Prem (us, _) => vs union terms_vs us | _ => vs)
(filter_out (equal x) ps));
val (in_ts, in_ts') = List.partition (is_constrt thy) (fst (get_args is 1 ts));
val in_vs = terms_vs in_ts;
val concl_vs = terms_vs ts
in
forall is_eqT (map snd (duplicates (op =) (List.concat (map term_vTs in_ts)))) andalso
forall (is_eqT o fastype_of) in_ts' andalso
(case check_mode_prems (arg_vs union in_vs) ps of
NONE => false
| SOME vs => concl_vs subset vs)
end;
fun check_modes_pred thy arg_vs preds modes (p, ms) =
let val SOME rs = AList.lookup (op =) preds p
in (p, List.filter (fn m => case find_index
(not o check_mode_clause thy arg_vs modes m) rs of
~1 => true
| i => (message ("Clause " ^ string_of_int (i+1) ^ " of " ^
p ^ " violates mode " ^ string_of_mode m); false)) ms)
end;
fun fixp f (x : (string * (int list option list * int list) list) list) =
let val y = f x
in if x = y then x else fixp f y end;
fun infer_modes thy extra_modes arities arg_vs preds = fixp (fn modes =>
map (check_modes_pred thy arg_vs preds (modes @ extra_modes)) modes)
(map (fn (s, (ks, k)) => (s, cprod (cprods (map
(fn NONE => [NONE]
| SOME k' => map SOME (subsets 1 k')) ks),
subsets 1 k))) arities);
(**** code generation ****)
fun mk_eq (x::xs) =
let fun mk_eqs _ [] = []
| mk_eqs a (b::cs) = Pretty.str (a ^ " = " ^ b) :: mk_eqs b cs
in mk_eqs x xs end;
fun mk_tuple xs = Pretty.block (Pretty.str "(" ::
List.concat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
[Pretty.str ")"]);
fun mk_v ((names, vs), s) = (case AList.lookup (op =) vs s of
NONE => ((names, (s, [s])::vs), s)
| SOME xs => let val s' = Name.variant names s in
((s'::names, AList.update (op =) (s, s'::xs) vs), s') end);
fun distinct_v (nvs, Var ((s, 0), T)) =
apsnd (Var o rpair T o rpair 0) (mk_v (nvs, s))
| distinct_v (nvs, t $ u) =
let
val (nvs', t') = distinct_v (nvs, t);
val (nvs'', u') = distinct_v (nvs', u);
in (nvs'', t' $ u') end
| distinct_v x = x;
fun is_exhaustive (Var _) = true
| is_exhaustive (Const ("Pair", _) $ t $ u) =
is_exhaustive t andalso is_exhaustive u
| is_exhaustive _ = false;
fun compile_match nvs eq_ps out_ps success_p can_fail =
let val eqs = List.concat (separate [Pretty.str " andalso", Pretty.brk 1]
(map single (List.concat (map (mk_eq o snd) nvs) @ eq_ps)));
in
Pretty.block
([Pretty.str "(fn ", mk_tuple out_ps, Pretty.str " =>", Pretty.brk 1] @
(Pretty.block ((if eqs=[] then [] else Pretty.str "if " ::
[Pretty.block eqs, Pretty.brk 1, Pretty.str "then "]) @
(success_p ::
(if eqs=[] then [] else [Pretty.brk 1, Pretty.str "else Seq.empty"]))) ::
(if can_fail then
[Pretty.brk 1, Pretty.str "| _ => Seq.empty)"]
else [Pretty.str ")"])))
end;
fun modename module s (iss, is) gr =
let val (gr', id) = if s = "op =" then (gr, ("", "equal"))
else mk_const_id module s gr
in (gr', space_implode "__"
(mk_qual_id module id ::
map (space_implode "_" o map string_of_int) (List.mapPartial I iss @ [is])))
end;
fun mk_funcomp brack s k p = (if brack then parens else I)
(Pretty.block [Pretty.block ((if k = 0 then [] else [Pretty.str "("]) @
separate (Pretty.brk 1) (Pretty.str s :: replicate k (Pretty.str "|> ???")) @
(if k = 0 then [] else [Pretty.str ")"])), Pretty.brk 1, p]);
fun compile_expr thy defs dep module brack modes (gr, (NONE, t)) =
apsnd single (invoke_codegen thy defs dep module brack (gr, t))
| compile_expr _ _ _ _ _ _ (gr, (SOME _, Var ((name, _), _))) =
(gr, [Pretty.str name])
| compile_expr thy defs dep module brack modes (gr, (SOME (Mode (mode, _, ms)), t)) =
(case strip_comb t of
(Const (name, _), args) =>
if name = "op =" orelse AList.defined op = modes name then
let
val (args1, args2) = chop (length ms) args;
val (gr', (ps, mode_id)) = foldl_map
(compile_expr thy defs dep module true modes) (gr, ms ~~ args1) |>>>
modename module name mode;
val (gr'', ps') = foldl_map
(invoke_codegen thy defs dep module true) (gr', args2)
in (gr', (if brack andalso not (null ps andalso null ps') then
single o parens o Pretty.block else I)
(List.concat (separate [Pretty.brk 1]
([Pretty.str mode_id] :: ps @ map single ps'))))
end
else apsnd (single o mk_funcomp brack "??" (length (binder_types (fastype_of t))))
(invoke_codegen thy defs dep module true (gr, t))
| _ => apsnd (single o mk_funcomp brack "??" (length (binder_types (fastype_of t))))
(invoke_codegen thy defs dep module true (gr, t)));
fun compile_clause thy defs gr dep module all_vs arg_vs modes (iss, is) (ts, ps) inp =
let
val modes' = modes @ List.mapPartial
(fn (_, NONE) => NONE | (v, SOME js) => SOME (v, [([], js)]))
(arg_vs ~~ iss);
fun check_constrt ((names, eqs), t) =
if is_constrt thy t then ((names, eqs), t) else
let val s = Name.variant names "x";
in ((s::names, (s, t)::eqs), Var ((s, 0), fastype_of t)) end;
fun compile_eq (gr, (s, t)) =
apsnd (Pretty.block o cons (Pretty.str (s ^ " = ")) o single)
(invoke_codegen thy defs dep module false (gr, t));
val (in_ts, out_ts) = get_args is 1 ts;
val ((all_vs', eqs), in_ts') =
foldl_map check_constrt ((all_vs, []), in_ts);
fun is_ind t = (case head_of t of
Const (s, _) => s = "op =" orelse AList.defined (op =) modes s
| Var ((s, _), _) => s mem arg_vs);
fun compile_prems out_ts' vs names gr [] =
let
val (gr2, out_ps) = foldl_map
(invoke_codegen thy defs dep module false) (gr, out_ts);
val (gr3, eq_ps) = foldl_map compile_eq (gr2, eqs);
val ((names', eqs'), out_ts'') =
foldl_map check_constrt ((names, []), out_ts');
val (nvs, out_ts''') = foldl_map distinct_v
((names', map (fn x => (x, [x])) vs), out_ts'');
val (gr4, out_ps') = foldl_map
(invoke_codegen thy defs dep module false) (gr3, out_ts''');
val (gr5, eq_ps') = foldl_map compile_eq (gr4, eqs')
in
(gr5, compile_match (snd nvs) (eq_ps @ eq_ps') out_ps'
(Pretty.block [Pretty.str "Seq.single", Pretty.brk 1, mk_tuple out_ps])
(exists (not o is_exhaustive) out_ts'''))
end
| compile_prems out_ts vs names gr ps =
let
val vs' = distinct (op =) (List.concat (vs :: map term_vs out_ts));
val SOME (p, mode as SOME (Mode (_, js, _))) =
select_mode_prem thy modes' vs' ps;
val ps' = filter_out (equal p) ps;
val ((names', eqs), out_ts') =
foldl_map check_constrt ((names, []), out_ts);
val (nvs, out_ts'') = foldl_map distinct_v
((names', map (fn x => (x, [x])) vs), out_ts');
val (gr0, out_ps) = foldl_map
(invoke_codegen thy defs dep module false) (gr, out_ts'');
val (gr1, eq_ps) = foldl_map compile_eq (gr0, eqs)
in
(case p of
Prem (us, t) =>
let
val (in_ts, out_ts''') = get_args js 1 us;
val (gr2, in_ps) = foldl_map
(invoke_codegen thy defs dep module true) (gr1, in_ts);
val (gr3, ps) = if is_ind t then
apsnd (fn ps => ps @ Pretty.brk 1 ::
separate (Pretty.brk 1) in_ps)
(compile_expr thy defs dep module false modes
(gr2, (mode, t)))
else
apsnd (fn p => [Pretty.str "Seq.of_list", Pretty.brk 1, p])
(invoke_codegen thy defs dep module true (gr2, t));
val (gr4, rest) = compile_prems out_ts''' vs' (fst nvs) gr3 ps';
in
(gr4, compile_match (snd nvs) eq_ps out_ps
(Pretty.block (ps @
[Pretty.str " :->", Pretty.brk 1, rest]))
(exists (not o is_exhaustive) out_ts''))
end
| Sidecond t =>
let
val (gr2, side_p) = invoke_codegen thy defs dep module true (gr1, t);
val (gr3, rest) = compile_prems [] vs' (fst nvs) gr2 ps';
in
(gr3, compile_match (snd nvs) eq_ps out_ps
(Pretty.block [Pretty.str "?? ", side_p,
Pretty.str " :->", Pretty.brk 1, rest])
(exists (not o is_exhaustive) out_ts''))
end)
end;
val (gr', prem_p) = compile_prems in_ts' arg_vs all_vs' gr ps;
in
(gr', Pretty.block [Pretty.str "Seq.single", Pretty.brk 1, inp,
Pretty.str " :->", Pretty.brk 1, prem_p])
end;
fun compile_pred thy defs gr dep module prfx all_vs arg_vs modes s cls mode =
let
val xs = map Pretty.str (Name.variant_list arg_vs
(map (fn i => "x" ^ string_of_int i) (snd mode)));
val (gr', (cl_ps, mode_id)) =
foldl_map (fn (gr, cl) => compile_clause thy defs
gr dep module all_vs arg_vs modes mode cl (mk_tuple xs)) (gr, cls) |>>>
modename module s mode
in
((gr', "and "), Pretty.block
([Pretty.block (separate (Pretty.brk 1)
(Pretty.str (prfx ^ mode_id) ::
map Pretty.str arg_vs @ xs) @
[Pretty.str " ="]),
Pretty.brk 1] @
List.concat (separate [Pretty.str " ++", Pretty.brk 1] (map single cl_ps))))
end;
fun compile_preds thy defs gr dep module all_vs arg_vs modes preds =
let val ((gr', _), prs) = foldl_map (fn ((gr, prfx), (s, cls)) =>
foldl_map (fn ((gr', prfx'), mode) => compile_pred thy defs gr'
dep module prfx' all_vs arg_vs modes s cls mode)
((gr, prfx), ((the o AList.lookup (op =) modes) s))) ((gr, "fun "), preds)
in
(gr', space_implode "\n\n" (map Pretty.string_of (List.concat prs)) ^ ";\n\n")
end;
(**** processing of introduction rules ****)
exception Modes of
(string * (int list option list * int list) list) list *
(string * (int option list * int)) list;
fun lookup_modes gr dep = apfst List.concat (apsnd List.concat (ListPair.unzip
(map ((fn (SOME (Modes x), _, _) => x | _ => ([], [])) o get_node gr)
(Graph.all_preds (fst gr) [dep]))));
fun print_arities arities = message ("Arities:\n" ^
space_implode "\n" (map (fn (s, (ks, k)) => s ^ ": " ^
space_implode " -> " (map
(fn NONE => "X" | SOME k' => string_of_int k')
(ks @ [SOME k]))) arities));
fun prep_intrs intrs = map (rename_term o #prop o rep_thm o standard) intrs;
fun constrain cs [] = []
| constrain cs ((s, xs) :: ys) = (s, case AList.lookup (op =) cs (s : string) of
NONE => xs
| SOME xs' => xs inter xs') :: constrain cs ys;
fun mk_extra_defs thy defs gr dep names module ts =
Library.foldl (fn (gr, name) =>
if name mem names then gr
else (case get_clauses thy name of
NONE => gr
| SOME (names, thyname, nparms, intrs) =>
mk_ind_def thy defs gr dep names (if_library thyname module)
[] (prep_intrs intrs) nparms))
(gr, foldr add_term_consts [] ts)
and mk_ind_def thy defs gr dep names module modecs intrs nparms =
add_edge (hd names, dep) gr handle Graph.UNDEF _ =>
let
val _ $ u = Logic.strip_imp_concl (hd intrs);
val args = List.take (snd (strip_comb u), nparms);
val arg_vs = List.concat (map term_vs args);
fun get_nparms s = if s mem names then SOME nparms else
Option.map #3 (get_clauses thy s);
fun dest_prem (_ $ (Const ("op :", _) $ t $ u)) = Prem ([t], u)
| dest_prem (_ $ ((eq as Const ("op =", _)) $ t $ u)) = Prem ([t, u], eq)
| dest_prem (_ $ t) =
(case strip_comb t of
(v as Var _, ts) => if v mem args then Prem (ts, v) else Sidecond t
| (c as Const (s, _), ts) => (case get_nparms s of
NONE => Sidecond t
| SOME k =>
let val (ts1, ts2) = chop k ts
in Prem (ts2, list_comb (c, ts1)) end)
| _ => Sidecond t);
fun add_clause intr (clauses, arities) =
let
val _ $ t = Logic.strip_imp_concl intr;
val (Const (name, T), ts) = strip_comb t;
val (ts1, ts2) = chop nparms ts;
val prems = map dest_prem (Logic.strip_imp_prems intr);
val (Ts, Us) = chop nparms (binder_types T)
in
(AList.update op = (name, these (AList.lookup op = clauses name) @
[(ts2, prems)]) clauses,
AList.update op = (name, (map (fn U => (case strip_type U of
(Rs as _ :: _, Type ("bool", [])) => SOME (length Rs)
| _ => NONE)) Ts,
length Us)) arities)
end;
val gr' = mk_extra_defs thy defs
(add_edge (hd names, dep)
(new_node (hd names, (NONE, "", "")) gr)) (hd names) names module intrs;
val (extra_modes, extra_arities) = lookup_modes gr' (hd names);
val (clauses, arities) = fold add_clause intrs ([], []);
val modes = constrain modecs
(infer_modes thy extra_modes arities arg_vs clauses);
val _ = print_arities arities;
val _ = print_modes modes;
val (gr'', s) = compile_preds thy defs gr' (hd names) module (terms_vs intrs)
arg_vs (modes @ extra_modes) clauses;
in
(map_node (hd names)
(K (SOME (Modes (modes, arities)), module, s)) gr'')
end;
fun find_mode gr dep s u modes is = (case find_first (fn Mode (_, js, _) => is=js)
(modes_of modes u handle Option => []) of
NONE => codegen_error gr dep
("No such mode for " ^ s ^ ": " ^ string_of_mode ([], is))
| mode => mode);
fun mk_ind_call thy defs gr dep module is_query s T ts names thyname k intrs =
let
val (ts1, ts2) = chop k ts;
val u = list_comb (Const (s, T), ts1);
fun mk_mode (((ts, mode), i), Const ("dummy_pattern", _)) =
((ts, mode), i+1)
| mk_mode (((ts, mode), i), t) = ((ts @ [t], mode @ [i]), i+1);
val module' = if_library thyname module;
val gr1 = mk_extra_defs thy defs
(mk_ind_def thy defs gr dep names module'
[] (prep_intrs intrs) k) dep names module' [u];
val (modes, _) = lookup_modes gr1 dep;
val (ts', is) = if is_query then
fst (Library.foldl mk_mode ((([], []), 1), ts2))
else (ts2, 1 upto length (binder_types T) - k);
val mode = find_mode gr1 dep s u modes is;
val (gr2, in_ps) = foldl_map
(invoke_codegen thy defs dep module true) (gr1, ts');
val (gr3, ps) =
compile_expr thy defs dep module false modes (gr2, (mode, u))
in
(gr3, Pretty.block (ps @ (if null in_ps then [] else [Pretty.brk 1]) @
separate (Pretty.brk 1) in_ps))
end;
fun clause_of_eqn eqn =
let
val (t, u) = HOLogic.dest_eq (HOLogic.dest_Trueprop (concl_of eqn));
val (Const (s, T), ts) = strip_comb t;
val (Ts, U) = strip_type T
in
rename_term (Logic.list_implies (prems_of eqn, HOLogic.mk_Trueprop
(list_comb (Const (s ^ "_aux", Ts @ [U] ---> HOLogic.boolT), ts @ [u]))))
end;
fun mk_fun thy defs name eqns dep module module' gr =
case try (get_node gr) name of
NONE =>
let
val clauses = map clause_of_eqn eqns;
val pname = name ^ "_aux";
val arity = length (snd (strip_comb (fst (HOLogic.dest_eq
(HOLogic.dest_Trueprop (concl_of (hd eqns)))))));
val mode = 1 upto arity;
val (gr', (fun_id, mode_id)) = gr |>
mk_const_id module' name |>>>
modename module' pname ([], mode);
val vars = map (fn i => Pretty.str ("x" ^ string_of_int i)) mode;
val s = Pretty.string_of (Pretty.block
[mk_app false (Pretty.str ("fun " ^ snd fun_id)) vars, Pretty.str " =",
Pretty.brk 1, Pretty.str "Seq.hd", Pretty.brk 1,
parens (Pretty.block (separate (Pretty.brk 1) (Pretty.str mode_id ::
vars)))]) ^ ";\n\n";
val gr'' = mk_ind_def thy defs (add_edge (name, dep)
(new_node (name, (NONE, module', s)) gr')) name [pname] module'
[(pname, [([], mode)])] clauses 0;
val (modes, _) = lookup_modes gr'' dep;
val _ = find_mode gr'' dep pname (head_of (HOLogic.dest_Trueprop
(Logic.strip_imp_concl (hd clauses)))) modes mode
in (gr'', mk_qual_id module fun_id) end
| SOME _ =>
(add_edge (name, dep) gr, mk_qual_id module (get_const_id name gr));
fun inductive_codegen thy defs gr dep module brack t = (case strip_comb t of
(Const ("Collect", Type (_, [_, Type (_, [U])])), [u]) => (case strip_comb u of
(Const (s, T), ts) => (case (get_clauses thy s, get_assoc_code thy s T) of
(SOME (names, thyname, k, intrs), NONE) =>
let val (gr', call_p) = mk_ind_call thy defs gr dep module true
s T (ts @ [Term.dummy_pattern U]) names thyname k intrs
in SOME (gr', (if brack then parens else I) (Pretty.block
[Pretty.str "Seq.list_of", Pretty.brk 1, Pretty.str "(",
call_p, Pretty.str ")"]))
end
| _ => NONE)
| _ => NONE)
| (Const (s, T), ts) => (case Symtab.lookup (#eqns (CodegenData.get thy)) s of
NONE => (case (get_clauses thy s, get_assoc_code thy s T) of
(SOME (names, thyname, k, intrs), NONE) =>
if length ts < k then NONE else SOME
(let val (gr', call_p) = mk_ind_call thy defs gr dep module false
s T (map Term.no_dummy_patterns ts) names thyname k intrs
in (gr', mk_funcomp brack "?!"
(length (binder_types T) - length ts) (parens call_p))
end handle TERM _ => mk_ind_call thy defs gr dep module true
s T ts names thyname k intrs)
| _ => NONE)
| SOME eqns =>
let
val (_, thyname) :: _ = eqns;
val (gr', id) = mk_fun thy defs s (preprocess thy (map fst (rev eqns)))
dep module (if_library thyname module) gr;
val (gr'', ps) = foldl_map
(invoke_codegen thy defs dep module true) (gr', ts);
in SOME (gr'', mk_app brack (Pretty.str id) ps)
end)
| _ => NONE);
val setup =
add_codegen "inductive" inductive_codegen #>
CodegenData.init #>
add_attribute "ind" (Scan.option (Args.$$$ "target" |-- Args.colon |-- Args.name) --
Scan.option (Args.$$$ "params" |-- Args.colon |-- Args.nat) >> uncurry add);
end;
(**** combinators for code generated from inductive predicates ****)
infix 5 :->;
infix 3 ++;
fun s :-> f = Seq.maps f s;
fun s1 ++ s2 = Seq.append s1 s2;
fun ?? b = if b then Seq.single () else Seq.empty;
fun ??? f g = f o g;
fun ?! s = is_some (Seq.pull s);
fun equal__1 x = Seq.single x;
val equal__2 = equal__1;
fun equal__1_2 (x, y) = ?? (x = y);