src/FOLP/ROOT.ML
author clasohm
Mon Jan 29 13:58:15 1996 +0100 (1996-01-29)
changeset 1459 d12da312eff4
parent 1361 90d615b599d9
child 2237 f01ac387e82b
permissions -rw-r--r--
expanded tabs
clasohm@1459
     1
(*  Title:      FOLP/ROOT
clasohm@0
     2
    ID:         $Id$
clasohm@1459
     3
    Author:     martin Coen, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1993  University of Cambridge
clasohm@0
     5
clasohm@0
     6
Modifed version of Lawrence Paulson's FOL that contains proof terms.
clasohm@0
     7
clasohm@0
     8
Presence of unknown proof term means that matching does not behave as expected.
clasohm@0
     9
*)
clasohm@0
    10
clasohm@0
    11
val banner = "First-Order Logic with Natural Deduction with Proof Terms";
clasohm@0
    12
clasohm@0
    13
writeln banner;
clasohm@0
    14
wenzelm@393
    15
init_thy_reader();
clasohm@72
    16
clasohm@0
    17
print_depth 1;  
clasohm@98
    18
use_thy "IFOLP";
clasohm@98
    19
use_thy "FOLP";
clasohm@0
    20
lcp@1008
    21
use "hypsubst.ML";
clasohm@0
    22
use "classical.ML";      (* Patched 'cos matching won't instantiate proof *)
clasohm@1459
    23
use "simp.ML";           (* Patched 'cos matching won't instantiate proof *)
clasohm@0
    24
clasohm@0
    25
clasohm@0
    26
(*** Applying HypsubstFun to generate hyp_subst_tac ***)
clasohm@0
    27
clasohm@0
    28
structure Hypsubst_Data =
clasohm@0
    29
  struct
clasohm@0
    30
  (*Take apart an equality judgement; otherwise raise Match!*)
clasohm@0
    31
  fun dest_eq (Const("Proof",_) $ (Const("op =",_)  $ t $ u) $ _) = (t,u);
clasohm@0
    32
clasohm@0
    33
  val imp_intr = impI
clasohm@0
    34
clasohm@0
    35
  (*etac rev_cut_eq moves an equality to be the last premise. *)
clasohm@0
    36
  val rev_cut_eq = prove_goal IFOLP.thy 
clasohm@1459
    37
                "[| p:a=b;  !!x.x:a=b ==> f(x):R |] ==> ?p:R"
clasohm@0
    38
   (fn prems => [ REPEAT(resolve_tac prems 1) ]);
clasohm@0
    39
clasohm@0
    40
  val rev_mp = rev_mp
clasohm@0
    41
  val subst = subst
clasohm@0
    42
  val sym = sym
clasohm@0
    43
  end;
clasohm@0
    44
clasohm@0
    45
structure Hypsubst = HypsubstFun(Hypsubst_Data);
clasohm@0
    46
open Hypsubst;
clasohm@0
    47
clasohm@98
    48
use "intprover.ML";
clasohm@0
    49
clasohm@0
    50
(*** Applying ClassicalFun to create a classical prover ***)
clasohm@0
    51
structure Classical_Data = 
clasohm@0
    52
  struct
clasohm@0
    53
  val sizef = size_of_thm
clasohm@0
    54
  val mp = mp
clasohm@0
    55
  val not_elim = notE
clasohm@0
    56
  val swap = swap
clasohm@0
    57
  val hyp_subst_tacs=[hyp_subst_tac]
clasohm@0
    58
  end;
clasohm@0
    59
clasohm@0
    60
structure Cla = ClassicalFun(Classical_Data);
clasohm@0
    61
open Cla;
clasohm@0
    62
clasohm@0
    63
(*Propositional rules 
clasohm@0
    64
  -- iffCE might seem better, but in the examples in ex/cla
clasohm@0
    65
     run about 7% slower than with iffE*)
clasohm@0
    66
val prop_cs = empty_cs addSIs [refl,TrueI,conjI,disjCI,impI,notI,iffI] 
clasohm@0
    67
                       addSEs [conjE,disjE,impCE,FalseE,iffE];
clasohm@0
    68
clasohm@0
    69
(*Quantifier rules*)
clasohm@0
    70
val FOLP_cs = prop_cs addSIs [allI] addIs [exI,ex1I] 
clasohm@0
    71
                      addSEs [exE,ex1E] addEs [allE];
clasohm@0
    72
clasohm@0
    73
val FOLP_dup_cs = prop_cs addSIs [allI] addIs [exCI,ex1I] 
clasohm@0
    74
                          addSEs [exE,ex1E] addEs [all_dupE];
clasohm@0
    75
clasohm@0
    76
use "simpdata.ML";
clasohm@0
    77
clasohm@0
    78
use "../Pure/install_pp.ML";
clasohm@0
    79
print_depth 8;
lcp@176
    80
clasohm@1459
    81
val FOLP_build_completed = ();  (*indicate successful build*)