src/Pure/thm.ML
author lcp
Mon, 21 Nov 1994 11:49:36 +0100
changeset 721 479832ff2d29
parent 678 6151b7f3b606
child 776 df8f91c0e57c
permissions -rw-r--r--
Pure/thm/norm_term_skip: new, for skipping normalization of the context Pure/thm/bicompose_aux: now computes nlift (number of lifted assumptions in new subgoals) and avoids normalizing the first nlift assumptions in the case where the proof state is not affected. Pure/thm/norm_term_skip: now normalizes types of parameters Pure/thm/THM: aligned colons
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
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     6
The abstract types "theory" and "thm".
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
     7
Also "cterm" / "ctyp" (certified terms / typs under a signature).
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 =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
    11
sig
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    12
  structure Envir 	: ENVIR
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    13
  structure Sequence 	: SEQUENCE
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    14
  structure Sign 	: SIGN
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    15
  type ctyp
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
    16
  type cterm
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    17
  type thm
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    18
  type theory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    19
  type meta_simpset
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    20
  exception THM of string * int * thm list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    21
  exception THEORY of string * theory list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    22
  exception SIMPLIFIER of string * thm
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    23
  (*certified terms/types; previously in sign.ML*)
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    24
  val cterm_of		: Sign.sg -> term -> cterm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    25
  val ctyp_of		: Sign.sg -> typ -> ctyp
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    26
  val read_ctyp		: Sign.sg -> string -> ctyp
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    27
  val read_cterm	: Sign.sg -> string * typ -> cterm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    28
  val rep_cterm		: cterm -> {T:typ, t:term, sign:Sign.sg, maxidx:int}
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    29
  val rep_ctyp		: ctyp -> {T: typ, sign: Sign.sg}
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    30
  val term_of		: cterm -> term
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    31
  val typ_of		: ctyp -> typ
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    32
  val cterm_fun		: (term -> term) -> (cterm -> cterm)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    33
  (*end of cterm/ctyp functions*)
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
    34
  local open Sign.Syntax in
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    35
    val add_classes	: (class * class list) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    36
    val add_classrel	: (class * class) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    37
    val add_defsort	: sort -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    38
    val add_types	: (string * int * mixfix) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    39
    val add_tyabbrs	: (string * string list * string * mixfix) list
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    40
      -> theory -> theory
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    41
    val add_tyabbrs_i	: (string * string list * typ * mixfix) list
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    42
      -> theory -> theory
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    43
    val add_arities	: (string * sort list * sort) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    44
    val add_consts	: (string * string * mixfix) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    45
    val add_consts_i	: (string * typ * mixfix) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    46
    val add_syntax	: (string * string * mixfix) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    47
    val add_syntax_i	: (string * typ * mixfix) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    48
    val add_trfuns	:
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    49
      (string * (ast list -> ast)) list *
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    50
      (string * (term list -> term)) list *
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    51
      (string * (term list -> term)) list *
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    52
      (string * (ast list -> ast)) list -> theory -> theory
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    53
    val add_trrules	: xrule list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    54
    val add_axioms	: (string * string) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    55
    val add_axioms_i	: (string * term) list -> theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    56
    val add_thyname	: string -> theory -> theory
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
    57
  end
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    58
  val cert_axm		: Sign.sg -> string * term -> string * term
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    59
  val read_axm		: Sign.sg -> string * string -> string * term
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    60
  val inferT_axm	: Sign.sg -> string * term -> string * term
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    61
  val abstract_rule	: string -> cterm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    62
  val add_congs		: meta_simpset * thm list -> meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    63
  val add_prems		: meta_simpset * thm list -> meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    64
  val add_simps		: meta_simpset * thm list -> meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    65
  val assume		: cterm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    66
  val assumption	: int -> thm -> thm Sequence.seq
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    67
  val axioms_of		: theory -> (string * term) list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    68
  val beta_conversion	: cterm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    69
  val bicompose		: bool -> bool * thm * int -> int -> thm -> 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    70
                          thm Sequence.seq
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    71
  val biresolution	: bool -> (bool*thm)list -> int -> thm -> 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    72
                          thm Sequence.seq
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    73
  val combination	: thm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    74
  val concl_of		: thm -> term
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    75
  val cprop_of		: thm -> cterm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    76
  val del_simps		: meta_simpset * thm list -> meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    77
  val dest_cimplies	: cterm -> cterm*cterm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    78
  val dest_state	: thm*int -> (term*term)list * term list * term * term
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    79
  val empty_mss		: meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    80
  val eq_assumption	: int -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    81
  val equal_intr	: thm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    82
  val equal_elim	: thm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    83
  val extensional	: thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    84
  val flexflex_rule	: thm -> thm Sequence.seq
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    85
  val flexpair_def	: thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    86
  val forall_elim	: cterm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    87
  val forall_intr	: cterm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    88
  val freezeT		: thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    89
  val get_axiom		: theory -> string -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    90
  val implies_elim	: thm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    91
  val implies_intr	: cterm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    92
  val implies_intr_hyps	: thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    93
  val instantiate	: (indexname*ctyp)list * (cterm*cterm)list -> 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    94
                          thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    95
  val lift_rule		: (thm * int) -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    96
  val merge_theories	: theory * theory -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    97
  val merge_thy_list	: bool -> theory list -> theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    98
  val mk_rews_of_mss	: meta_simpset -> thm -> thm list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
    99
  val mss_of		: thm list -> meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   100
  val nprems_of		: thm -> int
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   101
  val parents_of	: theory -> theory list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   102
  val prems_of		: thm -> term list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   103
  val prems_of_mss	: meta_simpset -> thm list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   104
  val pure_thy		: theory
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   105
  val read_def_cterm 	:
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   106
         Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   107
         string * typ -> cterm * (indexname * typ) list
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   108
   val reflexive	: cterm -> thm
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   109
  val rename_params_rule: string list * int -> thm -> thm
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   110
  val rep_thm		: thm -> {prop: term, hyps: term list, 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   111
				  maxidx: int, sign: Sign.sg}
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   112
  val rewrite_cterm	: bool*bool -> meta_simpset -> 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   113
      (meta_simpset -> thm -> thm option) -> cterm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   114
  val set_mk_rews	: meta_simpset * (thm -> thm list) -> meta_simpset
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   115
  val rep_theory	: theory -> {sign: Sign.sg, 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   116
				     new_axioms: term Sign.Symtab.table,
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   117
				     parents: theory list}
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   118
  val subthy		: theory * theory -> bool
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   119
  val eq_thy		: theory * theory -> bool
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   120
  val sign_of		: theory -> Sign.sg
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   121
  val syn_of		: theory -> Sign.Syntax.syntax
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   122
  val stamps_of_thm	: thm -> string ref list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   123
  val stamps_of_thy	: theory -> string ref list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   124
  val symmetric		: thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   125
  val tpairs_of		: thm -> (term*term)list
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   126
  val trace_simp	: bool ref
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   127
  val transitive	: thm -> thm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   128
  val trivial		: cterm -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   129
  val class_triv	: theory -> class -> thm
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   130
  val varifyT		: thm -> thm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   131
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   132
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   133
functor ThmFun (structure Logic: LOGIC and Unify: UNIFY and Pattern: PATTERN
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   134
  and Net:NET sharing type Pattern.type_sig = Unify.Sign.Type.type_sig): THM =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   135
