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