added ident_with;

fold ProofContext.declare_term;

added 'print_simpset'; tuned 'thms_containing'; removed 'print_intros';

added print_simpset; renamed print_thms_containing to find_theorems; removed print_intros (superceded by find_theorems intro);

added find_theorems.ML, ../simplifier.ML;

tuned terms_of_tpairs;

added string_of_thmref, selections, fact_index_of, valid_thms; moved find_matching_thms, is_matching_thm, find_intros/intros_goal/elims to Isar/find_theorems.ML; tuned

FindTheorems.print_theorems;

findI/Es/E: adapted to FindTheorems.find_XXX, results use thmref instead of string;

major tuning;

Simplifier already setup in Pure;

tuned antiquotations;

tuned thms_containing;

tuned;

moved to Pure;

moved here from Provers; removed find_rewrites (superceded by find_theorems rewrite); outer syntax moved to Pure/Isar/isar_syn.ML;

removed find_rewrites (superceded by improved thms_containing);

bug fixes for clause form transformation

converted some problems to Isar format

subst again

Skolemization of simprules and classical rules

pcpo instance for type unit

lucas - bugfix to subst in assumptions: fixed index error for conditional rules.

shortened proof of adm_disj

cleaned up and shortened some proofs

lucas - fixed subst in assumptions to count redexes from left to right.

removed update_node, which is just an instance of map_node; tuned;

tuned;

updated;

searching for combination of criteria (intro, elim, dest, name, pattern)

made para on searching more readable

new cnf function taking Skolemization theorems as an extra argument