equal
deleted
inserted
replaced
1309 |> sort (fast_string_ord o pairself fst) |
1309 |> sort (fast_string_ord o pairself fst) |
1310 |> Ord_List.inter (fast_string_ord o apsnd fst) def_names |
1310 |> Ord_List.inter (fast_string_ord o apsnd fst) def_names |
1311 |> map snd |
1311 |> map snd |
1312 end |
1312 end |
1313 |
1313 |
1314 (* Ideally we would check against "Complex_Main", not "Refute", but any theory |
1314 (* Ideally we would check against "Complex_Main", not "Hilbert_Choice", but any |
1315 will do as long as it contains all the "axioms" and "axiomatization" |
1315 theory will do as long as it contains all the "axioms" and "axiomatization" |
1316 commands. *) |
1316 commands. *) |
1317 fun is_built_in_theory thy = Theory.subthy (thy, @{theory Refute}) |
1317 fun is_built_in_theory thy = Theory.subthy (thy, @{theory Hilbert_Choice}) |
1318 |
1318 |
1319 fun all_nondefs_of ctxt subst = |
1319 fun all_nondefs_of ctxt subst = |
1320 ctxt |> Spec_Rules.get |
1320 ctxt |> Spec_Rules.get |
1321 |> filter (curry (op =) Spec_Rules.Unknown o fst) |
1321 |> filter (curry (op =) Spec_Rules.Unknown o fst) |
1322 |> maps (snd o snd) |
1322 |> maps (snd o snd) |