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