author | wenzelm |
Tue, 20 Aug 2019 19:49:49 +0200 | |
changeset 70596 | 3a7117c33742 |
parent 70595 | 2ae7e33c950f |
child 70602 | b85a12c2e2bf |
permissions | -rw-r--r-- |
70556 | 1 |
(* Title: Pure/Thy/thm_deps.ML |
7765
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
2 |
Author: Stefan Berghofer, TU Muenchen |
70556 | 3 |
Author: Makarius |
7765
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
4 |
|
70556 | 5 |
Dependencies of theorems wrt. internal derivation. |
7765
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
6 |
*) |
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
7 |
|
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
8 |
signature THM_DEPS = |
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
9 |
sig |
70557 | 10 |
val all_oracles: thm list -> Proofterm.oracle list |
70566
fb3d06d7dd05
more thorough check, using full dependency graph of finished proofs;
wenzelm
parents:
70560
diff
changeset
|
11 |
val has_skip_proof: thm list -> bool |
70560 | 12 |
val pretty_thm_oracles: Proof.context -> thm list -> Pretty.T |
70595
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
13 |
val thm_deps: theory -> thm -> (Proofterm.thm_id * Thm_Name.T) list |
70570 | 14 |
val thm_deps_cmd: theory -> thm list -> unit |
15 |
val unused_thms_cmd: theory list * theory list -> (string * thm) list |
|
7765
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
16 |
end; |
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
17 |
|
33391 | 18 |
structure Thm_Deps: THM_DEPS = |
7765
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
19 |
struct |
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
20 |
|
70557 | 21 |
(* oracles *) |
22 |
||
23 |
fun all_oracles thms = |
|
70588 | 24 |
let |
25 |
fun collect (PBody {oracles, thms, ...}) = |
|
26 |
(if null oracles then I else apfst (cons oracles)) #> |
|
27 |
(tap Proofterm.join_thms thms |> fold (fn (i, thm_node) => fn (res, seen) => |
|
28 |
if Inttab.defined seen i then (res, seen) |
|
29 |
else |
|
30 |
let val body = Future.join (Proofterm.thm_node_body thm_node) |
|
31 |
in collect body (res, Inttab.update (i, ()) seen) end)); |
|
32 |
val bodies = map Thm.proof_body_of thms; |
|
33 |
in fold collect bodies ([], Inttab.empty) |> #1 |> Proofterm.unions_oracles end; |
|
70557 | 34 |
|
70566
fb3d06d7dd05
more thorough check, using full dependency graph of finished proofs;
wenzelm
parents:
70560
diff
changeset
|
35 |
fun has_skip_proof thms = |
fb3d06d7dd05
more thorough check, using full dependency graph of finished proofs;
wenzelm
parents:
70560
diff
changeset
|
36 |
all_oracles thms |> exists (fn (name, _) => name = \<^oracle_name>\<open>skip_proof\<close>); |
fb3d06d7dd05
more thorough check, using full dependency graph of finished proofs;
wenzelm
parents:
70560
diff
changeset
|
37 |
|
70560 | 38 |
fun pretty_thm_oracles ctxt thms = |
39 |
let |
|
70567 | 40 |
val thy = Proof_Context.theory_of ctxt; |
70560 | 41 |
fun prt_oracle (name, NONE) = [Thm.pretty_oracle ctxt name] |
42 |
| prt_oracle (name, SOME prop) = |
|
70567 | 43 |
[Thm.pretty_oracle ctxt name, Pretty.str ":", Pretty.brk 1, |
44 |
Syntax.pretty_term_global thy prop]; |
|
70560 | 45 |
in Pretty.big_list "oracles:" (map (Pretty.item o prt_oracle) (all_oracles thms)) end; |
46 |
||
70557 | 47 |
|
70595
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
48 |
(* thm_deps *) |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
49 |
|
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
50 |
fun thm_deps thy = |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
51 |
let |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
52 |
val lookup = Global_Theory.lookup_thm_id thy; |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
53 |
fun deps (i, thm_node) res = |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
54 |
if Inttab.defined res i then res |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
55 |
else |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
56 |
let val thm_id = Proofterm.thm_id (i, thm_node) in |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
57 |
(case lookup thm_id of |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
58 |
SOME thm_name => Inttab.update (i, (thm_id, thm_name)) res |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
59 |
| NONE => fold deps (Proofterm.thm_node_thms thm_node) res) |
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
60 |
end; |
70596 | 61 |
in |
62 |
fn thm => |
|
63 |
fold deps (Thm.thm_deps (Thm.transfer thy thm)) Inttab.empty |
|
64 |
|> Inttab.dest |> map #2 |
|
65 |
end; |
|
70595
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
66 |
|
2ae7e33c950f
clarified thm_id vs. thm_node/thm: retain theory_name;
wenzelm
parents:
70588
diff
changeset
|
67 |
|
70570 | 68 |
(* thm_deps_cmd *) |
26697 | 69 |
|
70570 | 70 |
fun thm_deps_cmd thy thms = |
28810 | 71 |
let |
60084
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
72 |
fun make_node name directory = |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
73 |
Graph_Display.session_node |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
74 |
{name = Long_Name.base_name name, directory = directory, unfold = false, path = ""}; |
64572 | 75 |
fun add_dep {name = "", ...} = I |
76 |
| add_dep {name = name, body = PBody {thms = thms', ...}, ...} = |
|
28826
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
77 |
let |
41489
8e2b8649507d
standardized split_last/last_elem towards List.last;
wenzelm
parents:
39557
diff
changeset
|
78 |
val prefix = #1 (split_last (Long_Name.explode name)); |
28826
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
79 |
val session = |
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
80 |
(case prefix of |
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
81 |
a :: _ => |
68482 | 82 |
(case try (Context.get_theory {long = false} thy) a of |
28826
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
83 |
SOME thy => |
66037 | 84 |
(case Present.theory_qualifier thy of |
28826
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
85 |
"" => [] |
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
86 |
| session => [session]) |
3b460b6eadae
simplified thm_deps -- no need to build a graph datastructure;
wenzelm
parents:
28817
diff
changeset
|
87 |
| NONE => []) |
60084
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
88 |
| _ => ["global"]); |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
89 |
val node = make_node name (space_implode "/" (session @ prefix)); |
64573 | 90 |
val deps = filter_out (fn s => s = "") (map (Proofterm.thm_node_name o #2) thms'); |
60084
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
91 |
in Symtab.update (name, (node, deps)) end; |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
92 |
val entries0 = Proofterm.fold_body_thms add_dep (Thm.proof_bodies_of thms) Symtab.empty; |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
93 |
val entries1 = |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
94 |
Symtab.fold (fn (_, (_, deps)) => deps |> fold (fn d => fn tab => |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
95 |
if Symtab.defined tab d then tab |
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
96 |
else Symtab.update (d, (make_node d "", [])) tab)) entries0 entries0; |
59210
8658b4290aed
clarified Graph_Display.graph etc.: sort_graph determines order from structure (and names);
wenzelm
parents:
59208
diff
changeset
|
97 |
in |
60084
2a066431a814
ensure that deps are defined in entries, to prevent crash of Graph_View.build_graph;
wenzelm
parents:
59936
diff
changeset
|
98 |
Symtab.fold (fn (name, (node, deps)) => cons ((name, node), deps)) entries1 [] |
60089
8bd5999133d4
let the system choose Graph_Display.display_graph_old: thm_deps needs tree hierarchy, code_deps needs cycles (!?);
wenzelm
parents:
60084
diff
changeset
|
99 |
|> Graph_Display.display_graph_old |
59210
8658b4290aed
clarified Graph_Display.graph etc.: sort_graph determines order from structure (and names);
wenzelm
parents:
59208
diff
changeset
|
100 |
end; |
26697 | 101 |
|
102 |
||
70570 | 103 |
(* unused_thms_cmd *) |
26697 | 104 |
|
70570 | 105 |
fun unused_thms_cmd (base_thys, thys) = |
26185 | 106 |
let |
61507 | 107 |
fun add_fact transfer space (name, ths) = |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
37870
diff
changeset
|
108 |
if exists (fn thy => Global_Theory.defined_fact thy name) base_thys then I |
33170 | 109 |
else |
110 |
let val {concealed, group, ...} = Name_Space.the_entry space name in |
|
111 |
fold_rev (fn th => |
|
36744
6e1f3d609a68
renamed Thm.get_name -> Thm.derivation_name and Thm.put_name -> Thm.name_derivation, to emphasize the true nature of these operations;
wenzelm
parents:
33769
diff
changeset
|
112 |
(case Thm.derivation_name th of |
33170 | 113 |
"" => I |
61507 | 114 |
| a => cons (a, (transfer th, concealed, group)))) ths |
33170 | 115 |
end; |
61507 | 116 |
fun add_facts thy = |
117 |
let |
|
118 |
val transfer = Global_Theory.transfer_theories thy; |
|
119 |
val facts = Global_Theory.facts_of thy; |
|
120 |
in Facts.fold_static (add_fact transfer (Facts.space_of facts)) facts end; |
|
33170 | 121 |
|
33769
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
122 |
val new_thms = |
61507 | 123 |
fold add_facts thys [] |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58893
diff
changeset
|
124 |
|> sort_distinct (string_ord o apply2 #1); |
28810 | 125 |
|
33769
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
126 |
val used = |
32810
f3466a5645fa
back to simple fold_body_thms and fulfill_proof/thm_proof (reverting a900d3cd47cc) -- the cycle check is implicit in the future computation of join_proofs;
wenzelm
parents:
32726
diff
changeset
|
127 |
Proofterm.fold_body_thms |
64572 | 128 |
(fn {name = a, ...} => a <> "" ? Symtab.update (a, ())) |
44333
cc53ce50f738
reverted to join_bodies/join_proofs based on fold_body_thms to regain performance (escpecially of HOL-Proofs) -- see also aa9c1e9ef2ce and 4e2abb045eac;
wenzelm
parents:
44331
diff
changeset
|
129 |
(map Proofterm.strip_thm (Thm.proof_bodies_of (map (#1 o #2) new_thms))) |
44331 | 130 |
Symtab.empty; |
33170 | 131 |
|
41565
9718c32f9c4e
unused_thms no longer compares propositions, since this is no longer needed
berghofe
parents:
41489
diff
changeset
|
132 |
fun is_unused a = not (Symtab.defined used a); |
28810 | 133 |
|
57934
5e500c0e7eca
tuned signature -- prefer self-contained user-space tool;
wenzelm
parents:
49561
diff
changeset
|
134 |
(*groups containing at least one used theorem*) |
41565
9718c32f9c4e
unused_thms no longer compares propositions, since this is no longer needed
berghofe
parents:
41489
diff
changeset
|
135 |
val used_groups = fold (fn (a, (_, _, group)) => |
9718c32f9c4e
unused_thms no longer compares propositions, since this is no longer needed
berghofe
parents:
41489
diff
changeset
|
136 |
if is_unused a then I |
33170 | 137 |
else |
138 |
(case group of |
|
139 |
NONE => I |
|
33769
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
140 |
| SOME grp => Inttab.update (grp, ()))) new_thms Inttab.empty; |
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
141 |
|
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
142 |
val (thms', _) = fold (fn (a, (th, concealed, group)) => fn q as (thms, seen_groups) => |
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
143 |
if not concealed andalso |
42473 | 144 |
(* FIXME replace by robust treatment of thm groups *) |
61336 | 145 |
Thm.legacy_get_kind th = Thm.theoremK andalso is_unused a |
33769
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
146 |
then |
33170 | 147 |
(case group of |
33769
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
148 |
NONE => ((a, th) :: thms, seen_groups) |
26185 | 149 |
| SOME grp => |
33769
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
150 |
if Inttab.defined used_groups grp orelse |
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
151 |
Inttab.defined seen_groups grp then q |
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
152 |
else ((a, th) :: thms, Inttab.update (grp, ()) seen_groups)) |
6d8630fab26a
unused_thms: show only results from 'theorem(s)' package (via old-style kinds);
wenzelm
parents:
33642
diff
changeset
|
153 |
else q) new_thms ([], Inttab.empty); |
26185 | 154 |
in rev thms' end; |
155 |
||
7765
fa28bac7903c
New function thm_deps for visualizing dependencies of theorems.
berghofe
parents:
diff
changeset
|
156 |
end; |