src/HOL/Import/proof_kernel.ML
author wenzelm
Fri Jul 24 21:02:34 2009 +0200 (2009-07-24)
changeset 32174 9036cc8ae775
parent 32091 30e2ffbba718
child 32180 37800cb1d378
permissions -rw-r--r--
explicit OldGoals;
     1 (*  Title:      HOL/Import/proof_kernel.ML
     2     Author:     Sebastian Skalberg and Steven Obua, TU Muenchen
     3 *)
     4 
     5 signature ProofKernel =
     6 sig
     7     type hol_type
     8     type tag
     9     type term
    10     type thm
    11     type ('a,'b) subst
    12 
    13     type proof_info
    14     datatype proof = Proof of proof_info * proof_content
    15          and proof_content
    16            = PRefl of term
    17            | PInstT of proof * (hol_type,hol_type) subst
    18            | PSubst of proof list * term * proof
    19            | PAbs of proof * term
    20            | PDisch of proof * term
    21            | PMp of proof * proof
    22            | PHyp of term
    23            | PAxm of string * term
    24            | PDef of string * string * term
    25            | PTmSpec of string * string list * proof
    26            | PTyDef of string * string * proof
    27            | PTyIntro of string * string * string * string * term * term * proof
    28            | POracle of tag * term list * term
    29            | PDisk
    30            | PSpec of proof * term
    31            | PInst of proof * (term,term) subst
    32            | PGen of proof * term
    33            | PGenAbs of proof * term option * term list
    34            | PImpAS of proof * proof
    35            | PSym of proof
    36            | PTrans of proof * proof
    37            | PComb of proof * proof
    38            | PEqMp of proof * proof
    39            | PEqImp of proof
    40            | PExists of proof * term * term
    41            | PChoose of term * proof * proof
    42            | PConj of proof * proof
    43            | PConjunct1 of proof
    44            | PConjunct2 of proof
    45            | PDisj1 of proof * term
    46            | PDisj2 of proof * term
    47            | PDisjCases of proof * proof * proof
    48            | PNotI of proof
    49            | PNotE of proof
    50            | PContr of proof * term
    51 
    52     exception PK of string * string
    53 
    54     val get_proof_dir: string -> theory -> string option
    55     val disambiguate_frees : Thm.thm -> Thm.thm
    56     val debug : bool ref
    57     val disk_info_of : proof -> (string * string) option
    58     val set_disk_info_of : proof -> string -> string -> unit
    59     val mk_proof : proof_content -> proof
    60     val content_of : proof -> proof_content
    61     val import_proof : string -> string -> theory -> (theory -> term) option * (theory -> proof)
    62 
    63     val rewrite_hol4_term: Term.term -> theory -> Thm.thm
    64 
    65     val type_of : term -> hol_type
    66 
    67     val get_thm  : string -> string         -> theory -> (theory * thm option)
    68     val get_def  : string -> string -> term -> theory -> (theory * thm option)
    69     val get_axiom: string -> string         -> theory -> (theory * thm option)
    70 
    71     val store_thm : string -> string -> thm -> theory -> theory * thm
    72 
    73     val to_isa_thm : thm -> (term * term) list * Thm.thm
    74     val to_isa_term: term -> Term.term
    75     val to_hol_thm : Thm.thm -> thm
    76 
    77     val REFL : term -> theory -> theory * thm
    78     val ASSUME : term -> theory -> theory * thm
    79     val INST_TYPE : (hol_type,hol_type) subst -> thm -> theory -> theory * thm
    80     val INST : (term,term)subst -> thm -> theory -> theory * thm
    81     val EQ_MP : thm -> thm -> theory -> theory * thm
    82     val EQ_IMP_RULE : thm -> theory -> theory * thm
    83     val SUBST : thm list -> term -> thm -> theory -> theory * thm
    84     val DISJ_CASES : thm -> thm -> thm -> theory -> theory * thm
    85     val DISJ1: thm -> term -> theory -> theory * thm
    86     val DISJ2: term -> thm -> theory -> theory * thm
    87     val IMP_ANTISYM: thm -> thm -> theory -> theory * thm
    88     val SYM : thm -> theory -> theory * thm
    89     val MP : thm -> thm -> theory -> theory * thm
    90     val GEN : term -> thm -> theory -> theory * thm
    91     val CHOOSE : term -> thm -> thm -> theory -> theory * thm
    92     val EXISTS : term -> term -> thm -> theory -> theory * thm
    93     val ABS : term -> thm -> theory -> theory * thm
    94     val GEN_ABS : term option -> term list -> thm -> theory -> theory * thm
    95     val TRANS : thm -> thm -> theory -> theory * thm
    96     val CCONTR : term -> thm -> theory -> theory * thm
    97     val CONJ : thm -> thm -> theory -> theory * thm
    98     val CONJUNCT1: thm -> theory -> theory * thm
    99     val CONJUNCT2: thm -> theory -> theory * thm
   100     val NOT_INTRO: thm -> theory -> theory * thm
   101     val NOT_ELIM : thm -> theory -> theory * thm
   102     val SPEC : term -> thm -> theory -> theory * thm
   103     val COMB : thm -> thm -> theory -> theory * thm
   104     val DISCH: term -> thm -> theory -> theory * thm
   105 
   106     val type_introduction: string -> string -> string -> string -> string -> term * term -> thm -> theory -> theory * thm
   107 
   108     val new_definition : string -> string -> term -> theory -> theory * thm
   109     val new_specification : string -> string -> string list -> thm -> theory -> theory * thm
   110     val new_type_definition : string -> string -> string -> thm -> theory -> theory * thm
   111     val new_axiom : string -> term -> theory -> theory * thm
   112 
   113     val prin : term -> unit
   114     val protect_factname : string -> string
   115     val replay_protect_varname : string -> string -> unit
   116     val replay_add_dump : string -> theory -> theory
   117 end
   118 
   119 structure ProofKernel :> ProofKernel =
   120 struct
   121 type hol_type = Term.typ
   122 type term = Term.term
   123 datatype tag = Tag of string list
   124 type ('a,'b) subst = ('a * 'b) list
   125 datatype thm = HOLThm of (Term.term * Term.term) list * Thm.thm
   126 
   127 fun hthm2thm (HOLThm (_, th)) = th
   128 
   129 fun to_hol_thm th = HOLThm ([], th)
   130 
   131 val replay_add_dump = add_dump
   132 fun add_dump s thy = (ImportRecorder.add_dump s; replay_add_dump s thy)
   133 
   134 datatype proof_info
   135   = Info of {disk_info: (string * string) option ref}
   136 
   137 datatype proof = Proof of proof_info * proof_content
   138      and proof_content
   139        = PRefl of term
   140        | PInstT of proof * (hol_type,hol_type) subst
   141        | PSubst of proof list * term * proof
   142        | PAbs of proof * term
   143        | PDisch of proof * term
   144        | PMp of proof * proof
   145        | PHyp of term
   146        | PAxm of string * term
   147        | PDef of string * string * term
   148        | PTmSpec of string * string list * proof
   149        | PTyDef of string * string * proof
   150        | PTyIntro of string * string * string * string * term * term * proof
   151        | POracle of tag * term list * term
   152        | PDisk
   153        | PSpec of proof * term
   154        | PInst of proof * (term,term) subst
   155        | PGen of proof * term
   156        | PGenAbs of proof * term option * term list
   157        | PImpAS of proof * proof
   158        | PSym of proof
   159        | PTrans of proof * proof
   160        | PComb of proof * proof
   161        | PEqMp of proof * proof
   162        | PEqImp of proof
   163        | PExists of proof * term * term
   164        | PChoose of term * proof * proof
   165        | PConj of proof * proof
   166        | PConjunct1 of proof
   167        | PConjunct2 of proof
   168        | PDisj1 of proof * term
   169        | PDisj2 of proof * term
   170        | PDisjCases of proof * proof * proof
   171        | PNotI of proof
   172        | PNotE of proof
   173        | PContr of proof * term
   174 
   175 exception PK of string * string
   176 fun ERR f mesg = PK (f,mesg)
   177 
   178 fun print_exn e =
   179     case e of
   180         PK (m,s) => (writeln ("PK (" ^ m ^ "): " ^ s); raise e)
   181       | _ => OldGoals.print_exn e
   182 
   183 (* Compatibility. *)
   184 
   185 val string_of_mixfix = Pretty.string_of o Syntax.pretty_mixfix;
   186 
   187 fun mk_syn thy c =
   188   if Syntax.is_identifier c andalso not (Syntax.is_keyword (Sign.syn_of thy) c) then NoSyn
   189   else Syntax.literal c
   190 
   191 fun quotename c =
   192   if Syntax.is_identifier c andalso not (OuterKeyword.is_keyword c) then c else quote c
   193 
   194 fun simple_smart_string_of_cterm ct =
   195     let
   196         val thy = Thm.theory_of_cterm ct;
   197         val {t,T,...} = rep_cterm ct
   198         (* Hack to avoid parse errors with Trueprop *)
   199         val ct  = (cterm_of thy (HOLogic.dest_Trueprop t)
   200                            handle TERM _ => ct)
   201     in
   202         quote(
   203         PrintMode.setmp [] (
   204         Library.setmp show_brackets false (
   205         Library.setmp show_all_types true (
   206         Library.setmp Syntax.ambiguity_is_error false (
   207         Library.setmp show_sorts true Display.string_of_cterm))))
   208         ct)
   209     end
   210 
   211 exception SMART_STRING
   212 
   213 fun smart_string_of_cterm ct =
   214     let
   215         val thy = Thm.theory_of_cterm ct
   216         val ctxt = ProofContext.init thy
   217         val {t,T,...} = rep_cterm ct
   218         (* Hack to avoid parse errors with Trueprop *)
   219         val ct  = (cterm_of thy (HOLogic.dest_Trueprop t)
   220                    handle TERM _ => ct)
   221         fun match u = t aconv u
   222         fun G 0 = Library.setmp show_types true (Library.setmp show_sorts true)
   223           | G 1 = Library.setmp show_brackets true (G 0)
   224           | G 2 = Library.setmp show_all_types true (G 0)
   225           | G 3 = Library.setmp show_brackets true (G 2)
   226           | G _ = raise SMART_STRING
   227         fun F n =
   228             let
   229                 val str = Library.setmp show_brackets false (G n Display.string_of_cterm) ct
   230                 val u = Syntax.parse_term ctxt str
   231                   |> TypeInfer.constrain T |> Syntax.check_term ctxt
   232             in
   233                 if match u
   234                 then quote str
   235                 else F (n+1)
   236             end
   237             handle ERROR mesg => F (n+1)
   238                  | SMART_STRING => error ("smart_string failed for: "^(G 0 Display.string_of_cterm ct))
   239     in
   240       PrintMode.setmp [] (Library.setmp Syntax.ambiguity_is_error true F) 0
   241     end
   242     handle ERROR mesg => simple_smart_string_of_cterm ct
   243 
   244 val smart_string_of_thm = smart_string_of_cterm o cprop_of
   245 
   246 fun prth th = writeln (PrintMode.setmp [] Display.string_of_thm_without_context th)
   247 fun prc ct = writeln (PrintMode.setmp [] Display.string_of_cterm ct)
   248 fun prin t = writeln (PrintMode.setmp [] (fn () => Syntax.string_of_term_global (OldGoals.the_context ()) t) ());
   249 fun pth (HOLThm(ren,thm)) =
   250     let
   251         (*val _ = writeln "Renaming:"
   252         val _ = app (fn(v,w) => (prin v; writeln " -->"; prin w)) ren*)
   253         val _ = prth thm
   254     in
   255         ()
   256     end
   257 
   258 fun disk_info_of (Proof(Info{disk_info,...},_)) = !disk_info
   259 fun mk_proof p = Proof(Info{disk_info = ref NONE},p)
   260 fun content_of (Proof(_,p)) = p
   261 
   262 fun set_disk_info_of (Proof(Info{disk_info,...},_)) thyname thmname =
   263     disk_info := SOME(thyname,thmname)
   264 
   265 structure Lib =
   266 struct
   267 
   268 fun assoc x =
   269     let
   270         fun F [] = raise PK("Lib.assoc","Not found")
   271           | F ((x',y)::rest) = if x = x'
   272                                then y
   273                                else F rest
   274     in
   275         F
   276     end
   277 fun i mem L =
   278     let fun itr [] = false
   279           | itr (a::rst) = i=a orelse itr rst
   280     in itr L end;
   281 
   282 fun [] union S = S
   283   | S union [] = S
   284   | (a::rst) union S2 = rst union (insert (op =) a S2)
   285 
   286 fun implode_subst [] = []
   287   | implode_subst (x::r::rest) = ((x,r)::(implode_subst rest))
   288   | implode_subst _ = raise ERR "implode_subst" "malformed substitution list"
   289 
   290 end
   291 open Lib
   292 
   293 structure Tag =
   294 struct
   295 val empty_tag = Tag []
   296 fun read name = Tag [name]
   297 fun merge (Tag tag1) (Tag tag2) = Tag (Lib.union(tag1,tag2))
   298 end
   299 
   300 (* Actual code. *)
   301 
   302 fun get_segment thyname l = (Lib.assoc "s" l
   303                              handle PK _ => thyname)
   304 val get_name : (string * string) list -> string = Lib.assoc "n"
   305 
   306 local
   307     open LazyScan
   308     infix 7 |-- --|
   309     infix 5 :-- -- ^^
   310     infix 3 >>
   311     infix 0 ||
   312 in
   313 exception XML of string
   314 
   315 datatype xml = Elem of string * (string * string) list * xml list
   316 datatype XMLtype = XMLty of xml | FullType of hol_type
   317 datatype XMLterm = XMLtm of xml | FullTerm of term
   318 
   319 fun pair x y = (x,y)
   320 
   321 fun scan_id toks =
   322     let
   323         val (x,toks2) = one Char.isAlpha toks
   324         val (xs,toks3) = any Char.isAlphaNum toks2
   325     in
   326         (String.implode (x::xs),toks3)
   327     end
   328 
   329 fun scan_string str c =
   330     let
   331         fun F [] toks = (c,toks)
   332           | F (c::cs) toks =
   333             case LazySeq.getItem toks of
   334                 SOME(c',toks') =>
   335                 if c = c'
   336                 then F cs toks'
   337                 else raise SyntaxError
   338               | NONE => raise SyntaxError
   339     in
   340         F (String.explode str)
   341     end
   342 
   343 local
   344     val scan_entity =
   345         (scan_string "amp;" #"&")
   346             || scan_string "quot;" #"\""
   347             || scan_string "gt;" #">"
   348             || scan_string "lt;" #"<"
   349             || scan_string "apos;" #"'"
   350 in
   351 fun scan_nonquote toks =
   352     case LazySeq.getItem toks of
   353         SOME (c,toks') =>
   354         (case c of
   355              #"\"" => raise SyntaxError
   356            | #"&" => scan_entity toks'
   357            | c => (c,toks'))
   358       | NONE => raise SyntaxError
   359 end
   360 
   361 val scan_string = $$ #"\"" |-- repeat scan_nonquote --| $$ #"\"" >>
   362                      String.implode
   363 
   364 val scan_attribute = scan_id -- $$ #"=" |-- scan_string
   365 
   366 val scan_start_of_tag = $$ #"<" |-- scan_id --
   367                            repeat ($$ #" " |-- scan_attribute)
   368 
   369 (* The evaluation delay introduced through the 'toks' argument is needed
   370 for the sake of the SML/NJ (110.9.1) compiler.  Either that or an explicit
   371 type :-( *)
   372 fun scan_end_of_tag toks = ($$ #"/" |-- $$ #">" |-- succeed []) toks
   373 
   374 val scan_end_tag = $$ #"<" |-- $$ #"/" |-- scan_id --| $$ #">"
   375 
   376 fun scan_children id = $$ #">" |-- repeat scan_tag -- scan_end_tag >>
   377                        (fn (chldr,id') => if id = id'
   378                                           then chldr
   379                                           else raise XML "Tag mismatch")
   380 and scan_tag toks =
   381     let
   382         val ((id,atts),toks2) = scan_start_of_tag toks
   383         val (chldr,toks3) = (scan_children id || scan_end_of_tag) toks2
   384     in
   385         (Elem (id,atts,chldr),toks3)
   386     end
   387 end
   388 
   389 val type_of = Term.type_of
   390 
   391 val boolT = Type("bool",[])
   392 val propT = Type("prop",[])
   393 
   394 fun mk_defeq name rhs thy =
   395     let
   396         val ty = type_of rhs
   397     in
   398         Logic.mk_equals (Const(Sign.intern_const thy name,ty),rhs)
   399     end
   400 
   401 fun mk_teq name rhs thy =
   402     let
   403         val ty = type_of rhs
   404     in
   405         HOLogic.mk_eq (Const(Sign.intern_const thy name,ty),rhs)
   406     end
   407 
   408 fun intern_const_name thyname const thy =
   409     case get_hol4_const_mapping thyname const thy of
   410         SOME (_,cname,_) => cname
   411       | NONE => (case get_hol4_const_renaming thyname const thy of
   412                      SOME cname => Sign.intern_const thy (thyname ^ "." ^ cname)
   413                    | NONE => Sign.intern_const thy (thyname ^ "." ^ const))
   414 
   415 fun intern_type_name thyname const thy =
   416     case get_hol4_type_mapping thyname const thy of
   417         SOME (_,cname) => cname
   418       | NONE => Sign.intern_const thy (thyname ^ "." ^ const)
   419 
   420 fun mk_vartype name = TFree(name,["HOL.type"])
   421 fun mk_thy_type thy Thy Tyop Args = Type(intern_type_name Thy Tyop thy,Args)
   422 
   423 val mk_var = Free
   424 
   425 fun dom_rng (Type("fun",[dom,rng])) = (dom,rng)
   426   | dom_rng _ = raise ERR "dom_rng" "Not a functional type"
   427 
   428 fun mk_thy_const thy Thy Nam Ty = Const(intern_const_name Thy Nam thy,Ty)
   429 
   430 local
   431   fun get_const sg thyname name =
   432     (case Sign.const_type sg name of
   433       SOME ty => Const (name, ty)
   434     | NONE => raise ERR "get_type" (name ^ ": No such constant"))
   435 in
   436 fun prim_mk_const thy Thy Nam =
   437     let
   438       val name = intern_const_name Thy Nam thy
   439       val cmaps = HOL4ConstMaps.get thy
   440     in
   441       case StringPair.lookup cmaps (Thy,Nam) of
   442         SOME(_,_,SOME ty) => Const(name,ty)
   443       | _ => get_const thy Thy name
   444     end
   445 end
   446 
   447 fun mk_comb(f,a) = f $ a
   448 
   449 (* Needed for HOL Light *)
   450 fun protect_tyvarname s =
   451     let
   452         fun no_quest s =
   453             if Char.contains s #"?"
   454             then String.translate (fn #"?" => "q_" | c => Char.toString c) s
   455             else s
   456         fun beg_prime s =
   457             if String.isPrefix "'" s
   458             then s
   459             else "'" ^ s
   460     in
   461         s |> no_quest |> beg_prime
   462     end
   463 
   464 val protected_varnames = ref (Symtab.empty:string Symtab.table)
   465 val invented_isavar = ref 0
   466 
   467 fun innocent_varname s = Syntax.is_identifier s andalso not (String.isPrefix "u_" s)
   468 
   469 val check_name_thy = theory "Main"
   470 
   471 fun valid_boundvarname s =
   472   can (fn () => Syntax.read_term_global check_name_thy ("SOME "^s^". True")) ();
   473 
   474 fun valid_varname s =
   475   can (fn () => Syntax.read_term_global check_name_thy s) ();
   476 
   477 fun protect_varname s =
   478     if innocent_varname s andalso valid_varname s then s else
   479     case Symtab.lookup (!protected_varnames) s of
   480       SOME t => t
   481     | NONE =>
   482       let
   483           val _ = inc invented_isavar
   484           val t = "u_" ^ string_of_int (!invented_isavar)
   485           val _ = ImportRecorder.protect_varname s t
   486           val _ = protected_varnames := Symtab.update (s, t) (!protected_varnames)
   487       in
   488           t
   489       end
   490 
   491 exception REPLAY_PROTECT_VARNAME of string*string*string
   492 
   493 fun replay_protect_varname s t =
   494         case Symtab.lookup (!protected_varnames) s of
   495           SOME t' => raise REPLAY_PROTECT_VARNAME (s, t, t')
   496         | NONE =>
   497           let
   498               val _ = inc invented_isavar
   499               val t = "u_" ^ string_of_int (!invented_isavar)
   500               val _ = protected_varnames := Symtab.update (s, t) (!protected_varnames)
   501           in
   502               ()
   503           end
   504 
   505 fun protect_boundvarname s = if innocent_varname s andalso valid_boundvarname s then s else "u"
   506 
   507 fun mk_lambda (v as Free (x, T)) t = Abs (protect_boundvarname x, T, abstract_over (v, t))
   508   | mk_lambda (v as Var ((x, _), T)) t = Abs (protect_boundvarname x, T, abstract_over (v, t))
   509   | mk_lambda v t = raise TERM ("lambda", [v, t]);
   510 
   511 fun replacestr x y s =
   512 let
   513   val xl = explode x
   514   val yl = explode y
   515   fun isprefix [] ys = true
   516     | isprefix (x::xs) (y::ys) = if x = y then isprefix xs ys else false
   517     | isprefix _ _ = false
   518   fun isp s = isprefix xl s
   519   fun chg s = yl@(List.drop (s, List.length xl))
   520   fun r [] = []
   521     | r (S as (s::ss)) = if isp S then r (chg S) else s::(r ss)
   522 in
   523   implode(r (explode s))
   524 end
   525 
   526 fun protect_factname s = replacestr "." "_dot_" s
   527 fun unprotect_factname s = replacestr "_dot_" "." s
   528 
   529 val ty_num_prefix = "N_"
   530 
   531 fun startsWithDigit s = Char.isDigit (hd (String.explode s))
   532 
   533 fun protect_tyname tyn =
   534   let
   535     val tyn' =
   536       if String.isPrefix ty_num_prefix tyn then raise (ERR "protect_ty_name" ("type name '"^tyn^"' is reserved")) else
   537       (if startsWithDigit tyn then ty_num_prefix^tyn else tyn)
   538   in
   539     tyn'
   540   end
   541 
   542 fun protect_constname tcn = tcn
   543  (* if tcn = ".." then "dotdot"
   544   else if tcn = "==" then "eqeq"
   545   else tcn*)
   546 
   547 structure TypeNet =
   548 struct
   549 
   550 fun get_type_from_index thy thyname types is =
   551     case Int.fromString is of
   552         SOME i => (case Array.sub(types,i) of
   553                        FullType ty => ty
   554                      | XMLty xty =>
   555                        let
   556                            val ty = get_type_from_xml thy thyname types xty
   557                            val _  = Array.update(types,i,FullType ty)
   558                        in
   559                            ty
   560                        end)
   561       | NONE => raise ERR "get_type_from_index" "Bad index"
   562 and get_type_from_xml thy thyname types =
   563     let
   564         fun gtfx (Elem("tyi",[("i",iS)],[])) =
   565                  get_type_from_index thy thyname types iS
   566           | gtfx (Elem("tyc",atts,[])) =
   567             mk_thy_type thy
   568                         (get_segment thyname atts)
   569                         (protect_tyname (get_name atts))
   570                         []
   571           | gtfx (Elem("tyv",[("n",s)],[])) = mk_vartype (protect_tyvarname s)
   572           | gtfx (Elem("tya",[],(Elem("tyc",atts,[]))::tys)) =
   573             mk_thy_type thy
   574                         (get_segment thyname atts)
   575                         (protect_tyname (get_name atts))
   576                         (map gtfx tys)
   577           | gtfx _ = raise ERR "get_type" "Bad type"
   578     in
   579         gtfx
   580     end
   581 
   582 fun input_types thyname (Elem("tylist",[("i",i)],xtys)) =
   583     let
   584         val types = Array.array(valOf (Int.fromString i),XMLty (Elem("",[],[])))
   585         fun IT _ [] = ()
   586           | IT n (xty::xtys) =
   587             (Array.update(types,n,XMLty xty);
   588              IT (n+1) xtys)
   589         val _ = IT 0 xtys
   590     in
   591         types
   592     end
   593   | input_types _ _ = raise ERR "input_types" "Bad type list"
   594 end
   595 
   596 structure TermNet =
   597 struct
   598 
   599 fun get_term_from_index thy thyname types terms is =
   600     case Int.fromString is of
   601         SOME i => (case Array.sub(terms,i) of
   602                        FullTerm tm => tm
   603                      | XMLtm xtm =>
   604                        let
   605                            val tm = get_term_from_xml thy thyname types terms xtm
   606                            val _  = Array.update(terms,i,FullTerm tm)
   607                        in
   608                            tm
   609                        end)
   610       | NONE => raise ERR "get_term_from_index" "Bad index"
   611 and get_term_from_xml thy thyname types terms =
   612     let
   613         fun get_type [] = NONE
   614           | get_type [ty] = SOME (TypeNet.get_type_from_xml thy thyname types ty)
   615           | get_type _ = raise ERR "get_term" "Bad type"
   616 
   617         fun gtfx (Elem("tmv",[("n",name),("t",tyi)],[])) =
   618             mk_var(protect_varname name,TypeNet.get_type_from_index thy thyname types tyi)
   619           | gtfx (Elem("tmc",atts,[])) =
   620             let
   621                 val segment = get_segment thyname atts
   622                 val name = protect_constname(get_name atts)
   623             in
   624                 mk_thy_const thy segment name (TypeNet.get_type_from_index thy thyname types (Lib.assoc "t" atts))
   625                 handle PK _ => prim_mk_const thy segment name
   626             end
   627           | gtfx (Elem("tma",[("f",tmf),("a",tma)],[])) =
   628             let
   629                 val f = get_term_from_index thy thyname types terms tmf
   630                 val a = get_term_from_index thy thyname types terms tma
   631             in
   632                 mk_comb(f,a)
   633             end
   634           | gtfx (Elem("tml",[("x",tmx),("a",tma)],[])) =
   635             let
   636                 val x = get_term_from_index thy thyname types terms tmx
   637                 val a = get_term_from_index thy thyname types terms tma
   638             in
   639                 mk_lambda x a
   640             end
   641           | gtfx (Elem("tmi",[("i",iS)],[])) =
   642             get_term_from_index thy thyname types terms iS
   643           | gtfx (Elem(tag,_,_)) =
   644             raise ERR "get_term" ("Not a term: "^tag)
   645     in
   646         gtfx
   647     end
   648 
   649 fun input_terms thyname types (Elem("tmlist",[("i",i)],xtms)) =
   650     let
   651         val terms = Array.array(valOf(Int.fromString i),XMLtm (Elem("",[],[])))
   652 
   653         fun IT _ [] = ()
   654           | IT n (xtm::xtms) =
   655             (Array.update(terms,n,XMLtm xtm);
   656              IT (n+1) xtms)
   657         val _ = IT 0 xtms
   658     in
   659         terms
   660     end
   661   | input_terms _ _ _ = raise ERR "input_terms" "Bad term list"
   662 end
   663 
   664 fun get_proof_dir (thyname:string) thy =
   665     let
   666         val import_segment =
   667             case get_segment2 thyname thy of
   668                 SOME seg => seg
   669               | NONE => get_import_segment thy
   670         val path = space_explode ":" (getenv "HOL4_PROOFS")
   671         fun find [] = NONE
   672           | find (p::ps) =
   673             (let
   674                  val dir = OS.Path.joinDirFile {dir = p,file=import_segment}
   675              in
   676                  if OS.FileSys.isDir dir
   677                  then SOME dir
   678                  else find ps
   679              end) handle OS.SysErr _ => find ps
   680     in
   681         Option.map (fn p => OS.Path.joinDirFile {dir = p, file = thyname}) (find path)
   682     end
   683 
   684 fun proof_file_name thyname thmname thy =
   685     let
   686         val path = case get_proof_dir thyname thy of
   687                        SOME p => p
   688                      | NONE => error "Cannot find proof files"
   689         val _ = OS.FileSys.mkDir path handle OS.SysErr _ => ()
   690     in
   691         OS.Path.joinDirFile {dir = path, file = OS.Path.joinBaseExt {base = (unprotect_factname thmname), ext = SOME "prf"}}
   692     end
   693 
   694 fun xml_to_proof thyname types terms prf thy =
   695     let
   696         val xml_to_hol_type = TypeNet.get_type_from_xml thy thyname types
   697         val xml_to_term = TermNet.get_term_from_xml thy thyname types terms
   698 
   699         fun index_to_term is =
   700             TermNet.get_term_from_index thy thyname types terms is
   701 
   702         fun x2p (Elem("prefl",[("i",is)],[])) = mk_proof (PRefl (index_to_term is))
   703           | x2p (Elem("pinstt",[],p::lambda)) =
   704             let
   705                 val p = x2p p
   706                 val lambda = implode_subst (map xml_to_hol_type lambda)
   707             in
   708                 mk_proof (PInstT(p,lambda))
   709             end
   710           | x2p (Elem("psubst",[("i",is)],prf::prfs)) =
   711             let
   712                 val tm = index_to_term is
   713                 val prf = x2p prf
   714                 val prfs = map x2p prfs
   715             in
   716                 mk_proof (PSubst(prfs,tm,prf))
   717             end
   718           | x2p (Elem("pabs",[("i",is)],[prf])) =
   719             let
   720                 val p = x2p prf
   721                 val t = index_to_term is
   722             in
   723                 mk_proof (PAbs (p,t))
   724             end
   725           | x2p (Elem("pdisch",[("i",is)],[prf])) =
   726             let
   727                 val p = x2p prf
   728                 val t = index_to_term is
   729             in
   730                 mk_proof (PDisch (p,t))
   731             end
   732           | x2p (Elem("pmp",[],[prf1,prf2])) =
   733             let
   734                 val p1 = x2p prf1
   735                 val p2 = x2p prf2
   736             in
   737                 mk_proof (PMp(p1,p2))
   738             end
   739           | x2p (Elem("phyp",[("i",is)],[])) = mk_proof (PHyp (index_to_term is))
   740           | x2p (Elem("paxiom",[("n",n),("i",is)],[])) =
   741             mk_proof (PAxm(n,index_to_term is))
   742           | x2p (Elem("pfact",atts,[])) =
   743             let
   744                 val thyname = get_segment thyname atts
   745                 val thmname = protect_factname (get_name atts)
   746                 val p = mk_proof PDisk
   747                 val _  = set_disk_info_of p thyname thmname
   748             in
   749                 p
   750             end
   751           | x2p (Elem("pdef",[("s",seg),("n",name),("i",is)],[])) =
   752             mk_proof (PDef(seg,protect_constname name,index_to_term is))
   753           | x2p (Elem("ptmspec",[("s",seg)],p::names)) =
   754             let
   755                 val names = map (fn Elem("name",[("n",name)],[]) => name
   756                                   | _ => raise ERR "x2p" "Bad proof (ptmspec)") names
   757             in
   758                 mk_proof (PTmSpec(seg,names,x2p p))
   759             end
   760           | x2p (Elem("ptyintro",[("s",seg),("n",name),("a",abs_name),("r",rep_name)],[xP,xt,p])) =
   761             let
   762                 val P = xml_to_term xP
   763                 val t = xml_to_term xt
   764             in
   765                 mk_proof (PTyIntro(seg,protect_tyname name,protect_constname abs_name,protect_constname rep_name,P,t,x2p p))
   766             end
   767           | x2p (Elem("ptydef",[("s",seg),("n",name)],[p])) =
   768             mk_proof (PTyDef(seg,protect_tyname name,x2p p))
   769           | x2p (xml as Elem("poracle",[],chldr)) =
   770             let
   771                 val (oracles,terms) = List.partition (fn (Elem("oracle",_,_)) => true | _ => false) chldr
   772                 val ors = map (fn (Elem("oracle",[("n",name)],[])) => name | xml => raise ERR "x2p" "bad oracle") oracles
   773                 val (c,asl) = case terms of
   774                                   [] => raise ERR "x2p" "Bad oracle description"
   775                                 | (hd::tl) => (hd,tl)
   776                 val tg = List.foldr (fn (oracle,tg) => Tag.merge (Tag.read oracle) tg) Tag.empty_tag ors
   777             in
   778                 mk_proof (POracle(tg,map xml_to_term asl,xml_to_term c))
   779             end
   780           | x2p (Elem("pspec",[("i",is)],[prf])) =
   781             let
   782                 val p = x2p prf
   783                 val tm = index_to_term is
   784             in
   785                 mk_proof (PSpec(p,tm))
   786             end
   787           | x2p (Elem("pinst",[],p::theta)) =
   788             let
   789                 val p = x2p p
   790                 val theta = implode_subst (map xml_to_term theta)
   791             in
   792                 mk_proof (PInst(p,theta))
   793             end
   794           | x2p (Elem("pgen",[("i",is)],[prf])) =
   795             let
   796                 val p = x2p prf
   797                 val tm = index_to_term is
   798             in
   799                 mk_proof (PGen(p,tm))
   800             end
   801           | x2p (Elem("pgenabs",[],prf::tms)) =
   802             let
   803                 val p = x2p prf
   804                 val tml = map xml_to_term tms
   805             in
   806                 mk_proof (PGenAbs(p,NONE,tml))
   807             end
   808           | x2p (Elem("pgenabs",[("i",is)],prf::tms)) =
   809             let
   810                 val p = x2p prf
   811                 val tml = map xml_to_term tms
   812             in
   813                 mk_proof (PGenAbs(p,SOME (index_to_term is),tml))
   814             end
   815           | x2p (Elem("pimpas",[],[prf1,prf2])) =
   816             let
   817                 val p1 = x2p prf1
   818                 val p2 = x2p prf2
   819             in
   820                 mk_proof (PImpAS(p1,p2))
   821             end
   822           | x2p (Elem("psym",[],[prf])) =
   823             let
   824                 val p = x2p prf
   825             in
   826                 mk_proof (PSym p)
   827             end
   828           | x2p (Elem("ptrans",[],[prf1,prf2])) =
   829             let
   830                 val p1 = x2p prf1
   831                 val p2 = x2p prf2
   832             in
   833                 mk_proof (PTrans(p1,p2))
   834             end
   835           | x2p (Elem("pcomb",[],[prf1,prf2])) =
   836             let
   837                 val p1 = x2p prf1
   838                 val p2 = x2p prf2
   839             in
   840                 mk_proof (PComb(p1,p2))
   841             end
   842           | x2p (Elem("peqmp",[],[prf1,prf2])) =
   843             let
   844                 val p1 = x2p prf1
   845                 val p2 = x2p prf2
   846             in
   847                 mk_proof (PEqMp(p1,p2))
   848             end
   849           | x2p (Elem("peqimp",[],[prf])) =
   850             let
   851                 val p = x2p prf
   852             in
   853                 mk_proof (PEqImp p)
   854             end
   855           | x2p (Elem("pexists",[("e",ise),("w",isw)],[prf])) =
   856             let
   857                 val p = x2p prf
   858                 val ex = index_to_term ise
   859                 val w = index_to_term isw
   860             in
   861                 mk_proof (PExists(p,ex,w))
   862             end
   863           | x2p (Elem("pchoose",[("i",is)],[prf1,prf2])) =
   864             let
   865                 val v  = index_to_term is
   866                 val p1 = x2p prf1
   867                 val p2 = x2p prf2
   868             in
   869                 mk_proof (PChoose(v,p1,p2))
   870             end
   871           | x2p (Elem("pconj",[],[prf1,prf2])) =
   872             let
   873                 val p1 = x2p prf1
   874                 val p2 = x2p prf2
   875             in
   876                 mk_proof (PConj(p1,p2))
   877             end
   878           | x2p (Elem("pconjunct1",[],[prf])) =
   879             let
   880                 val p = x2p prf
   881             in
   882                 mk_proof (PConjunct1 p)
   883             end
   884           | x2p (Elem("pconjunct2",[],[prf])) =
   885             let
   886                 val p = x2p prf
   887             in
   888                 mk_proof (PConjunct2 p)
   889             end
   890           | x2p (Elem("pdisj1",[("i",is)],[prf])) =
   891             let
   892                 val p = x2p prf
   893                 val t = index_to_term is
   894             in
   895                 mk_proof (PDisj1 (p,t))
   896             end
   897           | x2p (Elem("pdisj2",[("i",is)],[prf])) =
   898             let
   899                 val p = x2p prf
   900                 val t = index_to_term is
   901             in
   902                 mk_proof (PDisj2 (p,t))
   903             end
   904           | x2p (Elem("pdisjcases",[],[prf1,prf2,prf3])) =
   905             let
   906                 val p1 = x2p prf1
   907                 val p2 = x2p prf2
   908                 val p3 = x2p prf3
   909             in
   910                 mk_proof (PDisjCases(p1,p2,p3))
   911             end
   912           | x2p (Elem("pnoti",[],[prf])) =
   913             let
   914                 val p = x2p prf
   915             in
   916                 mk_proof (PNotI p)
   917             end
   918           | x2p (Elem("pnote",[],[prf])) =
   919             let
   920                 val p = x2p prf
   921             in
   922                 mk_proof (PNotE p)
   923             end
   924           | x2p (Elem("pcontr",[("i",is)],[prf])) =
   925             let
   926                 val p = x2p prf
   927                 val t = index_to_term is
   928             in
   929                 mk_proof (PContr (p,t))
   930             end
   931           | x2p xml = raise ERR "x2p" "Bad proof"
   932     in
   933         x2p prf
   934     end
   935 
   936 fun import_proof_concl thyname thmname thy =
   937     let
   938         val is = TextIO.openIn(proof_file_name thyname thmname thy)
   939         val (proof_xml,_) = scan_tag (LazySeq.of_instream is)
   940         val _ = TextIO.closeIn is
   941     in
   942         case proof_xml of
   943             Elem("proof",[],xtypes::xterms::prf::rest) =>
   944             let
   945                 val types = TypeNet.input_types thyname xtypes
   946                 val terms = TermNet.input_terms thyname types xterms
   947                 fun f xtm thy = TermNet.get_term_from_xml thy thyname types terms xtm
   948             in
   949                 case rest of
   950                     [] => NONE
   951                   | [xtm] => SOME (f xtm)
   952                   | _ => raise ERR "import_proof" "Bad argument list"
   953             end
   954           | _ => raise ERR "import_proof" "Bad proof"
   955     end
   956 
   957 fun import_proof thyname thmname thy =
   958     let
   959         val is = TextIO.openIn(proof_file_name thyname thmname thy)
   960         val (proof_xml,_) = scan_tag (LazySeq.of_instream is)
   961         val _ = TextIO.closeIn is
   962     in
   963         case proof_xml of
   964             Elem("proof",[],xtypes::xterms::prf::rest) =>
   965             let
   966                 val types = TypeNet.input_types thyname xtypes
   967                 val terms = TermNet.input_terms thyname types xterms
   968             in
   969                 (case rest of
   970                      [] => NONE
   971                    | [xtm] => SOME (fn thy => TermNet.get_term_from_xml thy thyname types terms xtm)
   972                    | _ => raise ERR "import_proof" "Bad argument list",
   973                  xml_to_proof thyname types terms prf)
   974             end
   975           | _ => raise ERR "import_proof" "Bad proof"
   976     end
   977 
   978 fun uniq_compose m th i st =
   979     let
   980         val res = Thm.bicompose false (false,th,m) i st
   981     in
   982         case Seq.pull res of
   983             SOME (th,rest) => (case Seq.pull rest of
   984                                    SOME _ => raise ERR "uniq_compose" "Not unique!"
   985                                  | NONE => th)
   986           | NONE => raise ERR "uniq_compose" "No result"
   987     end
   988 
   989 val reflexivity_thm = thm "refl"
   990 val substitution_thm = thm "subst"
   991 val mp_thm = thm "mp"
   992 val imp_antisym_thm = thm "light_imp_as"
   993 val disch_thm = thm "impI"
   994 val ccontr_thm = thm "ccontr"
   995 
   996 val meta_eq_to_obj_eq_thm = thm "meta_eq_to_obj_eq"
   997 
   998 val gen_thm = thm "HOLallI"
   999 val choose_thm = thm "exE"
  1000 val exists_thm = thm "exI"
  1001 val conj_thm = thm "conjI"
  1002 val conjunct1_thm = thm "conjunct1"
  1003 val conjunct2_thm = thm "conjunct2"
  1004 val spec_thm = thm "spec"
  1005 val disj_cases_thm = thm "disjE"
  1006 val disj1_thm = thm "disjI1"
  1007 val disj2_thm = thm "disjI2"
  1008 
  1009 local
  1010     val th = thm "not_def"
  1011     val thy = theory_of_thm th
  1012     val pp = reflexive (cterm_of thy (Const("Trueprop",boolT-->propT)))
  1013 in
  1014 val not_elim_thm = combination pp th
  1015 end
  1016 
  1017 val not_intro_thm = symmetric not_elim_thm
  1018 val abs_thm = thm "ext"
  1019 val trans_thm = thm "trans"
  1020 val symmetry_thm = thm "sym"
  1021 val transitivity_thm = thm "trans"
  1022 val eqmp_thm = thm "iffD1"
  1023 val eqimp_thm = thm "HOL4Setup.eq_imp"
  1024 val comb_thm = thm "cong"
  1025 
  1026 (* Beta-eta normalizes a theorem (only the conclusion, not the *
  1027 hypotheses!)  *)
  1028 
  1029 fun beta_eta_thm th =
  1030     let
  1031         val th1 = Thm.equal_elim (Thm.beta_conversion true (cprop_of th))  th
  1032         val th2 = Thm.equal_elim (Thm.eta_conversion       (cprop_of th1)) th1
  1033     in
  1034         th2
  1035     end
  1036 
  1037 fun implies_elim_all th =
  1038     Library.foldl (fn (th,p) => implies_elim th (assume p)) (th,cprems_of th)
  1039 
  1040 fun norm_hyps th =
  1041     th |> beta_eta_thm
  1042        |> implies_elim_all
  1043        |> implies_intr_hyps
  1044 
  1045 fun mk_GEN v th sg =
  1046     let
  1047         val c = HOLogic.dest_Trueprop (concl_of th)
  1048         val cv = cterm_of sg v
  1049         val lc = Term.lambda v c
  1050         val clc = Thm.cterm_of sg lc
  1051         val cvty = ctyp_of_term cv
  1052         val th1 = implies_elim_all th
  1053         val th2 = beta_eta_thm (forall_intr cv th1)
  1054         val th3 = th2 COMP (beta_eta_thm (Drule.instantiate' [SOME cvty] [SOME clc] gen_thm))
  1055         val c = prop_of th3
  1056         val vname = fst(dest_Free v)
  1057         val (cold,cnew) = case c of
  1058                               tpc $ (Const("All",allT) $ Abs(oldname,ty,body)) =>
  1059                               (Abs(oldname,dummyT,Bound 0),Abs(vname,dummyT,Bound 0))
  1060                             | tpc $ (Const("All",allT) $ rest) => (tpc,tpc)
  1061                             | _ => raise ERR "mk_GEN" "Unknown conclusion"
  1062         val th4 = Thm.rename_boundvars cold cnew th3
  1063         val res = implies_intr_hyps th4
  1064     in
  1065         res
  1066     end
  1067 
  1068 fun rearrange sg tm th =
  1069     let
  1070         val tm' = Envir.beta_eta_contract tm
  1071         fun find []      n = Thm.permute_prems 0 1 (implies_intr (Thm.cterm_of sg tm) th)
  1072           | find (p::ps) n = if tm' aconv (Envir.beta_eta_contract p)
  1073                              then Thm.permute_prems n 1 th
  1074                              else find ps (n+1)
  1075     in
  1076         find (prems_of th) 0
  1077     end
  1078 
  1079 fun zip (x::xs) (y::ys) = (x,y)::(zip xs ys)
  1080   | zip [] [] = []
  1081   | zip _ _ = raise ERR "zip" "arguments not of same length"
  1082 
  1083 fun mk_INST dom rng th =
  1084     th |> forall_intr_list dom
  1085        |> forall_elim_list rng
  1086 
  1087 val collect_vars =
  1088     let
  1089         fun F vars (Bound _) = vars
  1090           | F vars (tm as Free _) =
  1091             if tm mem vars
  1092             then vars
  1093             else (tm::vars)
  1094           | F vars (Const _) = vars
  1095           | F vars (tm1 $ tm2) = F (F vars tm1) tm2
  1096           | F vars (Abs(_,_,body)) = F vars body
  1097           | F vars (Var _) = raise ERR "collect_vars" "Schematic variable found"
  1098     in
  1099         F []
  1100     end
  1101 
  1102 (* Code for disambiguating variablenames (wrt. types) *)
  1103 
  1104 val disamb_info_empty = {vars=[],rens=[]}
  1105 
  1106 fun rens_of {vars,rens} = rens
  1107 
  1108 fun name_of_var (Free(vname,_)) = vname
  1109   | name_of_var _ = raise ERR "name_of_var" "Not a variable"
  1110 
  1111 fun disamb_term_from info tm = (info, tm)
  1112 
  1113 fun swap (x,y) = (y,x)
  1114 
  1115 fun has_ren (HOLThm _) = false
  1116 
  1117 fun prinfo {vars,rens} = (writeln "Vars:";
  1118                           app prin vars;
  1119                           writeln "Renaming:";
  1120                           app (fn(x,y)=>(prin x; writeln " -->"; prin y)) rens)
  1121 
  1122 fun disamb_thm_from info (HOLThm (_,thm)) = (info, thm)
  1123 
  1124 fun disamb_terms_from info tms = (info, tms)
  1125 
  1126 fun disamb_thms_from info hthms = (info, map hthm2thm hthms)
  1127 
  1128 fun disamb_term tm   = disamb_term_from disamb_info_empty tm
  1129 fun disamb_terms tms = disamb_terms_from disamb_info_empty tms
  1130 fun disamb_thm thm   = disamb_thm_from disamb_info_empty thm
  1131 fun disamb_thms thms = disamb_thms_from disamb_info_empty thms
  1132 
  1133 fun norm_hthm sg (hth as HOLThm _) = hth
  1134 
  1135 (* End of disambiguating code *)
  1136 
  1137 fun disambiguate_frees thm =
  1138     let
  1139       fun ERR s = error ("Drule.disambiguate_frees: "^s)
  1140       val ct = cprop_of thm
  1141       val t = term_of ct
  1142       val thy = theory_of_cterm ct
  1143       val frees = OldTerm.term_frees t
  1144       val freenames = Term.add_free_names t []
  1145       val is_old_name = member (op =) freenames
  1146       fun name_of (Free (n, _)) = n
  1147         | name_of _ = ERR "name_of"
  1148       fun new_name' bump map n =
  1149           let val n' = n^bump in
  1150             if is_old_name n' orelse Symtab.lookup map n' <> NONE then
  1151               new_name' (Symbol.bump_string bump) map n
  1152             else
  1153               n'
  1154           end
  1155       val new_name = new_name' "a"
  1156       fun replace_name n' (Free (n, t)) = Free (n', t)
  1157         | replace_name n' _ = ERR "replace_name"
  1158       (* map: old or fresh name -> old free,
  1159          invmap: old free which has fresh name assigned to it -> fresh name *)
  1160       fun dis (v, mapping as (map,invmap)) =
  1161           let val n = name_of v in
  1162             case Symtab.lookup map n of
  1163               NONE => (Symtab.update (n, v) map, invmap)
  1164             | SOME v' =>
  1165               if v=v' then
  1166                 mapping
  1167               else
  1168                 let val n' = new_name map n in
  1169                   (Symtab.update (n', v) map,
  1170                    Termtab.update (v, n') invmap)
  1171                 end
  1172           end
  1173     in
  1174       if (length freenames = length frees) then
  1175         thm
  1176       else
  1177         let
  1178           val (_, invmap) =
  1179               List.foldl dis (Symtab.empty, Termtab.empty) frees
  1180           fun make_subst ((oldfree, newname), (intros, elims)) =
  1181               (cterm_of thy oldfree :: intros,
  1182                cterm_of thy (replace_name newname oldfree) :: elims)
  1183           val (intros, elims) = List.foldl make_subst ([], []) (Termtab.dest invmap)
  1184         in
  1185           forall_elim_list elims (forall_intr_list intros thm)
  1186         end
  1187     end
  1188 
  1189 val debug = ref false
  1190 
  1191 fun if_debug f x = if !debug then f x else ()
  1192 val message = if_debug writeln
  1193 
  1194 val conjE_helper = Thm.permute_prems 0 1 conjE
  1195 
  1196 fun get_hol4_thm thyname thmname thy =
  1197     case get_hol4_theorem thyname thmname thy of
  1198         SOME hth => SOME (HOLThm hth)
  1199       | NONE =>
  1200         let
  1201             val pending = HOL4Pending.get thy
  1202         in
  1203             case StringPair.lookup pending (thyname,thmname) of
  1204                 SOME hth => SOME (HOLThm hth)
  1205               | NONE => NONE
  1206         end
  1207 
  1208 fun non_trivial_term_consts t = fold_aterms
  1209   (fn Const (c, _) =>
  1210       if c = "Trueprop" orelse c = "All" orelse c = "op -->" orelse c = "op &" orelse c = "op ="
  1211       then I else insert (op =) c
  1212     | _ => I) t [];
  1213 
  1214 fun match_consts t (* th *) =
  1215     let
  1216         fun add_consts (Const (c, _), cs) =
  1217             (case c of
  1218                  "op =" => insert (op =) "==" cs
  1219                | "op -->" => insert (op =) "==>" cs
  1220                | "All" => cs
  1221                | "all" => cs
  1222                | "op &" => cs
  1223                | "Trueprop" => cs
  1224                | _ => insert (op =) c cs)
  1225           | add_consts (t $ u, cs) = add_consts (t, add_consts (u, cs))
  1226           | add_consts (Abs (_, _, t), cs) = add_consts (t, cs)
  1227           | add_consts (_, cs) = cs
  1228         val t_consts = add_consts(t,[])
  1229     in
  1230         fn th => eq_set(t_consts,add_consts(prop_of th,[]))
  1231     end
  1232 
  1233 fun split_name str =
  1234     let
  1235         val sub = Substring.full str
  1236         val (f,idx) = apsnd Substring.string (Substring.splitr Char.isDigit sub)
  1237         val (newstr,u) = pairself Substring.string (Substring.splitr (fn c => c = #"_") f)
  1238     in
  1239         if not (idx = "") andalso u = "_"
  1240         then SOME (newstr,valOf(Int.fromString idx))
  1241         else NONE
  1242     end
  1243     handle _ => NONE  (* FIXME avoid handle _ *)
  1244 
  1245 fun rewrite_hol4_term t thy =
  1246     let
  1247         val hol4rews1 = map (Thm.transfer thy) (HOL4Rewrites.get thy)
  1248         val hol4ss = Simplifier.theory_context thy empty_ss
  1249           setmksimps single addsimps hol4rews1
  1250     in
  1251         Thm.transfer thy (Simplifier.full_rewrite hol4ss (cterm_of thy t))
  1252     end
  1253 
  1254 fun get_isabelle_thm thyname thmname hol4conc thy =
  1255     let
  1256         val (info,hol4conc') = disamb_term hol4conc
  1257         val i2h_conc = symmetric (rewrite_hol4_term (HOLogic.mk_Trueprop hol4conc') thy)
  1258         val isaconc =
  1259             case concl_of i2h_conc of
  1260                 Const("==",_) $ lhs $ _ => lhs
  1261               | _ => error "get_isabelle_thm" "Bad rewrite rule"
  1262         val _ = (message "Original conclusion:";
  1263                  if_debug prin hol4conc';
  1264                  message "Modified conclusion:";
  1265                  if_debug prin isaconc)
  1266 
  1267         fun mk_res th = HOLThm(rens_of info,equal_elim i2h_conc th)
  1268     in
  1269         case get_hol4_mapping thyname thmname thy of
  1270             SOME (SOME thmname) =>
  1271             let
  1272                 val th1 = (SOME (PureThy.get_thm thy thmname)
  1273                            handle ERROR _ =>
  1274                                   (case split_name thmname of
  1275                                        SOME (listname,idx) => (SOME (List.nth(PureThy.get_thms thy listname,idx-1))
  1276                                                                handle _ => NONE)  (* FIXME avoid handle _ *)
  1277                                      | NONE => NONE))
  1278             in
  1279                 case th1 of
  1280                     SOME th2 =>
  1281                     (case Shuffler.set_prop thy isaconc [(thmname,th2)] of
  1282                          SOME (_,th) => (message "YES";(thy, SOME (mk_res th)))
  1283                        | NONE => (message "NO2";error "get_isabelle_thm" "Bad mapping"))
  1284                   | NONE => (message "NO1";error "get_isabelle_thm" "Bad mapping")
  1285             end
  1286           | SOME NONE => error ("Trying to access ignored theorem " ^ thmname)
  1287           | NONE =>
  1288             let
  1289                 val _ = (message "Looking for conclusion:";
  1290                          if_debug prin isaconc)
  1291                 val cs = non_trivial_term_consts isaconc;
  1292                 val _ = (message "Looking for consts:";
  1293                          message (commas cs))
  1294                 val pot_thms = Shuffler.find_potential thy isaconc
  1295                 val _ = message ((Int.toString (length pot_thms)) ^ " potential theorems")
  1296             in
  1297                 case Shuffler.set_prop thy isaconc pot_thms of
  1298                     SOME (isaname,th) =>
  1299                     let
  1300                         val hth as HOLThm args = mk_res th
  1301                         val thy' =  thy |> add_hol4_theorem thyname thmname args
  1302                                         |> add_hol4_mapping thyname thmname isaname
  1303                         val _ = ImportRecorder.add_hol_theorem thyname thmname (snd args)
  1304                         val _ = ImportRecorder.add_hol_mapping thyname thmname isaname
  1305                     in
  1306                         (thy',SOME hth)
  1307                     end
  1308                   | NONE => (thy,NONE)
  1309             end
  1310     end
  1311     handle e => (message "Exception in get_isabelle_thm"; if_debug print_exn e handle _ => (); (thy,NONE))
  1312 
  1313 fun get_isabelle_thm_and_warn thyname thmname hol4conc thy =
  1314   let
  1315     val (a, b) = get_isabelle_thm thyname thmname hol4conc thy
  1316     fun warn () =
  1317         let
  1318             val (info,hol4conc') = disamb_term hol4conc
  1319             val i2h_conc = symmetric (rewrite_hol4_term (HOLogic.mk_Trueprop hol4conc') thy)
  1320         in
  1321             case concl_of i2h_conc of
  1322                 Const("==",_) $ lhs $ _ =>
  1323                 (warning ("Failed lookup of theorem '"^thmname^"':");
  1324                  writeln "Original conclusion:";
  1325                  prin hol4conc';
  1326                  writeln "Modified conclusion:";
  1327                  prin lhs)
  1328               | _ => ()
  1329         end
  1330   in
  1331       case b of
  1332           NONE => (warn () handle _ => (); (a,b)) (* FIXME avoid handle _ *)
  1333         | _ => (a, b)
  1334   end
  1335 
  1336 fun get_thm thyname thmname thy =
  1337     case get_hol4_thm thyname thmname thy of
  1338         SOME hth => (thy,SOME hth)
  1339       | NONE => ((case import_proof_concl thyname thmname thy of
  1340                       SOME f => get_isabelle_thm_and_warn thyname thmname (f thy) thy
  1341                     | NONE => (message "No conclusion"; (thy,NONE)))
  1342                  handle e as IO.Io _ => (message "IO exception"; (thy,NONE))
  1343                       | e as PK _ => (message "PK exception"; (thy,NONE)))
  1344 
  1345 fun rename_const thyname thy name =
  1346     case get_hol4_const_renaming thyname name thy of
  1347         SOME cname => cname
  1348       | NONE => name
  1349 
  1350 fun get_def thyname constname rhs thy =
  1351     let
  1352         val constname = rename_const thyname thy constname
  1353         val (thmname,thy') = get_defname thyname constname thy
  1354         val _ = message ("Looking for definition " ^ thyname ^ "." ^ thmname)
  1355     in
  1356         get_isabelle_thm_and_warn thyname thmname (mk_teq (thyname ^ "." ^ constname) rhs thy') thy'
  1357     end
  1358 
  1359 fun get_axiom thyname axname thy =
  1360     case get_thm thyname axname thy of
  1361         arg as (_,SOME _) => arg
  1362       | _ => raise ERR "get_axiom" ("Trying to retrieve axiom (" ^ axname ^ ")")
  1363 
  1364 fun intern_store_thm gen_output thyname thmname hth thy =
  1365     let
  1366         val (hth' as HOLThm (args as (_,th))) = norm_hthm thy hth
  1367         val rew = rewrite_hol4_term (concl_of th) thy
  1368         val th  = equal_elim rew th
  1369         val thy' = add_hol4_pending thyname thmname args thy
  1370         val _ = ImportRecorder.add_hol_pending thyname thmname (hthm2thm hth')
  1371         val th = disambiguate_frees th
  1372         val thy2 = if gen_output
  1373                    then add_dump ("lemma " ^ (quotename thmname) ^ ": " ^
  1374                                   (smart_string_of_thm th) ^ "\n  by (import " ^
  1375                                   thyname ^ " " ^ (quotename thmname) ^ ")") thy'
  1376                    else thy'
  1377     in
  1378         (thy2,hth')
  1379     end
  1380 
  1381 val store_thm = intern_store_thm true
  1382 
  1383 fun mk_REFL ctm =
  1384     let
  1385         val cty = Thm.ctyp_of_term ctm
  1386     in
  1387         Drule.instantiate' [SOME cty] [SOME ctm] reflexivity_thm
  1388     end
  1389 
  1390 fun REFL tm thy =
  1391     let
  1392         val _ = message "REFL:"
  1393         val (info,tm') = disamb_term tm
  1394         val ctm = Thm.cterm_of thy tm'
  1395         val res = HOLThm(rens_of info,mk_REFL ctm)
  1396         val _ = if_debug pth res
  1397     in
  1398         (thy,res)
  1399     end
  1400 
  1401 fun ASSUME tm thy =
  1402     let
  1403         val _ = message "ASSUME:"
  1404         val (info,tm') = disamb_term tm
  1405         val ctm = Thm.cterm_of thy (HOLogic.mk_Trueprop tm')
  1406         val th = Thm.trivial ctm
  1407         val res = HOLThm(rens_of info,th)
  1408         val _ = if_debug pth res
  1409     in
  1410         (thy,res)
  1411     end
  1412 
  1413 fun INST_TYPE lambda (hth as HOLThm(rens,th)) thy =
  1414     let
  1415         val _ = message "INST_TYPE:"
  1416         val _ = if_debug pth hth
  1417         val tys_before = OldTerm.add_term_tfrees (prop_of th,[])
  1418         val th1 = Thm.varifyT th
  1419         val tys_after = OldTerm.add_term_tvars (prop_of th1,[])
  1420         val tyinst = map (fn (bef, iS) =>
  1421                              (case try (Lib.assoc (TFree bef)) lambda of
  1422                                   SOME ty => (ctyp_of thy (TVar iS), ctyp_of thy ty)
  1423                                 | NONE => (ctyp_of thy (TVar iS), ctyp_of thy (TFree bef))
  1424                              ))
  1425                          (zip tys_before tys_after)
  1426         val res = Drule.instantiate (tyinst,[]) th1
  1427         val hth = HOLThm([],res)
  1428         val res = norm_hthm thy hth
  1429         val _ = message "RESULT:"
  1430         val _ = if_debug pth res
  1431     in
  1432         (thy,res)
  1433     end
  1434 
  1435 fun INST sigma hth thy =
  1436     let
  1437         val _ = message "INST:"
  1438         val _ = if_debug (app (fn (x,y) => (prin x; prin y))) sigma
  1439         val _ = if_debug pth hth
  1440         val (sdom,srng) = ListPair.unzip (rev sigma)
  1441         val th = hthm2thm hth
  1442         val th1 = mk_INST (map (cterm_of thy) sdom) (map (cterm_of thy) srng) th
  1443         val res = HOLThm([],th1)
  1444         val _ = message "RESULT:"
  1445         val _ = if_debug pth res
  1446     in
  1447         (thy,res)
  1448     end
  1449 
  1450 fun EQ_IMP_RULE (hth as HOLThm(rens,th)) thy =
  1451     let
  1452         val _ = message "EQ_IMP_RULE:"
  1453         val _ = if_debug pth hth
  1454         val res = HOLThm(rens,th RS eqimp_thm)
  1455         val _ = message "RESULT:"
  1456         val _ = if_debug pth res
  1457     in
  1458         (thy,res)
  1459     end
  1460 
  1461 fun mk_EQ_MP th1 th2 = [beta_eta_thm th1, beta_eta_thm th2] MRS eqmp_thm
  1462 
  1463 fun EQ_MP hth1 hth2 thy =
  1464     let
  1465         val _ = message "EQ_MP:"
  1466         val _ = if_debug pth hth1
  1467         val _ = if_debug pth hth2
  1468         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1469         val res = HOLThm(rens_of info,mk_EQ_MP th1 th2)
  1470         val _ = message "RESULT:"
  1471         val _ = if_debug pth res
  1472     in
  1473         (thy,res)
  1474     end
  1475 
  1476 fun mk_COMB th1 th2 thy =
  1477     let
  1478         val (f,g) = case concl_of th1 of
  1479                         _ $ (Const("op =",_) $ f $ g) => (f,g)
  1480                       | _ => raise ERR "mk_COMB" "First theorem not an equality"
  1481         val (x,y) = case concl_of th2 of
  1482                         _ $ (Const("op =",_) $ x $ y) => (x,y)
  1483                       | _ => raise ERR "mk_COMB" "Second theorem not an equality"
  1484         val fty = type_of f
  1485         val (fd,fr) = dom_rng fty
  1486         val comb_thm' = Drule.instantiate'
  1487                             [SOME (ctyp_of thy fd),SOME (ctyp_of thy fr)]
  1488                             [SOME (cterm_of thy f),SOME (cterm_of thy g),
  1489                              SOME (cterm_of thy x),SOME (cterm_of thy y)] comb_thm
  1490     in
  1491         [th1,th2] MRS comb_thm'
  1492     end
  1493 
  1494 fun SUBST rews ctxt hth thy =
  1495     let
  1496         val _ = message "SUBST:"
  1497         val _ = if_debug (app pth) rews
  1498         val _ = if_debug prin ctxt
  1499         val _ = if_debug pth hth
  1500         val (info,th) = disamb_thm hth
  1501         val (info1,ctxt') = disamb_term_from info ctxt
  1502         val (info2,rews') = disamb_thms_from info1 rews
  1503 
  1504         val cctxt = cterm_of thy ctxt'
  1505         fun subst th [] = th
  1506           | subst th (rew::rews) = subst (mk_COMB th rew thy) rews
  1507         val res = HOLThm(rens_of info2,mk_EQ_MP (subst (mk_REFL cctxt) rews') th)
  1508         val _ = message "RESULT:"
  1509         val _ = if_debug pth res
  1510     in
  1511         (thy,res)
  1512     end
  1513 
  1514 fun DISJ_CASES hth hth1 hth2 thy =
  1515     let
  1516         val _ = message "DISJ_CASES:"
  1517         val _ = if_debug (app pth) [hth,hth1,hth2]
  1518         val (info,th) = disamb_thm hth
  1519         val (info1,th1) = disamb_thm_from info hth1
  1520         val (info2,th2) = disamb_thm_from info1 hth2
  1521         val th1 = norm_hyps th1
  1522         val th2 = norm_hyps th2
  1523         val (l,r) = case concl_of th of
  1524                         _ $ (Const("op |",_) $ l $ r) => (l,r)
  1525                       | _ => raise ERR "DISJ_CASES" "Conclusion not a disjunction"
  1526         val th1' = rearrange thy (HOLogic.mk_Trueprop l) th1
  1527         val th2' = rearrange thy (HOLogic.mk_Trueprop r) th2
  1528         val res1 = th RS disj_cases_thm
  1529         val res2 = uniq_compose ((nprems_of th1')-1) th1' ((nprems_of th)+1) res1
  1530         val res3 = uniq_compose ((nprems_of th2')-1) th2' (nprems_of res2) res2
  1531         val res  = HOLThm(rens_of info2,res3)
  1532         val _ = message "RESULT:"
  1533         val _ = if_debug pth res
  1534     in
  1535         (thy,res)
  1536     end
  1537 
  1538 fun DISJ1 hth tm thy =
  1539     let
  1540         val _ = message "DISJ1:"
  1541         val _ = if_debug pth hth
  1542         val _ = if_debug prin tm
  1543         val (info,th) = disamb_thm hth
  1544         val (info',tm') = disamb_term_from info tm
  1545         val ct = Thm.cterm_of thy tm'
  1546         val disj1_thm' = Drule.instantiate' [] [NONE,SOME ct] disj1_thm
  1547         val res = HOLThm(rens_of info',th RS disj1_thm')
  1548         val _ = message "RESULT:"
  1549         val _ = if_debug pth res
  1550     in
  1551         (thy,res)
  1552     end
  1553 
  1554 fun DISJ2 tm hth thy =
  1555     let
  1556         val _ = message "DISJ1:"
  1557         val _ = if_debug prin tm
  1558         val _ = if_debug pth hth
  1559         val (info,th) = disamb_thm hth
  1560         val (info',tm') = disamb_term_from info tm
  1561         val ct = Thm.cterm_of thy tm'
  1562         val disj2_thm' = Drule.instantiate' [] [NONE,SOME ct] disj2_thm
  1563         val res = HOLThm(rens_of info',th RS disj2_thm')
  1564         val _ = message "RESULT:"
  1565         val _ = if_debug pth res
  1566     in
  1567         (thy,res)
  1568     end
  1569 
  1570 fun IMP_ANTISYM hth1 hth2 thy =
  1571     let
  1572         val _ = message "IMP_ANTISYM:"
  1573         val _ = if_debug pth hth1
  1574         val _ = if_debug pth hth2
  1575         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1576         val th = [beta_eta_thm th1,beta_eta_thm th2] MRS imp_antisym_thm
  1577         val res = HOLThm(rens_of info,th)
  1578         val _ = message "RESULT:"
  1579         val _ = if_debug pth res
  1580     in
  1581         (thy,res)
  1582     end
  1583 
  1584 fun SYM (hth as HOLThm(rens,th)) thy =
  1585     let
  1586         val _ = message "SYM:"
  1587         val _ = if_debug pth hth
  1588         val th = th RS symmetry_thm
  1589         val res = HOLThm(rens,th)
  1590         val _ = message "RESULT:"
  1591         val _ = if_debug pth res
  1592     in
  1593         (thy,res)
  1594     end
  1595 
  1596 fun MP hth1 hth2 thy =
  1597     let
  1598         val _ = message "MP:"
  1599         val _ = if_debug pth hth1
  1600         val _ = if_debug pth hth2
  1601         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1602         val th = [beta_eta_thm th1,beta_eta_thm th2] MRS mp_thm
  1603         val res = HOLThm(rens_of info,th)
  1604         val _ = message "RESULT:"
  1605         val _ = if_debug pth res
  1606     in
  1607         (thy,res)
  1608     end
  1609 
  1610 fun CONJ hth1 hth2 thy =
  1611     let
  1612         val _ = message "CONJ:"
  1613         val _ = if_debug pth hth1
  1614         val _ = if_debug pth hth2
  1615         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1616         val th = [th1,th2] MRS conj_thm
  1617         val res = HOLThm(rens_of info,th)
  1618         val _ = message "RESULT:"
  1619         val _ = if_debug pth res
  1620     in
  1621         (thy,res)
  1622     end
  1623 
  1624 fun CONJUNCT1 (hth as HOLThm(rens,th)) thy =
  1625     let
  1626         val _ = message "CONJUNCT1:"
  1627         val _ = if_debug pth hth
  1628         val res = HOLThm(rens,th RS conjunct1_thm)
  1629         val _ = message "RESULT:"
  1630         val _ = if_debug pth res
  1631     in
  1632         (thy,res)
  1633     end
  1634 
  1635 fun CONJUNCT2 (hth as HOLThm(rens,th)) thy =
  1636     let
  1637         val _ = message "CONJUNCT1:"
  1638         val _ = if_debug pth hth
  1639         val res = HOLThm(rens,th RS conjunct2_thm)
  1640         val _ = message "RESULT:"
  1641         val _ = if_debug pth res
  1642     in
  1643         (thy,res)
  1644     end
  1645 
  1646 fun EXISTS ex wit hth thy =
  1647     let
  1648         val _ = message "EXISTS:"
  1649         val _ = if_debug prin ex
  1650         val _ = if_debug prin wit
  1651         val _ = if_debug pth hth
  1652         val (info,th) = disamb_thm hth
  1653         val (info',[ex',wit']) = disamb_terms_from info [ex,wit]
  1654         val cwit = cterm_of thy wit'
  1655         val cty = ctyp_of_term cwit
  1656         val a = case ex' of
  1657                     (Const("Ex",_) $ a) => a
  1658                   | _ => raise ERR "EXISTS" "Argument not existential"
  1659         val ca = cterm_of thy a
  1660         val exists_thm' = beta_eta_thm (Drule.instantiate' [SOME cty] [SOME ca,SOME cwit] exists_thm)
  1661         val th1 = beta_eta_thm th
  1662         val th2 = implies_elim_all th1
  1663         val th3 = th2 COMP exists_thm'
  1664         val th  = implies_intr_hyps th3
  1665         val res = HOLThm(rens_of info',th)
  1666         val _   = message "RESULT:"
  1667         val _   = if_debug pth res
  1668     in
  1669         (thy,res)
  1670     end
  1671 
  1672 fun CHOOSE v hth1 hth2 thy =
  1673     let
  1674         val _ = message "CHOOSE:"
  1675         val _ = if_debug prin v
  1676         val _ = if_debug pth hth1
  1677         val _ = if_debug pth hth2
  1678         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1679         val (info',v') = disamb_term_from info v
  1680         fun strip 0 _ th = th
  1681           | strip n (p::ps) th =
  1682             strip (n-1) ps (implies_elim th (assume p))
  1683           | strip _ _ _ = raise ERR "CHOOSE" "strip error"
  1684         val cv = cterm_of thy v'
  1685         val th2 = norm_hyps th2
  1686         val cvty = ctyp_of_term cv
  1687         val c = HOLogic.dest_Trueprop (concl_of th2)
  1688         val cc = cterm_of thy c
  1689         val a = case concl_of th1 of
  1690                     _ $ (Const("Ex",_) $ a) => a
  1691                   | _ => raise ERR "CHOOSE" "Conclusion not existential"
  1692         val ca = cterm_of (theory_of_thm th1) a
  1693         val choose_thm' = beta_eta_thm (Drule.instantiate' [SOME cvty] [SOME ca,SOME cc] choose_thm)
  1694         val th21 = rearrange thy (HOLogic.mk_Trueprop (a $ v')) th2
  1695         val th22 = strip ((nprems_of th21)-1) (cprems_of th21) th21
  1696         val th23 = beta_eta_thm (forall_intr cv th22)
  1697         val th11 = implies_elim_all (beta_eta_thm th1)
  1698         val th' = th23 COMP (th11 COMP choose_thm')
  1699         val th = implies_intr_hyps th'
  1700         val res = HOLThm(rens_of info',th)
  1701         val _   = message "RESULT:"
  1702         val _   = if_debug pth res
  1703     in
  1704         (thy,res)
  1705     end
  1706 
  1707 fun GEN v hth thy =
  1708     let
  1709       val _ = message "GEN:"
  1710         val _ = if_debug prin v
  1711         val _ = if_debug pth hth
  1712         val (info,th) = disamb_thm hth
  1713         val (info',v') = disamb_term_from info v
  1714         val res = HOLThm(rens_of info',mk_GEN v' th thy)
  1715         val _ = message "RESULT:"
  1716         val _ = if_debug pth res
  1717     in
  1718         (thy,res)
  1719     end
  1720 
  1721 fun SPEC tm hth thy =
  1722     let
  1723         val _ = message "SPEC:"
  1724         val _ = if_debug prin tm
  1725         val _ = if_debug pth hth
  1726         val (info,th) = disamb_thm hth
  1727         val (info',tm') = disamb_term_from info tm
  1728         val ctm = Thm.cterm_of thy tm'
  1729         val cty = Thm.ctyp_of_term ctm
  1730         val spec' = Drule.instantiate' [SOME cty] [NONE,SOME ctm] spec_thm
  1731         val th = th RS spec'
  1732         val res = HOLThm(rens_of info',th)
  1733         val _ = message "RESULT:"
  1734         val _ = if_debug pth res
  1735     in
  1736         (thy,res)
  1737     end
  1738 
  1739 fun COMB hth1 hth2 thy =
  1740     let
  1741         val _ = message "COMB:"
  1742         val _ = if_debug pth hth1
  1743         val _ = if_debug pth hth2
  1744         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1745         val res = HOLThm(rens_of info,mk_COMB th1 th2 thy)
  1746         val _ = message "RESULT:"
  1747         val _ = if_debug pth res
  1748     in
  1749         (thy,res)
  1750     end
  1751 
  1752 fun TRANS hth1 hth2 thy =
  1753     let
  1754         val _ = message "TRANS:"
  1755         val _ = if_debug pth hth1
  1756         val _ = if_debug pth hth2
  1757         val (info,[th1,th2]) = disamb_thms [hth1,hth2]
  1758         val th = [th1,th2] MRS trans_thm
  1759         val res = HOLThm(rens_of info,th)
  1760         val _ = message "RESULT:"
  1761         val _ = if_debug pth res
  1762     in
  1763         (thy,res)
  1764     end
  1765 
  1766 
  1767 fun CCONTR tm hth thy =
  1768     let
  1769         val _ = message "SPEC:"
  1770         val _ = if_debug prin tm
  1771         val _ = if_debug pth hth
  1772         val (info,th) = disamb_thm hth
  1773         val (info',tm') = disamb_term_from info tm
  1774         val th = norm_hyps th
  1775         val ct = cterm_of thy tm'
  1776         val th1 = rearrange thy (HOLogic.mk_Trueprop (Const("Not",boolT-->boolT) $ tm')) th
  1777         val ccontr_thm' = Drule.instantiate' [] [SOME ct] ccontr_thm
  1778         val res1 = uniq_compose ((nprems_of th1) - 1) th1 1 ccontr_thm'
  1779         val res = HOLThm(rens_of info',res1)
  1780         val _ = message "RESULT:"
  1781         val _ = if_debug pth res
  1782     in
  1783         (thy,res)
  1784     end
  1785 
  1786 fun mk_ABS v th thy =
  1787     let
  1788         val cv = cterm_of thy v
  1789         val th1 = implies_elim_all (beta_eta_thm th)
  1790         val (f,g) = case concl_of th1 of
  1791                         _ $ (Const("op =",_) $ f $ g) => (Term.lambda v f,Term.lambda v g)
  1792                       | _ => raise ERR "mk_ABS" "Bad conclusion"
  1793         val (fd,fr) = dom_rng (type_of f)
  1794         val abs_thm' = Drule.instantiate' [SOME (ctyp_of thy fd), SOME (ctyp_of thy fr)] [SOME (cterm_of thy f), SOME (cterm_of thy g)] abs_thm
  1795         val th2 = forall_intr cv th1
  1796         val th3 = th2 COMP abs_thm'
  1797         val res = implies_intr_hyps th3
  1798     in
  1799         res
  1800     end
  1801 
  1802 fun ABS v hth thy =
  1803     let
  1804         val _ = message "ABS:"
  1805         val _ = if_debug prin v
  1806         val _ = if_debug pth hth
  1807         val (info,th) = disamb_thm hth
  1808         val (info',v') = disamb_term_from info v
  1809         val res = HOLThm(rens_of info',mk_ABS v' th thy)
  1810         val _ = message "RESULT:"
  1811         val _ = if_debug pth res
  1812     in
  1813         (thy,res)
  1814     end
  1815 
  1816 fun GEN_ABS copt vlist hth thy =
  1817     let
  1818         val _ = message "GEN_ABS:"
  1819         val _ = case copt of
  1820                     SOME c => if_debug prin c
  1821                   | NONE => ()
  1822         val _ = if_debug (app prin) vlist
  1823         val _ = if_debug pth hth
  1824         val (info,th) = disamb_thm hth
  1825         val (info',vlist') = disamb_terms_from info vlist
  1826         val th1 =
  1827             case copt of
  1828                 SOME (c as Const(cname,cty)) =>
  1829                 let
  1830                     fun inst_type ty1 ty2 (TVar _) = raise ERR "GEN_ABS" "Type variable found!"
  1831                       | inst_type ty1 ty2 (ty as TFree _) = if ty1 = ty
  1832                                                             then ty2
  1833                                                             else ty
  1834                       | inst_type ty1 ty2 (ty as Type(name,tys)) =
  1835                         Type(name,map (inst_type ty1 ty2) tys)
  1836                 in
  1837                     List.foldr (fn (v,th) =>
  1838                               let
  1839                                   val cdom = fst (dom_rng (fst (dom_rng cty)))
  1840                                   val vty  = type_of v
  1841                                   val newcty = inst_type cdom vty cty
  1842                                   val cc = cterm_of thy (Const(cname,newcty))
  1843                               in
  1844                                   mk_COMB (mk_REFL cc) (mk_ABS v th thy) thy
  1845                               end) th vlist'
  1846                 end
  1847               | SOME _ => raise ERR "GEN_ABS" "Bad constant"
  1848               | NONE =>
  1849                 List.foldr (fn (v,th) => mk_ABS v th thy) th vlist'
  1850         val res = HOLThm(rens_of info',th1)
  1851         val _ = message "RESULT:"
  1852         val _ = if_debug pth res
  1853     in
  1854         (thy,res)
  1855     end
  1856 
  1857 fun NOT_INTRO (hth as HOLThm(rens,th)) thy =
  1858     let
  1859         val _ = message "NOT_INTRO:"
  1860         val _ = if_debug pth hth
  1861         val th1 = implies_elim_all (beta_eta_thm th)
  1862         val a = case concl_of th1 of
  1863                     _ $ (Const("op -->",_) $ a $ Const("False",_)) => a
  1864                   | _ => raise ERR "NOT_INTRO" "Conclusion of bad form"
  1865         val ca = cterm_of thy a
  1866         val th2 = equal_elim (Drule.instantiate' [] [SOME ca] not_intro_thm) th1
  1867         val res = HOLThm(rens,implies_intr_hyps th2)
  1868         val _ = message "RESULT:"
  1869         val _ = if_debug pth res
  1870     in
  1871         (thy,res)
  1872     end
  1873 
  1874 fun NOT_ELIM (hth as HOLThm(rens,th)) thy =
  1875     let
  1876         val _ = message "NOT_INTRO:"
  1877         val _ = if_debug pth hth
  1878         val th1 = implies_elim_all (beta_eta_thm th)
  1879         val a = case concl_of th1 of
  1880                     _ $ (Const("Not",_) $ a) => a
  1881                   | _ => raise ERR "NOT_ELIM" "Conclusion of bad form"
  1882         val ca = cterm_of thy a
  1883         val th2 = equal_elim (Drule.instantiate' [] [SOME ca] not_elim_thm) th1
  1884         val res = HOLThm(rens,implies_intr_hyps th2)
  1885         val _ = message "RESULT:"
  1886         val _ = if_debug pth res
  1887     in
  1888         (thy,res)
  1889     end
  1890 
  1891 fun DISCH tm hth thy =
  1892     let
  1893         val _ = message "DISCH:"
  1894         val _ = if_debug prin tm
  1895         val _ = if_debug pth hth
  1896         val (info,th) = disamb_thm hth
  1897         val (info',tm') = disamb_term_from info tm
  1898         val prems = prems_of th
  1899         val th1 = beta_eta_thm th
  1900         val th2 = implies_elim_all th1
  1901         val th3 = implies_intr (cterm_of thy (HOLogic.mk_Trueprop tm')) th2
  1902         val th4 = th3 COMP disch_thm
  1903         val res = HOLThm(rens_of info',implies_intr_hyps th4)
  1904         val _ = message "RESULT:"
  1905         val _ = if_debug pth res
  1906     in
  1907         (thy,res)
  1908     end
  1909 
  1910 val spaces = String.concat o separate " "
  1911 
  1912 fun new_definition thyname constname rhs thy =
  1913     let
  1914         val constname = rename_const thyname thy constname
  1915         val redeclared = isSome (Sign.const_type thy (Sign.intern_const thy constname));
  1916         val _ = warning ("Introducing constant " ^ constname)
  1917         val (thmname,thy) = get_defname thyname constname thy
  1918         val (info,rhs') = disamb_term rhs
  1919         val ctype = type_of rhs'
  1920         val csyn = mk_syn thy constname
  1921         val thy1 = case HOL4DefThy.get thy of
  1922                        Replaying _ => thy
  1923                      | _ => (ImportRecorder.add_consts [(constname, ctype, csyn)];
  1924                               Sign.add_consts_i [(Binding.name constname,ctype,csyn)] thy)
  1925         val eq = mk_defeq constname rhs' thy1
  1926         val (thms, thy2) = PureThy.add_defs false [((Binding.name thmname,eq),[])] thy1
  1927         val _ = ImportRecorder.add_defs thmname eq
  1928         val def_thm = hd thms
  1929         val thm' = def_thm RS meta_eq_to_obj_eq_thm
  1930         val (thy',th) = (thy2, thm')
  1931         val fullcname = Sign.intern_const thy' constname
  1932         val thy'' = add_hol4_const_mapping thyname constname true fullcname thy'
  1933         val _ = ImportRecorder.add_hol_const_mapping thyname constname fullcname
  1934         val (linfo,tm24) = disamb_term (mk_teq constname rhs' thy'')
  1935         val rew = rewrite_hol4_term eq thy''
  1936         val crhs = cterm_of thy'' (#2 (Logic.dest_equals (prop_of rew)))
  1937         val thy22 = if Thm.def_name constname = thmname andalso not redeclared andalso csyn = NoSyn
  1938                     then
  1939                         let
  1940                             val p1 = quotename constname
  1941                             val p2 = Display.string_of_ctyp (ctyp_of thy'' ctype)
  1942                             val p3 = string_of_mixfix csyn
  1943                             val p4 = smart_string_of_cterm crhs
  1944                         in
  1945                             add_dump ("constdefs\n  " ^p1^ " :: \"" ^p2^ "\" "^p3^ "\n  " ^p4) thy''
  1946                         end
  1947                     else
  1948                         (add_dump ("consts\n  " ^ (quotename constname) ^ " :: \"" ^ Display.string_of_ctyp (ctyp_of thy'' ctype) ^
  1949                                    "\" " ^ (string_of_mixfix csyn) ^ "\n\ndefs\n  " ^ (quotename thmname) ^ ": " ^ (smart_string_of_cterm crhs))
  1950                                   thy'')
  1951         val hth = case Shuffler.set_prop thy22 (HOLogic.mk_Trueprop tm24) [("",th)] of
  1952                       SOME (_,res) => HOLThm(rens_of linfo,res)
  1953                     | NONE => raise ERR "new_definition" "Bad conclusion"
  1954         val fullname = Sign.full_bname thy22 thmname
  1955         val thy22' = case opt_get_output_thy thy22 of
  1956                          "" => (ImportRecorder.add_hol_mapping thyname thmname fullname;
  1957                                 add_hol4_mapping thyname thmname fullname thy22)
  1958                        | output_thy =>
  1959                          let
  1960                              val moved_thmname = output_thy ^ "." ^ thyname ^ "." ^ thmname
  1961                              val _ = ImportRecorder.add_hol_move fullname moved_thmname
  1962                              val _ = ImportRecorder.add_hol_mapping thyname thmname moved_thmname
  1963                          in
  1964                              thy22 |> add_hol4_move fullname moved_thmname
  1965                                    |> add_hol4_mapping thyname thmname moved_thmname
  1966                          end
  1967         val _ = message "new_definition:"
  1968         val _ = if_debug pth hth
  1969     in
  1970         (thy22',hth)
  1971     end
  1972     handle e => (message "exception in new_definition"; print_exn e)
  1973 
  1974 local
  1975     val helper = thm "termspec_help"
  1976 in
  1977 fun new_specification thyname thmname names hth thy =
  1978     case HOL4DefThy.get thy of
  1979         Replaying _ => (thy,hth)
  1980       | _ =>
  1981         let
  1982             val _ = message "NEW_SPEC:"
  1983             val _ = if_debug pth hth
  1984             val names = map (rename_const thyname thy) names
  1985             val _ = warning ("Introducing constants " ^ commas names)
  1986             val (HOLThm(rens,th)) = norm_hthm thy hth
  1987             val thy1 = case HOL4DefThy.get thy of
  1988                            Replaying _ => thy
  1989                          | _ =>
  1990                            let
  1991                                fun dest_eta_abs (Abs(x,xT,body)) = (x,xT,body)
  1992                                  | dest_eta_abs body =
  1993                                    let
  1994                                        val (dT,rT) = dom_rng (type_of body)
  1995                                    in
  1996                                        ("x",dT,body $ Bound 0)
  1997                                    end
  1998                                    handle TYPE _ => raise ERR "new_specification" "not an abstraction type"
  1999                                fun dest_exists (Const("Ex",_) $ abody) =
  2000                                    dest_eta_abs abody
  2001                                  | dest_exists tm =
  2002                                    raise ERR "new_specification" "Bad existential formula"
  2003 
  2004                                val (consts,_) = Library.foldl (fn ((cs,ex),cname) =>
  2005                                                           let
  2006                                                               val (_,cT,p) = dest_exists ex
  2007                                                           in
  2008                                                               ((cname,cT,mk_syn thy cname)::cs,p)
  2009                                                           end) (([],HOLogic.dest_Trueprop (concl_of th)),names)
  2010                                val str = Library.foldl (fn (acc,(c,T,csyn)) =>
  2011                                                    acc ^ "\n  " ^ (quotename c) ^ " :: \"" ^ Display.string_of_ctyp (ctyp_of thy T) ^ "\" " ^ (string_of_mixfix csyn)) ("consts",consts)
  2012                                val thy' = add_dump str thy
  2013                                val _ = ImportRecorder.add_consts consts
  2014                            in
  2015                                Sign.add_consts_i (map (fn (c, T, mx) => (Binding.name c, T, mx)) consts) thy'
  2016                            end
  2017 
  2018             val thy1 = List.foldr (fn(name,thy)=>
  2019                                 snd (get_defname thyname name thy)) thy1 names
  2020             fun new_name name = fst (get_defname thyname name thy1)
  2021             val names' = map (fn name => (new_name name,name,false)) names
  2022             val (thy',res) = Choice_Specification.add_specification NONE
  2023                                  names'
  2024                                  (thy1,th)
  2025             val _ = ImportRecorder.add_specification names' th
  2026             val res' = Thm.unvarify res
  2027             val hth = HOLThm(rens,res')
  2028             val rew = rewrite_hol4_term (concl_of res') thy'
  2029             val th  = equal_elim rew res'
  2030             fun handle_const (name,thy) =
  2031                 let
  2032                     val defname = Thm.def_name name
  2033                     val (newname,thy') = get_defname thyname name thy
  2034                 in
  2035                     (if defname = newname
  2036                      then quotename name
  2037                      else (quotename newname) ^ ": " ^ (quotename name),thy')
  2038                 end
  2039             val (new_names,thy') = List.foldr (fn(name,(names,thy)) =>
  2040                                             let
  2041                                                 val (name',thy') = handle_const (name,thy)
  2042                                             in
  2043                                                 (name'::names,thy')
  2044                                             end) ([],thy') names
  2045             val thy'' = add_dump ("specification (" ^ (spaces new_names) ^ ") " ^ thmname ^ ": " ^ (smart_string_of_thm th) ^
  2046                                   "\n  by (import " ^ thyname ^ " " ^ thmname ^ ")")
  2047                                  thy'
  2048             val _ = message "RESULT:"
  2049             val _ = if_debug pth hth
  2050         in
  2051             intern_store_thm false thyname thmname hth thy''
  2052         end
  2053         handle e => (message "exception in new_specification"; print_exn e)
  2054 
  2055 end
  2056 
  2057 fun new_axiom name tm thy = raise ERR "new_axiom" ("Oh, no you don't! (" ^ name ^ ")")
  2058 
  2059 fun to_isa_thm (hth as HOLThm(_,th)) =
  2060     let
  2061         val (HOLThm args) = norm_hthm (theory_of_thm th) hth
  2062     in
  2063         apsnd strip_shyps args
  2064     end
  2065 
  2066 fun to_isa_term tm = tm
  2067 
  2068 local
  2069     val light_nonempty = thm "light_ex_imp_nonempty"
  2070     val ex_imp_nonempty = thm "ex_imp_nonempty"
  2071     val typedef_hol2hol4 = thm "typedef_hol2hol4"
  2072     val typedef_hol2hollight = thm "typedef_hol2hollight"
  2073 in
  2074 fun new_type_definition thyname thmname tycname hth thy =
  2075     case HOL4DefThy.get thy of
  2076         Replaying _ => (thy,hth)
  2077       | _ =>
  2078         let
  2079             val _ = message "TYPE_DEF:"
  2080             val _ = if_debug pth hth
  2081             val _ = warning ("Introducing type " ^ tycname)
  2082             val (HOLThm(rens,td_th)) = norm_hthm thy hth
  2083             val th2 = beta_eta_thm (td_th RS ex_imp_nonempty)
  2084             val c = case concl_of th2 of
  2085                         _ $ (Const("Ex",_) $ Abs(_,_,Const("op :",_) $ _ $ c)) => c
  2086                       | _ => raise ERR "new_type_definition" "Bad type definition theorem"
  2087             val tfrees = OldTerm.term_tfrees c
  2088             val tnames = map fst tfrees
  2089             val tsyn = mk_syn thy tycname
  2090             val typ = (tycname,tnames,tsyn)
  2091             val ((_, typedef_info), thy') =
  2092               Typedef.add_typedef false (SOME (Binding.name thmname))
  2093                 (Binding.name tycname, tnames, tsyn) c NONE (rtac th2 1) thy
  2094             val _ = ImportRecorder.add_typedef (SOME thmname) typ c NONE th2
  2095 
  2096             val th3 = (#type_definition typedef_info) RS typedef_hol2hol4
  2097 
  2098             val fulltyname = Sign.intern_type thy' tycname
  2099             val thy'' = add_hol4_type_mapping thyname tycname true fulltyname thy'
  2100             val _ = ImportRecorder.add_hol_type_mapping thyname tycname fulltyname
  2101 
  2102             val (hth' as HOLThm args) = norm_hthm thy'' (HOLThm(rens,th3))
  2103             val _ = if has_ren hth' then warning ("Theorem " ^ thmname ^ " needs variable-disambiguating")
  2104                     else ()
  2105             val thy4 = add_hol4_pending thyname thmname args thy''
  2106             val _ = ImportRecorder.add_hol_pending thyname thmname (hthm2thm hth')
  2107 
  2108             val rew = rewrite_hol4_term (concl_of td_th) thy4
  2109             val th  = equal_elim rew (Thm.transfer thy4 td_th)
  2110             val c   = case HOLogic.dest_Trueprop (prop_of th) of
  2111                           Const("Ex",exT) $ P =>
  2112                           let
  2113                               val PT = domain_type exT
  2114                           in
  2115                               Const("Collect",PT-->HOLogic.mk_setT (domain_type PT)) $ P
  2116                           end
  2117                         | _ => error "Internal error in ProofKernel.new_typedefinition"
  2118             val tnames_string = if null tnames
  2119                                 then ""
  2120                                 else "(" ^ commas tnames ^ ") "
  2121             val proc_prop = if null tnames
  2122                             then smart_string_of_cterm
  2123                             else Library.setmp show_all_types true smart_string_of_cterm
  2124             val thy5 = add_dump ("typedef (open) " ^ tnames_string ^ (quotename tycname) ^ " = " ^ (proc_prop (cterm_of thy4 c)) ^ " "
  2125                                  ^ (string_of_mixfix tsyn) ^ "\n  by (rule typedef_helper,import " ^ thyname ^ " " ^ thmname ^ ")") thy4
  2126 
  2127             val thy6 = add_dump ("lemmas " ^ thmname ^ " = typedef_hol2hol4 [OF type_definition_" ^ tycname ^ "]") thy5
  2128 
  2129             val _ = message "RESULT:"
  2130             val _ = if_debug pth hth'
  2131         in
  2132             (thy6,hth')
  2133         end
  2134         handle e => (message "exception in new_type_definition"; print_exn e)
  2135 
  2136 fun add_dump_constdefs thy defname constname rhs ty =
  2137     let
  2138         val n = quotename constname
  2139         val t = Display.string_of_ctyp (ctyp_of thy ty)
  2140         val syn = string_of_mixfix (mk_syn thy constname)
  2141         (*val eq = smart_string_of_cterm (cterm_of thy (Const(rhs, ty)))*)
  2142         val eq = quote (constname ^ " == "^rhs)
  2143         val d = case defname of NONE => "" | SOME defname => (quotename defname)^" : "
  2144     in
  2145         add_dump ("constdefs\n  " ^ n ^ " :: \"" ^ t ^ "\" " ^ syn ^ "\n  " ^ d ^ eq) thy
  2146     end
  2147 
  2148 fun add_dump_syntax thy name =
  2149     let
  2150       val n = quotename name
  2151       val syn = string_of_mixfix (mk_syn thy name)
  2152     in
  2153       add_dump ("syntax\n  "^n^" :: _ "^syn) thy
  2154     end
  2155 
  2156 fun type_introduction thyname thmname tycname abs_name rep_name (P,t) hth thy =
  2157     case HOL4DefThy.get thy of
  2158         Replaying _ => (thy,
  2159           HOLThm([], PureThy.get_thm thy (thmname^"_@intern")) handle ERROR _ => hth)
  2160       | _ =>
  2161         let
  2162             val _ = message "TYPE_INTRO:"
  2163             val _ = if_debug pth hth
  2164             val _ = warning ("Introducing type " ^ tycname ^ " (with morphisms " ^ abs_name ^ " and " ^ rep_name ^ ")")
  2165             val (HOLThm(rens,td_th)) = norm_hthm thy hth
  2166             val tT = type_of t
  2167             val light_nonempty' =
  2168                 Drule.instantiate' [SOME (ctyp_of thy tT)]
  2169                                    [SOME (cterm_of thy P),
  2170                                     SOME (cterm_of thy t)] light_nonempty
  2171             val th2 = beta_eta_thm (td_th RS (beta_eta_thm light_nonempty'))
  2172             val c = case concl_of th2 of
  2173                         _ $ (Const("Ex",_) $ Abs(_,_,Const("op :",_) $ _ $ c)) => c
  2174                       | _ => raise ERR "type_introduction" "Bad type definition theorem"
  2175             val tfrees = OldTerm.term_tfrees c
  2176             val tnames = sort string_ord (map fst tfrees)
  2177             val tsyn = mk_syn thy tycname
  2178             val typ = (tycname,tnames,tsyn)
  2179             val ((_, typedef_info), thy') =
  2180               Typedef.add_typedef false NONE (Binding.name tycname,tnames,tsyn) c
  2181                 (SOME(Binding.name rep_name,Binding.name abs_name)) (rtac th2 1) thy
  2182             val _ = ImportRecorder.add_typedef NONE typ c (SOME(rep_name,abs_name)) th2
  2183             val fulltyname = Sign.intern_type thy' tycname
  2184             val aty = Type (fulltyname, map mk_vartype tnames)
  2185             val abs_ty = tT --> aty
  2186             val rep_ty = aty --> tT
  2187             val typedef_hol2hollight' =
  2188                 Drule.instantiate'
  2189                     [SOME (ctyp_of thy' aty), SOME (ctyp_of thy' tT)]
  2190                     [NONE, NONE, NONE, SOME (cterm_of thy' (Free ("a", aty))), SOME (cterm_of thy' (Free ("r", tT)))]
  2191                     typedef_hol2hollight
  2192             val th4 = (#type_definition typedef_info) RS typedef_hol2hollight'
  2193             val _ = null (Thm.fold_terms Term.add_tvars th4 []) orelse
  2194               raise ERR "type_introduction" "no type variables expected any more"
  2195             val _ = null (Thm.fold_terms Term.add_vars th4 []) orelse
  2196               raise ERR "type_introduction" "no term variables expected any more"
  2197             val _ = message ("step 3: thyname="^thyname^", tycname="^tycname^", fulltyname="^fulltyname)
  2198             val thy'' = add_hol4_type_mapping thyname tycname true fulltyname thy'
  2199             val _ = ImportRecorder.add_hol_type_mapping thyname tycname fulltyname
  2200             val _ = message "step 4"
  2201             val (hth' as HOLThm args) = norm_hthm thy'' (HOLThm(rens,th4))
  2202             val thy4 = add_hol4_pending thyname thmname args thy''
  2203             val _ = ImportRecorder.add_hol_pending thyname thmname (hthm2thm hth')
  2204 
  2205             val P' = P (* why !? #2 (Logic.dest_equals (concl_of (rewrite_hol4_term P thy4))) *)
  2206             val c   =
  2207                 let
  2208                     val PT = type_of P'
  2209                 in
  2210                     Const("Collect",PT-->HOLogic.mk_setT (domain_type PT)) $ P'
  2211                 end
  2212 
  2213             val tnames_string = if null tnames
  2214                                 then ""
  2215                                 else "(" ^ commas tnames ^ ") "
  2216             val proc_prop = if null tnames
  2217                             then smart_string_of_cterm
  2218                             else Library.setmp show_all_types true smart_string_of_cterm
  2219             val thy = add_dump ("typedef (open) " ^ tnames_string ^ (quotename tycname) ^
  2220               " = " ^ (proc_prop (cterm_of thy4 c)) ^ " " ^
  2221               (string_of_mixfix tsyn) ^ " morphisms "^
  2222               (quote rep_name)^" "^(quote abs_name)^"\n"^
  2223               ("  apply (rule light_ex_imp_nonempty[where t="^
  2224               (proc_prop (cterm_of thy4 t))^"])\n"^
  2225               ("  by (import " ^ thyname ^ " " ^ (quotename thmname) ^ ")"))) thy4
  2226             val str_aty = Display.string_of_ctyp (ctyp_of thy aty)
  2227             val thy = add_dump_syntax thy rep_name
  2228             val thy = add_dump_syntax thy abs_name
  2229             val thy = add_dump ("lemmas " ^ (quote (thmname^"_@intern")) ^
  2230               " = typedef_hol2hollight \n"^
  2231               "  [where a=\"a :: "^str_aty^"\" and r=r" ^
  2232               " ,\n   OF "^(quotename ("type_definition_" ^ tycname)) ^ "]") thy
  2233             val _ = message "RESULT:"
  2234             val _ = if_debug pth hth'
  2235         in
  2236             (thy,hth')
  2237         end
  2238         handle e => (message "exception in type_introduction"; print_exn e)
  2239 end
  2240 
  2241 val prin = prin
  2242 
  2243 end