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