TFL/rules.sig
author paulson
Tue May 20 11:49:57 1997 +0200 (1997-05-20)
changeset 3245 241838c01caf
parent 2112 3902e9af752f
child 3302 404fe31fd8d2
permissions -rw-r--r--
Removal of redundant code (unused or already present in Isabelle.
This eliminates HOL compatibility but makes the code smaller and more
readable
paulson@2112
     1
signature Rules_sig =
paulson@2112
     2
sig
paulson@2112
     3
(*  structure USyntax : USyntax_sig *)
paulson@2112
     4
  type 'a binding
paulson@2112
     5
paulson@3245
     6
  val dest_thm : thm -> term list * term
paulson@2112
     7
paulson@2112
     8
  (* Inference rules *)
paulson@3245
     9
  val REFL      :cterm -> thm
paulson@3245
    10
  val ASSUME    :cterm -> thm
paulson@3245
    11
  val MP        :thm -> thm -> thm
paulson@3245
    12
  val MATCH_MP  :thm -> thm -> thm
paulson@3245
    13
  val CONJUNCT1 :thm -> thm
paulson@3245
    14
  val CONJUNCT2 :thm -> thm
paulson@3245
    15
  val CONJUNCTS :thm -> thm list
paulson@3245
    16
  val DISCH     :cterm -> thm -> thm
paulson@3245
    17
  val UNDISCH   :thm  -> thm
paulson@3245
    18
  val INST_TYPE :typ binding list -> thm -> thm
paulson@3245
    19
  val SPEC      :cterm -> thm -> thm
paulson@3245
    20
  val ISPEC     :cterm -> thm -> thm
paulson@3245
    21
  val ISPECL    :cterm list -> thm -> thm
paulson@3245
    22
  val GEN       :cterm -> thm -> thm
paulson@3245
    23
  val GENL      :cterm list -> thm -> thm
paulson@3245
    24
  val LIST_CONJ :thm list -> thm
paulson@2112
    25
paulson@3245
    26
  val SYM : thm -> thm
paulson@3245
    27
  val DISCH_ALL : thm -> thm
paulson@3245
    28
  val FILTER_DISCH_ALL : (term -> bool) -> thm -> thm
paulson@3245
    29
  val SPEC_ALL  : thm -> thm
paulson@3245
    30
  val GEN_ALL   : thm -> thm
paulson@3245
    31
  val IMP_TRANS : thm -> thm -> thm
paulson@3245
    32
  val PROVE_HYP : thm -> thm -> thm
paulson@2112
    33
paulson@3245
    34
  val CHOOSE : cterm * thm -> thm -> thm
paulson@3245
    35
  val EXISTS : cterm * cterm -> thm -> thm
paulson@3245
    36
  val EXISTL : cterm list -> thm -> thm
paulson@3245
    37
  val IT_EXISTS : cterm binding list -> thm -> thm
paulson@2112
    38
paulson@3245
    39
  val EVEN_ORS : thm list -> thm list
paulson@3245
    40
  val DISJ_CASESL : thm -> thm list -> thm
paulson@2112
    41
paulson@3245
    42
  val SUBS : thm list -> thm -> thm
paulson@3245
    43
  val simplify : thm list -> thm -> thm
paulson@3245
    44
  val simpl_conv : thm list -> cterm -> thm
paulson@2112
    45
paulson@2112
    46
(* For debugging my isabelle solver in the conditional rewriter *)
paulson@2112
    47
(*
paulson@3245
    48
  val term_ref : term list ref
paulson@3245
    49
  val thm_ref : thm list ref
paulson@2112
    50
  val mss_ref : meta_simpset list ref
paulson@2112
    51
  val tracing :bool ref
paulson@2112
    52
*)
paulson@3245
    53
  val CONTEXT_REWRITE_RULE : term * term
paulson@3245
    54
                             -> {thms:thm list,congs: thm list, th:thm} 
paulson@3245
    55
                             -> thm * term list
paulson@3245
    56
  val RIGHT_ASSOC : thm -> thm 
paulson@2112
    57
paulson@3245
    58
  val prove : cterm * tactic -> thm
paulson@2112
    59
end;