1 (* Title: HOL/Import/proof_kernel.ML
2 Author: Sebastian Skalberg and Steven Obua, TU Muenchen
5 signature ProofKernel =
14 datatype proof = Proof of proof_info * proof_content
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
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
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
36 | PTrans of proof * proof
37 | PComb of proof * proof
38 | PEqMp of proof * proof
40 | PExists of proof * term * term
41 | PChoose of term * proof * proof
42 | PConj of proof * proof
45 | PDisj1 of proof * term
46 | PDisj2 of proof * term
47 | PDisjCases of proof * proof * proof
50 | PContr of proof * term
52 exception PK of string * string
54 val get_proof_dir: string -> theory -> string option
55 val disambiguate_frees : Thm.thm -> Thm.thm
56 val debug : bool Unsynchronized.ref
57 val disk_info_of : proof -> (string * string) option
58 val set_disk_info_of : proof -> string -> string -> unit
59 val mk_proof : proof_content -> proof
60 val content_of : proof -> proof_content
61 val import_proof : string -> string -> theory -> (theory -> term) option * (theory -> proof)
63 val rewrite_hol4_term: Term.term -> theory -> Thm.thm
65 val type_of : term -> hol_type
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)
71 val store_thm : string -> string -> thm -> theory -> theory * thm
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
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
106 val type_introduction: string -> string -> string -> string -> string -> term * term -> thm -> theory -> theory * thm
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
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
119 structure ProofKernel :> ProofKernel =
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
127 fun hthm2thm (HOLThm (_, th)) = th
129 fun to_hol_thm th = HOLThm ([], th)
131 val replay_add_dump = add_dump
132 fun add_dump s thy = (ImportRecorder.add_dump s; replay_add_dump s thy)
135 = Info of {disk_info: (string * string) option Unsynchronized.ref}
137 datatype proof = Proof of proof_info * proof_content
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
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
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
159 | PTrans of proof * proof
160 | PComb of proof * proof
161 | PEqMp of proof * 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
173 | PContr of proof * term
175 exception PK of string * string
176 fun ERR f mesg = PK (f,mesg)
180 PK (m,s) => (writeln ("PK (" ^ m ^ "): " ^ s); raise e)
181 | _ => OldGoals.print_exn e
185 val string_of_mixfix = Pretty.string_of o Syntax.pretty_mixfix;
188 if Syntax.is_identifier c andalso not (Syntax.is_keyword (Sign.syn_of thy) c) then NoSyn
189 else Delimfix (Syntax.escape c)
192 if Syntax.is_identifier c andalso not (Keyword.is_keyword c) then c else quote c
194 fun simple_smart_string_of_cterm ct =
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)
204 setmp_CRITICAL show_brackets false (
205 setmp_CRITICAL show_all_types true (
206 setmp_CRITICAL Syntax.ambiguity_is_error false (
207 setmp_CRITICAL show_sorts true (Syntax.string_of_term_global thy o Thm.term_of)))))
211 exception SMART_STRING
213 fun smart_string_of_cterm ct =
215 val thy = Thm.theory_of_cterm ct
216 val ctxt = ProofContext.init_global 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)
221 fun match u = t aconv u
222 fun G 0 = setmp_CRITICAL show_types true (setmp_CRITICAL show_sorts true)
223 | G 1 = setmp_CRITICAL show_brackets true (G 0)
224 | G 2 = setmp_CRITICAL show_all_types true (G 0)
225 | G 3 = setmp_CRITICAL show_brackets true (G 2)
226 | G _ = raise SMART_STRING
230 setmp_CRITICAL show_brackets false (G n (Syntax.string_of_term ctxt o term_of)) ct
231 val u = Syntax.parse_term ctxt str
232 |> TypeInfer.constrain T |> Syntax.check_term ctxt
238 handle ERROR mesg => F (n + 1)
240 error ("smart_string failed for: "^ G 0 (Syntax.string_of_term ctxt o term_of) ct)
242 PrintMode.setmp [] (setmp_CRITICAL Syntax.ambiguity_is_error true F) 0
244 handle ERROR mesg => simple_smart_string_of_cterm ct
246 val smart_string_of_thm = smart_string_of_cterm o cprop_of
248 fun prth th = writeln (PrintMode.setmp [] Display.string_of_thm_without_context th);
249 fun prin t = writeln (PrintMode.setmp []
250 (fn () => Syntax.string_of_term (ML_Context.the_local_context ()) t) ());
251 fun pth (HOLThm(ren,thm)) =
253 (*val _ = writeln "Renaming:"
254 val _ = app (fn(v,w) => (prin v; writeln " -->"; prin w)) ren*)
260 fun disk_info_of (Proof(Info{disk_info,...},_)) = !disk_info
261 fun mk_proof p = Proof(Info{disk_info = Unsynchronized.ref NONE},p)
262 fun content_of (Proof(_,p)) = p
264 fun set_disk_info_of (Proof(Info{disk_info,...},_)) thyname thmname =
265 disk_info := SOME(thyname,thmname)
272 fun F [] = raise PK("Lib.assoc","Not found")
273 | F ((x',y)::rest) = if x = x'
281 let fun itr [] = false
282 | itr (a::rst) = i=a orelse itr rst
288 | (a::rst) union S2 = rst union (insert (op =) a S2);
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"
299 val empty_tag = Tag []
300 fun read name = Tag [name]
301 fun merge (Tag tag1) (Tag tag2) = Tag (Lib.union(tag1,tag2))
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"
317 exception XML of string
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
327 val (x,toks2) = one Char.isAlpha toks
328 val (xs,toks3) = any Char.isAlphaNum toks2
330 (String.implode (x::xs),toks3)
333 fun scan_string str c =
335 fun F [] toks = (c,toks)
337 case LazySeq.getItem toks of
341 else raise SyntaxError
342 | NONE => raise SyntaxError
344 F (String.explode str)
349 (scan_string "amp;" #"&")
350 || scan_string "quot;" #"\""
351 || scan_string "gt;" #">"
352 || scan_string "lt;" #"<"
353 || scan_string "apos;" #"'"
355 fun scan_nonquote toks =
356 case LazySeq.getItem toks of
359 #"\"" => raise SyntaxError
360 | #"&" => scan_entity toks'
362 | NONE => raise SyntaxError
365 val scan_string = $$ #"\"" |-- repeat scan_nonquote --| $$ #"\"" >>
368 val scan_attribute = scan_id -- $$ #"=" |-- scan_string
370 val scan_start_of_tag = $$ #"<" |-- scan_id --
371 repeat ($$ #" " |-- scan_attribute)
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
376 fun scan_end_of_tag toks = ($$ #"/" |-- $$ #">" |-- succeed []) toks
378 val scan_end_tag = $$ #"<" |-- $$ #"/" |-- scan_id --| $$ #">"
380 fun scan_children id = $$ #">" |-- repeat scan_tag -- scan_end_tag >>
381 (fn (chldr,id') => if id = id'
383 else raise XML "Tag mismatch")
386 val ((id,atts),toks2) = scan_start_of_tag toks
387 val (chldr,toks3) = (scan_children id || scan_end_of_tag) toks2
389 (Elem (id,atts,chldr),toks3)
393 val type_of = Term.type_of
395 val boolT = Type("bool",[])
396 val propT = Type("prop",[])
398 fun mk_defeq name rhs thy =
402 Logic.mk_equals (Const(Sign.intern_const thy name,ty),rhs)
405 fun mk_teq name rhs thy =
409 HOLogic.mk_eq (Const(Sign.intern_const thy name,ty),rhs)
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))
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)
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)
429 fun dom_rng (Type("fun",[dom,rng])) = (dom,rng)
430 | dom_rng _ = raise ERR "dom_rng" "Not a functional type"
432 fun mk_thy_const thy Thy Nam Ty = Const(intern_const_name Thy Nam thy,Ty)
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"))
440 fun prim_mk_const thy Thy Nam =
442 val name = intern_const_name Thy Nam thy
443 val cmaps = HOL4ConstMaps.get thy
445 case StringPair.lookup cmaps (Thy,Nam) of
446 SOME(_,_,SOME ty) => Const(name,ty)
447 | _ => get_const thy Thy name
451 fun mk_comb(f,a) = f $ a
453 (* Needed for HOL Light *)
454 fun protect_tyvarname s =
457 if Char.contains s #"?"
458 then String.translate (fn #"?" => "q_" | c => Char.toString c) s
461 if String.isPrefix "'" s
465 s |> no_quest |> beg_prime
468 val protected_varnames = Unsynchronized.ref (Symtab.empty:string Symtab.table)
469 val invented_isavar = Unsynchronized.ref 0
471 fun innocent_varname s = Syntax.is_identifier s andalso not (String.isPrefix "u_" s)
473 val check_name_thy = theory "Main"
475 fun valid_boundvarname s =
476 can (fn () => Syntax.read_term_global check_name_thy ("SOME "^s^". True")) ();
478 fun valid_varname s =
479 can (fn () => Syntax.read_term_global check_name_thy s) ();
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
487 val _ = Unsynchronized.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)
495 exception REPLAY_PROTECT_VARNAME of string*string*string
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')
502 val _ = Unsynchronized.inc invented_isavar
503 val t = "u_" ^ string_of_int (!invented_isavar)
504 val _ = protected_varnames := Symtab.update (s, t) (!protected_varnames)
509 fun protect_boundvarname s = if innocent_varname s andalso valid_boundvarname s then s else "u"
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]);
515 fun replacestr x y s =
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))
525 | r (S as (s::ss)) = if isp S then r (chg S) else s::(r ss)
527 implode(r (explode s))
530 fun protect_factname s = replacestr "." "_dot_" s
531 fun unprotect_factname s = replacestr "_dot_" "." s
533 val ty_num_prefix = "N_"
535 fun startsWithDigit s = Char.isDigit (hd (String.explode s))
537 fun protect_tyname 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)
546 fun protect_constname tcn = tcn
547 (* if tcn = ".." then "dotdot"
548 else if tcn = "==" then "eqeq"
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
560 val ty = get_type_from_xml thy thyname types xty
561 val _ = Array.update(types,i,FullType ty)
565 | NONE => raise ERR "get_type_from_index" "Bad index"
566 and get_type_from_xml thy thyname types =
568 fun gtfx (Elem("tyi",[("i",iS)],[])) =
569 get_type_from_index thy thyname types iS
570 | gtfx (Elem("tyc",atts,[])) =
572 (get_segment thyname atts)
573 (protect_tyname (get_name atts))
575 | gtfx (Elem("tyv",[("n",s)],[])) = mk_vartype (protect_tyvarname s)
576 | gtfx (Elem("tya",[],(Elem("tyc",atts,[]))::tys)) =
578 (get_segment thyname atts)
579 (protect_tyname (get_name atts))
581 | gtfx _ = raise ERR "get_type" "Bad type"
586 fun input_types thyname (Elem("tylist",[("i",i)],xtys)) =
588 val types = Array.array(the (Int.fromString i),XMLty (Elem("",[],[])))
591 (Array.update(types,n,XMLty xty);
597 | input_types _ _ = raise ERR "input_types" "Bad type list"
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
609 val tm = get_term_from_xml thy thyname types terms xtm
610 val _ = Array.update(terms,i,FullTerm tm)
614 | NONE => raise ERR "get_term_from_index" "Bad index"
615 and get_term_from_xml thy thyname types terms =
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"
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,[])) =
625 val segment = get_segment thyname atts
626 val name = protect_constname(get_name atts)
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
631 | gtfx (Elem("tma",[("f",tmf),("a",tma)],[])) =
633 val f = get_term_from_index thy thyname types terms tmf
634 val a = get_term_from_index thy thyname types terms tma
638 | gtfx (Elem("tml",[("x",tmx),("a",tma)],[])) =
640 val x = get_term_from_index thy thyname types terms tmx
641 val a = get_term_from_index thy thyname types terms tma
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)
653 fun input_terms thyname types (Elem("tmlist",[("i",i)],xtms)) =
655 val terms = Array.array(the (Int.fromString i), XMLtm (Elem("",[],[])))
659 (Array.update(terms,n,XMLtm xtm);
665 | input_terms _ _ _ = raise ERR "input_terms" "Bad term list"
668 fun get_proof_dir (thyname:string) thy =
671 case get_segment2 thyname thy of
673 | NONE => get_import_segment thy
674 val path = space_explode ":" (getenv "HOL4_PROOFS")
678 val dir = OS.Path.joinDirFile {dir = p,file=import_segment}
680 if OS.FileSys.isDir dir
683 end) handle OS.SysErr _ => find ps
685 Option.map (fn p => OS.Path.joinDirFile {dir = p, file = thyname}) (find path)
688 fun proof_file_name thyname thmname thy =
690 val path = case get_proof_dir thyname thy of
692 | NONE => error "Cannot find proof files"
693 val _ = OS.FileSys.mkDir path handle OS.SysErr _ => ()
695 OS.Path.joinDirFile {dir = path, file = OS.Path.joinBaseExt {base = (unprotect_factname thmname), ext = SOME "prf"}}
698 fun xml_to_proof thyname types terms prf thy =
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
703 fun index_to_term is =
704 TermNet.get_term_from_index thy thyname types terms is
706 fun x2p (Elem("prefl",[("i",is)],[])) = mk_proof (PRefl (index_to_term is))
707 | x2p (Elem("pinstt",[],p::lambda)) =
710 val lambda = implode_subst (map xml_to_hol_type lambda)
712 mk_proof (PInstT(p,lambda))
714 | x2p (Elem("psubst",[("i",is)],prf::prfs)) =
716 val tm = index_to_term is
718 val prfs = map x2p prfs
720 mk_proof (PSubst(prfs,tm,prf))
722 | x2p (Elem("pabs",[("i",is)],[prf])) =
725 val t = index_to_term is
727 mk_proof (PAbs (p,t))
729 | x2p (Elem("pdisch",[("i",is)],[prf])) =
732 val t = index_to_term is
734 mk_proof (PDisch (p,t))
736 | x2p (Elem("pmp",[],[prf1,prf2])) =
741 mk_proof (PMp(p1,p2))
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,[])) =
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
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)) =
759 val names = map (fn Elem("name",[("n",name)],[]) => name
760 | _ => raise ERR "x2p" "Bad proof (ptmspec)") names
762 mk_proof (PTmSpec(seg,names,x2p p))
764 | x2p (Elem("ptyintro",[("s",seg),("n",name),("a",abs_name),("r",rep_name)],[xP,xt,p])) =
766 val P = xml_to_term xP
767 val t = xml_to_term xt
769 mk_proof (PTyIntro(seg,protect_tyname name,protect_constname abs_name,protect_constname rep_name,P,t,x2p p))
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)) =
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 = fold_rev (Tag.merge o Tag.read) ors Tag.empty_tag
782 mk_proof (POracle(tg,map xml_to_term asl,xml_to_term c))
784 | x2p (Elem("pspec",[("i",is)],[prf])) =
787 val tm = index_to_term is
789 mk_proof (PSpec(p,tm))
791 | x2p (Elem("pinst",[],p::theta)) =
794 val theta = implode_subst (map xml_to_term theta)
796 mk_proof (PInst(p,theta))
798 | x2p (Elem("pgen",[("i",is)],[prf])) =
801 val tm = index_to_term is
803 mk_proof (PGen(p,tm))
805 | x2p (Elem("pgenabs",[],prf::tms)) =
808 val tml = map xml_to_term tms
810 mk_proof (PGenAbs(p,NONE,tml))
812 | x2p (Elem("pgenabs",[("i",is)],prf::tms)) =
815 val tml = map xml_to_term tms
817 mk_proof (PGenAbs(p,SOME (index_to_term is),tml))
819 | x2p (Elem("pimpas",[],[prf1,prf2])) =
824 mk_proof (PImpAS(p1,p2))
826 | x2p (Elem("psym",[],[prf])) =
832 | x2p (Elem("ptrans",[],[prf1,prf2])) =
837 mk_proof (PTrans(p1,p2))
839 | x2p (Elem("pcomb",[],[prf1,prf2])) =
844 mk_proof (PComb(p1,p2))
846 | x2p (Elem("peqmp",[],[prf1,prf2])) =
851 mk_proof (PEqMp(p1,p2))
853 | x2p (Elem("peqimp",[],[prf])) =
859 | x2p (Elem("pexists",[("e",ise),("w",isw)],[prf])) =
862 val ex = index_to_term ise
863 val w = index_to_term isw
865 mk_proof (PExists(p,ex,w))
867 | x2p (Elem("pchoose",[("i",is)],[prf1,prf2])) =
869 val v = index_to_term is
873 mk_proof (PChoose(v,p1,p2))
875 | x2p (Elem("pconj",[],[prf1,prf2])) =
880 mk_proof (PConj(p1,p2))
882 | x2p (Elem("pconjunct1",[],[prf])) =
886 mk_proof (PConjunct1 p)
888 | x2p (Elem("pconjunct2",[],[prf])) =
892 mk_proof (PConjunct2 p)
894 | x2p (Elem("pdisj1",[("i",is)],[prf])) =
897 val t = index_to_term is
899 mk_proof (PDisj1 (p,t))
901 | x2p (Elem("pdisj2",[("i",is)],[prf])) =
904 val t = index_to_term is
906 mk_proof (PDisj2 (p,t))
908 | x2p (Elem("pdisjcases",[],[prf1,prf2,prf3])) =
914 mk_proof (PDisjCases(p1,p2,p3))
916 | x2p (Elem("pnoti",[],[prf])) =
922 | x2p (Elem("pnote",[],[prf])) =
928 | x2p (Elem("pcontr",[("i",is)],[prf])) =
931 val t = index_to_term is
933 mk_proof (PContr (p,t))
935 | x2p xml = raise ERR "x2p" "Bad proof"
940 fun import_proof_concl thyname thmname thy =
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
947 Elem("proof",[],xtypes::xterms::prf::rest) =>
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
955 | [xtm] => SOME (f xtm)
956 | _ => raise ERR "import_proof" "Bad argument list"
958 | _ => raise ERR "import_proof" "Bad proof"
961 fun import_proof thyname thmname thy =
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
968 Elem("proof",[],xtypes::xterms::prf::rest) =>
970 val types = TypeNet.input_types thyname xtypes
971 val terms = TermNet.input_terms thyname types xterms
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)
979 | _ => raise ERR "import_proof" "Bad proof"
982 fun uniq_compose m th i st =
984 val res = Thm.bicompose false (false,th,m) i st
987 SOME (th,rest) => (case Seq.pull rest of
988 SOME _ => raise ERR "uniq_compose" "Not unique!"
990 | NONE => raise ERR "uniq_compose" "No result"
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"
1000 val meta_eq_to_obj_eq_thm = thm "meta_eq_to_obj_eq"
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"
1014 val th = thm "not_def"
1015 val thy = theory_of_thm th
1016 val pp = Thm.reflexive (cterm_of thy (Const("Trueprop",boolT-->propT)))
1018 val not_elim_thm = Thm.combination pp th
1021 val not_intro_thm = 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"
1030 (* Beta-eta normalizes a theorem (only the conclusion, not the *
1033 fun beta_eta_thm th =
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
1041 fun implies_elim_all th =
1042 Library.foldl (fn (th,p) => Thm.implies_elim th (Thm.assume p)) (th,cprems_of th)
1047 |> implies_intr_hyps
1049 fun mk_GEN v th sg =
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 (Thm.forall_intr cv th1)
1058 val th3 = th2 COMP (beta_eta_thm (Drule.instantiate' [SOME cvty] [SOME clc] gen_thm))
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
1072 fun rearrange sg tm th =
1074 val tm' = Envir.beta_eta_contract tm
1075 fun find [] n = Thm.permute_prems 0 1 (Thm.implies_intr (Thm.cterm_of sg tm) th)
1076 | find (p::ps) n = if tm' aconv (Envir.beta_eta_contract p)
1077 then Thm.permute_prems n 1 th
1080 find (prems_of th) 0
1083 fun zip (x::xs) (y::ys) = (x,y)::(zip xs ys)
1085 | zip _ _ = raise ERR "zip" "arguments not of same length"
1087 fun mk_INST dom rng th =
1088 th |> forall_intr_list dom
1089 |> forall_elim_list rng
1093 fun F vars (Bound _) = vars
1094 | F vars (tm as Free _) =
1095 if member (op =) vars tm
1098 | F vars (Const _) = vars
1099 | F vars (tm1 $ tm2) = F (F vars tm1) tm2
1100 | F vars (Abs(_,_,body)) = F vars body
1101 | F vars (Var _) = raise ERR "collect_vars" "Schematic variable found"
1106 (* Code for disambiguating variablenames (wrt. types) *)
1108 val disamb_info_empty = {vars=[],rens=[]}
1110 fun rens_of {vars,rens} = rens
1112 fun name_of_var (Free(vname,_)) = vname
1113 | name_of_var _ = raise ERR "name_of_var" "Not a variable"
1115 fun disamb_term_from info tm = (info, tm)
1117 fun swap (x,y) = (y,x)
1119 fun has_ren (HOLThm _) = false
1121 fun prinfo {vars,rens} = (writeln "Vars:";
1123 writeln "Renaming:";
1124 app (fn(x,y)=>(prin x; writeln " -->"; prin y)) rens)
1126 fun disamb_thm_from info (HOLThm (_,thm)) = (info, thm)
1128 fun disamb_terms_from info tms = (info, tms)
1130 fun disamb_thms_from info hthms = (info, map hthm2thm hthms)
1132 fun disamb_term tm = disamb_term_from disamb_info_empty tm
1133 fun disamb_terms tms = disamb_terms_from disamb_info_empty tms
1134 fun disamb_thm thm = disamb_thm_from disamb_info_empty thm
1135 fun disamb_thms thms = disamb_thms_from disamb_info_empty thms
1137 fun norm_hthm sg (hth as HOLThm _) = hth
1139 (* End of disambiguating code *)
1141 fun disambiguate_frees thm =
1143 fun ERR s = error ("Drule.disambiguate_frees: "^s)
1144 val ct = cprop_of thm
1146 val thy = theory_of_cterm ct
1147 val frees = OldTerm.term_frees t
1148 val freenames = Term.add_free_names t []
1149 val is_old_name = member (op =) freenames
1150 fun name_of (Free (n, _)) = n
1151 | name_of _ = ERR "name_of"
1152 fun new_name' bump map n =
1153 let val n' = n^bump in
1154 if is_old_name n' orelse Symtab.lookup map n' <> NONE then
1155 new_name' (Symbol.bump_string bump) map n
1159 val new_name = new_name' "a"
1160 fun replace_name n' (Free (n, t)) = Free (n', t)
1161 | replace_name n' _ = ERR "replace_name"
1162 (* map: old or fresh name -> old free,
1163 invmap: old free which has fresh name assigned to it -> fresh name *)
1164 fun dis v (mapping as (map,invmap)) =
1165 let val n = name_of v in
1166 case Symtab.lookup map n of
1167 NONE => (Symtab.update (n, v) map, invmap)
1172 let val n' = new_name map n in
1173 (Symtab.update (n', v) map,
1174 Termtab.update (v, n') invmap)
1178 if (length freenames = length frees) then
1183 fold dis frees (Symtab.empty, Termtab.empty)
1184 fun make_subst (oldfree, newname) (intros, elims) =
1185 (cterm_of thy oldfree :: intros,
1186 cterm_of thy (replace_name newname oldfree) :: elims)
1187 val (intros, elims) = fold make_subst (Termtab.dest invmap) ([], [])
1189 forall_elim_list elims (forall_intr_list intros thm)
1193 val debug = Unsynchronized.ref false
1195 fun if_debug f x = if !debug then f x else ()
1196 val message = if_debug writeln
1198 val conjE_helper = Thm.permute_prems 0 1 conjE
1200 fun get_hol4_thm thyname thmname thy =
1201 case get_hol4_theorem thyname thmname thy of
1202 SOME hth => SOME (HOLThm hth)
1205 val pending = HOL4Pending.get thy
1207 case StringPair.lookup pending (thyname,thmname) of
1208 SOME hth => SOME (HOLThm hth)
1212 fun non_trivial_term_consts t = fold_aterms
1214 if c = "Trueprop" orelse c = "All" orelse c = "op -->" orelse c = "op &" orelse c = "op ="
1215 then I else insert (op =) c
1218 fun match_consts t (* th *) =
1220 fun add_consts (Const (c, _), cs) =
1222 "op =" => insert (op =) "==" cs
1223 | "op -->" => insert (op =) "==>" cs
1228 | _ => insert (op =) c cs)
1229 | add_consts (t $ u, cs) = add_consts (t, add_consts (u, cs))
1230 | add_consts (Abs (_, _, t), cs) = add_consts (t, cs)
1231 | add_consts (_, cs) = cs
1232 val t_consts = add_consts(t,[])
1234 fn th => eq_set (op =) (t_consts, add_consts (prop_of th, []))
1237 fun split_name str =
1239 val sub = Substring.full str
1240 val (f,idx) = apsnd Substring.string (Substring.splitr Char.isDigit sub)
1241 val (newstr,u) = pairself Substring.string (Substring.splitr (fn c => c = #"_") f)
1243 if not (idx = "") andalso u = "_"
1244 then SOME (newstr, the (Int.fromString idx))
1247 handle _ => NONE (* FIXME avoid handle _ *)
1249 fun rewrite_hol4_term t thy =
1251 val hol4rews1 = map (Thm.transfer thy) (HOL4Rewrites.get thy)
1252 val hol4ss = Simplifier.global_context thy empty_ss
1253 setmksimps (K single) addsimps hol4rews1
1255 Thm.transfer thy (Simplifier.full_rewrite hol4ss (cterm_of thy t))
1258 fun get_isabelle_thm thyname thmname hol4conc thy =
1260 val (info,hol4conc') = disamb_term hol4conc
1261 val i2h_conc = Thm.symmetric (rewrite_hol4_term (HOLogic.mk_Trueprop hol4conc') thy)
1263 case concl_of i2h_conc of
1264 Const("==",_) $ lhs $ _ => lhs
1265 | _ => error "get_isabelle_thm" "Bad rewrite rule"
1266 val _ = (message "Original conclusion:";
1267 if_debug prin hol4conc';
1268 message "Modified conclusion:";
1269 if_debug prin isaconc)
1271 fun mk_res th = HOLThm (rens_of info, Thm.equal_elim i2h_conc th)
1273 case get_hol4_mapping thyname thmname thy of
1274 SOME (SOME thmname) =>
1276 val th1 = (SOME (PureThy.get_thm thy thmname)
1278 (case split_name thmname of
1279 SOME (listname,idx) => (SOME (List.nth(PureThy.get_thms thy listname,idx-1))
1280 handle _ => NONE) (* FIXME avoid handle _ *)
1285 (case Shuffler.set_prop thy isaconc [(thmname,th2)] of
1286 SOME (_,th) => (message "YES";(thy, SOME (mk_res th)))
1287 | NONE => (message "NO2";error "get_isabelle_thm" "Bad mapping"))
1288 | NONE => (message "NO1";error "get_isabelle_thm" "Bad mapping")
1290 | SOME NONE => error ("Trying to access ignored theorem " ^ thmname)
1293 val _ = (message "Looking for conclusion:";
1294 if_debug prin isaconc)
1295 val cs = non_trivial_term_consts isaconc;
1296 val _ = (message "Looking for consts:";
1297 message (commas cs))
1298 val pot_thms = Shuffler.find_potential thy isaconc
1299 val _ = message ((Int.toString (length pot_thms)) ^ " potential theorems")
1301 case Shuffler.set_prop thy isaconc pot_thms of
1302 SOME (isaname,th) =>
1304 val hth as HOLThm args = mk_res th
1305 val thy' = thy |> add_hol4_theorem thyname thmname args
1306 |> add_hol4_mapping thyname thmname isaname
1307 val _ = ImportRecorder.add_hol_theorem thyname thmname (snd args)
1308 val _ = ImportRecorder.add_hol_mapping thyname thmname isaname
1312 | NONE => (thy,NONE)
1315 handle e => (message "Exception in get_isabelle_thm"; if_debug print_exn e handle _ => (); (thy,NONE))
1317 fun get_isabelle_thm_and_warn thyname thmname hol4conc thy =
1319 val (a, b) = get_isabelle_thm thyname thmname hol4conc thy
1322 val (info,hol4conc') = disamb_term hol4conc
1323 val i2h_conc = Thm.symmetric (rewrite_hol4_term (HOLogic.mk_Trueprop hol4conc') thy)
1325 case concl_of i2h_conc of
1326 Const("==",_) $ lhs $ _ =>
1327 (warning ("Failed lookup of theorem '"^thmname^"':");
1328 writeln "Original conclusion:";
1330 writeln "Modified conclusion:";
1336 NONE => (warn () handle _ => (); (a,b)) (* FIXME avoid handle _ *)
1340 fun get_thm thyname thmname thy =
1341 case get_hol4_thm thyname thmname thy of
1342 SOME hth => (thy,SOME hth)
1343 | NONE => ((case import_proof_concl thyname thmname thy of
1344 SOME f => get_isabelle_thm_and_warn thyname thmname (f thy) thy
1345 | NONE => (message "No conclusion"; (thy,NONE)))
1346 handle e as IO.Io _ => (message "IO exception"; (thy,NONE))
1347 | e as PK _ => (message "PK exception"; (thy,NONE)))
1349 fun rename_const thyname thy name =
1350 case get_hol4_const_renaming thyname name thy of
1354 fun get_def thyname constname rhs thy =
1356 val constname = rename_const thyname thy constname
1357 val (thmname,thy') = get_defname thyname constname thy
1358 val _ = message ("Looking for definition " ^ thyname ^ "." ^ thmname)
1360 get_isabelle_thm_and_warn thyname thmname (mk_teq (thyname ^ "." ^ constname) rhs thy') thy'
1363 fun get_axiom thyname axname thy =
1364 case get_thm thyname axname thy of
1365 arg as (_,SOME _) => arg
1366 | _ => raise ERR "get_axiom" ("Trying to retrieve axiom (" ^ axname ^ ")")
1368 fun intern_store_thm gen_output thyname thmname hth thy =
1370 val (hth' as HOLThm (args as (_,th))) = norm_hthm thy hth
1371 val rew = rewrite_hol4_term (concl_of th) thy
1372 val th = Thm.equal_elim rew th
1373 val thy' = add_hol4_pending thyname thmname args thy
1374 val _ = ImportRecorder.add_hol_pending thyname thmname (hthm2thm hth')
1375 val th = disambiguate_frees th
1376 val thy2 = if gen_output
1377 then add_dump ("lemma " ^ (quotename thmname) ^ ": " ^
1378 (smart_string_of_thm th) ^ "\n by (import " ^
1379 thyname ^ " " ^ (quotename thmname) ^ ")") thy'
1385 val store_thm = intern_store_thm true
1389 val cty = Thm.ctyp_of_term ctm
1391 Drule.instantiate' [SOME cty] [SOME ctm] reflexivity_thm
1396 val _ = message "REFL:"
1397 val (info,tm') = disamb_term tm
1398 val ctm = Thm.cterm_of thy tm'
1399 val res = HOLThm(rens_of info,mk_REFL ctm)
1400 val _ = if_debug pth res
1407 val _ = message "ASSUME:"
1408 val (info,tm') = disamb_term tm
1409 val ctm = Thm.cterm_of thy (HOLogic.mk_Trueprop tm')
1410 val th = Thm.trivial ctm
1411 val res = HOLThm(rens_of info,th)
1412 val _ = if_debug pth res
1417 fun INST_TYPE lambda (hth as HOLThm(rens,th)) thy =
1419 val _ = message "INST_TYPE:"
1420 val _ = if_debug pth hth
1421 val tys_before = OldTerm.add_term_tfrees (prop_of th,[])
1422 val th1 = Thm.varifyT_global th
1423 val tys_after = OldTerm.add_term_tvars (prop_of th1,[])
1424 val tyinst = map (fn (bef, iS) =>
1425 (case try (Lib.assoc (TFree bef)) lambda of
1426 SOME ty => (ctyp_of thy (TVar iS), ctyp_of thy ty)
1427 | NONE => (ctyp_of thy (TVar iS), ctyp_of thy (TFree bef))
1429 (zip tys_before tys_after)
1430 val res = Drule.instantiate (tyinst,[]) th1
1431 val hth = HOLThm([],res)
1432 val res = norm_hthm thy hth
1433 val _ = message "RESULT:"
1434 val _ = if_debug pth res
1439 fun INST sigma hth thy =
1441 val _ = message "INST:"
1442 val _ = if_debug (app (fn (x,y) => (prin x; prin y))) sigma
1443 val _ = if_debug pth hth
1444 val (sdom,srng) = ListPair.unzip (rev sigma)
1445 val th = hthm2thm hth
1446 val th1 = mk_INST (map (cterm_of thy) sdom) (map (cterm_of thy) srng) th
1447 val res = HOLThm([],th1)
1448 val _ = message "RESULT:"
1449 val _ = if_debug pth res
1454 fun EQ_IMP_RULE (hth as HOLThm(rens,th)) thy =
1456 val _ = message "EQ_IMP_RULE:"
1457 val _ = if_debug pth hth
1458 val res = HOLThm(rens,th RS eqimp_thm)
1459 val _ = message "RESULT:"
1460 val _ = if_debug pth res
1465 fun mk_EQ_MP th1 th2 = [beta_eta_thm th1, beta_eta_thm th2] MRS eqmp_thm
1467 fun EQ_MP hth1 hth2 thy =
1469 val _ = message "EQ_MP:"
1470 val _ = if_debug pth hth1
1471 val _ = if_debug pth hth2
1472 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1473 val res = HOLThm(rens_of info,mk_EQ_MP th1 th2)
1474 val _ = message "RESULT:"
1475 val _ = if_debug pth res
1480 fun mk_COMB th1 th2 thy =
1482 val (f,g) = case concl_of th1 of
1483 _ $ (Const("op =",_) $ f $ g) => (f,g)
1484 | _ => raise ERR "mk_COMB" "First theorem not an equality"
1485 val (x,y) = case concl_of th2 of
1486 _ $ (Const("op =",_) $ x $ y) => (x,y)
1487 | _ => raise ERR "mk_COMB" "Second theorem not an equality"
1489 val (fd,fr) = dom_rng fty
1490 val comb_thm' = Drule.instantiate'
1491 [SOME (ctyp_of thy fd),SOME (ctyp_of thy fr)]
1492 [SOME (cterm_of thy f),SOME (cterm_of thy g),
1493 SOME (cterm_of thy x),SOME (cterm_of thy y)] comb_thm
1495 [th1,th2] MRS comb_thm'
1498 fun SUBST rews ctxt hth thy =
1500 val _ = message "SUBST:"
1501 val _ = if_debug (app pth) rews
1502 val _ = if_debug prin ctxt
1503 val _ = if_debug pth hth
1504 val (info,th) = disamb_thm hth
1505 val (info1,ctxt') = disamb_term_from info ctxt
1506 val (info2,rews') = disamb_thms_from info1 rews
1508 val cctxt = cterm_of thy ctxt'
1509 fun subst th [] = th
1510 | subst th (rew::rews) = subst (mk_COMB th rew thy) rews
1511 val res = HOLThm(rens_of info2,mk_EQ_MP (subst (mk_REFL cctxt) rews') th)
1512 val _ = message "RESULT:"
1513 val _ = if_debug pth res
1518 fun DISJ_CASES hth hth1 hth2 thy =
1520 val _ = message "DISJ_CASES:"
1521 val _ = if_debug (app pth) [hth,hth1,hth2]
1522 val (info,th) = disamb_thm hth
1523 val (info1,th1) = disamb_thm_from info hth1
1524 val (info2,th2) = disamb_thm_from info1 hth2
1525 val th1 = norm_hyps th1
1526 val th2 = norm_hyps th2
1527 val (l,r) = case concl_of th of
1528 _ $ (Const("op |",_) $ l $ r) => (l,r)
1529 | _ => raise ERR "DISJ_CASES" "Conclusion not a disjunction"
1530 val th1' = rearrange thy (HOLogic.mk_Trueprop l) th1
1531 val th2' = rearrange thy (HOLogic.mk_Trueprop r) th2
1532 val res1 = th RS disj_cases_thm
1533 val res2 = uniq_compose ((nprems_of th1')-1) th1' ((nprems_of th)+1) res1
1534 val res3 = uniq_compose ((nprems_of th2')-1) th2' (nprems_of res2) res2
1535 val res = HOLThm(rens_of info2,res3)
1536 val _ = message "RESULT:"
1537 val _ = if_debug pth res
1542 fun DISJ1 hth tm thy =
1544 val _ = message "DISJ1:"
1545 val _ = if_debug pth hth
1546 val _ = if_debug prin tm
1547 val (info,th) = disamb_thm hth
1548 val (info',tm') = disamb_term_from info tm
1549 val ct = Thm.cterm_of thy tm'
1550 val disj1_thm' = Drule.instantiate' [] [NONE,SOME ct] disj1_thm
1551 val res = HOLThm(rens_of info',th RS disj1_thm')
1552 val _ = message "RESULT:"
1553 val _ = if_debug pth res
1558 fun DISJ2 tm hth thy =
1560 val _ = message "DISJ1:"
1561 val _ = if_debug prin tm
1562 val _ = if_debug pth hth
1563 val (info,th) = disamb_thm hth
1564 val (info',tm') = disamb_term_from info tm
1565 val ct = Thm.cterm_of thy tm'
1566 val disj2_thm' = Drule.instantiate' [] [NONE,SOME ct] disj2_thm
1567 val res = HOLThm(rens_of info',th RS disj2_thm')
1568 val _ = message "RESULT:"
1569 val _ = if_debug pth res
1574 fun IMP_ANTISYM hth1 hth2 thy =
1576 val _ = message "IMP_ANTISYM:"
1577 val _ = if_debug pth hth1
1578 val _ = if_debug pth hth2
1579 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1580 val th = [beta_eta_thm th1,beta_eta_thm th2] MRS imp_antisym_thm
1581 val res = HOLThm(rens_of info,th)
1582 val _ = message "RESULT:"
1583 val _ = if_debug pth res
1588 fun SYM (hth as HOLThm(rens,th)) thy =
1590 val _ = message "SYM:"
1591 val _ = if_debug pth hth
1592 val th = th RS symmetry_thm
1593 val res = HOLThm(rens,th)
1594 val _ = message "RESULT:"
1595 val _ = if_debug pth res
1600 fun MP hth1 hth2 thy =
1602 val _ = message "MP:"
1603 val _ = if_debug pth hth1
1604 val _ = if_debug pth hth2
1605 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1606 val th = [beta_eta_thm th1,beta_eta_thm th2] MRS mp_thm
1607 val res = HOLThm(rens_of info,th)
1608 val _ = message "RESULT:"
1609 val _ = if_debug pth res
1614 fun CONJ hth1 hth2 thy =
1616 val _ = message "CONJ:"
1617 val _ = if_debug pth hth1
1618 val _ = if_debug pth hth2
1619 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1620 val th = [th1,th2] MRS conj_thm
1621 val res = HOLThm(rens_of info,th)
1622 val _ = message "RESULT:"
1623 val _ = if_debug pth res
1628 fun CONJUNCT1 (hth as HOLThm(rens,th)) thy =
1630 val _ = message "CONJUNCT1:"
1631 val _ = if_debug pth hth
1632 val res = HOLThm(rens,th RS conjunct1_thm)
1633 val _ = message "RESULT:"
1634 val _ = if_debug pth res
1639 fun CONJUNCT2 (hth as HOLThm(rens,th)) thy =
1641 val _ = message "CONJUNCT1:"
1642 val _ = if_debug pth hth
1643 val res = HOLThm(rens,th RS conjunct2_thm)
1644 val _ = message "RESULT:"
1645 val _ = if_debug pth res
1650 fun EXISTS ex wit hth thy =
1652 val _ = message "EXISTS:"
1653 val _ = if_debug prin ex
1654 val _ = if_debug prin wit
1655 val _ = if_debug pth hth
1656 val (info,th) = disamb_thm hth
1657 val (info',[ex',wit']) = disamb_terms_from info [ex,wit]
1658 val cwit = cterm_of thy wit'
1659 val cty = ctyp_of_term cwit
1661 (Const("Ex",_) $ a) => a
1662 | _ => raise ERR "EXISTS" "Argument not existential"
1663 val ca = cterm_of thy a
1664 val exists_thm' = beta_eta_thm (Drule.instantiate' [SOME cty] [SOME ca,SOME cwit] exists_thm)
1665 val th1 = beta_eta_thm th
1666 val th2 = implies_elim_all th1
1667 val th3 = th2 COMP exists_thm'
1668 val th = implies_intr_hyps th3
1669 val res = HOLThm(rens_of info',th)
1670 val _ = message "RESULT:"
1671 val _ = if_debug pth res
1676 fun CHOOSE v hth1 hth2 thy =
1678 val _ = message "CHOOSE:"
1679 val _ = if_debug prin v
1680 val _ = if_debug pth hth1
1681 val _ = if_debug pth hth2
1682 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1683 val (info',v') = disamb_term_from info v
1684 fun strip 0 _ th = th
1685 | strip n (p::ps) th =
1686 strip (n-1) ps (Thm.implies_elim th (Thm.assume p))
1687 | strip _ _ _ = raise ERR "CHOOSE" "strip error"
1688 val cv = cterm_of thy v'
1689 val th2 = norm_hyps th2
1690 val cvty = ctyp_of_term cv
1691 val c = HOLogic.dest_Trueprop (concl_of th2)
1692 val cc = cterm_of thy c
1693 val a = case concl_of th1 of
1694 _ $ (Const("Ex",_) $ a) => a
1695 | _ => raise ERR "CHOOSE" "Conclusion not existential"
1696 val ca = cterm_of (theory_of_thm th1) a
1697 val choose_thm' = beta_eta_thm (Drule.instantiate' [SOME cvty] [SOME ca,SOME cc] choose_thm)
1698 val th21 = rearrange thy (HOLogic.mk_Trueprop (a $ v')) th2
1699 val th22 = strip ((nprems_of th21)-1) (cprems_of th21) th21
1700 val th23 = beta_eta_thm (Thm.forall_intr cv th22)
1701 val th11 = implies_elim_all (beta_eta_thm th1)
1702 val th' = th23 COMP (th11 COMP choose_thm')
1703 val th = implies_intr_hyps th'
1704 val res = HOLThm(rens_of info',th)
1705 val _ = message "RESULT:"
1706 val _ = if_debug pth res
1713 val _ = message "GEN:"
1714 val _ = if_debug prin v
1715 val _ = if_debug pth hth
1716 val (info,th) = disamb_thm hth
1717 val (info',v') = disamb_term_from info v
1718 val res = HOLThm(rens_of info',mk_GEN v' th thy)
1719 val _ = message "RESULT:"
1720 val _ = if_debug pth res
1725 fun SPEC tm hth thy =
1727 val _ = message "SPEC:"
1728 val _ = if_debug prin tm
1729 val _ = if_debug pth hth
1730 val (info,th) = disamb_thm hth
1731 val (info',tm') = disamb_term_from info tm
1732 val ctm = Thm.cterm_of thy tm'
1733 val cty = Thm.ctyp_of_term ctm
1734 val spec' = Drule.instantiate' [SOME cty] [NONE,SOME ctm] spec_thm
1735 val th = th RS spec'
1736 val res = HOLThm(rens_of info',th)
1737 val _ = message "RESULT:"
1738 val _ = if_debug pth res
1743 fun COMB hth1 hth2 thy =
1745 val _ = message "COMB:"
1746 val _ = if_debug pth hth1
1747 val _ = if_debug pth hth2
1748 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1749 val res = HOLThm(rens_of info,mk_COMB th1 th2 thy)
1750 val _ = message "RESULT:"
1751 val _ = if_debug pth res
1756 fun TRANS hth1 hth2 thy =
1758 val _ = message "TRANS:"
1759 val _ = if_debug pth hth1
1760 val _ = if_debug pth hth2
1761 val (info,[th1,th2]) = disamb_thms [hth1,hth2]
1762 val th = [th1,th2] MRS trans_thm
1763 val res = HOLThm(rens_of info,th)
1764 val _ = message "RESULT:"
1765 val _ = if_debug pth res
1771 fun CCONTR tm hth thy =
1773 val _ = message "SPEC:"
1774 val _ = if_debug prin tm
1775 val _ = if_debug pth hth
1776 val (info,th) = disamb_thm hth
1777 val (info',tm') = disamb_term_from info tm
1778 val th = norm_hyps th
1779 val ct = cterm_of thy tm'
1780 val th1 = rearrange thy (HOLogic.mk_Trueprop (Const("Not",boolT-->boolT) $ tm')) th
1781 val ccontr_thm' = Drule.instantiate' [] [SOME ct] ccontr_thm
1782 val res1 = uniq_compose ((nprems_of th1) - 1) th1 1 ccontr_thm'
1783 val res = HOLThm(rens_of info',res1)
1784 val _ = message "RESULT:"
1785 val _ = if_debug pth res
1790 fun mk_ABS v th thy =
1792 val cv = cterm_of thy v
1793 val th1 = implies_elim_all (beta_eta_thm th)
1794 val (f,g) = case concl_of th1 of
1795 _ $ (Const("op =",_) $ f $ g) => (Term.lambda v f,Term.lambda v g)
1796 | _ => raise ERR "mk_ABS" "Bad conclusion"
1797 val (fd,fr) = dom_rng (type_of f)
1798 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
1799 val th2 = Thm.forall_intr cv th1
1800 val th3 = th2 COMP abs_thm'
1801 val res = implies_intr_hyps th3
1808 val _ = message "ABS:"
1809 val _ = if_debug prin v
1810 val _ = if_debug pth hth
1811 val (info,th) = disamb_thm hth
1812 val (info',v') = disamb_term_from info v
1813 val res = HOLThm(rens_of info',mk_ABS v' th thy)
1814 val _ = message "RESULT:"
1815 val _ = if_debug pth res
1820 fun GEN_ABS copt vlist hth thy =
1822 val _ = message "GEN_ABS:"
1823 val _ = case copt of
1824 SOME c => if_debug prin c
1826 val _ = if_debug (app prin) vlist
1827 val _ = if_debug pth hth
1828 val (info,th) = disamb_thm hth
1829 val (info',vlist') = disamb_terms_from info vlist
1832 SOME (c as Const(cname,cty)) =>
1834 fun inst_type ty1 ty2 (TVar _) = raise ERR "GEN_ABS" "Type variable found!"
1835 | inst_type ty1 ty2 (ty as TFree _) = if ty1 = ty
1838 | inst_type ty1 ty2 (ty as Type(name,tys)) =
1839 Type(name,map (inst_type ty1 ty2) tys)
1841 fold_rev (fn v => fn th =>
1843 val cdom = fst (dom_rng (fst (dom_rng cty)))
1845 val newcty = inst_type cdom vty cty
1846 val cc = cterm_of thy (Const(cname,newcty))
1848 mk_COMB (mk_REFL cc) (mk_ABS v th thy) thy
1851 | SOME _ => raise ERR "GEN_ABS" "Bad constant"
1853 fold_rev (fn v => fn th => mk_ABS v th thy) vlist' th
1854 val res = HOLThm(rens_of info',th1)
1855 val _ = message "RESULT:"
1856 val _ = if_debug pth res
1861 fun NOT_INTRO (hth as HOLThm(rens,th)) thy =
1863 val _ = message "NOT_INTRO:"
1864 val _ = if_debug pth hth
1865 val th1 = implies_elim_all (beta_eta_thm th)
1866 val a = case concl_of th1 of
1867 _ $ (Const("op -->",_) $ a $ Const("False",_)) => a
1868 | _ => raise ERR "NOT_INTRO" "Conclusion of bad form"
1869 val ca = cterm_of thy a
1870 val th2 = Thm.equal_elim (Drule.instantiate' [] [SOME ca] not_intro_thm) th1
1871 val res = HOLThm(rens,implies_intr_hyps th2)
1872 val _ = message "RESULT:"
1873 val _ = if_debug pth res
1878 fun NOT_ELIM (hth as HOLThm(rens,th)) thy =
1880 val _ = message "NOT_INTRO:"
1881 val _ = if_debug pth hth
1882 val th1 = implies_elim_all (beta_eta_thm th)
1883 val a = case concl_of th1 of
1884 _ $ (Const("Not",_) $ a) => a
1885 | _ => raise ERR "NOT_ELIM" "Conclusion of bad form"
1886 val ca = cterm_of thy a
1887 val th2 = Thm.equal_elim (Drule.instantiate' [] [SOME ca] not_elim_thm) th1
1888 val res = HOLThm(rens,implies_intr_hyps th2)
1889 val _ = message "RESULT:"
1890 val _ = if_debug pth res
1895 fun DISCH tm hth thy =
1897 val _ = message "DISCH:"
1898 val _ = if_debug prin tm
1899 val _ = if_debug pth hth
1900 val (info,th) = disamb_thm hth
1901 val (info',tm') = disamb_term_from info tm
1902 val prems = prems_of th
1903 val th1 = beta_eta_thm th
1904 val th2 = implies_elim_all th1
1905 val th3 = Thm.implies_intr (cterm_of thy (HOLogic.mk_Trueprop tm')) th2
1906 val th4 = th3 COMP disch_thm
1907 val res = HOLThm (rens_of info', implies_intr_hyps th4)
1908 val _ = message "RESULT:"
1909 val _ = if_debug pth res
1914 val spaces = space_implode " "
1916 fun new_definition thyname constname rhs thy =
1918 val constname = rename_const thyname thy constname
1919 val redeclared = is_some (Sign.const_type thy (Sign.intern_const thy constname));
1920 val _ = warning ("Introducing constant " ^ constname)
1921 val (thmname,thy) = get_defname thyname constname thy
1922 val (info,rhs') = disamb_term rhs
1923 val ctype = type_of rhs'
1924 val csyn = mk_syn thy constname
1925 val thy1 = case HOL4DefThy.get thy of
1927 | _ => (ImportRecorder.add_consts [(constname, ctype, csyn)];
1928 Sign.add_consts_i [(Binding.name constname,ctype,csyn)] thy)
1929 val eq = mk_defeq constname rhs' thy1
1930 val (thms, thy2) = PureThy.add_defs false [((Binding.name thmname,eq),[])] thy1
1931 val _ = ImportRecorder.add_defs thmname eq
1932 val def_thm = hd thms
1933 val thm' = def_thm RS meta_eq_to_obj_eq_thm
1934 val (thy',th) = (thy2, thm')
1935 val fullcname = Sign.intern_const thy' constname
1936 val thy'' = add_hol4_const_mapping thyname constname true fullcname thy'
1937 val _ = ImportRecorder.add_hol_const_mapping thyname constname fullcname
1938 val (linfo,tm24) = disamb_term (mk_teq constname rhs' thy'')
1939 val rew = rewrite_hol4_term eq thy''
1940 val crhs = cterm_of thy'' (#2 (Logic.dest_equals (prop_of rew)))
1941 val thy22 = if Thm.def_name constname = thmname andalso not redeclared andalso csyn = NoSyn
1944 val p1 = quotename constname
1945 val p2 = Syntax.string_of_typ_global thy'' ctype
1946 val p3 = string_of_mixfix csyn
1947 val p4 = smart_string_of_cterm crhs
1949 add_dump ("constdefs\n " ^ p1 ^ " :: \"" ^ p2 ^ "\" "^ p3 ^ "\n " ^ p4) thy''
1952 add_dump ("consts\n " ^ quotename constname ^ " :: \"" ^
1953 Syntax.string_of_typ_global thy'' ctype ^
1954 "\" " ^ string_of_mixfix csyn ^ "\n\ndefs\n " ^
1955 quotename thmname ^ ": " ^ smart_string_of_cterm crhs) thy''
1956 val hth = case Shuffler.set_prop thy22 (HOLogic.mk_Trueprop tm24) [("",th)] of
1957 SOME (_,res) => HOLThm(rens_of linfo,res)
1958 | NONE => raise ERR "new_definition" "Bad conclusion"
1959 val fullname = Sign.full_bname thy22 thmname
1960 val thy22' = case opt_get_output_thy thy22 of
1961 "" => (ImportRecorder.add_hol_mapping thyname thmname fullname;
1962 add_hol4_mapping thyname thmname fullname thy22)
1965 val moved_thmname = output_thy ^ "." ^ thyname ^ "." ^ thmname
1966 val _ = ImportRecorder.add_hol_move fullname moved_thmname
1967 val _ = ImportRecorder.add_hol_mapping thyname thmname moved_thmname
1969 thy22 |> add_hol4_move fullname moved_thmname
1970 |> add_hol4_mapping thyname thmname moved_thmname
1972 val _ = message "new_definition:"
1973 val _ = if_debug pth hth
1977 handle e => (message "exception in new_definition"; print_exn e)
1980 val helper = thm "termspec_help"
1982 fun new_specification thyname thmname names hth thy =
1983 case HOL4DefThy.get thy of
1984 Replaying _ => (thy,hth)
1987 val _ = message "NEW_SPEC:"
1988 val _ = if_debug pth hth
1989 val names = map (rename_const thyname thy) names
1990 val _ = warning ("Introducing constants " ^ commas names)
1991 val (HOLThm(rens,th)) = norm_hthm thy hth
1992 val thy1 = case HOL4DefThy.get thy of
1996 fun dest_eta_abs (Abs(x,xT,body)) = (x,xT,body)
1997 | dest_eta_abs body =
1999 val (dT,rT) = dom_rng (type_of body)
2001 ("x",dT,body $ Bound 0)
2003 handle TYPE _ => raise ERR "new_specification" "not an abstraction type"
2004 fun dest_exists (Const("Ex",_) $ abody) =
2007 raise ERR "new_specification" "Bad existential formula"
2009 val (consts,_) = Library.foldl (fn ((cs,ex),cname) =>
2011 val (_,cT,p) = dest_exists ex
2013 ((cname,cT,mk_syn thy cname)::cs,p)
2014 end) (([],HOLogic.dest_Trueprop (concl_of th)),names)
2015 val str = Library.foldl (fn (acc, (c, T, csyn)) =>
2016 acc ^ "\n " ^ quotename c ^ " :: \"" ^
2017 Syntax.string_of_typ_global thy T ^ "\" " ^ string_of_mixfix csyn) ("consts", consts)
2018 val thy' = add_dump str thy
2019 val _ = ImportRecorder.add_consts consts
2021 Sign.add_consts_i (map (fn (c, T, mx) => (Binding.name c, T, mx)) consts) thy'
2024 val thy1 = fold_rev (fn name => fn thy =>
2025 snd (get_defname thyname name thy)) names thy1
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) = Choice_Specification.add_specification NONE
2031 val _ = ImportRecorder.add_specification names' th
2032 val res' = Thm.unvarify_global res
2033 val hth = HOLThm(rens,res')
2034 val rew = rewrite_hol4_term (concl_of res') thy'
2035 val th = Thm.equal_elim rew res'
2036 fun handle_const (name,thy) =
2038 val defname = Thm.def_name name
2039 val (newname,thy') = get_defname thyname name thy
2041 (if defname = newname
2043 else (quotename newname) ^ ": " ^ (quotename name),thy')
2045 val (new_names,thy') = fold_rev (fn name => fn (names, thy) =>
2047 val (name',thy') = handle_const (name,thy)
2050 end) names ([], thy')
2051 val thy'' = add_dump ("specification (" ^ (spaces new_names) ^ ") " ^ thmname ^ ": " ^ (smart_string_of_thm th) ^
2052 "\n by (import " ^ thyname ^ " " ^ thmname ^ ")")
2054 val _ = message "RESULT:"
2055 val _ = if_debug pth hth
2057 intern_store_thm false thyname thmname hth thy''
2059 handle e => (message "exception in new_specification"; print_exn e)
2063 fun new_axiom name tm thy = raise ERR "new_axiom" ("Oh, no you don't! (" ^ name ^ ")")
2065 fun to_isa_thm (hth as HOLThm(_,th)) =
2067 val (HOLThm args) = norm_hthm (theory_of_thm th) hth
2069 apsnd Thm.strip_shyps args
2072 fun to_isa_term tm = tm
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"
2080 fun new_type_definition thyname thmname tycname hth thy =
2081 case HOL4DefThy.get thy of
2082 Replaying _ => (thy,hth)
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 Typedef.add_typedef_global false (SOME (Binding.name thmname))
2099 (Binding.name tycname, map (rpair dummyS) tnames, tsyn) c NONE (rtac th2 1) thy
2100 val _ = ImportRecorder.add_typedef (SOME thmname) typ c NONE th2
2102 val th3 = (#type_definition (#2 typedef_info)) RS typedef_hol2hol4
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
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")
2111 val thy4 = add_hol4_pending thyname thmname args thy''
2112 val _ = ImportRecorder.add_hol_pending thyname thmname (hthm2thm hth')
2114 val rew = rewrite_hol4_term (concl_of td_th) thy4
2115 val th = Thm.equal_elim rew (Thm.transfer thy4 td_th)
2116 val c = case HOLogic.dest_Trueprop (prop_of th) of
2117 Const("Ex",exT) $ P =>
2119 val PT = domain_type exT
2121 Const("Collect",PT-->HOLogic.mk_setT (domain_type PT)) $ P
2123 | _ => error "Internal error in ProofKernel.new_typedefinition"
2124 val tnames_string = if null tnames
2126 else "(" ^ commas tnames ^ ") "
2127 val proc_prop = if null tnames
2128 then smart_string_of_cterm
2129 else setmp_CRITICAL 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
2133 val thy6 = add_dump ("lemmas " ^ thmname ^ " = typedef_hol2hol4 [OF type_definition_" ^ tycname ^ "]") thy5
2135 val _ = message "RESULT:"
2136 val _ = if_debug pth hth'
2140 handle e => (message "exception in new_type_definition"; print_exn e)
2142 fun add_dump_constdefs thy defname constname rhs ty =
2144 val n = quotename constname
2145 val t = Syntax.string_of_typ_global 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)^" : "
2151 add_dump ("constdefs\n " ^ n ^ " :: \"" ^ t ^ "\" " ^ syn ^ "\n " ^ d ^ eq) thy
2154 fun add_dump_syntax thy name =
2156 val n = quotename name
2157 val syn = string_of_mixfix (mk_syn thy name)
2159 add_dump ("syntax\n "^n^" :: _ "^syn) thy
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)
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
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_strings (map fst tfrees)
2183 val tsyn = mk_syn thy tycname
2184 val typ = (tycname,tnames,tsyn)
2185 val ((_, typedef_info), thy') =
2186 Typedef.add_typedef_global false NONE
2187 (Binding.name tycname, map (rpair dummyS) tnames, tsyn) c
2188 (SOME(Binding.name rep_name,Binding.name abs_name)) (rtac th2 1) thy
2189 val _ = ImportRecorder.add_typedef NONE typ c (SOME(rep_name,abs_name)) th2
2190 val fulltyname = Sign.intern_type thy' tycname
2191 val aty = Type (fulltyname, map mk_vartype tnames)
2192 val abs_ty = tT --> aty
2193 val rep_ty = aty --> tT
2194 val typedef_hol2hollight' =
2196 [SOME (ctyp_of thy' aty), SOME (ctyp_of thy' tT)]
2197 [NONE, NONE, NONE, SOME (cterm_of thy' (Free ("a", aty))), SOME (cterm_of thy' (Free ("r", tT)))]
2198 typedef_hol2hollight
2199 val th4 = (#type_definition (#2 typedef_info)) RS typedef_hol2hollight'
2200 val _ = null (Thm.fold_terms Term.add_tvars th4 []) orelse
2201 raise ERR "type_introduction" "no type variables expected any more"
2202 val _ = null (Thm.fold_terms Term.add_vars th4 []) orelse
2203 raise ERR "type_introduction" "no term variables expected any more"
2204 val _ = message ("step 3: thyname="^thyname^", tycname="^tycname^", fulltyname="^fulltyname)
2205 val thy'' = add_hol4_type_mapping thyname tycname true fulltyname thy'
2206 val _ = ImportRecorder.add_hol_type_mapping thyname tycname fulltyname
2207 val _ = message "step 4"
2208 val (hth' as HOLThm args) = norm_hthm thy'' (HOLThm(rens,th4))
2209 val thy4 = add_hol4_pending thyname thmname args thy''
2210 val _ = ImportRecorder.add_hol_pending thyname thmname (hthm2thm hth')
2212 val P' = P (* why !? #2 (Logic.dest_equals (concl_of (rewrite_hol4_term P thy4))) *)
2217 Const("Collect",PT-->HOLogic.mk_setT (domain_type PT)) $ P'
2220 val tnames_string = if null tnames
2222 else "(" ^ commas tnames ^ ") "
2223 val proc_prop = if null tnames
2224 then smart_string_of_cterm
2225 else setmp_CRITICAL show_all_types true smart_string_of_cterm
2226 val thy = add_dump ("typedef (open) " ^ tnames_string ^ (quotename tycname) ^
2227 " = " ^ (proc_prop (cterm_of thy4 c)) ^ " " ^
2228 (string_of_mixfix tsyn) ^ " morphisms "^
2229 (quote rep_name)^" "^(quote abs_name)^"\n"^
2230 (" apply (rule light_ex_imp_nonempty[where t="^
2231 (proc_prop (cterm_of thy4 t))^"])\n"^
2232 (" by (import " ^ thyname ^ " " ^ (quotename thmname) ^ ")"))) thy4
2233 val str_aty = Syntax.string_of_typ_global thy aty
2234 val thy = add_dump_syntax thy rep_name
2235 val thy = add_dump_syntax thy abs_name
2236 val thy = add_dump ("lemmas " ^ (quote (thmname^"_@intern")) ^
2237 " = typedef_hol2hollight \n"^
2238 " [where a=\"a :: "^str_aty^"\" and r=r" ^
2239 " ,\n OF "^(quotename ("type_definition_" ^ tycname)) ^ "]") thy
2240 val _ = message "RESULT:"
2241 val _ = if_debug pth hth'
2245 handle e => (message "exception in type_introduction"; print_exn e)