author  wenzelm 
Sun, 01 Mar 2009 23:36:12 +0100  
changeset 30190  479806475f3c 
parent 30089  f631fb528277 
child 30223  24d975352879 
child 30304  d8e4cd2ac2a1 
permissions  rwrr 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

1 
(* Title: HOL/Tools/inductive_set_package.ML 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

2 
Author: Stefan Berghofer, TU Muenchen 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

3 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

4 
Wrapper for defining inductive sets using package for inductive predicates, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

5 
including infrastructure for converting between predicates and sets. 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

6 
*) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

7 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

8 
signature INDUCTIVE_SET_PACKAGE = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

9 
sig 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

10 
val to_set_att: thm list > attribute 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

11 
val to_pred_att: thm list > attribute 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

12 
val pred_set_conv_att: attribute 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24745
diff
changeset

13 
val add_inductive_i: 
26534  14 
InductivePackage.inductive_flags > 
29581  15 
((binding * typ) * mixfix) list > 
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

16 
(string * typ) list > 
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

17 
(Attrib.binding * term) list > thm list > 
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

18 
local_theory > InductivePackage.inductive_result * local_theory 
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

19 
val add_inductive: bool > bool > 
29581  20 
(binding * string option * mixfix) list > 
21 
(binding * string option * mixfix) list > 

28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset

22 
(Attrib.binding * string) list > (Facts.ref * Attrib.src list) list > 
29389  23 
bool > local_theory > InductivePackage.inductive_result * local_theory 
28723  24 
val codegen_preproc: theory > thm list > thm list 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

25 
val setup: theory > theory 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

26 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

27 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

28 
structure InductiveSetPackage: INDUCTIVE_SET_PACKAGE = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

29 
struct 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

30 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

31 
(**** simplify {(x1, ..., xn). (x1, ..., xn) : S} to S ****) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

32 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

33 
val collect_mem_simproc = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

