author | wenzelm |
Thu, 18 Aug 2005 12:07:33 +0200 | |
changeset 17118 | 1ff59b7b35b7 |
parent 17106 | 2bd6c20cdda1 |
child 17205 | 8994750ae33c |
permissions | -rw-r--r-- |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
1 |
(* Title: Pure/Isar/find_theorems.ML |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
2 |
ID: $Id$ |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
3 |
Author: Rafal Kolanski, NICTA and Tobias Nipkow, TU Muenchen |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
4 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
5 |
Retrieve theorems from proof context. |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
6 |
*) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
7 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
8 |
val thms_containing_limit = ref 40; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
9 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
10 |
signature FIND_THEOREMS = |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
11 |
sig |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
12 |
val find_thms: Proof.context -> FactIndex.spec -> (thmref * thm) list |
16036 | 13 |
datatype 'term criterion = |
16074 | 14 |
Name of string | Intro | Elim | Dest | Simp of 'term | Pattern of 'term |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
15 |
val print_theorems: Proof.context -> term option -> int option -> |
16036 | 16 |
(bool * string criterion) list -> unit |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
17 |
end; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
18 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
19 |
structure FindTheorems: FIND_THEOREMS = |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
20 |
struct |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
21 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
22 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
23 |
(* find_thms *) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
24 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
25 |
fun find_thms ctxt spec = |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
26 |
(PureThy.thms_containing (ProofContext.theory_of ctxt) spec @ |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
27 |
ProofContext.lthms_containing ctxt spec) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
28 |
|> map PureThy.selections |> List.concat; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
29 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
30 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
31 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
32 |
(** search criteria **) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
33 |
|
16036 | 34 |
datatype 'term criterion = |
16074 | 35 |
Name of string | Intro | Elim | Dest | Simp of 'term | Pattern of 'term; |
16036 | 36 |
|
37 |
fun read_criterion _ (Name name) = Name name |
|
38 |
| read_criterion _ Intro = Intro |
|
39 |
| read_criterion _ Elim = Elim |
|
40 |
| read_criterion _ Dest = Dest |
|
16486 | 41 |
| read_criterion ctxt (Simp str) = |
16088 | 42 |
Simp (hd (ProofContext.read_term_pats TypeInfer.logicT ctxt [str])) |
16036 | 43 |
| read_criterion ctxt (Pattern str) = |
44 |
Pattern (hd (ProofContext.read_term_pats TypeInfer.logicT ctxt [str])); |
|
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
45 |
|
16036 | 46 |
fun pretty_criterion ctxt (b, c) = |
47 |
let |
|
48 |
fun prfx s = if b then s else "-" ^ s; |
|
49 |
in |
|
50 |
(case c of |
|
51 |
Name name => Pretty.str (prfx "name: " ^ quote name) |
|
52 |
| Intro => Pretty.str (prfx "intro") |
|
53 |
| Elim => Pretty.str (prfx "elim") |
|
54 |
| Dest => Pretty.str (prfx "dest") |
|
16088 | 55 |
| Simp pat => Pretty.block [Pretty.str (prfx "simp:"), Pretty.brk 1, |
56 |
Pretty.quote (ProofContext.pretty_term ctxt (Term.show_dummy_patterns pat))] |
|
16036 | 57 |
| Pattern pat => Pretty.enclose (prfx " \"") "\"" |
58 |
[ProofContext.pretty_term ctxt (Term.show_dummy_patterns pat)]) |
|
59 |
end; |
|
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
60 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
61 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
62 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
63 |
(** search criterion filters **) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
64 |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
65 |
(*generated filters are to be of the form |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
66 |
input: (PureThy.thmref * Thm.thm) |
17106 | 67 |
output: (p:int, s:int) option, where |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
68 |
NONE indicates no match |
17106 | 69 |
p is the primary sorting criterion |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
70 |
(eg. number of assumptions in the theorem) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
71 |
s is the secondary sorting criterion |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
72 |
(eg. size of the substitution for intro, elim and dest) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
73 |
when applying a set of filters to a thm, fold results in: |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
74 |
(biggest p, sum of all s) |
17106 | 75 |
currently p and s only matter for intro, elim, dest and simp filters, |
76 |
otherwise the default ordering is used. |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
77 |
*) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
78 |
|
16088 | 79 |
|
80 |
(* matching theorems *) |
|
17106 | 81 |
|
82 |
fun is_nontrivial thy = is_Const o head_of o ObjectLogic.drop_judgment thy; |
|
16088 | 83 |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
84 |
(*extract terms from term_src, refine them to the parts that concern us, |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
85 |
if po try match them against obj else vice versa. |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
86 |
trivial matches are ignored. |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
87 |
returns: smallest substitution size*) |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
88 |
fun is_matching_thm (extract_terms, refine_term) ctxt po obj term_src = |
16088 | 89 |
let |
17106 | 90 |
val thy = ProofContext.theory_of ctxt; |
91 |
val tsig = Sign.tsig_of thy; |
|
16088 | 92 |
|
16486 | 93 |
fun matches pat = |
17106 | 94 |
is_nontrivial thy pat andalso |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
95 |
Pattern.matches tsig (if po then (pat,obj) else (obj,pat)); |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
96 |
|
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
97 |
fun substsize pat = |
17106 | 98 |
let |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
99 |
val (_,subst) = Pattern.match tsig (if po then (pat,obj) else (obj,pat)) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
100 |
in Vartab.foldl (op + o apsnd (size_of_term o snd o snd)) (0, subst) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
101 |
end; |
16088 | 102 |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
103 |
fun bestmatch [] = NONE |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
104 |
| bestmatch (x :: xs) = SOME (foldl Int.min x xs); |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
105 |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
106 |
val match_thm = matches o refine_term; |
16486 | 107 |
in |
17106 | 108 |
map (substsize o refine_term) |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
109 |
(List.filter match_thm (extract_terms term_src)) |> bestmatch |
16088 | 110 |
end; |
111 |
||
112 |
||
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
113 |
(* filter_name *) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
114 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
115 |
fun is_substring pat str = |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
116 |
if String.size pat = 0 then true |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
117 |
else if String.size pat > String.size str then false |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
118 |
else if String.substring (str, 0, String.size pat) = pat then true |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
119 |
else is_substring pat (String.extract (str, 1, NONE)); |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
120 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
121 |
(*filter that just looks for a string in the name, |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
122 |
substring match only (no regexps are performed)*) |
17106 | 123 |
fun filter_name str_pat (thmref, _) = |
124 |
if is_substring str_pat (PureThy.name_of_thmref thmref) |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
125 |
then SOME (0,0) else NONE; |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
126 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
127 |
|
16036 | 128 |
(* filter intro/elim/dest rules *) |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
129 |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
130 |
fun filter_dest ctxt goal (_,thm) = |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
131 |
let |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
132 |
val extract_dest = |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
133 |
(fn thm => if Thm.no_prems thm then [] else [prop_of thm], |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
134 |
hd o Logic.strip_imp_prems); |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
135 |
val prems = Logic.prems_of_goal goal 1; |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
136 |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
137 |
fun try_subst prem = is_matching_thm extract_dest ctxt true prem thm; |
17106 | 138 |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
139 |
(*keep successful substitutions*) |
17106 | 140 |
val ss = prems |> List.map try_subst |
141 |
|> List.filter isSome |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
142 |
|> List.map valOf; |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
143 |
in |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
144 |
(*if possible, keep best substitution (one with smallest size)*) |
17106 | 145 |
(*dest rules always have assumptions, so a dest with one |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
146 |
assumption is as good as an intro rule with none*) |
17106 | 147 |
if not (null ss) |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
148 |
then SOME (nprems_of thm - 1, foldl Int.min (hd ss) (tl ss)) else NONE |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
149 |
end; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
150 |
|
16088 | 151 |
fun filter_intro ctxt goal (_,thm) = |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
152 |
let |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
153 |
val extract_intro = (single o prop_of, Logic.strip_imp_concl); |
16036 | 154 |
val concl = Logic.concl_of_goal goal 1; |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
155 |
val ss = is_matching_thm extract_intro ctxt true concl thm; |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
156 |
in |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
157 |
if is_some ss then SOME (nprems_of thm, valOf ss) else NONE |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
158 |
end; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
159 |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
160 |
fun filter_elim ctxt goal (_,thm) = |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
161 |
if not (Thm.no_prems thm) then |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
162 |
let |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
163 |
val rule = prop_of thm; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
164 |
val prems = Logic.prems_of_goal goal 1; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
165 |
val goal_concl = Logic.concl_of_goal goal 1; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
166 |
val rule_mp = (hd o Logic.strip_imp_prems) rule; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
167 |
val rule_concl = Logic.strip_imp_concl rule; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
168 |
fun combine t1 t2 = Const ("combine", dummyT --> dummyT) $ (t1 $ t2); |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
169 |
val rule_tree = combine rule_mp rule_concl; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
170 |
fun goal_tree prem = (combine prem goal_concl); |
17106 | 171 |
fun try_subst prem = |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
172 |
is_matching_thm (single, I) ctxt true (goal_tree prem) rule_tree; |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
173 |
(*keep successful substitutions*) |
17106 | 174 |
val ss = prems |> List.map try_subst |
175 |
|> List.filter isSome |
|
176 |
|> List.map valOf; |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
177 |
in |
17106 | 178 |
(*elim rules always have assumptions, so an elim with one |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
179 |
assumption is as good as an intro rule with none*) |
17106 | 180 |
if is_nontrivial (ProofContext.theory_of ctxt) (Thm.major_prem_of thm) |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
181 |
andalso not (null ss) |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
182 |
then SOME (nprems_of thm - 1, foldl Int.min (hd ss) (tl ss)) else NONE |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
183 |
end |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
184 |
else NONE |
16036 | 185 |
|
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
186 |
|
16074 | 187 |
(* filter_simp *) |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
188 |
|
16088 | 189 |
fun filter_simp ctxt t (_,thm) = |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
190 |
let |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
191 |
val (_, {mk_rews = {mk, ...}, ...}) = |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
192 |
MetaSimplifier.rep_ss (Simplifier.local_simpset_of ctxt); |
17106 | 193 |
val extract_simp = |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
194 |
((List.map prop_of) o mk, #1 o Logic.dest_equals o Logic.strip_imp_concl); |
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
195 |
val ss = is_matching_thm extract_simp ctxt false t thm |
17106 | 196 |
in |
197 |
if is_some ss then SOME (nprems_of thm, valOf ss) else NONE |
|
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
198 |
end; |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
199 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
200 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
201 |
(* filter_pattern *) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
202 |
|
16088 | 203 |
fun filter_pattern ctxt pat (_, thm) = |
17106 | 204 |
let val tsig = Sign.tsig_of (ProofContext.theory_of ctxt) |
205 |
in if Pattern.matches_subterm tsig (pat, Thm.prop_of thm) then SOME (0,0) |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
206 |
else NONE end; |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
207 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
208 |
(* interpret criteria as filters *) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
209 |
|
16036 | 210 |
local |
211 |
||
212 |
fun err_no_goal c = |
|
213 |
error ("Current goal required for " ^ c ^ " search criterion"); |
|
214 |
||
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
215 |
fun filter_crit _ _ (Name name) = filter_name name |
16036 | 216 |
| filter_crit _ NONE Intro = err_no_goal "intro" |
217 |
| filter_crit _ NONE Elim = err_no_goal "elim" |
|
218 |
| filter_crit _ NONE Dest = err_no_goal "dest" |
|
219 |
| filter_crit ctxt (SOME goal) Intro = filter_intro ctxt goal |
|
220 |
| filter_crit ctxt (SOME goal) Elim = filter_elim ctxt goal |
|
221 |
| filter_crit ctxt (SOME goal) Dest = filter_dest ctxt goal |
|
16088 | 222 |
| filter_crit ctxt _ (Simp pat) = filter_simp ctxt pat |
223 |
| filter_crit ctxt _ (Pattern pat) = filter_pattern ctxt pat; |
|
16036 | 224 |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
225 |
fun opt_not x = if isSome x then NONE else SOME (0,0); |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
226 |
|
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
227 |
fun opt_add (SOME (a,x), SOME (b,y)) = SOME ((Int.max (a,b)), (x + y)) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
228 |
| opt_add _ = NONE; |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
229 |
|
16036 | 230 |
in |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
231 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
232 |
fun filter_criterion ctxt opt_goal (b, c) = |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
233 |
(if b then I else opt_not) o filter_crit ctxt opt_goal c; |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
234 |
|
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
235 |
fun all_filters filters thms = |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
236 |
let |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
237 |
fun eval_filters filters thm = |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
238 |
map (fn f => f thm) filters |> List.foldl opt_add (SOME (0,0)); |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
239 |
|
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
240 |
(*filters return: (number of assumptions, substitution size) option, so |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
241 |
sort (desc. in both cases) according to number of assumptions first, |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
242 |
then by the substitution size*) |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
243 |
fun thm_ord (((p0,s0),_),((p1,s1),_)) = |
16964
6a25e42eaff5
Ordering is now: first by number of assumptions, second by the substitution size.
kleing
parents:
16895
diff
changeset
|
244 |
prod_ord int_ord int_ord ((p1,s1),(p0,s0)); |
16895
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
245 |
|
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
246 |
val processed = List.map (fn t => (eval_filters filters t, t)) thms; |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
247 |
val filtered = List.filter (isSome o #1) processed; |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
248 |
in |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
249 |
filtered |> List.map (apfst valOf) |> sort thm_ord |> map #2 |
df67fc190e06
Sort search results in order of relevance, where relevance =
kleing
parents:
16486
diff
changeset
|
250 |
end; |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
251 |
|
16036 | 252 |
end; |
253 |
||
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
254 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
255 |
(* print_theorems *) |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
256 |
|
16036 | 257 |
fun print_theorems ctxt opt_goal opt_limit raw_criteria = |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
258 |
let |
16036 | 259 |
val criteria = map (apsnd (read_criterion ctxt)) raw_criteria; |
260 |
val filters = map (filter_criterion ctxt opt_goal) criteria; |
|
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
261 |
|
16036 | 262 |
val matches = all_filters filters (find_thms ctxt ([], [])); |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
263 |
val len = length matches; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
264 |
val limit = if_none opt_limit (! thms_containing_limit); |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
265 |
|
16036 | 266 |
fun prt_fact (thmref, thm) = |
267 |
ProofContext.pretty_fact ctxt (PureThy.string_of_thmref thmref, [thm]); |
|
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
268 |
in |
16036 | 269 |
Pretty.big_list "searched for:" (map (pretty_criterion ctxt) criteria) :: Pretty.str "" :: |
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
270 |
(if null matches then [Pretty.str "nothing found"] |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
271 |
else |
16036 | 272 |
[Pretty.str ("found " ^ string_of_int len ^ " theorems" ^ |
273 |
(if len <= limit then "" else " (" ^ string_of_int limit ^ " displayed)") ^ ":"), |
|
274 |
Pretty.str ""] @ |
|
275 |
map prt_fact (Library.drop (len - limit, matches))) |
|
16033
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
276 |
|> Pretty.chunks |> Pretty.writeln |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
277 |
end; |
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
278 |
|
f93ca3d4ffa7
Retrieve theorems from proof context -- improved version of
wenzelm
parents:
diff
changeset
|
279 |
end; |