src/Pure/thm.ML
author paulson
Fri, 01 Nov 1996 15:35:28 +0100
changeset 2147 0698ddfbf6e4
parent 2139 2c59b204b540
child 2163 4d43e7486164
permissions -rw-r--r--
Now uses Int.max instead of max nodup_Vars now updates maxidx
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     1
(*  Title:      Pure/thm.ML
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
     4
    Copyright   1994  University of Cambridge
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
     5
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
     6
The core of Isabelle's Meta Logic: certified types and terms, meta
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
     7
theorems, meta rules (including resolution and simplification).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
    10
signature THM =
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
    11
  sig
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    12
  (*certified types*)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    13
  type ctyp
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    14
  val rep_ctyp          : ctyp -> {sign: Sign.sg, T: typ}
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    15
  val typ_of            : ctyp -> typ
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    16
  val ctyp_of           : Sign.sg -> typ -> ctyp
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    17
  val read_ctyp         : Sign.sg -> string -> ctyp
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    18
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    19
  (*certified terms*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    20
  type cterm
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    21
  exception CTERM of string
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    22
  val rep_cterm         : cterm -> {sign: Sign.sg, t: term, T: typ,
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    23
                                    maxidx: int}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    24
  val term_of           : cterm -> term
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    25
  val cterm_of          : Sign.sg -> term -> cterm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    26
  val read_cterm        : Sign.sg -> string * typ -> cterm
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
    27
  val read_cterms       : Sign.sg -> string list * typ list -> cterm list
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    28
  val cterm_fun         : (term -> term) -> (cterm -> cterm)
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    29
  val dest_comb         : cterm -> cterm * cterm
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
    30
  val dest_abs          : cterm -> cterm * cterm
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1659
diff changeset
    31
  val adjust_maxidx     : cterm -> cterm
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
    32
  val capply            : cterm -> cterm -> cterm
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
    33
  val cabs              : cterm -> cterm -> cterm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    34
  val read_def_cterm    :
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    35
    Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    36
    string list -> bool -> string * typ -> cterm * (indexname * typ) list
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    37
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    38
  (*theories*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    39
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    40
  (*proof terms [must duplicate declaration as a specification]*)
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    41
  datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv;
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    42
  val keep_derivs	: deriv_kind ref
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    43
  datatype rule = 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    44
      MinProof				
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    45
    | Oracle of theory * Sign.sg * exn
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    46
    | Axiom		of theory * string
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    47
    | Theorem		of string	
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    48
    | Assume		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    49
    | Implies_intr	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    50
    | Implies_intr_shyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    51
    | Implies_intr_hyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    52
    | Implies_elim 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    53
    | Forall_intr	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    54
    | Forall_elim	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    55
    | Reflexive		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    56
    | Symmetric 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    57
    | Transitive
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    58
    | Beta_conversion	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    59
    | Extensional
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    60
    | Abstract_rule	of string * cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    61
    | Combination
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    62
    | Equal_intr
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    63
    | Equal_elim
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    64
    | Trivial		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    65
    | Lift_rule		of cterm * int 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    66
    | Assumption	of int * Envir.env option
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    67
    | Instantiate	of (indexname * ctyp) list * (cterm * cterm) list
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    68
    | Bicompose		of bool * bool * int * int * Envir.env
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    69
    | Flexflex_rule	of Envir.env		
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    70
    | Class_triv	of theory * class	
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    71
    | VarifyT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    72
    | FreezeT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    73
    | RewriteC		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    74
    | CongC		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    75
    | Rewrite_cterm	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    76
    | Rename_params_rule of string list * int;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    77
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
    78
  type deriv   (* = rule mtree *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    79
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    80
  (*meta theorems*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    81
  type thm
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
    82
  exception THM of string * int * thm list
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    83
  val rep_thm           : thm -> {sign: Sign.sg, der: deriv, maxidx: int,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    84
				  shyps: sort list, hyps: term list, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    85
				  prop: term}
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    86
  val crep_thm          : thm -> {sign: Sign.sg, der: deriv, maxidx: int,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    87
				  shyps: sort list, hyps: cterm list, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
    88
				  prop: cterm}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    89
  val stamps_of_thm     : thm -> string ref list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    90
  val tpairs_of         : thm -> (term * term) list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    91
  val prems_of          : thm -> term list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    92
  val nprems_of         : thm -> int
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    93
  val concl_of          : thm -> term
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    94
  val cprop_of          : thm -> cterm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    95
  val extra_shyps       : thm -> sort list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    96
  val force_strip_shyps : bool ref      (* FIXME tmp *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    97
  val strip_shyps       : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    98
  val implies_intr_shyps: thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
    99
  val get_axiom         : theory -> string -> thm
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   100
  val name_thm          : string * thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   101
  val axioms_of         : theory -> (string * thm) list
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   102
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   103
  (*meta rules*)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   104
  val assume            : cterm -> thm
1416
f59857e32972 Commented the datatype declaration of thm.
paulson
parents: 1394
diff changeset
   105
  val compress          : thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   106
  val implies_intr      : cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   107
  val implies_elim      : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   108
  val forall_intr       : cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   109
  val forall_elim       : cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   110
  val flexpair_def      : thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   111
  val reflexive         : cterm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   112
  val symmetric         : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   113
  val transitive        : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   114
  val beta_conversion   : cterm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   115
  val extensional       : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   116
  val abstract_rule     : string -> cterm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   117
  val combination       : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   118
  val equal_intr        : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   119
  val equal_elim        : thm -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   120
  val implies_intr_hyps : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   121
  val flexflex_rule     : thm -> thm Sequence.seq
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   122
  val instantiate       :
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   123
    (indexname * ctyp) list * (cterm * cterm) list -> thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   124
  val trivial           : cterm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   125
  val class_triv        : theory -> class -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   126
  val varifyT           : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   127
  val freezeT           : thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   128
  val dest_state        : thm * int ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   129
    (term * term) list * term list * term * term
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   130
  val lift_rule         : (thm * int) -> thm -> thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   131
  val assumption        : int -> thm -> thm Sequence.seq
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   132
  val eq_assumption     : int -> thm -> thm
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   133
  val rename_params_rule: string list * int -> thm -> thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   134
  val bicompose         : bool -> bool * thm * int ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   135
    int -> thm -> thm Sequence.seq
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   136
  val biresolution      : bool -> (bool * thm) list ->
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   137
    int -> thm -> thm Sequence.seq
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   138
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   139
  (*meta simplification*)
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   140
  type meta_simpset
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   141
  exception SIMPLIFIER of string * thm
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   142
  val empty_mss         : meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   143
  val add_simps         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   144
  val del_simps         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   145
  val mss_of            : thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   146
  val add_congs         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   147
  val add_prems         : meta_simpset * thm list -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   148
  val prems_of_mss      : meta_simpset -> thm list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   149
  val set_mk_rews       : meta_simpset * (thm -> thm list) -> meta_simpset
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   150
  val mk_rews_of_mss    : meta_simpset -> thm -> thm list
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   151
  val trace_simp        : bool ref
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   152
  val rewrite_cterm     : bool * bool -> meta_simpset ->
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   153
                          (meta_simpset -> thm -> thm option) -> cterm -> thm
1539
f21c8fab7c3c Addition of oracles
paulson
parents: 1529
diff changeset
   154
f21c8fab7c3c Addition of oracles
paulson
parents: 1529
diff changeset
   155
  val invoke_oracle	: theory * Sign.sg * exn -> thm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   156
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   157
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
   158
structure Thm : THM =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   159
struct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   160
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   161
(*** Certified terms and types ***)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   162
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   163
(** certified types **)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   164
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   165
(*certified typs under a signature*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   166
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   167
datatype ctyp = Ctyp of {sign: Sign.sg, T: typ};
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   168
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   169
fun rep_ctyp (Ctyp args) = args;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   170
fun typ_of (Ctyp {T, ...}) = T;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   171
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   172
fun ctyp_of sign T =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   173
  Ctyp {sign = sign, T = Sign.certify_typ sign T};
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   174
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   175
fun read_ctyp sign s =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   176
  Ctyp {sign = sign, T = Sign.read_typ (sign, K None) s};
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   177
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   178
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   179
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   180
(** certified terms **)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   181
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   182
(*certified terms under a signature, with checked typ and maxidx of Vars*)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   183
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   184
datatype cterm = Cterm of {sign: Sign.sg, t: term, T: typ, maxidx: int};
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   185
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   186
fun rep_cterm (Cterm args) = args;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   187
fun term_of (Cterm {t, ...}) = t;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   188
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   189
(*create a cterm by checking a "raw" term with respect to a signature*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   190
fun cterm_of sign tm =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   191
  let val (t, T, maxidx) = Sign.certify_term sign tm
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   192
  in  Cterm {sign = sign, t = t, T = T, maxidx = maxidx}
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   193
  end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   194
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   195
fun cterm_fun f (Cterm {sign, t, ...}) = cterm_of sign (f t);
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   196
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   197
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   198
exception CTERM of string;
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   199
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   200
(*Destruct application in cterms*)
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   201
fun dest_comb (Cterm{sign, T, maxidx, t = A $ B}) =
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   202
      let val typeA = fastype_of A;
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   203
          val typeB =
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   204
            case typeA of Type("fun",[S,T]) => S
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   205
                        | _ => error "Function type expected in dest_comb";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   206
      in
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   207
      (Cterm {sign=sign, maxidx=maxidx, t=A, T=typeA},
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   208
       Cterm {sign=sign, maxidx=maxidx, t=B, T=typeB})
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   209
      end
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   210
  | dest_comb _ = raise CTERM "dest_comb";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   211
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   212
(*Destruct abstraction in cterms*)
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   213
fun dest_abs (Cterm {sign, T as Type("fun",[_,S]), maxidx, t=Abs(x,ty,M)}) = 
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   214
      let val (y,N) = variant_abs (x,ty,M)
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   215
      in (Cterm {sign = sign, T = ty, maxidx = 0, t = Free(y,ty)},
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   216
          Cterm {sign = sign, T = S, maxidx = maxidx, t = N})
1493
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   217
      end
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   218
  | dest_abs _ = raise CTERM "dest_abs";
e936723cb94d added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents: 1460
diff changeset
   219
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   220
(*Makes maxidx precise: it is often too big*)
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   221
fun adjust_maxidx (ct as Cterm {sign, T, t, maxidx, ...}) =
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   222
  if maxidx = ~1 then ct 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   223
  else  Cterm {sign = sign, T = T, maxidx = maxidx_of_term t, t = t};
1703
e22ad43bab5f moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents: 1659
diff changeset
   224
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   225
(*Form cterm out of a function and an argument*)
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   226
fun capply (Cterm {t=f, sign=sign1, T=Type("fun",[dty,rty]), maxidx=maxidx1})
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   227
           (Cterm {t=x, sign=sign2, T, maxidx=maxidx2}) =
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   228
      if T = dty then Cterm{t=f$x, sign=Sign.merge(sign1,sign2), T=rty,
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   229
                            maxidx=Int.max(maxidx1, maxidx2)}
1516
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   230
      else raise CTERM "capply: types don't agree"
96286c4e32de removed mk_prop; added capply; simplified dest_abs
clasohm
parents: 1503
diff changeset
   231
  | capply _ _ = raise CTERM "capply: first arg is not a function"
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   232
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   233
fun cabs (Cterm {t=Free(a,ty), sign=sign1, T=T1, maxidx=maxidx1})
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   234
         (Cterm {t=t2, sign=sign2, T=T2, maxidx=maxidx2}) =
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   235
      Cterm {t=absfree(a,ty,t2), sign=Sign.merge(sign1,sign2),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   236
             T = ty --> T2, maxidx=Int.max(maxidx1, maxidx2)}
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   237
  | cabs _ _ = raise CTERM "cabs: first arg is not a free variable";
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   238
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   239
(** read cterms **)   (*exception ERROR*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   240
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   241
(*read term, infer types, certify term*)
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
   242
fun read_def_cterm (sign, types, sorts) used freeze (a, T) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   243
  let
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   244
    val T' = Sign.certify_typ sign T
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   245
      handle TYPE (msg, _, _) => error msg;
623
ca9f5dbab880 added print_msg;
clasohm
parents: 622
diff changeset
   246
    val ts = Syntax.read (#syn (Sign.rep_sg sign)) T' a;
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
   247
    val (_, t', tye) =
959
35c2e5e114c4 removed print_msg parameter of infer_types
clasohm
parents: 949
diff changeset
   248
          Sign.infer_types sign types sorts used freeze (ts, T');
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   249
    val ct = cterm_of sign t'
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   250
      handle TYPE arg => error (Sign.exn_type_msg sign arg)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   251
	   | TERM (msg, _) => error msg;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   252
  in (ct, tye) end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   253
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
   254
fun read_cterm sign = #1 o read_def_cterm (sign, K None, K None) [] true;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   255
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   256
(*read a list of terms, matching them against a list of expected types.
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   257
  NO disambiguation of alternative parses via type-checking -- it is just
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   258
  not practical.*)
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   259
fun read_cterms sign (bs, Ts) =
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   260
  let
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   261
    val {tsig, syn, ...} = Sign.rep_sg sign
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   262
    fun read (b,T) =
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   263
	case Syntax.read syn T b of
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   264
	    [t] => t
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   265
	  | _   => error("Error or ambiguity in parsing of " ^ b)
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   266
    val (us,_) = Type.infer_types(tsig, Sign.const_type sign, 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   267
				  K None, K None, 
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   268
				  [], true, 
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   269
				  map (Sign.certify_typ sign) Ts, 
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   270
				  map read (bs~~Ts))
1394
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   271
  in  map (cterm_of sign) us  end
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   272
  handle TYPE arg => error (Sign.exn_type_msg sign arg)
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   273
       | TERM (msg, _) => error msg;
a1d2735f5ade New function read_cterms is a combination of read_def_cterm and
paulson
parents: 1258
diff changeset
   274
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   275
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   276
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   277
(*** Derivations ***)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   278
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   279
(*Names of rules in derivations.  Includes logically trivial rules, if 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   280
  executed in ML.*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   281
datatype rule = 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   282
    MinProof				(*for building minimal proof terms*)
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   283
  | Oracle   	        of theory * Sign.sg * exn	(*oracles*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   284
(*Axioms/theorems*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   285
  | Axiom		of theory * string
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   286
  | Theorem		of string
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   287
(*primitive inferences and compound versions of them*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   288
  | Assume		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   289
  | Implies_intr	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   290
  | Implies_intr_shyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   291
  | Implies_intr_hyps
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   292
  | Implies_elim 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   293
  | Forall_intr		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   294
  | Forall_elim		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   295
  | Reflexive		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   296
  | Symmetric 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   297
  | Transitive
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   298
  | Beta_conversion	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   299
  | Extensional
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   300
  | Abstract_rule	of string * cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   301
  | Combination
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   302
  | Equal_intr
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   303
  | Equal_elim
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   304
(*derived rules for tactical proof*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   305
  | Trivial		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   306
	(*For lift_rule, the proof state is not a premise.
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   307
	  Use cterm instead of thm to avoid mutual recursion.*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   308
  | Lift_rule		of cterm * int 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   309
  | Assumption		of int * Envir.env option (*includes eq_assumption*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   310
  | Instantiate		of (indexname * ctyp) list * (cterm * cterm) list
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   311
  | Bicompose		of bool * bool * int * int * Envir.env
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   312
  | Flexflex_rule	of Envir.env		(*identifies unifier chosen*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   313
(*other derived rules*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   314
  | Class_triv		of theory * class	(*derived rule????*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   315
  | VarifyT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   316
  | FreezeT
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   317
(*for the simplifier*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   318
  | RewriteC		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   319
  | CongC		of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   320
  | Rewrite_cterm	of cterm
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   321
(*Logical identities, recorded since they are part of the proof process*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   322
  | Rename_params_rule	of string list * int;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   323
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   324
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   325
type deriv = rule mtree;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   326
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   327
datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   328
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   329
val keep_derivs = ref MinDeriv;
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   330
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   331
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   332
(*Build a minimal derivation.  Keep oracles; suppress atomic inferences;
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   333
  retain Theorems or their underlying links; keep anything else*)
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   334
fun squash_derivs [] = []
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   335
  | squash_derivs (der::ders) =
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   336
     (case der of
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   337
	  Join (Oracle _, _) => der :: squash_derivs ders
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   338
	| Join (Theorem _, [der']) => if !keep_derivs=ThmDeriv 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   339
				      then der :: squash_derivs ders
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   340
				      else squash_derivs (der'::ders)
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   341
	| Join (Axiom _, _) => if !keep_derivs=ThmDeriv 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   342
			       then der :: squash_derivs ders
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   343
			       else squash_derivs ders
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   344
	| Join (_, [])      => squash_derivs ders
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   345
	| _                 => der :: squash_derivs ders);
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   346
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   347
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   348
(*Ensure sharing of the most likely derivation, the empty one!*)
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   349
val min_infer = Join (MinProof, []);
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   350
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   351
(*Make a minimal inference*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   352
fun make_min_infer []    = min_infer
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   353
  | make_min_infer [der] = der
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   354
  | make_min_infer ders  = Join (MinProof, ders);
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   355
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   356
fun infer_derivs (rl, [])   = Join (rl, [])
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   357
  | infer_derivs (rl, ders) =
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   358
    if !keep_derivs=FullDeriv then Join (rl, ders)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   359
    else make_min_infer (squash_derivs ders);
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   360
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   361
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   362
(*** Meta theorems ***)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   363
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   364
datatype thm = Thm of
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   365
  {sign: Sign.sg,		(*signature for hyps and prop*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   366
   der: deriv,			(*derivation*)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   367
   maxidx: int,			(*maximum index of any Var or TVar*)
2047
a3701c4343ea added shyps comment;
wenzelm
parents: 2046
diff changeset
   368
   shyps: sort list,		(*sort hypotheses*)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   369
   hyps: term list,		(*hypotheses*)
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   370
   prop: term};			(*conclusion*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   371
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   372
fun rep_thm (Thm args) = args;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   373
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   374
(*Version of rep_thm returning cterms instead of terms*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   375
fun crep_thm (Thm {sign, der, maxidx, shyps, hyps, prop}) =
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   376
  let fun ctermf max t = Cterm{sign=sign, t=t, T=propT, maxidx=max};
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   377
  in {sign=sign, der=der, maxidx=maxidx, shyps=shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   378
      hyps = map (ctermf ~1) hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   379
      prop = ctermf maxidx prop}
1517
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   380
  end;
d2f865740d8e added cabs and crep_thm
clasohm
parents: 1516
diff changeset
   381
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   382
(*errors involving theorems*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   383
exception THM of string * int * thm list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   384
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   385
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   386
val stamps_of_thm = #stamps o Sign.rep_sg o #sign o rep_thm;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   387
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   388
(*merge signatures of two theorems; raise exception if incompatible*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   389
fun merge_thm_sgs (th1, th2) =
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   390
  Sign.merge (pairself (#sign o rep_thm) (th1, th2))
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   391
    handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]);
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   392
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   393
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   394
(*maps object-rule to tpairs*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   395
fun tpairs_of (Thm {prop, ...}) = #1 (Logic.strip_flexpairs prop);
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   396
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   397
(*maps object-rule to premises*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   398
fun prems_of (Thm {prop, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   399
  Logic.strip_imp_prems (Logic.skip_flexpairs prop);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   400
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   401
(*counts premises in a rule*)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   402
fun nprems_of (Thm {prop, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   403
  Logic.count_prems (Logic.skip_flexpairs prop, 0);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   404
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   405
(*maps object-rule to conclusion*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   406
fun concl_of (Thm {prop, ...}) = Logic.strip_imp_concl prop;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   407
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   408
(*the statement of any thm is a cterm*)
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   409
fun cprop_of (Thm {sign, maxidx, prop, ...}) =
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   410
  Cterm {sign = sign, maxidx = maxidx, T = propT, t = prop};
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   411
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   412
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   413
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   414
(** sort contexts of theorems **)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   415
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   416
(* basic utils *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   417
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   418
(*accumulate sorts suppressing duplicates; these are coded low level
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   419
  to improve efficiency a bit*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   420
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   421
fun add_typ_sorts (Type (_, Ts), Ss) = add_typs_sorts (Ts, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   422
  | add_typ_sorts (TFree (_, S), Ss) = S ins Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   423
  | add_typ_sorts (TVar (_, S), Ss) = S ins Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   424
and add_typs_sorts ([], Ss) = Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   425
  | add_typs_sorts (T :: Ts, Ss) = add_typs_sorts (Ts, add_typ_sorts (T, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   426
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   427
fun add_term_sorts (Const (_, T), Ss) = add_typ_sorts (T, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   428
  | add_term_sorts (Free (_, T), Ss) = add_typ_sorts (T, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   429
  | add_term_sorts (Var (_, T), Ss) = add_typ_sorts (T, Ss)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   430
  | add_term_sorts (Bound _, Ss) = Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   431
  | add_term_sorts (Abs (_, T, t), Ss) = add_term_sorts (t, add_typ_sorts (T, Ss))
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   432
  | add_term_sorts (t $ u, Ss) = add_term_sorts (t, add_term_sorts (u, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   433
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   434
fun add_terms_sorts ([], Ss) = Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   435
  | add_terms_sorts (t :: ts, Ss) = add_terms_sorts (ts, add_term_sorts (t, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   436
1258
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   437
fun env_codT (Envir.Envir {iTs, ...}) = map snd iTs;
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   438
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   439
fun add_env_sorts (env, Ss) =
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   440
  add_terms_sorts (map snd (Envir.alist_of env),
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   441
    add_typs_sorts (env_codT env, Ss));
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
   442
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   443
fun add_thm_sorts (Thm {hyps, prop, ...}, Ss) =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   444
  add_terms_sorts (hyps, add_term_sorts (prop, Ss));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   445
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   446
fun add_thms_shyps ([], Ss) = Ss
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   447
  | add_thms_shyps (Thm {shyps, ...} :: ths, Ss) =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   448
      add_thms_shyps (ths, shyps union Ss);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   449
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   450
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   451
(*get 'dangling' sort constraints of a thm*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   452
fun extra_shyps (th as Thm {shyps, ...}) =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   453
  shyps \\ add_thm_sorts (th, []);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   454
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   455
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   456
(* fix_shyps *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   457
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   458
(*preserve sort contexts of rule premises and substituted types*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   459
fun fix_shyps thms Ts thm =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   460
  let
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   461
    val Thm {sign, der, maxidx, hyps, prop, ...} = thm;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   462
    val shyps =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   463
      add_thm_sorts (thm, add_typs_sorts (Ts, add_thms_shyps (thms, [])));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   464
  in
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   465
    Thm {sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   466
	 der = der,		(*No new derivation, as other rules call this*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   467
	 maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   468
	 shyps = shyps, hyps = hyps, prop = prop}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   469
  end;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   470
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   471
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   472
(* strip_shyps *)       (* FIXME improve? (e.g. only minimal extra sorts) *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   473
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   474
val force_strip_shyps = ref true;  (* FIXME tmp *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   475
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   476
(*remove extra sorts that are known to be syntactically non-empty*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   477
fun strip_shyps thm =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   478
  let
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   479
    val Thm {sign, der, maxidx, shyps, hyps, prop} = thm;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   480
    val sorts = add_thm_sorts (thm, []);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   481
    val maybe_empty = not o Sign.nonempty_sort sign sorts;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   482
    val shyps' = filter (fn S => S mem sorts orelse maybe_empty S) shyps;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   483
  in
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   484
    Thm {sign = sign, der = der, maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   485
	 shyps =
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   486
	 (if eq_set (shyps',sorts) orelse not (!force_strip_shyps) then shyps'
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   487
	  else    (* FIXME tmp *)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   488
	      (writeln ("WARNING Removed sort hypotheses: " ^
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   489
			commas (map Type.str_of_sort (shyps' \\ sorts)));
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   490
	       writeln "WARNING Let's hope these sorts are non-empty!";
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   491
           sorts)),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   492
      hyps = hyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   493
      prop = prop}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   494
  end;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   495
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   496
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   497
(* implies_intr_shyps *)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   498
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   499
(*discharge all extra sort hypotheses*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   500
fun implies_intr_shyps thm =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   501
  (case extra_shyps thm of
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   502
    [] => thm
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   503
  | xshyps =>
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   504
      let
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   505
        val Thm {sign, der, maxidx, shyps, hyps, prop} = thm;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   506
        val shyps' = logicS ins (shyps \\ xshyps);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   507
        val used_names = foldr add_term_tfree_names (prop :: hyps, []);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   508
        val names =
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   509
          tl (variantlist (replicate (length xshyps + 1) "'", used_names));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   510
        val tfrees = map (TFree o rpair logicS) names;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   511
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   512
        fun mk_insort (T, S) = map (Logic.mk_inclass o pair T) S;
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   513
        val sort_hyps = flat (map2 mk_insort (tfrees, xshyps));
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   514
      in
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   515
        Thm {sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   516
	     der = infer_derivs (Implies_intr_shyps, [der]), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   517
	     maxidx = maxidx, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   518
	     shyps = shyps',
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   519
	     hyps = hyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   520
	     prop = Logic.list_implies (sort_hyps, prop)}
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   521
      end);
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   522
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   523
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   524
(** Axioms **)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   525
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   526
(*look up the named axiom in the theory*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   527
fun get_axiom theory name =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   528
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   529
    fun get_ax [] = raise Match
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   530
      | get_ax (thy :: thys) =
1539
f21c8fab7c3c Addition of oracles
paulson
parents: 1529
diff changeset
   531
	  let val {sign, new_axioms, parents, ...} = rep_theory thy
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   532
          in case Symtab.lookup (new_axioms, name) of
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   533
		Some t => fix_shyps [] []
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   534
		           (Thm {sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   535
				 der = infer_derivs (Axiom(theory,name), []),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   536
				 maxidx = maxidx_of_term t,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   537
				 shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   538
				 hyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   539
				 prop = t})
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   540
	      | None => get_ax parents handle Match => get_ax thys
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   541
          end;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   542
  in
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   543
    get_ax [theory] handle Match
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   544
      => raise THEORY ("get_axiom: no axiom " ^ quote name, [theory])
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   545
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   546
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   547
776
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   548
(*return additional axioms of this theory node*)
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   549
fun axioms_of thy =
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   550
  map (fn (s, _) => (s, get_axiom thy s))
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   551
    (Symtab.dest (#new_axioms (rep_theory thy)));
df8f91c0e57c improved axioms_of: returns thms as the manual says;
wenzelm
parents: 721
diff changeset
   552
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   553
(*Attach a label to a theorem to make proof objects more readable*)
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   554
fun name_thm (name, th as Thm {sign, der, maxidx, shyps, hyps, prop}) = 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   555
    Thm {sign = sign, 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   556
	 der = Join (Theorem name, [der]),
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   557
	 maxidx = maxidx,
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   558
	 shyps = shyps, 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   559
	 hyps = hyps, 
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   560
	 prop = prop};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   561
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   562
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   563
(*Compression of theorems -- a separate rule, not integrated with the others,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   564
  as it could be slow.*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   565
fun compress (Thm {sign, der, maxidx, shyps, hyps, prop}) = 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   566
    Thm {sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   567
	 der = der,	(*No derivation recorded!*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   568
	 maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   569
	 shyps = shyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   570
	 hyps = map Term.compress_term hyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   571
	 prop = Term.compress_term prop};
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   572
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   573
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   574
(*** Meta rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   575
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   576
(*Check that term does not contain same var with different typing/sorting.
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   577
  If this check must be made, recalculate maxidx in hope of preventing its
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   578
  recurrence.*)
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   579
fun nodup_Vars (thm as Thm{sign, der, maxidx, shyps, hyps, prop}) s =
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   580
  (Sign.nodup_Vars prop; 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   581
   Thm {sign = sign, 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   582
	 der = der,	
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   583
	 maxidx = maxidx_of_term prop,
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   584
	 shyps = shyps, 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   585
	 hyps = hyps, 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   586
	 prop = prop})
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   587
  handle TYPE(msg,Ts,ts) => raise TYPE(s^": "^msg,Ts,ts);
1495
b8b54847c77f Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents: 1493
diff changeset
   588
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   589
(** 'primitive' rules **)
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   590
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   591
(*discharge all assumptions t from ts*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   592
val disch = gen_rem (op aconv);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   593
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   594
(*The assumption rule A|-A in a theory*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   595
fun assume ct : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   596
  let val {sign, t=prop, T, maxidx} = rep_cterm ct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   597
  in  if T<>propT then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   598
        raise THM("assume: assumptions must have type prop", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   599
      else if maxidx <> ~1 then
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   600
        raise THM("assume: assumptions may not contain scheme variables",
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   601
                  maxidx, [])
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   602
      else Thm{sign   = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   603
	       der    = infer_derivs (Assume ct, []), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   604
	       maxidx = ~1, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   605
	       shyps  = add_term_sorts(prop,[]), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   606
	       hyps   = [prop], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   607
	       prop   = prop}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   608
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   609
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   610
(*Implication introduction
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   611
  A |- B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   612
  -------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   613
  A ==> B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   614
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   615
fun implies_intr cA (thB as Thm{sign,der,maxidx,hyps,prop,...}) : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   616
  let val {sign=signA, t=A, T, maxidx=maxidxA} = rep_cterm cA
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   617
  in  if T<>propT then
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   618
        raise THM("implies_intr: assumptions must have type prop", 0, [thB])
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   619
      else fix_shyps [thB] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   620
        (Thm{sign = Sign.merge (sign,signA),  
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   621
	     der = infer_derivs (Implies_intr cA, [der]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   622
	     maxidx = Int.max(maxidxA, maxidx),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   623
	     shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   624
	     hyps = disch(hyps,A),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   625
	     prop = implies$A$prop})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   626
      handle TERM _ =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   627
        raise THM("implies_intr: incompatible signatures", 0, [thB])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   628
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   629
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   630
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   631
(*Implication elimination
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   632
  A ==> B    A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   633
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   634
        B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   635
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   636
fun implies_elim thAB thA : thm =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   637
    let val Thm{maxidx=maxA, der=derA, hyps=hypsA, prop=propA,...} = thA
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   638
        and Thm{sign, der, maxidx, hyps, prop,...} = thAB;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   639
        fun err(a) = raise THM("implies_elim: "^a, 0, [thAB,thA])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   640
    in  case prop of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   641
            imp$A$B =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   642
                if imp=implies andalso  A aconv propA
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   643
                then fix_shyps [thAB, thA] []
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   644
                       (Thm{sign= merge_thm_sgs(thAB,thA),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   645
			    der = infer_derivs (Implies_elim, [der,derA]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   646
			    maxidx = Int.max(maxA,maxidx),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   647
			    shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   648
			    hyps = hypsA union hyps,  (*dups suppressed*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   649
			    prop = B})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   650
                else err("major premise")
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   651
          | _ => err("major premise")
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   652
    end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   653
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   654
(*Forall introduction.  The Free or Var x must not be free in the hypotheses.
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   655
    A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   656
  -----
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   657
  !!x.A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   658
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   659
fun forall_intr cx (th as Thm{sign,der,maxidx,hyps,prop,...}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   660
  let val x = term_of cx;
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   661
      fun result(a,T) = fix_shyps [th] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   662
        (Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   663
	     der = infer_derivs (Forall_intr cx, [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   664
	     maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   665
	     shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   666
	     hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   667
	     prop = all(T) $ Abs(a, T, abstract_over (x,prop))})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   668
  in  case x of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   669
        Free(a,T) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   670
          if exists (apl(x, Logic.occs)) hyps
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   671
          then  raise THM("forall_intr: variable free in assumptions", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   672
          else  result(a,T)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   673
      | Var((a,_),T) => result(a,T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   674
      | _ => raise THM("forall_intr: not a variable", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   675
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   676
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   677
(*Forall elimination
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   678
  !!x.A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   679
  ------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   680
  A[t/x]
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   681
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   682
fun forall_elim ct (th as Thm{sign,der,maxidx,hyps,prop,...}) : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   683
  let val {sign=signt, t, T, maxidx=maxt} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   684
  in  case prop of
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   685
	Const("all",Type("fun",[Type("fun",[qary,_]),_])) $ A =>
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   686
	  if T<>qary then
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   687
	      raise THM("forall_elim: type mismatch", 0, [th])
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   688
	  else let val thm = fix_shyps [th] []
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   689
		    (Thm{sign= Sign.merge(sign,signt),
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   690
			 der = infer_derivs (Forall_elim ct, [der]),
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   691
			 maxidx = Int.max(maxidx, maxt),
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   692
			 shyps = [],
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   693
			 hyps = hyps,  
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   694
			 prop = betapply(A,t)})
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   695
	       in if maxt >= 0 andalso maxidx >= 0
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   696
		  then nodup_Vars thm "forall_elim" 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   697
		  else thm (*no new Vars: no expensive check!*)
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   698
	       end
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   699
      | _ => raise THM("forall_elim: not quantified", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   700
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   701
  handle TERM _ =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   702
         raise THM("forall_elim: incompatible signatures", 0, [th]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   703
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   704
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   705
(* Equality *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   706
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   707
(* Definition of the relation =?= *)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   708
val flexpair_def = fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   709
  (Thm{sign= Sign.proto_pure, 
1597
54ece585bf62 name_thm no longer takes a theory argument, as the
paulson
parents: 1580
diff changeset
   710
       der = Join(Axiom(pure_thy, "flexpair_def"), []),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   711
       shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   712
       hyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   713
       maxidx = 0,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   714
       prop = term_of (read_cterm Sign.proto_pure
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   715
		       ("(?t =?= ?u) == (?t == ?u::?'a::{})", propT))});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   716
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   717
(*The reflexivity rule: maps  t   to the theorem   t==t   *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   718
fun reflexive ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   719
  let val {sign, t, T, maxidx} = rep_cterm ct
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   720
  in  fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   721
       (Thm{sign= sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   722
	    der = infer_derivs (Reflexive ct, []),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   723
	    shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   724
	    hyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   725
	    maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   726
	    prop = Logic.mk_equals(t,t)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   727
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   728
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   729
(*The symmetry rule
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   730
  t==u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   731
  ----
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   732
  u==t
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   733
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   734
fun symmetric (th as Thm{sign,der,maxidx,shyps,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   735
  case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   736
      (eq as Const("==",_)) $ t $ u =>
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   737
        (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   738
	  Thm{sign = sign,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   739
	      der = infer_derivs (Symmetric, [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   740
	      maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   741
	      shyps = shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   742
	      hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   743
	      prop = eq$u$t}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   744
    | _ => raise THM("symmetric", 0, [th]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   745
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   746
(*The transitive rule
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   747
  t1==u    u==t2
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   748
  --------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   749
      t1==t2
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   750
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   751
fun transitive th1 th2 =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   752
  let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   753
      and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   754
      fun err(msg) = raise THM("transitive: "^msg, 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   755
  in case (prop1,prop2) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   756
       ((eq as Const("==",_)) $ t1 $ u, Const("==",_) $ u' $ t2) =>
1634
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
   757
          if not (u aconv u') then err"middle term"
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
   758
          else let val thm =      
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   759
              fix_shyps [th1, th2] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   760
                (Thm{sign= merge_thm_sgs(th1,th2), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   761
		     der = infer_derivs (Transitive, [der1, der2]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   762
                     maxidx = Int.max(max1,max2), 
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   763
		     shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   764
		     hyps = hyps1 union hyps2,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   765
		     prop = eq$t1$t2})
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   766
                 in if max1 >= 0 andalso max2 >= 0
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   767
                    then nodup_Vars thm "transitive" 
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   768
                    else thm (*no new Vars: no expensive check!*)
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   769
                 end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   770
     | _ =>  err"premises"
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   771
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   772
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
   773
(*Beta-conversion: maps (%x.t)(u) to the theorem (%x.t)(u) == t[u/x] *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   774
fun beta_conversion ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   775
  let val {sign, t, T, maxidx} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   776
  in  case t of
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   777
          Abs(_,_,bodt) $ u => fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   778
            (Thm{sign = sign,  
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   779
		 der = infer_derivs (Beta_conversion ct, []),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   780
		 maxidx = maxidx,
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   781
		 shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   782
		 hyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   783
		 prop = Logic.mk_equals(t, subst_bounds([u],bodt))})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   784
        | _ =>  raise THM("beta_conversion: not a redex", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   785
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   786
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   787
(*The extensionality rule   (proviso: x not free in f, g, or hypotheses)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   788
  f(x) == g(x)
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   789
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   790
     f == g
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   791
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   792
fun extensional (th as Thm{sign, der, maxidx,shyps,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   793
  case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   794
    (Const("==",_)) $ (f$x) $ (g$y) =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   795
      let fun err(msg) = raise THM("extensional: "^msg, 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   796
      in (if x<>y then err"different variables" else
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   797
          case y of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   798
                Free _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   799
                  if exists (apl(y, Logic.occs)) (f::g::hyps)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   800
                  then err"variable free in hyps or functions"    else  ()
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   801
              | Var _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   802
                  if Logic.occs(y,f)  orelse  Logic.occs(y,g)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   803
                  then err"variable free in functions"   else  ()
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   804
              | _ => err"not a variable");
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   805
          (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   806
          Thm{sign = sign,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   807
	      der = infer_derivs (Extensional, [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   808
	      maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   809
	      shyps = shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   810
	      hyps = hyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   811
              prop = Logic.mk_equals(f,g)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   812
      end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   813
 | _ =>  raise THM("extensional: premise", 0, [th]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   814
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   815
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   816
  The bound variable will be named "a" (since x will be something like x320)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   817
     t == u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   818
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   819
  %x.t == %x.u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   820
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   821
fun abstract_rule a cx (th as Thm{sign,der,maxidx,hyps,prop,...}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   822
  let val x = term_of cx;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   823
      val (t,u) = Logic.dest_equals prop
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   824
            handle TERM _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   825
                raise THM("abstract_rule: premise not an equality", 0, [th])
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   826
      fun result T = fix_shyps [th] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   827
	  (Thm{sign = sign,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   828
	       der = infer_derivs (Abstract_rule (a,cx), [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   829
	       maxidx = maxidx, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   830
	       shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   831
	       hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   832
	       prop = Logic.mk_equals(Abs(a, T, abstract_over (x,t)),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   833
				      Abs(a, T, abstract_over (x,u)))})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   834
  in  case x of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   835
        Free(_,T) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   836
         if exists (apl(x, Logic.occs)) hyps
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   837
         then raise THM("abstract_rule: variable free in assumptions", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   838
         else result T
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   839
      | Var(_,T) => result T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   840
      | _ => raise THM("abstract_rule: not a variable", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   841
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   842
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   843
(*The combination rule
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   844
  f==g    t==u
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   845
  ------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   846
   f(t)==g(u)
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   847
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   848
fun combination th1 th2 =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   849
  let val Thm{der=der1, maxidx=max1, shyps=shyps1, hyps=hyps1, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   850
	      prop=prop1,...} = th1
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   851
      and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   852
	      prop=prop2,...} = th2
1836
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   853
      fun chktypes (f,t) =
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   854
	    (case fastype_of f of
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   855
		Type("fun",[T1,T2]) => 
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   856
		    if T1 <> fastype_of t then
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   857
			 raise THM("combination: types", 0, [th1,th2])
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   858
		    else ()
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   859
		| _ => raise THM("combination: not function type", 0, 
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   860
				 [th1,th2]))
1495
b8b54847c77f Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents: 1493
diff changeset
   861
  in case (prop1,prop2)  of
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   862
       (Const("==",_) $ f $ g, Const("==",_) $ t $ u) =>
1836
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   863
          let val _   = chktypes (f,t)
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   864
	      val thm = (*no fix_shyps*)
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   865
			Thm{sign = merge_thm_sgs(th1,th2), 
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   866
			    der = infer_derivs (Combination, [der1, der2]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   867
			    maxidx = Int.max(max1,max2), 
1836
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   868
			    shyps = shyps1 union shyps2,
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   869
			    hyps = hyps1 union hyps2,
861e29c7cada Added type-checking to rule "combination". This corrects a fault
paulson
parents: 1802
diff changeset
   870
			    prop = Logic.mk_equals(f$t, g$u)}
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   871
          in if max1 >= 0 andalso max2 >= 0
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   872
             then nodup_Vars thm "combination" 
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   873
	     else thm (*no new Vars: no expensive check!*)  
2139
2c59b204b540 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson
parents: 2047
diff changeset
   874
          end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   875
     | _ =>  raise THM("combination: premises", 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   876
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   877
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   878
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   879
(* Equality introduction
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   880
  A==>B    B==>A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   881
  --------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   882
       A==B
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   883
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   884
fun equal_intr th1 th2 =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   885
  let val Thm{der=der1,maxidx=max1, shyps=shyps1, hyps=hyps1, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   886
	      prop=prop1,...} = th1
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   887
      and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   888
	      prop=prop2,...} = th2;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   889
      fun err(msg) = raise THM("equal_intr: "^msg, 0, [th1,th2])
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   890
  in case (prop1,prop2) of
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   891
       (Const("==>",_) $ A $ B, Const("==>",_) $ B' $ A')  =>
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   892
	  if A aconv A' andalso B aconv B'
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   893
	  then
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   894
	    (*no fix_shyps*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   895
	      Thm{sign = merge_thm_sgs(th1,th2),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   896
		  der = infer_derivs (Equal_intr, [der1, der2]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   897
		  maxidx = Int.max(max1,max2),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   898
		  shyps = shyps1 union shyps2,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   899
		  hyps = hyps1 union hyps2,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   900
		  prop = Logic.mk_equals(A,B)}
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   901
	  else err"not equal"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   902
     | _ =>  err"premises"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   903
  end;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   904
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   905
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   906
(*The equal propositions rule
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   907
  A==B    A
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   908
  ---------
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   909
      B
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   910
*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   911
fun equal_elim th1 th2 =
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   912
  let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   913
      and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   914
      fun err(msg) = raise THM("equal_elim: "^msg, 0, [th1,th2])
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   915
  in  case prop1  of
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   916
       Const("==",_) $ A $ B =>
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   917
          if not (prop2 aconv A) then err"not equal"  else
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   918
            fix_shyps [th1, th2] []
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   919
              (Thm{sign= merge_thm_sgs(th1,th2), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   920
		   der = infer_derivs (Equal_elim, [der1, der2]),
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
   921
		   maxidx = Int.max(max1,max2),
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   922
		   shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   923
		   hyps = hyps1 union hyps2,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   924
		   prop = B})
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   925
     | _ =>  err"major premise"
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   926
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   927
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   928
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   929
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   930
(**** Derived rules ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   931
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
   932
(*Discharge all hypotheses.  Need not verify cterms or call fix_shyps.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   933
  Repeated hypotheses are discharged only once;  fold cannot do this*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   934
fun implies_intr_hyps (Thm{sign, der, maxidx, shyps, hyps=A::As, prop}) =
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
   935
      implies_intr_hyps (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   936
            (Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   937
		 der = infer_derivs (Implies_intr_hyps, [der]), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   938
		 maxidx = maxidx, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   939
		 shyps = shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   940
                 hyps = disch(As,A),  
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   941
		 prop = implies$A$prop})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   942
  | implies_intr_hyps th = th;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   943
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   944
(*Smash" unifies the list of term pairs leaving no flex-flex pairs.
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   945
  Instantiates the theorem and deletes trivial tpairs.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   946
  Resulting sequence may contain multiple elements if the tpairs are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   947
    not all flex-flex. *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   948
fun flexflex_rule (th as Thm{sign, der, maxidx, hyps, prop,...}) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   949
  let fun newthm env =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   950
          if Envir.is_empty env then th
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   951
          else
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   952
          let val (tpairs,horn) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   953
                        Logic.strip_flexpairs (Envir.norm_term env prop)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   954
                (*Remove trivial tpairs, of the form t=t*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   955
              val distpairs = filter (not o op aconv) tpairs
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   956
              val newprop = Logic.list_flexpairs(distpairs, horn)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   957
          in  fix_shyps [th] (env_codT env)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   958
                (Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   959
		     der = infer_derivs (Flexflex_rule env, [der]), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   960
		     maxidx = maxidx_of_term newprop, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   961
		     shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   962
		     hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   963
		     prop = newprop})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   964
          end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   965
      val (tpairs,_) = Logic.strip_flexpairs prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   966
  in Sequence.maps newthm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   967
            (Unify.smash_unifiers(sign, Envir.empty maxidx, tpairs))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   968
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   969
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   970
(*Instantiation of Vars
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   971
           A
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   972
  -------------------
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   973
  A[t1/v1,....,tn/vn]
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
   974
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   975
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   976
(*Check that all the terms are Vars and are distinct*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   977
fun instl_ok ts = forall is_Var ts andalso null(findrep ts);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   978
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   979
(*For instantiate: process pair of cterms, merge theories*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   980
fun add_ctpair ((ct,cu), (sign,tpairs)) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   981
  let val {sign=signt, t=t, T= T, ...} = rep_cterm ct
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   982
      and {sign=signu, t=u, T= U, ...} = rep_cterm cu
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   983
  in  if T=U  then (Sign.merge(sign, Sign.merge(signt, signu)), (t,u)::tpairs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   984
      else raise TYPE("add_ctpair", [T,U], [t,u])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   985
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   986
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   987
fun add_ctyp ((v,ctyp), (sign',vTs)) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   988
  let val {T,sign} = rep_ctyp ctyp
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   989
  in (Sign.merge(sign,sign'), (v,T)::vTs) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   990
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   991
(*Left-to-right replacements: ctpairs = [...,(vi,ti),...].
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   992
  Instantiates distinct Vars by terms of same type.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   993
  Normalizes the new theorem! *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   994
fun instantiate ([], []) th = th
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
   995
  | instantiate (vcTs,ctpairs)  (th as Thm{sign,der,maxidx,hyps,prop,...}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   996
  let val (newsign,tpairs) = foldr add_ctpair (ctpairs, (sign,[]));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   997
      val (newsign,vTs) = foldr add_ctyp (vcTs, (newsign,[]));
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   998
      val newprop =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   999
            Envir.norm_term (Envir.empty 0)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1000
              (subst_atomic tpairs
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1001
               (Type.inst_term_tvars(#tsig(Sign.rep_sg newsign),vTs) prop))
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1002
      val newth =
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1003
            fix_shyps [th] (map snd vTs)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1004
              (Thm{sign = newsign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1005
		   der = infer_derivs (Instantiate(vcTs,ctpairs), [der]), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1006
		   maxidx = maxidx_of_term newprop, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1007
		   shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1008
		   hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1009
		   prop = newprop})
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1010
  in  if not(instl_ok(map #1 tpairs))
193
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1011
      then raise THM("instantiate: variables not distinct", 0, [th])
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1012
      else if not(null(findrep(map #1 vTs)))
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1013
      then raise THM("instantiate: type variables not distinct", 0, [th])
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1014
      else nodup_Vars newth "instantiate"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1015
  end
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1016
  handle TERM _ =>
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1017
           raise THM("instantiate: incompatible signatures",0,[th])
193
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
  1018
       | TYPE _ => raise THM("instantiate: type conflict", 0, [th]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1019
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1020
(*The trivial implication A==>A, justified by assume and forall rules.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1021
  A can contain Vars, not so for assume!   *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1022
fun trivial ct : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1023
  let val {sign, t=A, T, maxidx} = rep_cterm ct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1024
  in  if T<>propT then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1025
            raise THM("trivial: the term must have type prop", 0, [])
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1026
      else fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1027
        (Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1028
	     der = infer_derivs (Trivial ct, []), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1029
	     maxidx = maxidx, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1030
	     shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1031
	     hyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1032
	     prop = implies$A$A})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1033
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1034
1503
7dba648ee25c Elimination of fully-functorial style.
paulson
parents: 1495
diff changeset
  1035
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *)
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1036
fun class_triv thy c =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1037
  let val sign = sign_of thy;
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1038
      val Cterm {t, maxidx, ...} =
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1039
	  cterm_of sign (Logic.mk_inclass (TVar (("'a", 0), [c]), c))
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1040
	    handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []);
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1041
  in
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1042
    fix_shyps [] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1043
      (Thm {sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1044
	    der = infer_derivs (Class_triv(thy,c), []), 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1045
	    maxidx = maxidx, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1046
	    shyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1047
	    hyps = [], 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1048
	    prop = t})
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1049
  end;
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1050
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
  1051
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1052
(* Replace all TFrees not in the hyps by new TVars *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1053
fun varifyT(Thm{sign,der,maxidx,shyps,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1054
  let val tfrees = foldr add_term_tfree_names (hyps,[])
1634
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
  1055
  in let val thm = (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1056
    Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1057
	der = infer_derivs (VarifyT, [der]), 
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1058
	maxidx = Int.max(0,maxidx), 
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1059
	shyps = shyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1060
	hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1061
        prop = Type.varify(prop,tfrees)}
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1062
     in nodup_Vars thm "varifyT" end
1634
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
  1063
(* this nodup_Vars check can be removed if thms are guaranteed not to contain
9b9cdef70669 Plugged some more loopholes with nodup_Vars.
nipkow
parents: 1597
diff changeset
  1064
duplicate TVars with differnt sorts *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1065
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1066
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1067
(* Replace all TVars by new TFrees *)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1068
fun freezeT(Thm{sign,der,maxidx,shyps,hyps,prop}) =
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 922
diff changeset
  1069
  let val prop' = Type.freeze prop
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1070
  in (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1071
    Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1072
	der = infer_derivs (FreezeT, [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1073
	maxidx = maxidx_of_term prop',
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1074
	shyps = shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1075
	hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1076
        prop = prop'}
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1077
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1078
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1079
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1080
(*** Inference rules for tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1081
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1082
(*Destruct proof state into constraints, other goals, goal(i), rest *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1083
fun dest_state (state as Thm{prop,...}, i) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1084
  let val (tpairs,horn) = Logic.strip_flexpairs prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1085
  in  case  Logic.strip_prems(i, [], horn) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1086
          (B::rBs, C) => (tpairs, rev rBs, B, C)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1087
        | _ => raise THM("dest_state", i, [state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1088
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1089
  handle TERM _ => raise THM("dest_state", i, [state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1090
309
3751567696bf restored the signature constraint :THM
lcp
parents: 305
diff changeset
  1091
(*Increment variables and parameters of orule as required for
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1092
  resolution with goal i of state. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1093
fun lift_rule (state, i) orule =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1094
  let val Thm{shyps=sshyps, prop=sprop, maxidx=smax, sign=ssign,...} = state
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1095
      val (Bi::_, _) = Logic.strip_prems(i, [], Logic.skip_flexpairs sprop)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1096
        handle TERM _ => raise THM("lift_rule", i, [orule,state])
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1097
      val ct_Bi = Cterm {sign=ssign, maxidx=smax, T=propT, t=Bi}
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1098
      val (lift_abs,lift_all) = Logic.lift_fns(Bi,smax+1)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1099
      val (Thm{sign, der, maxidx,shyps,hyps,prop}) = orule
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1100
      val (tpairs,As,B) = Logic.strip_horn prop
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1101
  in  (*no fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1102
      Thm{sign = merge_thm_sgs(state,orule),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1103
	  der = infer_derivs (Lift_rule(ct_Bi, i), [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1104
	  maxidx = maxidx+smax+1,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1105
          shyps=sshyps union shyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1106
	  hyps=hyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1107
          prop = Logic.rule_of (map (pairself lift_abs) tpairs,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1108
				map lift_all As,    
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1109
				lift_all B)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1110
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1111
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1112
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1113
fun assumption i state =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1114
  let val Thm{sign,der,maxidx,hyps,prop,...} = state;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1115
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1116
      fun newth (env as Envir.Envir{maxidx, ...}, tpairs) =
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1117
        fix_shyps [state] (env_codT env)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1118
          (Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1119
	       der = infer_derivs (Assumption (i, Some env), [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1120
	       maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1121
	       shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1122
	       hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1123
	       prop = 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1124
	       if Envir.is_empty env then (*avoid wasted normalizations*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1125
		   Logic.rule_of (tpairs, Bs, C)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1126
	       else (*normalize the new rule fully*)
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1127
		   Envir.norm_term env (Logic.rule_of (tpairs, Bs, C))});
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1128
      fun addprfs [] = Sequence.null
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1129
        | addprfs ((t,u)::apairs) = Sequence.seqof (fn()=> Sequence.pull
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1130
             (Sequence.mapp newth
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1131
                (Unify.unifiers(sign,Envir.empty maxidx, (t,u)::tpairs))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1132
                (addprfs apairs)))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1133
  in  addprfs (Logic.assum_pairs Bi)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1134
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1135
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1136
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1137
fun eq_assumption i state =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1138
  let val Thm{sign,der,maxidx,hyps,prop,...} = state;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1139
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1140
  in  if exists (op aconv) (Logic.assum_pairs Bi)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1141
      then fix_shyps [state] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1142
             (Thm{sign = sign, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1143
		  der = infer_derivs (Assumption (i,None), [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1144
		  maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1145
		  shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1146
		  hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1147
		  prop = Logic.rule_of(tpairs, Bs, C)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1148
      else  raise THM("eq_assumption", 0, [state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1149
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1150
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1151
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1152
(** User renaming of parameters in a subgoal **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1153
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1154
(*Calls error rather than raising an exception because it is intended
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1155
  for top-level use -- exception handling would not make sense here.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1156
  The names in cs, if distinct, are used for the innermost parameters;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1157
   preceding parameters may be renamed to make all params distinct.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1158
fun rename_params_rule (cs, i) state =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1159
  let val Thm{sign,der,maxidx,hyps,prop,...} = state
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1160
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1161
      val iparams = map #1 (Logic.strip_params Bi)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1162
      val short = length iparams - length cs
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1163
      val newnames =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1164
            if short<0 then error"More names than abstractions!"
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1165
            else variantlist(take (short,iparams), cs) @ cs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1166
      val freenames = map (#1 o dest_Free) (term_frees prop)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1167
      val newBi = Logic.list_rename_params (newnames, Bi)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1168
  in
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1169
  case findrep cs of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1170
     c::_ => error ("Bound variables not distinct: " ^ c)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1569
diff changeset
  1171
   | [] => (case cs inter_string freenames of
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1172
       a::_ => error ("Bound/Free variable clash: " ^ a)
1220
3b0b8408fc5f MAJOR changes:
wenzelm
parents: 1195
diff changeset
  1173
     | [] => fix_shyps [state] []
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1174
		(Thm{sign = sign,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1175
		     der = infer_derivs (Rename_params_rule(cs,i), [der]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1176
		     maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1177
		     shyps = [],
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1178
		     hyps = hyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1179
		     prop = Logic.rule_of(tpairs, Bs@[newBi], C)}))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1180
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1181
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1182
(*** Preservation of bound variable names ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1183
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1184
(*Scan a pair of terms; while they are similar,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1185
  accumulate corresponding bound vars in "al"*)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1186
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) =
1195
686e3eb613b9 match_bvs no longer puts a name in the alist if it is null ("")
lcp
parents: 1160
diff changeset
  1187
      match_bvs(s, t, if x="" orelse y="" then al
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1188
                                          else (x,y)::al)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1189
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1190
  | match_bvs(_,_,al) = al;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1191
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1192
(* strip abstractions created by parameters *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1193
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1194
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1195
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1196
(* strip_apply f A(,B) strips off all assumptions/parameters from A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1197
   introduced by lifting over B, and applies f to remaining part of A*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1198
fun strip_apply f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1199
  let fun strip(Const("==>",_)$ A1 $ B1,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1200
                Const("==>",_)$ _  $ B2) = implies $ A1 $ strip(B1,B2)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1201
        | strip((c as Const("all",_)) $ Abs(a,T,t1),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1202
                      Const("all",_)  $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1203
        | strip(A,_) = f A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1204
  in strip end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1205
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1206
(*Use the alist to rename all bound variables and some unknowns in a term
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1207
  dpairs = current disagreement pairs;  tpairs = permanent ones (flexflex);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1208
  Preserves unknowns in tpairs and on lhs of dpairs. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1209
fun rename_bvs([],_,_,_) = I
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1210
  | rename_bvs(al,dpairs,tpairs,B) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1211
    let val vars = foldr add_term_vars
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1212
                        (map fst dpairs @ map fst tpairs @ map snd tpairs, [])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1213
        (*unknowns appearing elsewhere be preserved!*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1214
        val vids = map (#1 o #1 o dest_Var) vars;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1215
        fun rename(t as Var((x,i),T)) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1216
                (case assoc(al,x) of
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1569
diff changeset
  1217
                   Some(y) => if x mem_string vids orelse y mem_string vids then t
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1218
                              else Var((y,i),T)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1219
                 | None=> t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1220
          | rename(Abs(x,T,t)) =
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1569
diff changeset
  1221
              Abs(case assoc_string(al,x) of Some(y) => y | None => x,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1222
                  T, rename t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1223
          | rename(f$t) = rename f $ rename t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1224
          | rename(t) = t;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1225
        fun strip_ren Ai = strip_apply rename (Ai,B)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1226
    in strip_ren end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1227
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1228
(*Function to rename bounds/unknowns in the argument, lifted over B*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1229
fun rename_bvars(dpairs, tpairs, B) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1230
        rename_bvs(foldr match_bvars (dpairs,[]), dpairs, tpairs, B);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1231
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1232
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1233
(*** RESOLUTION ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1234
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1235
(** Lifting optimizations **)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1236
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1237
(*strip off pairs of assumptions/parameters in parallel -- they are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1238
  identical because of lifting*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1239
fun strip_assums2 (Const("==>", _) $ _ $ B1,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1240
                   Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1241
  | strip_assums2 (Const("all",_)$Abs(a,T,t1),
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1242
                   Const("all",_)$Abs(_,_,t2)) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1243
      let val (B1,B2) = strip_assums2 (t1,t2)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1244
      in  (Abs(a,T,B1), Abs(a,T,B2))  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1245
  | strip_assums2 BB = BB;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1246
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1247
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1248
(*Faster normalization: skip assumptions that were lifted over*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1249
fun norm_term_skip env 0 t = Envir.norm_term env t
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1250
  | norm_term_skip env n (Const("all",_)$Abs(a,T,t)) =
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1251
        let val Envir.Envir{iTs, ...} = env
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1252
            val T' = typ_subst_TVars iTs T
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1253
            (*Must instantiate types of parameters because they are flattened;
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1254
              this could be a NEW parameter*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1255
        in  all T' $ Abs(a, T', norm_term_skip env n t)  end
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1256
  | norm_term_skip env n (Const("==>", _) $ A $ B) =
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1257
        implies $ A $ norm_term_skip env (n-1) B
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1258
  | norm_term_skip env n t = error"norm_term_skip: too few assumptions??";
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1259
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
  1260
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1261
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1262
  Unifies B with Bi, replacing subgoal i    (1 <= i <= n)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1263
  If match then forbid instantiations in proof state
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1264
  If lifted then shorten the dpair using strip_assums2.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1265
  If eres_flg then simultaneously proves A1 by assumption.
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1266
  nsubgoal is the number of new subgoals (written m above).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1267
  Curried so that resolution calls dest_state only once.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1268
*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1269
local open Sequence; exception COMPOSE
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1270
in
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1271
fun bicompose_aux match (state, (stpairs, Bs, Bi, C), lifted)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1272
                        (eres_flg, orule, nsubgoal) =
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1273
 let val Thm{der=sder, maxidx=smax, shyps=sshyps, hyps=shyps, ...} = state
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1274
     and Thm{der=rder, maxidx=rmax, shyps=rshyps, hyps=rhyps, 
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1275
	     prop=rprop,...} = orule
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1276
         (*How many hyps to skip over during normalization*)
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1277
     and nlift = Logic.count_prems(strip_all_body Bi,
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1278
                                   if eres_flg then ~1 else 0)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
  1279
     val sign = merge_thm_sgs(state,orule);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1280
     (** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1281
     fun addth As ((env as Envir.Envir {maxidx, ...}, tpairs), thq) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1282
       let val normt = Envir.norm_term env;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1283
           (*perform minimal copying here by examining env*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1284
           val normp =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1285
             if Envir.is_empty env then (tpairs, Bs @ As, C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1286
             else
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1287
             let val ntps = map (pairself normt) tpairs
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1288
             in if Envir.above (smax, env) then
1238
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1289
                  (*no assignments in state; normalize the rule only*)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1290
                  if lifted
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1291
                  then (ntps, Bs @ map (norm_term_skip env nlift) As, C)
289c573327f0 considerably tuned shyps handling;
wenzelm
parents: 1229
diff changeset
  1292
                  else (ntps, Bs @ map normt As, C)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1293
                else if match then raise COMPOSE
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1294
                else (*normalize the new rule fully*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1295
                  (ntps, map normt (Bs @ As), normt C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1296
             end
1258
2a2d8c74a756 bicompose_aux: tuned fix_shyps;
wenzelm
parents: 1238
diff changeset
  1297
           val th = (*tuned fix_shyps*)
1529
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1298
             Thm{sign = sign,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1299
		 der = infer_derivs (Bicompose(match, eres_flg,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1300
					       1 + length Bs, nsubgoal, env),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1301
				     [rder,sder]),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1302
		 maxidx = maxidx,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1303
		 shyps = add_env_sorts (env, rshyps union sshyps),
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1304
		 hyps = rhyps union shyps,
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1305
		 prop = Logic.rule_of normp}
09d9ad015269 Addition of proof objects
paulson
parents: 1517
diff changeset
  1306
        in  cons(th, thq)  end  handle COMPOSE => thq
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1307
     val (rtpairs,rhorn) = Logic.strip_flexpairs(rprop);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1308
     val (rAs,B) = Logic.strip_prems(nsubgoal, [], rhorn)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1309
       handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1310
     (*Modify assumptions, deleting n-th if n>0 for e-resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1311
     fun newAs(As0, n, dpairs, tpairs) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1312
       let val As1 = if !Logic.auto_rename orelse not lifted then As0
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1313
                     else map (rename_bvars(dpairs,tpairs,B)) As0
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1314
       in (map (Logic.flatten_params n) As1)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1315
          handle TERM _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1316
          raise THM("bicompose: 1st premise", 0, [orule])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1317
       end;
2147
0698ddfbf6e4 Now uses Int.max instead of max
paulson
parents: 2139
diff changeset
  1318
     val env = Envir.empty(Int.max(rmax,smax));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1319
     val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1320
     val dpairs = BBi :: (rtpairs@stpairs);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1321
     (*elim-resolution: try each assumption in turn.  Initially n=1*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1322
     fun tryasms (_, _, []) = null
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1323
       | tryasms (As, n, (t,u)::apairs) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1324
          (case pull(Unify.unifiers(sign, env, (t,u)::dpairs))  of
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1325
               None                   => tryasms (As, n+1, apairs)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1326
             | cell as Some((_,tpairs),_) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1327
                   its_right (addth (newAs(As, n, [BBi,(u,t)], tpairs)))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1328
                       (seqof (fn()=> cell),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1329
                        seqof (fn()=> pull (tryasms (As, n+1, apairs)))));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1330
     fun eres [] = raise THM("bicompose: no premises", 0, [orule,state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1331
       | eres (A1::As) = tryasms (As, 1, Logic.assum_pairs A1);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1332
     (*ordinary resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1333
     fun res(None) = null
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1334
       | res(cell as Some((_,tpairs),_)) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1335
             its_right (addth(newAs(rev rAs, 0, [BBi], tpairs)))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1336
                       (seqof (fn()=> cell), null)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1337
 in  if eres_flg then eres(rev rAs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1338
     else res(pull(Unify.unifiers(sign, env, dpairs)))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1339
 end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1340
end;  (*open Sequence*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1341
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1342
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1343
fun bicompose match arg i state =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1344
    bicompose_aux match (state, dest_state(state,i), false) arg;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1345
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1346
(*Quick test whether rule is resolvable with the subgoal with hyps Hs
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1347
  and conclusion B.  If eres_flg then checks 1st premise of rule also*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1348
fun could_bires (Hs, B, eres_flg, rule) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1349
    let fun could_reshyp (A1::_) = exists (apl(A1,could_unify)) Hs
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1350
          | could_reshyp [] = false;  (*no premise -- illegal*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1351
    in  could_unify(concl_of rule, B) andalso
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1352
        (not eres_flg  orelse  could_reshyp (prems_of rule))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1353
    end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1354
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1355
(*Bi-resolution of a state with a list of (flag,rule) pairs.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1356
  Puts the rule above:  rule/state.  Renames vars in the rules. *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1357
fun biresolution match brules i state =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1358
    let val lift = lift_rule(state, i);
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1359
        val (stpairs, Bs, Bi, C) = dest_state(state,i)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1360
        val B = Logic.strip_assums_concl Bi;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1361
        val Hs = Logic.strip_assums_hyp Bi;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1362
        val comp = bicompose_aux match (state, (stpairs, Bs, Bi, C), true);
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1363
        fun res [] = Sequence.null
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1364
          | res ((eres_flg, rule)::brules) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1365
              if could_bires (Hs, B, eres_flg, rule)
1160
8845eb5f0e5e added add_trrules_i;
wenzelm
parents: 1065
diff changeset
  1366
              then Sequence.seqof (*delay processing remainder till needed*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1367
                  (fn()=> Some(comp (eres_flg, lift rule, nprems_of rule),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1368
                               res brules))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1369
              else res brules
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1370
    in  Sequence.flats (res brules)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1371
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1372
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1373
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1374
(*** Meta simp sets ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1375
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1376
type rrule = {thm:thm, lhs:term, perm:bool};
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1377
type cong = {thm:thm, lhs:term};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1378
datatype meta_simpset =
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1379
  Mss of {net:rrule Net.net, congs:(string * cong)list, bounds:string list,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1380
          prems: thm list, mk_rews: thm -> thm list};
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1381
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1382
(*A "mss" contains data needed during conversion:
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1383
  net: discrimination net of rewrite rules
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1384
  congs: association list of congruence rules
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1385
  bounds: names of bound variables already used;
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1386
          for generating new names when rewriting under lambda abstractions
0
a5a9c433f639 Initial revision
clasohm
parents: