Prove.thy
author Cezary Kaliszyk <kaliszyk@in.tum.de>
Tue, 24 Nov 2009 08:36:28 +0100
changeset 356 51aafebf4d06
parent 319 0ae9d9e66cb7
child 549 f178958d3d81
permissions -rw-r--r--
Another theorem for which the new regularize differs from old one, so the goal is not proved. But it seems, that the new one is better.

theory Prove
imports Main 
begin

ML {*
val r = Unsynchronized.ref (NONE:(unit -> term) option)
*}

ML {*
let
  fun after_qed thm_name thms lthy =
       Local_Theory.note (thm_name, (flat thms)) lthy |> snd
    
  fun setup_proof (name_spec, (txt, pos)) lthy =
  let
    val trm = ML_Context.evaluate lthy true ("r", r) txt
  in
    Proof.theorem_i NONE (after_qed name_spec) [[(trm,[])]] lthy
  end

  val parser = SpecParse.opt_thm_name ":" -- OuterParse.ML_source
in
  OuterSyntax.local_theory_to_proof "prove" "proving a proposition" 
    OuterKeyword.thy_goal (parser >> setup_proof)
end
*}

end