struct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   136
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   137
structure Sequence = Unify.Sequence;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   138
structure Envir = Unify.Envir;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   139
structure Sign = Unify.Sign;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   140
structure Type = Sign.Type;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   141
structure Syntax = Sign.Syntax;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   142
structure Symtab = Sign.Symtab;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   143
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   144
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   145
(*** Certified terms and types ***)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   146
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   147
(** certified types **)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   148
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   149
(*certified typs under a signature*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   150
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   151
datatype ctyp = Ctyp of {sign: Sign.sg, T: typ};
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   152
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   153
fun rep_ctyp (Ctyp args) = args;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   154
fun typ_of (Ctyp {T, ...}) = T;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   155
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   156
fun ctyp_of sign T =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   157
  Ctyp {sign = sign, T = Sign.certify_typ sign T};
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   158
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   159
fun read_ctyp sign s =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   160
  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
   161
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   162
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   163
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   164
(** certified terms **)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   165
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   166
(*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
   167
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   168
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
   169
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   170
fun rep_cterm (Cterm args) = args;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   171
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
   172
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   173
(*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
   174
fun cterm_of sign tm =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   175
  let val (t, T, maxidx) = Sign.certify_term sign tm
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   176
  in Cterm {sign = sign, t = t, T = T, maxidx = maxidx}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   177
  end handle TYPE (msg, _, _)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   178
    => raise TERM ("Term not in signature\n" ^ msg, [tm]);
229
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
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
   181
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   182
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   183
(*dest_implies for cterms. Note T=prop below*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   184
fun dest_cimplies (Cterm{sign, T, maxidx, t=Const("==>", _) $ A $ B}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   185
       (Cterm{sign=sign, T=T, maxidx=maxidx, t=A},
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   186
        Cterm{sign=sign, T=T, maxidx=maxidx, t=B})
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   187
  | dest_cimplies ct = raise TERM ("dest_cimplies", [term_of ct]);
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
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   190
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   191
(** read cterms **)   (*exception ERROR*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   192
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   193
(*read term, infer types, certify term*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   194
fun read_def_cterm (sign, types, sorts) (a, T) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   195
  let
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   196
    val T' = Sign.certify_typ sign T
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   197
      handle TYPE (msg, _, _) => error msg;
623
ca9f5dbab880 added print_msg;
clasohm
parents: 622
diff changeset
   198
    val ts = Syntax.read (#syn (Sign.rep_sg sign)) T' a;
ca9f5dbab880 added print_msg;
clasohm
parents: 622
diff changeset
   199
    val (_, t', tye) = Sign.infer_types sign types sorts true (ts, T');
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   200
    val ct = cterm_of sign t'
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   201
      handle TERM (msg, _) => error msg;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   202
  in (ct, tye) end;
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   203
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   204
fun read_cterm sign = #1 o read_def_cterm (sign, K None, K None);
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   205
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   206
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   207
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   208
(*** Meta theorems ***)
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   209
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   210
datatype thm = Thm of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   211
  {sign: Sign.sg, maxidx: int, hyps: term list, prop: term};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   212
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   213
fun rep_thm (Thm args) = args;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   214
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   215
(*errors involving theorems*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   216
exception THM of string * int * thm list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   217
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   218
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   219
val sign_of_thm = #sign o rep_thm;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   220
val stamps_of_thm = #stamps o Sign.rep_sg o sign_of_thm;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   221
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   222
(*merge signatures of two theorems; raise exception if incompatible*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   223
fun merge_thm_sgs (th1, th2) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   224
  Sign.merge (pairself sign_of_thm (th1, th2))
574
810da101bad2 read_def_cterm: minor changes;
wenzelm
parents: 564
diff changeset
   225
    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
   226
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   227
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   228
(*maps object-rule to tpairs*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   229
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
   230
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   231
(*maps object-rule to premises*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   232
fun prems_of (Thm {prop, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   233
  Logic.strip_imp_prems (Logic.skip_flexpairs prop);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   234
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   235
(*counts premises in a rule*)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   236
fun nprems_of (Thm {prop, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   237
  Logic.count_prems (Logic.skip_flexpairs prop, 0);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   238
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   239
(*maps object-rule to conclusion*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   240
fun concl_of (Thm {prop, ...}) = Logic.strip_imp_concl prop;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   241
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   242
(*the statement of any thm is a cterm*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   243
fun cprop_of (Thm {sign, maxidx, hyps, prop}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   244
  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
   245
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   246
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   247
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   248
(*** Theories ***)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   249
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   250
datatype theory =
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   251
  Theory of {
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   252
    sign: Sign.sg,
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   253
    new_axioms: term Symtab.table,
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   254
    parents: theory list};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   255
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   256
fun rep_theory (Theory args) = args;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   257
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   258
(*errors involving theories*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   259
exception THEORY of string * theory list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   260
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   261
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   262
val sign_of = #sign o rep_theory;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   263
val syn_of = #syn o Sign.rep_sg o sign_of;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   264
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   265
(*stamps associated with a theory*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   266
val stamps_of_thy = #stamps o Sign.rep_sg o sign_of;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   267
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   268
(*return additional axioms of this theory node*)
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   269
val axioms_of = Symtab.dest o #new_axioms o rep_theory;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   270
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   271
(*return the immediate ancestors*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   272
val parents_of = #parents o rep_theory;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   273
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   274
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   275
(*compare theories*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   276
val subthy = Sign.subsig o pairself sign_of;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   277
val eq_thy = Sign.eq_sg o pairself sign_of;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   278
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   279
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   280
(*look up the named axiom in the theory*)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   281
fun get_axiom theory name =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   282
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   283
    fun get_ax [] = raise Match
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   284
      | get_ax (Theory {sign, new_axioms, parents} :: thys) =
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   285
          (case Symtab.lookup (new_axioms, name) of
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   286
            Some t =>
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   287
              Thm {sign = sign, maxidx = maxidx_of_term t, hyps = [], prop = t}
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   288
          | None => get_ax parents handle Match => get_ax thys);
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   289
  in
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   290
    get_ax [theory] handle Match
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   291
      => raise THEORY ("get_axiom: no axiom " ^ quote name, [theory])
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   292
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   293
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   294
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   295
(* the Pure theory *)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   296
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   297
val pure_thy =
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   298
  Theory {sign = Sign.pure, new_axioms = Symtab.null, parents = []};
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   299
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   300
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   301
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   302
(** extend theory **)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   303
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   304
fun err_dup_axms names =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   305
  error ("Duplicate axiom name(s) " ^ commas_quote names);
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   306
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   307
fun ext_thy (thy as Theory {sign, new_axioms, parents}) sign1 new_axms =
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   308
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   309
    val draft = Sign.is_draft sign;
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   310
    val new_axioms1 =
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   311
      Symtab.extend_new (if draft then new_axioms else Symtab.null, new_axms)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   312
        handle Symtab.DUPS names => err_dup_axms names;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   313
    val parents1 = if draft then parents else [thy];
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   314
  in
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   315
    Theory {sign = sign1, new_axioms = new_axioms1, parents = parents1}
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   316
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   317
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   318
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   319
(* extend signature of a theory *)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   320
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   321
fun ext_sg extfun decls (thy as Theory {sign, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   322
  ext_thy thy (extfun decls sign) [];
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   323
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   324
val add_classes   = ext_sg Sign.add_classes;
421
95e1d4faa863 added add_classrel;
wenzelm
parents: 405
diff changeset
   325
val add_classrel  = ext_sg Sign.add_classrel;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   326
val add_defsort   = ext_sg Sign.add_defsort;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   327
val add_types     = ext_sg Sign.add_types;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   328
val add_tyabbrs   = ext_sg Sign.add_tyabbrs;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   329
val add_tyabbrs_i = ext_sg Sign.add_tyabbrs_i;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   330
val add_arities   = ext_sg Sign.add_arities;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   331
val add_consts    = ext_sg Sign.add_consts;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   332
val add_consts_i  = ext_sg Sign.add_consts_i;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   333
val add_syntax    = ext_sg Sign.add_syntax;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   334
val add_syntax_i  = ext_sg Sign.add_syntax_i;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   335
val add_trfuns    = ext_sg Sign.add_trfuns;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   336
val add_trrules   = ext_sg Sign.add_trrules;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   337
val add_thyname   = ext_sg Sign.add_name;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   338
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   339
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   340
(* prepare axioms *)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   341
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   342
fun err_in_axm name =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   343
  error ("The error(s) above occurred in axiom " ^ quote name);
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   344
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   345
fun no_vars tm =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   346
  if null (term_vars tm) andalso null (term_tvars tm) then tm
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   347
  else error "Illegal schematic variable(s) in term";
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   348
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   349
fun cert_axm sg (name, raw_tm) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   350
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   351
    val Cterm {t, T, ...} = cterm_of sg raw_tm
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   352
      handle TERM (msg, _) => error msg;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   353
  in
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   354
    assert (T = propT) "Term not of type prop";
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   355
    (name, no_vars t)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   356
  end
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   357
  handle ERROR => err_in_axm name;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   358
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   359
fun read_axm sg (name, str) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   360
  (name, no_vars (term_of (read_cterm sg (str, propT))))
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   361
    handle ERROR => err_in_axm name;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   362
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   363
fun inferT_axm sg (name, pre_tm) =
623
ca9f5dbab880 added print_msg;
clasohm
parents: 622
diff changeset
   364
 (name, no_vars (#2 (Sign.infer_types sg (K None) (K None) true ([pre_tm], propT))))
564
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   365
    handle ERROR => err_in_axm name;
eec3a9222b50 added inferT_axm;
wenzelm
parents: 480
diff changeset
   366
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   367
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   368
(* extend axioms of a theory *)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   369
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   370
fun ext_axms prep_axm axms (thy as Theory {sign, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   371
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   372
    val sign1 = Sign.make_draft sign;
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   373
    val axioms = map (apsnd Logic.varify o prep_axm sign) axms;
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   374
  in
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   375
    ext_thy thy sign1 axioms
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   376
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   377
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   378
val add_axioms = ext_axms read_axm;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   379
val add_axioms_i = ext_axms cert_axm;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   380
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   381
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   382
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   383
(** merge theories **)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   384
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   385
fun merge_thy_list mk_draft thys =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   386
  let
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   387
    fun is_union thy = forall (fn t => subthy (t, thy)) thys;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   388
    val is_draft = Sign.is_draft o sign_of;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   389
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   390
    fun add_sign (sg, Theory {sign, ...}) =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   391
      Sign.merge (sg, sign) handle TERM (msg, _) => error msg;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   392
  in
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   393
    (case (find_first is_union thys, exists is_draft thys) of
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   394
      (Some thy, _) => thy
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   395
    | (None, true) => raise THEORY ("Illegal merge of draft theories", thys)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   396
    | (None, false) => Theory {
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   397
        sign =
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   398
          (if mk_draft then Sign.make_draft else I)
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   399
          (foldl add_sign (Sign.pure, thys)),
399
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   400
        new_axioms = Symtab.null,
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   401
        parents = thys})
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   402
  end;
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   403
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   404
fun merge_theories (thy1, thy2) = merge_thy_list false [thy1, thy2];
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   405
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   406
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   407
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   408
(**** Primitive rules ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   409
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   410
(* discharge all assumptions t from ts *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   411
val disch = gen_rem (op aconv);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   412
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   413
(*The assumption rule A|-A in a theory  *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   414
fun assume ct : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   415
  let val {sign, t=prop, T, maxidx} = rep_cterm ct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   416
  in  if T<>propT then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   417
        raise THM("assume: assumptions must have type prop", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   418
      else if maxidx <> ~1 then
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   419
        raise THM("assume: assumptions may not contain scheme variables",
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   420
                  maxidx, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   421
      else Thm{sign = sign, maxidx = ~1, hyps = [prop], prop = prop}
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   422
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   423
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   424
(* Implication introduction
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   425
              A |- B
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   426
              -------
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   427
              A ==> B    *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   428
fun implies_intr cA (thB as Thm{sign,maxidx,hyps,prop}) : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   429
  let val {sign=signA, t=A, T, maxidx=maxidxA} = rep_cterm cA
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   430
  in  if T<>propT then
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   431
        raise THM("implies_intr: assumptions must have type prop", 0, [thB])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   432
      else Thm{sign= Sign.merge (sign,signA),  maxidx= max[maxidxA, maxidx],
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   433
             hyps= disch(hyps,A),  prop= implies$A$prop}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   434
      handle TERM _ =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   435
        raise THM("implies_intr: incompatible signatures", 0, [thB])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   436
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   437
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   438
(* Implication elimination
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   439
        A ==> B       A
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   440
        ---------------
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   441
                B      *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   442
fun implies_elim thAB thA : thm =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   443
    let val Thm{maxidx=maxA, hyps=hypsA, prop=propA,...} = thA
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   444
        and Thm{sign, maxidx, hyps, prop,...} = thAB;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   445
        fun err(a) = raise THM("implies_elim: "^a, 0, [thAB,thA])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   446
    in  case prop of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   447
            imp$A$B =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   448
                if imp=implies andalso  A aconv propA
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   449
                then  Thm{sign= merge_thm_sgs(thAB,thA),
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   450
                          maxidx= max[maxA,maxidx],
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   451
                          hyps= hypsA union hyps,  (*dups suppressed*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   452
                          prop= B}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   453
                else err("major premise")
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   454
          | _ => err("major premise")
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   455
    end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   456
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   457
(* Forall introduction.  The Free or Var x must not be free in the hypotheses.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   458
     A
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   459
   ------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   460
   !!x.A       *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   461
fun forall_intr cx (th as Thm{sign,maxidx,hyps,prop}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   462
  let val x = term_of cx;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   463
      fun result(a,T) = Thm{sign= sign, maxidx= maxidx, hyps= hyps,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   464
                            prop= all(T) $ Abs(a, T, abstract_over (x,prop))}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   465
  in  case x of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   466
        Free(a,T) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   467
          if exists (apl(x, Logic.occs)) hyps
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   468
          then  raise THM("forall_intr: variable free in assumptions", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   469
          else  result(a,T)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   470
      | Var((a,_),T) => result(a,T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   471
      | _ => raise THM("forall_intr: not a variable", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   472
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   473
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   474
(* Forall elimination
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   475
              !!x.A
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   476
             --------
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   477
              A[t/x]     *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   478
fun forall_elim ct (th as Thm{sign,maxidx,hyps,prop}) : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   479
  let val {sign=signt, t, T, maxidx=maxt} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   480
  in  case prop of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   481
          Const("all",Type("fun",[Type("fun",[qary,_]),_])) $ A =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   482
            if T<>qary then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   483
                raise THM("forall_elim: type mismatch", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   484
            else Thm{sign= Sign.merge(sign,signt),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   485
                     maxidx= max[maxidx, maxt],
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   486
                     hyps= hyps,  prop= betapply(A,t)}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   487
        | _ => raise THM("forall_elim: not quantified", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   488
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   489
  handle TERM _ =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   490
         raise THM("forall_elim: incompatible signatures", 0, [th]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   491
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   492
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   493
(*** Equality ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   494
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   495
(*Definition of the relation =?= *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   496
val flexpair_def =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   497
  Thm{sign= Sign.pure, hyps= [], maxidx= 0,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   498
      prop= term_of
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   499
              (read_cterm Sign.pure
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   500
                 ("(?t =?= ?u) == (?t == ?u::?'a::{})", propT))};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   501
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   502
(*The reflexivity rule: maps  t   to the theorem   t==t   *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   503
fun reflexive ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   504
  let val {sign, t, T, maxidx} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   505
  in  Thm{sign= sign, hyps= [], maxidx= maxidx, prop= Logic.mk_equals(t,t)}
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   506
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   507
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   508
(*The symmetry rule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   509
    t==u
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   510
    ----
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   511
    u==t         *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   512
fun symmetric (th as Thm{sign,hyps,prop,maxidx}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   513
  case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   514
      (eq as Const("==",_)) $ t $ u =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   515
          Thm{sign=sign, hyps=hyps, maxidx=maxidx, prop= eq$u$t}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   516
    | _ => raise THM("symmetric", 0, [th]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   517
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   518
(*The transitive rule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   519
    t1==u    u==t2
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   520
    ------------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   521
        t1==t2      *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   522
fun transitive th1 th2 =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   523
  let val Thm{maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   524
      and Thm{maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   525
      fun err(msg) = raise THM("transitive: "^msg, 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   526
  in case (prop1,prop2) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   527
       ((eq as Const("==",_)) $ t1 $ u, Const("==",_) $ u' $ t2) =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   528
          if not (u aconv u') then err"middle term"  else
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   529
              Thm{sign= merge_thm_sgs(th1,th2), hyps= hyps1 union hyps2,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   530
                  maxidx= max[max1,max2], prop= eq$t1$t2}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   531
     | _ =>  err"premises"
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   532
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   533
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   534
(*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
   535
fun beta_conversion ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   536
  let val {sign, t, T, maxidx} = rep_cterm ct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   537
  in  case t of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   538
          Abs(_,_,bodt) $ u =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   539
            Thm{sign= sign,  hyps= [],
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   540
                maxidx= maxidx_of_term t,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   541
                prop= Logic.mk_equals(t, subst_bounds([u],bodt))}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   542
        | _ =>  raise THM("beta_conversion: not a redex", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   543
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   544
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   545
(*The extensionality rule   (proviso: x not free in f, g, or hypotheses)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   546
    f(x) == g(x)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   547
    ------------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   548
       f == g    *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   549
fun extensional (th as Thm{sign,maxidx,hyps,prop}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   550
  case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   551
    (Const("==",_)) $ (f$x) $ (g$y) =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   552
      let fun err(msg) = raise THM("extensional: "^msg, 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   553
      in (if x<>y then err"different variables" else
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   554
          case y of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   555
                Free _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   556
                  if exists (apl(y, Logic.occs)) (f::g::hyps)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   557
                  then err"variable free in hyps or functions"    else  ()
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   558
              | Var _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   559
                  if Logic.occs(y,f)  orelse  Logic.occs(y,g)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   560
                  then err"variable free in functions"   else  ()
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   561
              | _ => err"not a variable");
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   562
          Thm{sign=sign, hyps=hyps, maxidx=maxidx,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   563
              prop= Logic.mk_equals(f,g)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   564
      end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   565
 | _ =>  raise THM("extensional: premise", 0, [th]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   566
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   567
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   568
  The bound variable will be named "a" (since x will be something like x320)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   569
          t == u
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   570
    ----------------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   571
      %(x)t == %(x)u     *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   572
fun abstract_rule a cx (th as Thm{sign,maxidx,hyps,prop}) =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   573
  let val x = term_of cx;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   574
      val (t,u) = Logic.dest_equals prop
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   575
            handle TERM _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   576
                raise THM("abstract_rule: premise not an equality", 0, [th])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   577
      fun result T =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   578
            Thm{sign= sign, maxidx= maxidx, hyps= hyps,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   579
                prop= Logic.mk_equals(Abs(a, T, abstract_over (x,t)),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   580
                                      Abs(a, T, abstract_over (x,u)))}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   581
  in  case x of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   582
        Free(_,T) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   583
         if exists (apl(x, Logic.occs)) hyps
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   584
         then raise THM("abstract_rule: variable free in assumptions", 0, [th])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   585
         else result T
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   586
      | Var(_,T) => result T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   587
      | _ => raise THM("abstract_rule: not a variable", 0, [th])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   588
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   589
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   590
(*The combination rule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   591
    f==g    t==u
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   592
    ------------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   593
     f(t)==g(u)      *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   594
fun combination th1 th2 =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   595
  let val Thm{maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   596
      and Thm{maxidx=max2, hyps=hyps2, prop=prop2,...} = th2
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   597
  in  case (prop1,prop2)  of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   598
       (Const("==",_) $ f $ g, Const("==",_) $ t $ u) =>
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   599
              Thm{sign= merge_thm_sgs(th1,th2), hyps= hyps1 union hyps2,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   600
                  maxidx= max[max1,max2], prop= Logic.mk_equals(f$t, g$u)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   601
     | _ =>  raise THM("combination: premises", 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   602
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   603
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   604
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   605
(*The equal propositions rule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   606
    A==B    A
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   607
    ---------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   608
        B          *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   609
fun equal_elim th1 th2 =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   610
  let val Thm{maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   611
      and Thm{maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   612
      fun err(msg) = raise THM("equal_elim: "^msg, 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   613
  in  case prop1  of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   614
       Const("==",_) $ A $ B =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   615
          if not (prop2 aconv A) then err"not equal"  else
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   616
              Thm{sign= merge_thm_sgs(th1,th2), hyps= hyps1 union hyps2,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   617
                  maxidx= max[max1,max2], prop= B}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   618
     | _ =>  err"major premise"
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   619
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   620
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   621
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   622
(* Equality introduction
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   623
    A==>B    B==>A
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   624
    -------------
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   625
         A==B            *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   626
fun equal_intr th1 th2 =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   627
let val Thm{maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   628
    and Thm{maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   629
    fun err(msg) = raise THM("equal_intr: "^msg, 0, [th1,th2])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   630
in case (prop1,prop2) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   631
     (Const("==>",_) $ A $ B, Const("==>",_) $ B' $ A')  =>
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   632
        if A aconv A' andalso B aconv B'
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   633
        then Thm{sign= merge_thm_sgs(th1,th2), hyps= hyps1 union hyps2,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   634
                 maxidx= max[max1,max2], prop= Logic.mk_equals(A,B)}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   635
        else err"not equal"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   636
   | _ =>  err"premises"
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   637
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   638
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   639
(**** Derived rules ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   640
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   641
(*Discharge all hypotheses (need not verify cterms)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   642
  Repeated hypotheses are discharged only once;  fold cannot do this*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   643
fun implies_intr_hyps (Thm{sign, maxidx, hyps=A::As, prop}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   644
      implies_intr_hyps
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   645
            (Thm{sign=sign,  maxidx=maxidx,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   646
                 hyps= disch(As,A),  prop= implies$A$prop})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   647
  | implies_intr_hyps th = th;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   648
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   649
(*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
   650
  Instantiates the theorem and deletes trivial tpairs.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   651
  Resulting sequence may contain multiple elements if the tpairs are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   652
    not all flex-flex. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   653
fun flexflex_rule (Thm{sign,maxidx,hyps,prop}) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   654
  let fun newthm env =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   655
          let val (tpairs,horn) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   656
                        Logic.strip_flexpairs (Envir.norm_term env prop)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   657
                (*Remove trivial tpairs, of the form t=t*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   658
              val distpairs = filter (not o op aconv) tpairs
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   659
              val newprop = Logic.list_flexpairs(distpairs, horn)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   660
          in  Thm{sign= sign, hyps= hyps,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   661
                  maxidx= maxidx_of_term newprop, prop= newprop}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   662
          end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   663
      val (tpairs,_) = Logic.strip_flexpairs prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   664
  in Sequence.maps newthm
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   665
            (Unify.smash_unifiers(sign, Envir.empty maxidx, tpairs))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   666
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   667
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   668
(*Instantiation of Vars
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   669
                      A
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   670
             --------------------
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   671
              A[t1/v1,....,tn/vn]     *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   672
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   673
(*Check that all the terms are Vars and are distinct*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   674
fun instl_ok ts = forall is_Var ts andalso null(findrep ts);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   675
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   676
(*For instantiate: process pair of cterms, merge theories*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   677
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
   678
  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
   679
      and {sign=signu, t=u, T= U, ...} = rep_cterm cu
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   680
  in  if T=U  then (Sign.merge(sign, Sign.merge(signt, signu)), (t,u)::tpairs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   681
      else raise TYPE("add_ctpair", [T,U], [t,u])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   682
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   683
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   684
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
   685
  let val {T,sign} = rep_ctyp ctyp
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   686
  in (Sign.merge(sign,sign'), (v,T)::vTs) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   687
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   688
(*Left-to-right replacements: ctpairs = [...,(vi,ti),...].
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   689
  Instantiates distinct Vars by terms of same type.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   690
  Normalizes the new theorem! *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   691
fun instantiate (vcTs,ctpairs)  (th as Thm{sign,maxidx,hyps,prop}) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   692
  let val (newsign,tpairs) = foldr add_ctpair (ctpairs, (sign,[]));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   693
      val (newsign,vTs) = foldr add_ctyp (vcTs, (newsign,[]));
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   694
      val newprop =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   695
            Envir.norm_term (Envir.empty 0)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   696
              (subst_atomic tpairs
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   697
               (Type.inst_term_tvars(#tsig(Sign.rep_sg newsign),vTs) prop))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   698
      val newth = Thm{sign= newsign, hyps= hyps,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   699
                      maxidx= maxidx_of_term newprop, prop= newprop}
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   700
  in  if not(instl_ok(map #1 tpairs))
193
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   701
      then raise THM("instantiate: variables not distinct", 0, [th])
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   702
      else if not(null(findrep(map #1 vTs)))
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   703
      then raise THM("instantiate: type variables not distinct", 0, [th])
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   704
      else (*Check types of Vars for agreement*)
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   705
      case findrep (map (#1 o dest_Var) (term_vars newprop)) of
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   706
          ix::_ => raise THM("instantiate: conflicting types for variable " ^
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   707
                             Syntax.string_of_vname ix ^ "\n", 0, [newth])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   708
        | [] =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   709
             case findrep (map #1 (term_tvars newprop)) of
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   710
             ix::_ => raise THM
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   711
                    ("instantiate: conflicting sorts for type variable " ^
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   712
                     Syntax.string_of_vname ix ^ "\n", 0, [newth])
193
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   713
        | [] => newth
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   714
  end
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   715
  handle TERM _ =>
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   716
           raise THM("instantiate: incompatible signatures",0,[th])
193
b2be328e00c3 updated instantiate to deal with type clashes
nipkow
parents: 134
diff changeset
   717
       | TYPE _ => raise THM("instantiate: type conflict", 0, [th]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   718
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   719
(*The trivial implication A==>A, justified by assume and forall rules.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   720
  A can contain Vars, not so for assume!   *)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   721
fun trivial ct : thm =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
   722
  let val {sign, t=A, T, maxidx} = rep_cterm ct
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   723
  in  if T<>propT then
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   724
            raise THM("trivial: the term must have type prop", 0, [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   725
      else Thm{sign= sign, maxidx= maxidx, hyps= [], prop= implies$A$A}
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   726
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   727
480
d74522d9437f fixed comment: "(| _ : _ |)" to "OFCLASS(_, _)"
wenzelm
parents: 446
diff changeset
   728
(*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
   729
  Is weaker than some definition of c_class, e.g. "c_class == %x.T";
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   730
  may be interpreted as an instance of A==>A.*)
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   731
fun class_triv thy c =
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   732
  let
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   733
    val sign = sign_of thy;
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   734
    val Cterm {t, maxidx, ...} =
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   735
      cterm_of sign (Logic.mk_inclass (TVar (("'a", 0), [c]), c))
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   736
        handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []);
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   737
  in
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   738
    Thm {sign = sign, maxidx = maxidx, hyps = [], prop = t}
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   739
  end;
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   740
86cc2b98f9e0 added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents: 387
diff changeset
   741
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   742
(* Replace all TFrees not in the hyps by new TVars *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   743
fun varifyT(Thm{sign,maxidx,hyps,prop}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   744
  let val tfrees = foldr add_term_tfree_names (hyps,[])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   745
  in Thm{sign=sign, maxidx=max[0,maxidx], hyps=hyps,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   746
         prop= Type.varify(prop,tfrees)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   747
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   748
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   749
(* Replace all TVars by new TFrees *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   750
fun freezeT(Thm{sign,maxidx,hyps,prop}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   751
  let val prop' = Type.freeze (K true) prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   752
  in Thm{sign=sign, maxidx=maxidx_of_term prop', hyps=hyps, prop=prop'} end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   753
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   754
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   755
(*** Inference rules for tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   756
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   757
(*Destruct proof state into constraints, other goals, goal(i), rest *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   758
fun dest_state (state as Thm{prop,...}, i) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   759
  let val (tpairs,horn) = Logic.strip_flexpairs prop
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   760
  in  case  Logic.strip_prems(i, [], horn) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   761
          (B::rBs, C) => (tpairs, rev rBs, B, C)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   762
        | _ => raise THM("dest_state", i, [state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   763
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   764
  handle TERM _ => raise THM("dest_state", i, [state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   765
309
3751567696bf restored the signature constraint :THM
lcp
parents: 305
diff changeset
   766
(*Increment variables and parameters of orule as required for
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   767
  resolution with goal i of state. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   768
fun lift_rule (state, i) orule =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   769
  let val Thm{prop=sprop,maxidx=smax,...} = state;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   770
      val (Bi::_, _) = Logic.strip_prems(i, [], Logic.skip_flexpairs sprop)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   771
        handle TERM _ => raise THM("lift_rule", i, [orule,state]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   772
      val (lift_abs,lift_all) = Logic.lift_fns(Bi,smax+1);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   773
      val (Thm{sign,maxidx,hyps,prop}) = orule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   774
      val (tpairs,As,B) = Logic.strip_horn prop
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   775
  in  Thm{hyps=hyps, sign= merge_thm_sgs(state,orule),
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   776
          maxidx= maxidx+smax+1,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   777
          prop= Logic.rule_of(map (pairself lift_abs) tpairs,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   778
                              map lift_all As,    lift_all B)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   779
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   780
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   781
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   782
fun assumption i state =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   783
  let val Thm{sign,maxidx,hyps,prop} = state;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   784
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   785
      fun newth (env as Envir.Envir{maxidx, ...}, tpairs) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   786
          Thm{sign=sign, hyps=hyps, maxidx=maxidx, prop=
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   787
            if Envir.is_empty env then (*avoid wasted normalizations*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   788
              Logic.rule_of (tpairs, Bs, C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   789
            else (*normalize the new rule fully*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   790
              Envir.norm_term env (Logic.rule_of (tpairs, Bs, C))};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   791
      fun addprfs [] = Sequence.null
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   792
        | addprfs ((t,u)::apairs) = Sequence.seqof (fn()=> Sequence.pull
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   793
             (Sequence.mapp newth
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   794
                (Unify.unifiers(sign,Envir.empty maxidx, (t,u)::tpairs))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   795
                (addprfs apairs)))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   796
  in  addprfs (Logic.assum_pairs Bi)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   797
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   798
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   799
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   800
fun eq_assumption i state =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   801
  let val Thm{sign,maxidx,hyps,prop} = state;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   802
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   803
  in  if exists (op aconv) (Logic.assum_pairs Bi)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   804
      then Thm{sign=sign, hyps=hyps, maxidx=maxidx,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   805
               prop=Logic.rule_of(tpairs, Bs, C)}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   806
      else  raise THM("eq_assumption", 0, [state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   807
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   808
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   809
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   810
(** User renaming of parameters in a subgoal **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   811
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   812
(*Calls error rather than raising an exception because it is intended
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   813
  for top-level use -- exception handling would not make sense here.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   814
  The names in cs, if distinct, are used for the innermost parameters;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   815
   preceding parameters may be renamed to make all params distinct.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   816
fun rename_params_rule (cs, i) state =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   817
  let val Thm{sign,maxidx,hyps,prop} = state
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   818
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   819
      val iparams = map #1 (Logic.strip_params Bi)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   820
      val short = length iparams - length cs
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   821
      val newnames =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   822
            if short<0 then error"More names than abstractions!"
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   823
            else variantlist(take (short,iparams), cs) @ cs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   824
      val freenames = map (#1 o dest_Free) (term_frees prop)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   825
      val newBi = Logic.list_rename_params (newnames, Bi)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   826
  in
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   827
  case findrep cs of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   828
     c::_ => error ("Bound variables not distinct: " ^ c)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   829
   | [] => (case cs inter freenames of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   830
       a::_ => error ("Bound/Free variable clash: " ^ a)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   831
     | [] => Thm{sign=sign, hyps=hyps, maxidx=maxidx, prop=
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   832
                    Logic.rule_of(tpairs, Bs@[newBi], C)})
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   833
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   834
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   835
(*** Preservation of bound variable names ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   836
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   837
(*Scan a pair of terms; while they are similar,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   838
  accumulate corresponding bound vars in "al"*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   839
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) = match_bvs(s,t,(x,y)::al)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   840
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   841
  | match_bvs(_,_,al) = al;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   842
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   843
(* strip abstractions created by parameters *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   844
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   845
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   846
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   847
(* strip_apply f A(,B) strips off all assumptions/parameters from A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   848
   introduced by lifting over B, and applies f to remaining part of A*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   849
fun strip_apply f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   850
  let fun strip(Const("==>",_)$ A1 $ B1,
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   851
                Const("==>",_)$ _  $ B2) = implies $ A1 $ strip(B1,B2)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   852
        | strip((c as Const("all",_)) $ Abs(a,T,t1),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   853
                      Const("all",_)  $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   854
        | strip(A,_) = f A
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   855
  in strip end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   856
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   857
(*Use the alist to rename all bound variables and some unknowns in a term
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   858
  dpairs = current disagreement pairs;  tpairs = permanent ones (flexflex);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   859
  Preserves unknowns in tpairs and on lhs of dpairs. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   860
fun rename_bvs([],_,_,_) = I
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   861
  | rename_bvs(al,dpairs,tpairs,B) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   862
    let val vars = foldr add_term_vars
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   863
                        (map fst dpairs @ map fst tpairs @ map snd tpairs, [])
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   864
        (*unknowns appearing elsewhere be preserved!*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   865
        val vids = map (#1 o #1 o dest_Var) vars;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   866
        fun rename(t as Var((x,i),T)) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   867
                (case assoc(al,x) of
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   868
                   Some(y) => if x mem vids orelse y mem vids then t
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   869
                              else Var((y,i),T)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   870
                 | None=> t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   871
          | rename(Abs(x,T,t)) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   872
              Abs(case assoc(al,x) of Some(y) => y | None => x,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   873
                  T, rename t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   874
          | rename(f$t) = rename f $ rename t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   875
          | rename(t) = t;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   876
        fun strip_ren Ai = strip_apply rename (Ai,B)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   877
    in strip_ren end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   878
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   879
(*Function to rename bounds/unknowns in the argument, lifted over B*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   880
fun rename_bvars(dpairs, tpairs, B) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   881
        rename_bvs(foldr match_bvars (dpairs,[]), dpairs, tpairs, B);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   882
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   883
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   884
(*** RESOLUTION ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   885
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   886
(** Lifting optimizations **)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   887
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   888
(*strip off pairs of assumptions/parameters in parallel -- they are
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   889
  identical because of lifting*)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   890
fun strip_assums2 (Const("==>", _) $ _ $ B1,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   891
                   Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   892
  | strip_assums2 (Const("all",_)$Abs(a,T,t1),
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   893
                   Const("all",_)$Abs(_,_,t2)) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   894
      let val (B1,B2) = strip_assums2 (t1,t2)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   895
      in  (Abs(a,T,B1), Abs(a,T,B2))  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   896
  | strip_assums2 BB = BB;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   897
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   898
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   899
(*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
   900
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
   901
  | 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
   902
        let val Envir.Envir{iTs, ...} = env
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   903
	    val T' = typ_subst_TVars iTs T
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   904
	    (*Must instantiate types of parameters because they are flattened;
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   905
              this could be a NEW parameter*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   906
        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
   907
  | norm_term_skip env n (Const("==>", _) $ A $ B) =
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   908
	implies $ A $ norm_term_skip env (n-1) B
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   909
  | 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
   910
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   911
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   912
(*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
   913
  Unifies B with Bi, replacing subgoal i    (1 <= i <= n)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   914
  If match then forbid instantiations in proof state
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   915
  If lifted then shorten the dpair using strip_assums2.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   916
  If eres_flg then simultaneously proves A1 by assumption.
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   917
  nsubgoal is the number of new subgoals (written m above).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   918
  Curried so that resolution calls dest_state only once.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   919
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   920
local open Sequence; exception Bicompose
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   921
in
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   922
fun bicompose_aux match (state, (stpairs, Bs, Bi, C), lifted)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   923
                        (eres_flg, orule, nsubgoal) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   924
 let val Thm{maxidx=smax, hyps=shyps, ...} = state
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   925
     and Thm{maxidx=rmax, hyps=rhyps, prop=rprop,...} = orule
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   926
	     (*How many hyps to skip over during normalization*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   927
     and nlift = Logic.count_prems(strip_all_body Bi, 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   928
				   if eres_flg then ~1 else 0)
387
69f4356d915d new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents: 309
diff changeset
   929
     val sign = merge_thm_sgs(state,orule);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   930
     (** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   931
     fun addth As ((env as Envir.Envir {maxidx, ...}, tpairs), thq) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   932
       let val normt = Envir.norm_term env;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   933
           (*perform minimal copying here by examining env*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   934
           val normp =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   935
             if Envir.is_empty env then (tpairs, Bs @ As, C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   936
             else
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   937
             let val ntps = map (pairself normt) tpairs
721
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   938
             in if the (Envir.minidx env) > smax then 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   939
		  (*no assignments in state; normalize the rule only*)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   940
                  if lifted 
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   941
		  then (ntps, Bs @ map (norm_term_skip env nlift) As, C)
479832ff2d29 Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents: 678
diff changeset
   942
		  else (ntps, Bs @ map normt As, C)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   943
                else if match then raise Bicompose
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   944
                else (*normalize the new rule fully*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   945
                  (ntps, map normt (Bs @ As), normt C)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   946
             end
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   947
           val th = Thm{sign=sign, hyps=rhyps union shyps, maxidx=maxidx,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   948
                        prop= Logic.rule_of normp}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   949
        in  cons(th, thq)  end  handle Bicompose => thq
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   950
     val (rtpairs,rhorn) = Logic.strip_flexpairs(rprop);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   951
     val (rAs,B) = Logic.strip_prems(nsubgoal, [], rhorn)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   952
       handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   953
     (*Modify assumptions, deleting n-th if n>0 for e-resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   954
     fun newAs(As0, n, dpairs, tpairs) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   955
       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
   956
                     else map (rename_bvars(dpairs,tpairs,B)) As0
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   957
       in (map (Logic.flatten_params n) As1)
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   958
          handle TERM _ =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   959
          raise THM("bicompose: 1st premise", 0, [orule])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   960
       end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   961
     val env = Envir.empty(max[rmax,smax]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   962
     val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   963
     val dpairs = BBi :: (rtpairs@stpairs);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   964
     (*elim-resolution: try each assumption in turn.  Initially n=1*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   965
     fun tryasms (_, _, []) = null
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   966
       | tryasms (As, n, (t,u)::apairs) =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   967
          (case pull(Unify.unifiers(sign, env, (t,u)::dpairs))  of
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   968
               None                   => tryasms (As, n+1, apairs)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   969
             | cell as Some((_,tpairs),_) =>
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   970
                   its_right (addth (newAs(As, n, [BBi,(u,t)], tpairs)))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   971
                       (seqof (fn()=> cell),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   972
                        seqof (fn()=> pull (tryasms (As, n+1, apairs)))));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   973
     fun eres [] = raise THM("bicompose: no premises", 0, [orule,state])
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   974
       | eres (A1::As) = tryasms (As, 1, Logic.assum_pairs A1);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   975
     (*ordinary resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   976
     fun res(None) = null
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   977
       | res(cell as Some((_,tpairs),_)) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   978
             its_right (addth(newAs(rev rAs, 0, [BBi], tpairs)))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   979
                       (seqof (fn()=> cell), null)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   980
 in  if eres_flg then eres(rev rAs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   981
     else res(pull(Unify.unifiers(sign, env, dpairs)))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   982
 end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   983
end;  (*open Sequence*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   984
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   985
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   986
fun bicompose match arg i state =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   987
    bicompose_aux match (state, dest_state(state,i), false) arg;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   988
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   989
(*Quick test whether rule is resolvable with the subgoal with hyps Hs
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   990
  and conclusion B.  If eres_flg then checks 1st premise of rule also*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   991
fun could_bires (Hs, B, eres_flg, rule) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   992
    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
   993
          | could_reshyp [] = false;  (*no premise -- illegal*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   994
    in  could_unify(concl_of rule, B) andalso
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
   995
        (not eres_flg  orelse  could_reshyp (prems_of rule))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   996
    end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   997
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   998
(*Bi-resolution of a state with a list of (flag,rule) pairs.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   999
  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
  1000
fun biresolution match brules i state =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1001
    let val lift = lift_rule(state, i);
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1002
        val (stpairs, Bs, Bi, C) = dest_state(state,i)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1003
        val B = Logic.strip_assums_concl Bi;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1004
        val Hs = Logic.strip_assums_hyp Bi;
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1005
        val comp = bicompose_aux match (state, (stpairs, Bs, Bi, C), true);
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1006
        fun res [] = Sequence.null
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1007
          | res ((eres_flg, rule)::brules) =
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1008
              if could_bires (Hs, B, eres_flg, rule)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1009
              then Sequence.seqof (*delay processing remainder til needed*)
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1010
                  (fn()=> Some(comp (eres_flg, lift rule, nprems_of rule),
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1011
                               res brules))
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1012
              else res brules
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1013
    in  Sequence.flats (res brules)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1014
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1015
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1016
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1017
(*** Meta simp sets ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1018
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1019
type rrule = {thm:thm, lhs:term, perm:bool};
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1020
type cong = {thm:thm, lhs:term};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1021
datatype meta_simpset =
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1022
  Mss of {net:rrule Net.net, congs:(string * cong)list, bounds:string list,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1023
          prems: thm list, mk_rews: thm -> thm list};
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1024
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1025
(*A "mss" contains data needed during conversion:
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1026
  net: discrimination net of rewrite rules
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1027
  congs: association list of congruence rules
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1028
  bounds: names of bound variables already used;
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1029
          for generating new names when rewriting under lambda abstractions
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1030
  mk_rews: used when local assumptions are added
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1031
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1032
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1033
val empty_mss = Mss{net= Net.empty, congs= [], bounds=[], prems= [],
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1034
                    mk_rews = K[]};
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1035
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1036
exception SIMPLIFIER of string * thm;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1037
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1038
fun prtm a sign t = (writeln a; writeln(Sign.string_of_term sign t));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1039
209
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1040
val trace_simp = ref false;
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1041
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1042
fun trace_term a sign t = if !trace_simp then prtm a sign t else ();
209
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1043
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1044
fun trace_thm a (Thm{sign,prop,...}) = trace_term a sign prop;
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1045
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1046
fun vperm(Var _, Var _) = true
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1047
  | vperm(Abs(_,_,s), Abs(_,_,t)) = vperm(s,t)
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1048
  | vperm(t1$t2, u1$u2) = vperm(t1,u1) andalso vperm(t2,u2)
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1049
  | vperm(t,u) = (t=u);
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1050
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1051
fun var_perm(t,u) = vperm(t,u) andalso
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1052
                    eq_set(add_term_vars(t,[]), add_term_vars(u,[]))
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1053
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1054
(*simple test for looping rewrite*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1055
fun loops sign prems (lhs,rhs) =
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1056
  is_Var(lhs) orelse
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1057
  (null(prems) andalso
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1058
   Pattern.matches (#tsig(Sign.rep_sg sign)) (lhs,rhs));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1059
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1060
fun mk_rrule (thm as Thm{hyps,sign,prop,maxidx,...}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1061
  let val prems = Logic.strip_imp_prems prop
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1062
      val concl = Logic.strip_imp_concl prop
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1063
      val (lhs,_) = Logic.dest_equals concl handle TERM _ =>
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1064
                      raise SIMPLIFIER("Rewrite rule not a meta-equality",thm)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1065
      val econcl = Pattern.eta_contract concl
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1066
      val (elhs,erhs) = Logic.dest_equals econcl
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1067
      val perm = var_perm(elhs,erhs) andalso not(elhs aconv erhs)
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1068
                                     andalso not(is_Var(elhs))
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1069
  in if not perm andalso loops sign prems (elhs,erhs)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1070
     then (prtm "Warning: ignoring looping rewrite rule" sign prop; None)
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1071
     else Some{thm=thm,lhs=lhs,perm=perm}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1072
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1073
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1074
local
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1075
 fun eq({thm=Thm{prop=p1,...},...}:rrule,
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1076
        {thm=Thm{prop=p2,...},...}:rrule) = p1 aconv p2
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1077
in
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1078
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1079
fun add_simp(mss as Mss{net,congs,bounds,prems,mk_rews},
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1080
             thm as Thm{sign,prop,...}) =
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1081
  case mk_rrule thm of
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1082
    None => mss
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1083
  | Some(rrule as {lhs,...}) =>
209
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1084
      (trace_thm "Adding rewrite rule:" thm;
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1085
       Mss{net= (Net.insert_term((lhs,rrule),net,eq)
feb8ff35810a changed tracing of simplifier
nipkow
parents: 208
diff changeset
  1086
                 handle Net.INSERT =>
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1087
                  (prtm "Warning: ignoring duplicate rewrite rule" sign prop;
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1088
                   net)),
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1089
           congs=congs, bounds=bounds, prems=prems,mk_rews=mk_rews});
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1090
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1091
fun del_simp(mss as Mss{net,congs,bounds,prems,mk_rews},
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1092
             thm as Thm{sign,prop,...}) =
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1093
  case mk_rrule thm of
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1094
    None => mss
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1095
  | Some(rrule as {lhs,...}) =>
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1096
      Mss{net= (Net.delete_term((lhs,rrule),net,eq)
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1097
                handle Net.INSERT =>
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1098
                 (prtm "Warning: rewrite rule not in simpset" sign prop;
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1099
                  net)),
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1100
             congs=congs, bounds=bounds, prems=prems,mk_rews=mk_rews}
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1101
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1102
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1103
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1104
val add_simps = foldl add_simp;
87
c378e56d4a4b added function del_simps
nipkow
parents: 0
diff changeset
  1105
val del_simps = foldl del_simp;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1106
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1107
fun mss_of thms = add_simps(empty_mss,thms);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1108
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1109
fun add_cong(Mss{net,congs,bounds,prems,mk_rews},thm) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1110
  let val (lhs,_) = Logic.dest_equals(concl_of thm) handle TERM _ =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1111
                    raise SIMPLIFIER("Congruence not a meta-equality",thm)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1112
(*      val lhs = Pattern.eta_contract lhs*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1113
      val (a,_) = dest_Const (head_of lhs) handle TERM _ =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1114
                  raise SIMPLIFIER("Congruence must start with a constant",thm)
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1115
  in Mss{net=net, congs=(a,{lhs=lhs,thm=thm})::congs, bounds=bounds,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1116
         prems=prems, mk_rews=mk_rews}
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1117
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1118
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1119
val (op add_congs) = foldl add_cong;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1120
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1121
fun add_prems(Mss{net,congs,bounds,prems,mk_rews},thms) =
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1122
  Mss{net=net, congs=congs, bounds=bounds, prems=thms@prems, mk_rews=mk_rews};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1123
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1124
fun prems_of_mss(Mss{prems,...}) = prems;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1125
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1126
fun set_mk_rews(Mss{net,congs,bounds,prems,...},mk_rews) =
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1127
  Mss{net=net, congs=congs, bounds=bounds, prems=prems, mk_rews=mk_rews};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1128
fun mk_rews_of_mss(Mss{mk_rews,...}) = mk_rews;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1129
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1130
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1131
(*** Meta-level rewriting
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1132
     uses conversions, omitting proofs for efficiency.  See
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1133
        L C Paulson, A higher-order implementation of rewriting,
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1134
        Science of Computer Programming 3 (1983), pages 119-149. ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1135
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1136
type prover = meta_simpset -> thm -> thm option;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1137
type termrec = (Sign.sg * term list) * term;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1138
type conv = meta_simpset -> termrec -> termrec;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1139
305
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1140
datatype order = LESS | EQUAL | GREATER;
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1141
305
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1142
fun stringord(a,b:string) = if a<b then LESS  else
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1143
                            if a=b then EQUAL else GREATER;
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1144
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1145
fun intord(i,j:int) = if i<j then LESS  else
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1146
                      if i=j then EQUAL else GREATER;
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1147
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1148
(* NB: non-linearity of the ordering is not a soundness problem *)
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1149
305
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1150
(* FIXME: "***ABSTRACTION***" is a hack and makes the ordering non-linear *)
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1151
fun string_of_hd(Const(a,_)) = a
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1152
  | string_of_hd(Free(a,_))  = a
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1153
  | string_of_hd(Var(v,_))   = Syntax.string_of_vname v
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1154
  | string_of_hd(Bound i)    = string_of_int i
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1155
  | string_of_hd(Abs _)      = "***ABSTRACTION***";
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1156
305
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1157
(* a strict (not reflexive) linear well-founded AC-compatible ordering
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1158
 * for terms:
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1159
 * s < t <=> 1. size(s) < size(t) or
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1160
             2. size(s) = size(t) and s=f(...) and t = g(...) and f<g or
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1161
             3. size(s) = size(t) and s=f(s1..sn) and t=f(t1..tn) and
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1162
                (s1..sn) < (t1..tn) (lexicographically)
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1163
 *)
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1164
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1165
(* FIXME: should really take types into account as well.
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1166
 * Otherwise non-linear *)
622
bf9821f58781 Modified termord to take account of the Abs-Abs case.
nipkow
parents: 574
diff changeset
  1167
fun termord(Abs(_,_,t),Abs(_,_,u)) = termord(t,u)
bf9821f58781 Modified termord to take account of the Abs-Abs case.
nipkow
parents: 574
diff changeset
  1168
  | termord(t,u) =
305
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1169
      (case intord(size_of_term t,size_of_term u) of
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1170
         EQUAL => let val (f,ts) = strip_comb t and (g,us) = strip_comb u
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1171
                  in case stringord(string_of_hd f, string_of_hd g) of
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1172
                       EQUAL => lextermord(ts,us)
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1173
                     | ord   => ord
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1174
                  end
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1175
       | ord => ord)
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1176
and lextermord(t::ts,u::us) =
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1177
      (case termord(t,u) of
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1178
         EQUAL => lextermord(ts,us)
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1179
       | ord   => ord)
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1180
  | lextermord([],[]) = EQUAL
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1181
  | lextermord _ = error("lextermord");
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1182
305
4c2bbb5de471 Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents: 288
diff changeset
  1183
fun termless tu = (termord tu = LESS);
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1184
432
0d1071ac599c Improved error msg "Proved wrong thm"
nipkow
parents: 427
diff changeset
  1185
fun check_conv(thm as Thm{hyps,prop,sign,...}, prop0) =
0d1071ac599c Improved error msg "Proved wrong thm"
nipkow
parents: 427
diff changeset
  1186
  let fun err() = (trace_thm "Proved wrong thm (Check subgoaler?)" thm;
0d1071ac599c Improved error msg "Proved wrong thm"
nipkow
parents: 427
diff changeset
  1187
                   trace_term "Should have proved" sign prop0;
0d1071ac599c Improved error msg "Proved wrong thm"
nipkow
parents: 427
diff changeset
  1188
                   None)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1189
      val (lhs0,_) = Logic.dest_equals(Logic.strip_imp_concl prop0)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1190
  in case prop of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1191
       Const("==",_) $ lhs $ rhs =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1192
         if (lhs = lhs0) orelse
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1193
            (lhs aconv Envir.norm_term (Envir.empty 0) lhs0)
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1194
         then (trace_thm "SUCCEEDED" thm; Some(hyps,rhs))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1195
         else err()
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1196
     | _ => err()
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1197
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1198
659
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1199
fun ren_inst(insts,prop,pat,obj) =
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1200
  let val ren = match_bvs(pat,obj,[])
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1201
      fun renAbs(Abs(x,T,b)) =
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1202
            Abs(case assoc(ren,x) of None => x | Some(y) => y, T, renAbs(b))
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1203
        | renAbs(f$t) = renAbs(f) $ renAbs(t)
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1204
        | renAbs(t) = t
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1205
  in subst_vars insts (if null(ren) then prop else renAbs(prop)) end;
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1206
659
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1207
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1208
(*Conversion to apply the meta simpset to a term*)
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1209
fun rewritec (prover,signt) (mss as Mss{net,...}) (hypst,t) =
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1210
  let val etat = Pattern.eta_contract t;
288
b00ce6a1fe27 Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents: 274
diff changeset
  1211
      fun rew {thm as Thm{sign,hyps,maxidx,prop,...}, lhs, perm} =
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1212
        let val unit = if Sign.subsig(sign,signt) then ()
446
3ee5c9314efe rewritec now uses trace_thm for it's "rewrite rule from different theory"
clasohm
parents: 432
diff changeset
  1213
                  else (trace_thm"Warning: rewrite rule from different theory"
3ee5c9314efe rewritec now uses trace_thm for it's "rewrite rule from different theory"
clasohm
parents: 432
diff changeset
  1214
                          thm;
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1215
                        raise Pattern.MATCH)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1216
            val insts = Pattern.match (#tsig(Sign.rep_sg signt)) (lhs,etat)
659
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1217
            val prop' = ren_inst(insts,prop,lhs,t);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1218
            val hyps' = hyps union hypst;
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1219
            val thm' = Thm{sign=signt, hyps=hyps', prop=prop', maxidx=maxidx}
427
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1220
            val (lhs',rhs') = Logic.dest_equals(Logic.strip_imp_concl prop')
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1221
        in if perm andalso not(termless(rhs',lhs')) then None else
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1222
           if Logic.count_prems(prop',0) = 0
4ce2ce940faf ordered rewriting applies to conditional rules as well now
nipkow
parents: 421
diff changeset
  1223
           then (trace_thm "Rewriting:" thm'; Some(hyps',rhs'))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1224
           else (trace_thm "Trying to rewrite:" thm';
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1225
                 case prover mss thm' of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1226
                   None       => (trace_thm "FAILED" thm'; None)
112
009ae5c85ae9 Changed the simplifier: if the subgoaler proves an unexpected thm, chances
nipkow
parents: 87
diff changeset
  1227
                 | Some(thm2) => check_conv(thm2,prop'))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1228
        end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1229
225
76f60e6400e8 optimized net for matching of abstractions to speed up simplifier
nipkow
parents: 222
diff changeset
  1230
      fun rews [] = None
76f60e6400e8 optimized net for matching of abstractions to speed up simplifier
nipkow
parents: 222
diff changeset
  1231
        | rews (rrule::rrules) =
76f60e6400e8 optimized net for matching of abstractions to speed up simplifier
nipkow
parents: 222
diff changeset
  1232
            let val opt = rew rrule handle Pattern.MATCH => None
76f60e6400e8 optimized net for matching of abstractions to speed up simplifier
nipkow
parents: 222
diff changeset
  1233
            in case opt of None => rews rrules | some => some end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1234
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1235
  in case etat of
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1236
       Abs(_,_,body) $ u => Some(hypst,subst_bounds([u], body))
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 659
diff changeset
  1237
     | _                 => rews(Net.match_term net etat)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1238
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1239
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1240
(*Conversion to apply a congruence rule to a term*)
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1241
fun congc (prover,signt) {thm=cong,lhs=lhs} (hypst,t) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1242
  let val Thm{sign,hyps,maxidx,prop,...} = cong
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1243
      val unit = if Sign.subsig(sign,signt) then ()
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1244
                 else error("Congruence rule from different theory")
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1245
      val tsig = #tsig(Sign.rep_sg signt)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1246
      val insts = Pattern.match tsig (lhs,t) handle Pattern.MATCH =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1247
                  error("Congruence rule did not match")
659
95ed2ccb4438 Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents: 623
diff changeset
  1248
      val prop' = ren_inst(insts,prop,lhs,t);
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1249
      val thm' = Thm{sign=signt, hyps=hyps union hypst,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1250
                     prop=prop', maxidx=maxidx}
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1251
      val unit = trace_thm "Applying congruence rule" thm';
112
009ae5c85ae9 Changed the simplifier: if the subgoaler proves an unexpected thm, chances
nipkow
parents: 87
diff changeset
  1252
      fun err() = error("Failed congruence proof!")
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1253
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1254
  in case prover thm' of
112
009ae5c85ae9 Changed the simplifier: if the subgoaler proves an unexpected thm, chances
nipkow
parents: 87
diff changeset
  1255
       None => err()
009ae5c85ae9 Changed the simplifier: if the subgoaler proves an unexpected thm, chances
nipkow
parents: 87
diff changeset
  1256
     | Some(thm2) => (case check_conv(thm2,prop') of
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1257
                        None => err() | some => some)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1258
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1259
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1260
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1261
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 209
diff changeset
  1262
fun bottomc ((simprem,useprem),prover,sign) =
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1263
  let fun botc fail mss trec =
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1264
            (case subc mss trec of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1265
               some as Some(trec1) =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1266
                 (case rewritec (prover,sign) mss trec1 of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1267
                    Some(trec2) => botc false mss trec2
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1268
                  | None => some)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1269
             | None =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1270
                 (case rewritec (prover,sign) mss trec of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1271
                    Some(trec2) => botc false mss trec2
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1272
                  | None => if fail then None else Some(trec)))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1273
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1274
      and try_botc mss trec = (case botc true mss trec of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1275
                                 Some(trec1) => trec1
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1276
                               | None => trec)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1277
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1278
      and subc (mss as Mss{net,congs,bounds,prems,mk_rews})
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1279
               (trec as (hyps,t)) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1280
        (case t of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1281
            Abs(a,T,t) =>
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1282
              let val b = variant bounds a
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1283
                  val v = Free("." ^ b,T)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1284
                  val mss' = Mss{net=net, congs=congs, bounds=b::bounds,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1285
                                 prems=prems,mk_rews=mk_rews}
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1286
              in case botc true mss' (hyps,subst_bounds([v],t)) of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1287
                   Some(hyps',t') =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1288
                     Some(hyps', Abs(a, T, abstract_over(v,t')))
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1289
                 | None => None
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1290
              end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1291
          | t$u => (case t of
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1292
              Const("==>",_)$s  => Some(impc(hyps,s,u,mss))
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1293
            | Abs(_,_,body) =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1294
                let val trec = (hyps,subst_bounds([u], body))
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1295
                in case subc mss trec of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1296
                     None => Some(trec)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1297
                   | trec => trec
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1298
                end
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1299
            | _  =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1300
                let fun appc() =
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1301
                          (case botc true mss (hyps,t) of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1302
                             Some(hyps1,t1) =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1303
                               (case botc true mss (hyps1,u) of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1304
                                  Some(hyps2,u1) => Some(hyps2,t1$u1)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1305
                                | None => Some(hyps1,t1$u))
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1306
                           | None =>
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1307
                               (case botc true mss (hyps,u) of
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1308
                                  Some(hyps1,u1) => Some(hyps1,t$u1)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1309
                                | None => None))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1310
                    val (h,ts) = strip_comb t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1311
                in case h of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1312
                     Const(a,_) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1313
                       (case assoc(congs,a) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1314
                          None => appc()
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1315
                        | Some(cong) => congc (prover mss,sign) cong trec)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1316
                   | _ => appc()
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1317
                end)
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1318
          | _ => None)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1319
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1320
      and impc(hyps,s,u,mss as Mss{mk_rews,...}) =
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1321
        let val (hyps1,s1) = if simprem then try_botc mss (hyps,s)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1322
                             else (hyps,s)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1323
            val mss1 =
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1324
              if not useprem orelse maxidx_of_term s1 <> ~1 then mss
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1325
              else let val thm = Thm{sign=sign,hyps=[s1],prop=s1,maxidx= ~1}
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 209
diff changeset
  1326
                   in add_simps(add_prems(mss,[thm]), mk_rews thm) end
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1327
            val (hyps2,u1) = try_botc mss1 (hyps1,u)
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1328
            val hyps3 = if s1 mem hyps1 then hyps2 else hyps2\s1
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1329
        in (hyps3, Logic.mk_implies(s1,u1)) end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1330
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1331
  in try_botc end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1332
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1333
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1334
(*** Meta-rewriting: rewrites t to u and returns the theorem t==u ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1335
(* Parameters:
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1336
   mode = (simplify A, use A in simplifying B) when simplifying A ==> B
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1337
   mss: contains equality theorems of the form [|p1,...|] ==> t==u
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1338
   prover: how to solve premises in conditional rewrites and congruences
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1339
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1340
405
c97514f63633 Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents: 399
diff changeset
  1341
(*** FIXME: check that #bounds(mss) does not "occur" in ct alread ***)
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 209
diff changeset
  1342
fun rewrite_cterm mode mss prover ct =
229
4002c4cd450c Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents: 225
diff changeset
  1343
  let val {sign, t, T, maxidx} = rep_cterm ct;
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 209
diff changeset
  1344
      val (hyps,u) = bottomc (mode,prover,sign) mss ([],t);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1345
      val prop = Logic.mk_equals(t,u)
208
342f88d2e8ab optimized simplifier - signature of rewritten term stays constant
nipkow
parents: 200
diff changeset
  1346
  in  Thm{sign= sign, hyps= hyps, maxidx= maxidx_of_term prop, prop= prop}
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1347
  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1348
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1349
end;
250
9b5a069285ce extend_theory: changed type of "abbrs" arg;
wenzelm
parents: 242
diff changeset
  1350