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