src/HOL/Library/Reflection.thy

reduce AFP test by many hours;

(*  Title:      HOL/Library/Reflection.thy
    Author:     Amine Chaieb, TU Muenchen
*)

header {* Generic reflection and reification *}

theory Reflection
imports Main
uses "reify_data.ML" ("reflection.ML")
begin

setup {* Reify_Data.setup *}

lemma ext2: "(\<forall>x. f x = g x) \<Longrightarrow> f = g"
  by blast

use "reflection.ML"

method_setup reify = {*
  Attrib.thms --
    Scan.option (Scan.lift (Args.$$$ "(") |-- Args.term --| Scan.lift (Args.$$$ ")")) >>
  (fn (eqs, to) => fn ctxt => SIMPLE_METHOD' (Reflection.genreify_tac ctxt (eqs @ (fst (Reify_Data.get ctxt))) to))
*} "partial automatic reification"

method_setup reflection = {*
let
  fun keyword k = Scan.lift (Args.$$$ k -- Args.colon) >> K ();
  val onlyN = "only";
  val rulesN = "rules";
  val any_keyword = keyword onlyN || keyword rulesN;
  val thms = Scan.repeat (Scan.unless any_keyword Attrib.multi_thm) >> flat;
  val terms = thms >> map (term_of o Drule.dest_term);
in
  thms --
  Scan.optional (keyword rulesN |-- thms) [] --
  Scan.option (keyword onlyN |-- Args.term) >>
  (fn ((eqs,ths),to) => fn ctxt =>
    let
      val (ceqs,cths) = Reify_Data.get ctxt
      val corr_thms = ths@cths
      val raw_eqs = eqs@ceqs
    in SIMPLE_METHOD' (Reflection.reflection_tac ctxt corr_thms raw_eqs to) end)
end
*}

end