src/FOLP/ROOT.ML
changeset 1459 d12da312eff4
parent 1361 90d615b599d9
child 2237 f01ac387e82b
equal deleted inserted replaced
1458:fd510875fb71 1459:d12da312eff4
     1 (*  Title: 	FOLP/ROOT
     1 (*  Title:      FOLP/ROOT
     2     ID:         $Id$
     2     ID:         $Id$
     3     Author: 	martin Coen, Cambridge University Computer Laboratory
     3     Author:     martin Coen, Cambridge University Computer Laboratory
     4     Copyright   1993  University of Cambridge
     4     Copyright   1993  University of Cambridge
     5 
     5 
     6 Modifed version of Lawrence Paulson's FOL that contains proof terms.
     6 Modifed version of Lawrence Paulson's FOL that contains proof terms.
     7 
     7 
     8 Presence of unknown proof term means that matching does not behave as expected.
     8 Presence of unknown proof term means that matching does not behave as expected.
    18 use_thy "IFOLP";
    18 use_thy "IFOLP";
    19 use_thy "FOLP";
    19 use_thy "FOLP";
    20 
    20 
    21 use "hypsubst.ML";
    21 use "hypsubst.ML";
    22 use "classical.ML";      (* Patched 'cos matching won't instantiate proof *)
    22 use "classical.ML";      (* Patched 'cos matching won't instantiate proof *)
    23 use "simp.ML";	         (* Patched 'cos matching won't instantiate proof *)
    23 use "simp.ML";           (* Patched 'cos matching won't instantiate proof *)
    24 
    24 
    25 
    25 
    26 (*** Applying HypsubstFun to generate hyp_subst_tac ***)
    26 (*** Applying HypsubstFun to generate hyp_subst_tac ***)
    27 
    27 
    28 structure Hypsubst_Data =
    28 structure Hypsubst_Data =
    32 
    32 
    33   val imp_intr = impI
    33   val imp_intr = impI
    34 
    34 
    35   (*etac rev_cut_eq moves an equality to be the last premise. *)
    35   (*etac rev_cut_eq moves an equality to be the last premise. *)
    36   val rev_cut_eq = prove_goal IFOLP.thy 
    36   val rev_cut_eq = prove_goal IFOLP.thy 
    37 		"[| p:a=b;  !!x.x:a=b ==> f(x):R |] ==> ?p:R"
    37                 "[| p:a=b;  !!x.x:a=b ==> f(x):R |] ==> ?p:R"
    38    (fn prems => [ REPEAT(resolve_tac prems 1) ]);
    38    (fn prems => [ REPEAT(resolve_tac prems 1) ]);
    39 
    39 
    40   val rev_mp = rev_mp
    40   val rev_mp = rev_mp
    41   val subst = subst
    41   val subst = subst
    42   val sym = sym
    42   val sym = sym
    76 use "simpdata.ML";
    76 use "simpdata.ML";
    77 
    77 
    78 use "../Pure/install_pp.ML";
    78 use "../Pure/install_pp.ML";
    79 print_depth 8;
    79 print_depth 8;
    80 
    80 
    81 val FOLP_build_completed = ();	(*indicate successful build*)
    81 val FOLP_build_completed = ();  (*indicate successful build*)