34 
Simplifier.simproc (theory "Set") "Collect_mem" ["Collect t"] (fn thy => fn ss => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

35 
fn S as Const ("Collect", Type ("fun", [_, T])) $ t => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

36 
let val (u, Ts, ps) = HOLogic.strip_split t 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

37 
in case u of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

38 
(c as Const ("op :", _)) $ q $ S' => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

39 
(case try (HOLogic.dest_tuple' ps) q of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

40 
NONE => NONE 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

41 
 SOME ts => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

42 
if not (loose_bvar (S', 0)) andalso 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

43 
ts = map Bound (length ps downto 0) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

44 
then 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

45 
let val simp = full_simp_tac (Simplifier.inherit_context ss 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

46 
(HOL_basic_ss addsimps [split_paired_all, split_conv])) 1 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

47 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

48 
SOME (Goal.prove (Simplifier.the_context ss) [] [] 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

49 
(Const ("==", T > T > propT) $ S $ S') 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

50 
(K (EVERY 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24745
diff
changeset

51 
[rtac eq_reflection 1, rtac @{thm subset_antisym} 1, 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

52 
rtac subsetI 1, dtac CollectD 1, simp, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

53 
rtac subsetI 1, rtac CollectI 1, simp]))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

54 
end 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

55 
else NONE) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

56 
 _ => NONE 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

57 
end 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

58 
 _ => NONE); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

59 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

60 
(***********************************************************************************) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

61 
(* simplifies (%x y. (x, y) : S & P x y) to (%x y. (x, y) : S Int {(x, y). P x y}) *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

62 
(* and (%x y. (x, y) : S  P x y) to (%x y. (x, y) : S Un {(x, y). P x y}) *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

63 
(* used for converting "strong" (co)induction rules *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

64 
(***********************************************************************************) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

65 

23849
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

66 
val anyt = Free ("t", TFree ("'t", [])); 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

67 

2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

68 
fun strong_ind_simproc tab = 
29064  69 
Simplifier.simproc_i @{theory HOL} "strong_ind" [anyt] (fn thy => fn ss => fn t => 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

70 
let 
23849
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

71 
fun close p t f = 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

72 
let val vs = Term.add_vars t [] 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

73 
in Drule.instantiate' [] (rev (map (SOME o cterm_of thy o Var) vs)) 
27330  74 
(p (fold (Logic.all o Var) vs t) f) 
23849
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

75 
end; 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

76 
fun mkop "op &" T x = SOME (Const ("op Int", T > T > T), x) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

77 
 mkop "op " T x = SOME (Const ("op Un", T > T > T), x) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

78 
 mkop _ _ _ = NONE; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

79 
fun mk_collect p T t = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

80 
let val U = HOLogic.dest_setT T 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

81 
in HOLogic.Collect_const U $ 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

82 
HOLogic.ap_split' (HOLogic.prod_factors p) U HOLogic.boolT t 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

83 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

84 
fun decomp (Const (s, _) $ ((m as Const ("op :", 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

85 
Type (_, [_, Type (_, [T, _])]))) $ p $ S) $ u) = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

86 
mkop s T (m, p, S, mk_collect p T (head_of u)) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

87 
 decomp (Const (s, _) $ u $ ((m as Const ("op :", 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

88 
Type (_, [_, Type (_, [T, _])]))) $ p $ S)) = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

89 
mkop s T (m, p, mk_collect p T (head_of u), S) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

90 
 decomp _ = NONE; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

91 
val simp = full_simp_tac (Simplifier.inherit_context ss 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

92 
(HOL_basic_ss addsimps [mem_Collect_eq, split_conv])) 1; 
23849
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

93 
fun mk_rew t = (case strip_abs_vars t of 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

94 
[] => NONE 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

95 
 xs => (case decomp (strip_abs_body t) of 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

96 
NONE => NONE 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

97 
 SOME (bop, (m, p, S, S')) => 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

98 
SOME (close (Goal.prove (Simplifier.the_context ss) [] []) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

99 
(Logic.mk_equals (t, list_abs (xs, m $ p $ (bop $ S $ S')))) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

100 
(K (EVERY 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

101 
[rtac eq_reflection 1, REPEAT (rtac ext 1), rtac iffI 1, 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

102 
EVERY [etac conjE 1, rtac IntI 1, simp, simp, 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

103 
etac IntE 1, rtac conjI 1, simp, simp] ORELSE 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

104 
EVERY [etac disjE 1, rtac UnI1 1, simp, rtac UnI2 1, simp, 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

105 
etac UnE 1, rtac disjI1 1, simp, rtac disjI2 1, simp]]))) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

106 
handle ERROR _ => NONE)) 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

107 
in 
23849
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

108 
case strip_comb t of 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

109 
(h as Const (name, _), ts) => (case Symtab.lookup tab name of 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

110 
SOME _ => 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

111 
let val rews = map mk_rew ts 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

112 
in 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

113 
if forall is_none rews then NONE 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

114 
else SOME (fold (fn th1 => fn th2 => combination th2 th1) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

115 
(map2 (fn SOME r => K r  NONE => reflexive o cterm_of thy) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

116 
rews ts) (reflexive (cterm_of thy h))) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

117 
end 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

118 
 NONE => NONE) 
2a0e24c74593
strong_ind_simproc now only rewrites arguments of inductive predicates.
berghofe
parents:
23764
diff
changeset

119 
 _ => NONE 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

120 
end); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

121 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

122 
(* only eta contract terms occurring as arguments of functions satisfying p *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

123 
fun eta_contract p = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

124 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

125 
fun eta b (Abs (a, T, body)) = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

126 
(case eta b body of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

127 
body' as (f $ Bound 0) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

128 
if loose_bvar1 (f, 0) orelse not b then Abs (a, T, body') 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

129 
else incr_boundvars ~1 f 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

130 
 body' => Abs (a, T, body')) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

131 
 eta b (t $ u) = eta b t $ eta (p (head_of t)) u 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

132 
 eta b t = t 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

133 
in eta false end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

134 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

135 
fun eta_contract_thm p = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

136 
Conv.fconv_rule (Conv.then_conv (Thm.beta_conversion true, fn ct => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

137 
Thm.transitive (Thm.eta_conversion ct) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

138 
(Thm.symmetric (Thm.eta_conversion 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

139 
(cterm_of (theory_of_cterm ct) (eta_contract p (term_of ct))))))); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

140 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

141 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

142 
(***********************************************************) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

143 
(* rules for converting between predicate and set notation *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

144 
(* *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

145 
(* rules for converting predicates to sets have the form *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

146 
(* P (%x y. (x, y) : s) = (%x y. (x, y) : S s) *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

147 
(* *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

148 
(* rules for converting sets to predicates have the form *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

149 
(* S {(x, y). p x y} = {(x, y). P p x y} *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

150 
(* *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

151 
(* where s and p are parameters *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

152 
(***********************************************************) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

153 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

154 
structure PredSetConvData = GenericDataFun 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

155 
( 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

156 
type T = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

157 
{(* rules for converting predicates to sets *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

158 
to_set_simps: thm list, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

159 
(* rules for converting sets to predicates *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

160 
to_pred_simps: thm list, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

161 
(* arities of functions of type t set => ... => u set *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

162 
set_arities: (typ * (int list list option list * int list list option)) list Symtab.table, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

163 
(* arities of functions of type (t => ... => bool) => u => ... => bool *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

164 
pred_arities: (typ * (int list list option list * int list list option)) list Symtab.table}; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

165 
val empty = {to_set_simps = [], to_pred_simps = [], 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

166 
set_arities = Symtab.empty, pred_arities = Symtab.empty}; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

167 
val extend = I; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

168 
fun merge _ 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

169 
({to_set_simps = to_set_simps1, to_pred_simps = to_pred_simps1, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

170 
set_arities = set_arities1, pred_arities = pred_arities1}, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

171 
{to_set_simps = to_set_simps2, to_pred_simps = to_pred_simps2, 
29288  172 
set_arities = set_arities2, pred_arities = pred_arities2}) : T = 
24039
273698405054
renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents:
23849
diff
changeset

173 
{to_set_simps = Thm.merge_thms (to_set_simps1, to_set_simps2), 
273698405054
renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents:
23849
diff
changeset

174 
to_pred_simps = Thm.merge_thms (to_pred_simps1, to_pred_simps2), 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

175 
set_arities = Symtab.merge_list op = (set_arities1, set_arities2), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

176 
pred_arities = Symtab.merge_list op = (pred_arities1, pred_arities2)}; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

177 
); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

178 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

179 
fun name_type_of (Free p) = SOME p 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

180 
 name_type_of (Const p) = SOME p 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

181 
 name_type_of _ = NONE; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

182 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

183 
fun map_type f (Free (s, T)) = Free (s, f T) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

184 
 map_type f (Var (ixn, T)) = Var (ixn, f T) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

185 
 map_type f _ = error "map_type"; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

186 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

187 
fun find_most_specific is_inst f eq xs T = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

188 
find_first (fn U => is_inst (T, f U) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

189 
andalso forall (fn U' => eq (f U, f U') orelse not 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

190 
(is_inst (T, f U') andalso is_inst (f U', f U))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

191 
xs) xs; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

192 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

193 
fun lookup_arity thy arities (s, T) = case Symtab.lookup arities s of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

194 
NONE => NONE 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

195 
 SOME xs => find_most_specific (Sign.typ_instance thy) fst (op =) xs T; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

196 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

197 
fun lookup_rule thy f rules = find_most_specific 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

198 
(swap #> Pattern.matches thy) (f #> fst) (op aconv) rules; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

199 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

200 
fun infer_arities thy arities (optf, t) fs = case strip_comb t of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

201 
(Abs (s, T, u), []) => infer_arities thy arities (NONE, u) fs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

202 
 (Abs _, _) => infer_arities thy arities (NONE, Envir.beta_norm t) fs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

203 
 (u, ts) => (case Option.map (lookup_arity thy arities) (name_type_of u) of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

204 
SOME (SOME (_, (arity, _))) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

205 
(fold (infer_arities thy arities) (arity ~~ List.take (ts, length arity)) fs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

206 
handle Subscript => error "infer_arities: bad term") 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

207 
 _ => fold (infer_arities thy arities) (map (pair NONE) ts) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

208 
(case optf of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

209 
NONE => fs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

210 
 SOME f => AList.update op = (u, the_default f 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

211 
(Option.map (curry op inter f) (AList.lookup op = fs u))) fs)); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

212 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

213 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

214 
(**************************************************************) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

215 
(* derive the to_pred equation from the to_set equation *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

216 
(* *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

217 
(* 1. instantiate each set parameter with {(x, y). p x y} *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

218 
(* 2. apply %P. {(x, y). P x y} to both sides of the equation *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

219 
(* 3. simplify *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

220 
(**************************************************************) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

221 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

222 
fun mk_to_pred_inst thy fs = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

223 
map (fn (x, ps) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

224 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

225 
val U = HOLogic.dest_setT (fastype_of x); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

226 
val x' = map_type (K (HOLogic.prodT_factors' ps U > HOLogic.boolT)) x 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

227 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

228 
(cterm_of thy x, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

229 
cterm_of thy (HOLogic.Collect_const U $ 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

230 
HOLogic.ap_split' ps U HOLogic.boolT x')) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

231 
end) fs; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

232 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

233 
fun mk_to_pred_eq p fs optfs' T thm = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

234 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

235 
val thy = theory_of_thm thm; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

236 
val insts = mk_to_pred_inst thy fs; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

237 
val thm' = Thm.instantiate ([], insts) thm; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

238 
val thm'' = (case optfs' of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

239 
NONE => thm' RS sym 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

240 
 SOME fs' => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

241 
let 
26806  242 
val (_, U) = split_last (binder_types T); 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

243 
val Ts = HOLogic.prodT_factors' fs' U; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

244 
(* FIXME: should cterm_instantiate increment indexes? *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

245 
val arg_cong' = Thm.incr_indexes (Thm.maxidx_of thm + 1) arg_cong; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

246 
val (arg_cong_f, _) = arg_cong' > cprop_of > Drule.strip_imp_concl > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

247 
Thm.dest_comb > snd > Drule.strip_comb > snd > hd > Thm.dest_comb 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

248 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

249 
thm' RS (Drule.cterm_instantiate [(arg_cong_f, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

250 
cterm_of thy (Abs ("P", Ts > HOLogic.boolT, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

251 
HOLogic.Collect_const U $ HOLogic.ap_split' fs' U 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

252 
HOLogic.boolT (Bound 0))))] arg_cong' RS sym) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

253 
end) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

254 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

255 
Simplifier.simplify (HOL_basic_ss addsimps [mem_Collect_eq, split_conv] 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

256 
addsimprocs [collect_mem_simproc]) thm'' > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

257 
zero_var_indexes > eta_contract_thm (equal p) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

258 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

259 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

260 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

261 
(**** declare rules for converting predicates to sets ****) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

262 

26047
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

263 
fun add ctxt thm (tab as {to_set_simps, to_pred_simps, set_arities, pred_arities}) = 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

264 
case prop_of thm of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

265 
Const ("Trueprop", _) $ (Const ("op =", Type (_, [T, _])) $ lhs $ rhs) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

266 
(case body_type T of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

267 
Type ("bool", []) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

268 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

269 
val thy = Context.theory_of ctxt; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

270 
fun factors_of t fs = case strip_abs_body t of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

271 
Const ("op :", _) $ u $ S => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

272 
if is_Free S orelse is_Var S then 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

273 
let val ps = HOLogic.prod_factors u 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

274 
in (SOME ps, (S, ps) :: fs) end 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

275 
else (NONE, fs) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

276 
 _ => (NONE, fs); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

277 
val (h, ts) = strip_comb lhs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

278 
val (pfs, fs) = fold_map factors_of ts []; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

279 
val ((h', ts'), fs') = (case rhs of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

280 
Abs _ => (case strip_abs_body rhs of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

281 
Const ("op :", _) $ u $ S => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

282 
(strip_comb S, SOME (HOLogic.prod_factors u)) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

283 
 _ => error "member symbol on righthand side expected") 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

284 
 _ => (strip_comb rhs, NONE)) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

285 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

286 
case (name_type_of h, name_type_of h') of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

287 
(SOME (s, T), SOME (s', T')) => 
26047
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

288 
if exists (fn (U, _) => 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

289 
Sign.typ_instance thy (T', U) andalso 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

290 
Sign.typ_instance thy (U, T')) 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

291 
(Symtab.lookup_list set_arities s') 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

292 
then 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

293 
(warning ("Ignoring conversion rule for operator " ^ s'); tab) 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

294 
else 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

295 
{to_set_simps = thm :: to_set_simps, 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

296 
to_pred_simps = 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

297 
mk_to_pred_eq h fs fs' T' thm :: to_pred_simps, 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

298 
set_arities = Symtab.insert_list op = (s', 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

299 
(T', (map (AList.lookup op = fs) ts', fs'))) set_arities, 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

300 
pred_arities = Symtab.insert_list op = (s, 
d27b89c95b29
Instead of raising an exception, pred_set_conv now ignores conversion
berghofe
parents:
25978
diff
changeset

301 
(T, (pfs, fs'))) pred_arities} 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

302 
 _ => error "set / predicate constant expected" 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

303 
end 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

304 
 _ => error "equation between predicates expected") 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

305 
 _ => error "equation expected"; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

306 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

307 
val pred_set_conv_att = Thm.declaration_attribute 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

308 
(fn thm => fn ctxt => PredSetConvData.map (add ctxt thm) ctxt); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

309 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

310 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

311 
(**** convert theorem in set notation to predicate notation ****) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

312 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

313 
fun is_pred tab t = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

314 
case Option.map (Symtab.lookup tab o fst) (name_type_of t) of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

315 
SOME (SOME _) => true  _ => false; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

316 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

317 
fun to_pred_simproc rules = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

318 
let val rules' = map mk_meta_eq rules 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

319 
in 
29064  320 
Simplifier.simproc_i @{theory HOL} "to_pred" [anyt] 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

321 
(fn thy => K (lookup_rule thy (prop_of #> Logic.dest_equals) rules')) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

322 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

323 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

324 
fun to_pred_proc thy rules t = case lookup_rule thy I rules t of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

325 
NONE => NONE 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

326 
 SOME (lhs, rhs) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

327 
SOME (Envir.subst_vars 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

328 
(Pattern.match thy (lhs, t) (Vartab.empty, Vartab.empty)) rhs); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

329 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

330 
fun to_pred thms ctxt thm = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

331 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

332 
val thy = Context.theory_of ctxt; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

333 
val {to_pred_simps, set_arities, pred_arities, ...} = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

334 
fold (add ctxt) thms (PredSetConvData.get ctxt); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

335 
val fs = filter (is_Var o fst) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

336 
(infer_arities thy set_arities (NONE, prop_of thm) []); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

337 
(* instantiate each set parameter with {(x, y). p x y} *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

338 
val insts = mk_to_pred_inst thy fs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

339 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

340 
thm > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

341 
Thm.instantiate ([], insts) > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

342 
Simplifier.full_simplify (HOL_basic_ss addsimprocs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

343 
[to_pred_simproc (mem_Collect_eq :: split_conv :: to_pred_simps)]) > 
25416
1d8ebaf5f211
to_pred and to_set now save induction and case rule tags.
berghofe
parents:
25016
diff
changeset

344 
eta_contract_thm (is_pred pred_arities) > 
1d8ebaf5f211
to_pred and to_set now save induction and case rule tags.
berghofe
parents:
25016
diff
changeset

345 
RuleCases.save thm 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

346 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

347 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

348 
val to_pred_att = Thm.rule_attribute o to_pred; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

349 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

350 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

351 
(**** convert theorem in predicate notation to set notation ****) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

352 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

353 
fun to_set thms ctxt thm = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

354 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

355 
val thy = Context.theory_of ctxt; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

356 
val {to_set_simps, pred_arities, ...} = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

357 
fold (add ctxt) thms (PredSetConvData.get ctxt); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

358 
val fs = filter (is_Var o fst) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

359 
(infer_arities thy pred_arities (NONE, prop_of thm) []); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

360 
(* instantiate each predicate parameter with %x y. (x, y) : s *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

361 
val insts = map (fn (x, ps) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

362 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

363 
val Ts = binder_types (fastype_of x); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

364 
val T = HOLogic.mk_tupleT ps Ts; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

365 
val x' = map_type (K (HOLogic.mk_setT T)) x 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

366 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

367 
(cterm_of thy x, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

368 
cterm_of thy (list_abs (map (pair "x") Ts, HOLogic.mk_mem 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

369 
(HOLogic.mk_tuple' ps T (map Bound (length ps downto 0)), x')))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

370 
end) fs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

371 
in 
25416
1d8ebaf5f211
to_pred and to_set now save induction and case rule tags.
berghofe
parents:
25016
diff
changeset

372 
thm > 
1d8ebaf5f211
to_pred and to_set now save induction and case rule tags.
berghofe
parents:
25016
diff
changeset

373 
Thm.instantiate ([], insts) > 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

374 
Simplifier.full_simplify (HOL_basic_ss addsimps to_set_simps 
25487  375 
addsimprocs [strong_ind_simproc pred_arities, collect_mem_simproc]) > 
25416
1d8ebaf5f211
to_pred and to_set now save induction and case rule tags.
berghofe
parents:
25016
diff
changeset

376 
RuleCases.save thm 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

377 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

378 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

379 
val to_set_att = Thm.rule_attribute o to_set; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

380 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

381 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

382 
(**** preprocessor for code generator ****) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

383 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

384 
fun codegen_preproc thy = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

385 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

386 
val {to_pred_simps, set_arities, pred_arities, ...} = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

387 
PredSetConvData.get (Context.Theory thy); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

388 
fun preproc thm = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

389 
if exists_Const (fn (s, _) => case Symtab.lookup set_arities s of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

390 
NONE => false 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

391 
 SOME arities => exists (fn (_, (xs, _)) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

392 
forall is_none xs) arities) (prop_of thm) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

393 
then 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

394 
thm > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

395 
Simplifier.full_simplify (HOL_basic_ss addsimprocs 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

396 
[to_pred_simproc (mem_Collect_eq :: split_conv :: to_pred_simps)]) > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

397 
eta_contract_thm (is_pred pred_arities) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

398 
else thm 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

399 
in map preproc end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

400 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

401 
fun code_ind_att optmod = to_pred_att [] #> InductiveCodegen.add optmod NONE; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

402 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

403 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

404 
(**** definition of inductive sets ****) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

405 

29389  406 
fun add_ind_set_def 
407 
{quiet_mode, verbose, kind, alt_name, coind, no_elim, no_ind, skip_mono, fork_mono} 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24745
diff
changeset

408 
cs intros monos params cnames_syn ctxt = 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

409 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

410 
val thy = ProofContext.theory_of ctxt; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

411 
val {set_arities, pred_arities, to_pred_simps, ...} = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

412 
PredSetConvData.get (Context.Proof ctxt); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

413 
fun infer (Abs (_, _, t)) = infer t 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

414 
 infer (Const ("op :", _) $ t $ u) = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

415 
infer_arities thy set_arities (SOME (HOLogic.prod_factors t), u) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

416 
 infer (t $ u) = infer t #> infer u 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

417 
 infer _ = I; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

418 
val new_arities = filter_out 
26806  419 
(fn (x as Free (_, T), _) => x mem params andalso length (binder_types T) > 1 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

420 
 _ => false) (fold (snd #> infer) intros []); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

421 
val params' = map (fn x => (case AList.lookup op = new_arities x of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

422 
SOME fs => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

423 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

424 
val T = HOLogic.dest_setT (fastype_of x); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

425 
val Ts = HOLogic.prodT_factors' fs T; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

426 
val x' = map_type (K (Ts > HOLogic.boolT)) x 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

427 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

428 
(x, (x', 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

429 
(HOLogic.Collect_const T $ 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

430 
HOLogic.ap_split' fs T HOLogic.boolT x', 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

431 
list_abs (map (pair "x") Ts, HOLogic.mk_mem 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

432 
(HOLogic.mk_tuple' fs T (map Bound (length fs downto 0)), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

433 
x))))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

434 
end 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

435 
 NONE => (x, (x, (x, x))))) params; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

436 
val (params1, (params2, params3)) = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

437 
params' > map snd > split_list > split_list; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

438 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

439 
(* equations for converting sets to predicates *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

440 
val ((cs', cs_info), eqns) = cs > map (fn c as Free (s, T) => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

441 
let 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

442 
val fs = the_default [] (AList.lookup op = new_arities c); 
26806  443 
val (_, U) = split_last (binder_types T); 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

444 
val Ts = HOLogic.prodT_factors' fs U; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

445 
val c' = Free (s ^ "p", 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

446 
map fastype_of params1 @ Ts > HOLogic.boolT) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

447 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

448 
((c', (fs, U, Ts)), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

449 
(list_comb (c, params2), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

450 
HOLogic.Collect_const U $ HOLogic.ap_split' fs U HOLogic.boolT 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

451 
(list_comb (c', params1)))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

452 
end) > split_list >> split_list; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

453 
val eqns' = eqns @ 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

454 
map (prop_of #> HOLogic.dest_Trueprop #> HOLogic.dest_eq) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

455 
(mem_Collect_eq :: split_conv :: to_pred_simps); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

456 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

457 
(* predicate version of the introduction rules *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

458 
val intros' = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

459 
map (fn (name_atts, t) => (name_atts, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

460 
t > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

461 
map_aterms (fn u => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

462 
(case AList.lookup op = params' u of 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

463 
SOME (_, (u', _)) => u' 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

464 
 NONE => u)) > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

465 
Pattern.rewrite_term thy [] [to_pred_proc thy eqns'] > 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

466 
eta_contract (member op = cs' orf is_pred pred_arities))) intros; 
28965  467 
val cnames_syn' = map (fn (b, _) => (Binding.map_base (suffix "p") b, NoSyn)) cnames_syn; 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

468 
val monos' = map (to_pred [] (Context.Proof ctxt)) monos; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

469 
val ({preds, intrs, elims, raw_induct, ...}, ctxt1) = 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
27330
diff
changeset

470 
InductivePackage.add_ind_def 
28965  471 
{quiet_mode = quiet_mode, verbose = verbose, kind = kind, alt_name = Binding.empty, 
29389  472 
coind = coind, no_elim = no_elim, no_ind = no_ind, 
473 
skip_mono = skip_mono, fork_mono = fork_mono} 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24745
diff
changeset

474 
cs' intros' monos' params1 cnames_syn' ctxt; 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

475 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

476 
(* define inductive sets using previously defined predicates *) 
25016  477 
val (defs, ctxt2) = fold_map (LocalTheory.define Thm.internalK) 
28965  478 
(map (fn ((c_syn, (fs, U, _)), p) => (c_syn, (Attrib.empty_binding, 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

479 
fold_rev lambda params (HOLogic.Collect_const U $ 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

480 
HOLogic.ap_split' fs U HOLogic.boolT (list_comb (p, params3)))))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

481 
(cnames_syn ~~ cs_info ~~ preds)) ctxt1; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

482 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

483 
(* prove theorems for converting predicate to set notation *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

484 
val ctxt3 = fold 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

485 
(fn (((p, c as Free (s, _)), (fs, U, Ts)), (_, (_, def))) => fn ctxt => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

486 
let val conv_thm = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

487 
Goal.prove ctxt (map (fst o dest_Free) params) [] 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

488 
(HOLogic.mk_Trueprop (HOLogic.mk_eq 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

489 
(list_comb (p, params3), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

490 
list_abs (map (pair "x") Ts, HOLogic.mk_mem 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

491 
(HOLogic.mk_tuple' fs U (map Bound (length fs downto 0)), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

492 
list_comb (c, params)))))) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

493 
(K (REPEAT (rtac ext 1) THEN simp_tac (HOL_basic_ss addsimps 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

494 
[def, mem_Collect_eq, split_conv]) 1)) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

495 
in 
28965  496 
ctxt > LocalTheory.note kind ((Binding.name (s ^ "p_" ^ s ^ "_eq"), 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

497 
[Attrib.internal (K pred_set_conv_att)]), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

498 
[conv_thm]) > snd 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

499 
end) (preds ~~ cs ~~ cs_info ~~ defs) ctxt2; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

500 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

501 
(* convert theorems to set notation *) 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
27330
diff
changeset

502 
val rec_name = 
28965  503 
if Binding.is_empty alt_name then 
29006  504 
Binding.name (space_implode "_" (map (Binding.base_name o fst) cnames_syn)) 
28083
103d9282a946
explicit type Name.binding for higherspecification elements;
wenzelm
parents:
27330
diff
changeset

505 
else alt_name; 
30089
f631fb528277
Use LocalTheory.full_name instead of Sign.full_name, because the latter does
berghofe
parents:
29581
diff
changeset

506 
val cnames = map (LocalTheory.full_name ctxt3 o #1) cnames_syn; (* FIXME *) 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

507 
val (intr_names, intr_atts) = split_list (map fst intros); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

508 
val raw_induct' = to_set [] (Context.Proof ctxt3) raw_induct; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

509 
val (intrs', elims', induct, ctxt4) = 
26128  510 
InductivePackage.declare_rules kind rec_name coind no_ind cnames 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

511 
(map (to_set [] (Context.Proof ctxt3)) intrs) intr_names intr_atts 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

512 
(map (fn th => (to_set [] (Context.Proof ctxt3) th, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

513 
map fst (fst (RuleCases.get th)))) elims) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

514 
raw_induct' ctxt3 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

515 
in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

516 
({intrs = intrs', elims = elims', induct = induct, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

517 
raw_induct = raw_induct', preds = map fst defs}, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

518 
ctxt4) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

519 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

520 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

521 
val add_inductive_i = InductivePackage.gen_add_inductive_i add_ind_set_def; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

522 
val add_inductive = InductivePackage.gen_add_inductive add_ind_set_def; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

523 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

524 
val mono_add_att = to_pred_att [] #> InductivePackage.mono_add; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

525 
val mono_del_att = to_pred_att [] #> InductivePackage.mono_del; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

526 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

527 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

528 
(** package setup **) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

529 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

530 
(* setup theory *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

531 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

532 
val setup = 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

533 
Attrib.add_attributes 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

534 
[("pred_set_conv", Attrib.no_args pred_set_conv_att, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

535 
"declare rules for converting between predicate and set notation"), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

536 
("to_set", Attrib.syntax (Attrib.thms >> to_set_att), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

537 
"convert rule to set notation"), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

538 
("to_pred", Attrib.syntax (Attrib.thms >> to_pred_att), 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

539 
"convert rule to predicate notation")] #> 
24219  540 
Code.add_attribute ("ind_set", 
541 
Scan.option (Args.$$$ "target"  Args.colon  Args.name) >> code_ind_att) #> 

23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

542 
Codegen.add_preprocessor codegen_preproc #> 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

543 
Attrib.add_attributes [("mono_set", Attrib.add_del_args mono_add_att mono_del_att, 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

544 
"declaration of monotonicity rule for set operators")] #> 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

545 
Context.theory_map (Simplifier.map_ss (fn ss => 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

546 
ss addsimprocs [collect_mem_simproc])); 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

547 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

548 
(* outer syntax *) 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

549 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

550 
local structure P = OuterParse and K = OuterKeyword in 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

551 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

552 
val ind_set_decl = InductivePackage.gen_ind_decl add_ind_set_def; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

553 

24867  554 
val _ = 
29389  555 
OuterSyntax.local_theory' "inductive_set" "define inductive sets" K.thy_decl (ind_set_decl false); 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

556 

24867  557 
val _ = 
29389  558 
OuterSyntax.local_theory' "coinductive_set" "define coinductive sets" K.thy_decl (ind_set_decl true); 
23764
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

559 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

560 
end; 
15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

561 

15f81c5d5330
New wrapper for defining inductive sets with new inductive
berghofe
parents:
diff
changeset

562 
end; 