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