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