src/CCL/Term.ML
changeset 1459 d12da312eff4
parent 1087 c1ccf6679a96
child 2035 e329b36d9136
--- a/src/CCL/Term.ML	Mon Jan 29 13:56:41 1996 +0100
+++ b/src/CCL/Term.ML	Mon Jan 29 13:58:15 1996 +0100
@@ -1,6 +1,6 @@
-(*  Title: 	CCL/terms
+(*  Title:      CCL/terms
     ID:         $Id$
-    Author: 	Martin Coen, Cambridge University Computer Laboratory
+    Author:     Martin Coen, Cambridge University Computer Laboratory
     Copyright   1993  University of Cambridge
 
 For terms.thy.
@@ -57,12 +57,12 @@
 
 fun raw_mk_beta_rl defs s = prove_goalw Term.thy defs s
            (fn _ => [rtac (letrecB RS ssubst) 1,
-		     simp_tac (CCL_ss addsimps rawBs) 1]);
+                     simp_tac (CCL_ss addsimps rawBs) 1]);
 fun mk_beta_rl s = raw_mk_beta_rl data_defs s;
 
 fun raw_mk_beta_rl defs s = prove_goalw Term.thy defs s
            (fn _ => [simp_tac (CCL_ss addsimps rawBs 
-			       setloop (rtac (letrecB RS ssubst))) 1]);
+                               setloop (rtac (letrecB RS ssubst))) 1]);
 fun mk_beta_rl s = raw_mk_beta_rl data_defs s;
 
 val ifBtrue    = mk_beta_rl "if true then t else u = t";
@@ -116,7 +116,7 @@
 (*** Constructors are injective ***)
 
 val term_injs = map (mk_inj_rl Term.thy 
-		     [applyB,splitB,whenBinl,whenBinr,ncaseBsucc,lcaseBcons])
+                     [applyB,splitB,whenBinl,whenBinr,ncaseBsucc,lcaseBcons])
                ["(inl(a) = inl(a')) <-> (a=a')",
                 "(inr(a) = inr(a')) <-> (a=a')",
                 "(succ(a) = succ(a')) <-> (a=a')",