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