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