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