replaced _K by dummy abstraction;

--- a/src/CCL/Type.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/CCL/Type.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -41,9 +41,9 @@
 
 translations
   "PROD x:A. B" => "Pi(A, %x. B)"
-  "A -> B"      => "Pi(A, _K(B))"
+  "A -> B"      => "Pi(A, %_. B)"
   "SUM x:A. B"  => "Sigma(A, %x. B)"
-  "A * B"       => "Sigma(A, _K(B))"
+  "A * B"       => "Sigma(A, %_. B)"
   "{x: A. B}"   == "Subtype(A, %x. B)"
 
 print_translation {*

--- a/src/CTT/CTT.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/CTT/CTT.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -64,9 +64,9 @@
 
 translations
   "PROD x:A. B" => "Prod(A, %x. B)"
-  "A --> B"     => "Prod(A, _K(B))"
+  "A --> B"     => "Prod(A, %_. B)"
   "SUM x:A. B"  => "Sum(A, %x. B)"
-  "A * B"       => "Sum(A, _K(B))"
+  "A * B"       => "Sum(A, %_. B)"
 
 print_translation {*
   [("Prod", dependent_tr' ("@PROD", "@-->")),

--- a/src/Cube/Cube.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/Cube/Cube.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -39,7 +39,7 @@
   ("prop") "x:X" == ("prop") "|- x:X"
   "Lam x:A. B"   == "Abs(A, %x. B)"
   "Pi x:A. B"    => "Prod(A, %x. B)"
-  "A -> B"       => "Prod(A, _K(B))"
+  "A -> B"       => "Prod(A, %_. B)"
 
 syntax (xsymbols)
   Trueprop      :: "[context_, typing_] => prop"        ("(_/ \<turnstile> _)")

--- a/src/HOL/Finite_Set.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/HOL/Finite_Set.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -840,7 +840,7 @@
 
 parse_translation {*
   let
-    fun Setsum_tr [A] = Syntax.const "setsum" $ Abs ("", dummyT, Bound 0) $ A
+    fun Setsum_tr [A] = Syntax.const "setsum" $ Term.absdummy (dummyT, Bound 0) $ A
   in [("_Setsum", Setsum_tr)] end;
 *}
 

--- a/src/HOL/Map.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/HOL/Map.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -66,7 +66,7 @@
   --"requires amssymb!"
 
 translations
-  "empty"    => "_K None"
+  "empty"    => "%_. None"
   "empty"    <= "%x. None"
 
   "m(x\<mapsto>\<lambda>y. f)" == "chg_map (\<lambda>y. f) x m"

--- a/src/HOL/Product_Type.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/HOL/Product_Type.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -128,7 +128,7 @@
      The (x,y) is parsed as `Pair x y' because it is logic, not pttrn *)
 
   "SIGMA x:A. B" => "Sigma A (%x. B)"
-  "A <*> B"      => "Sigma A (_K B)"
+  "A <*> B"      => "Sigma A (%_. B)"
 
 (* reconstructs pattern from (nested) splits, avoiding eta-contraction of body*)
 (* works best with enclosing "let", if "let" does not avoid eta-contraction   *)

--- a/src/ZF/QPair.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/ZF/QPair.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -46,7 +46,7 @@
 
 translations
   "QSUM x:A. B"  => "QSigma(A, %x. B)"
-  "A <*> B"      => "QSigma(A, _K(B))"
+  "A <*> B"      => "QSigma(A, %_. B)"
 
 constdefs
   qsum    :: "[i,i]=>i"                         (infixr "<+>" 65)

--- a/src/ZF/ZF.thy	Fri Oct 07 22:59:18 2005 +0200
+++ b/src/ZF/ZF.thy	Fri Oct 07 22:59:19 2005 +0200
@@ -131,8 +131,8 @@
   "UN x:A. B"   == "Union({B. x:A})"
   "PROD x:A. B" => "Pi(A, %x. B)"
   "SUM x:A. B"  => "Sigma(A, %x. B)"
-  "A -> B"      => "Pi(A, _K(B))"
-  "A * B"       => "Sigma(A, _K(B))"
+  "A -> B"      => "Pi(A, %_. B)"
+  "A * B"       => "Sigma(A, %_. B)"
   "lam x:A. f"  == "Lambda(A, %x. f)"
   "ALL x:A. P"  == "Ball(A, %x. P)"
   "EX x:A. P"   == "Bex(A, %x. P)"