Index: doc/papers/concurrency/examples/Fib.py
===================================================================
--- doc/papers/concurrency/examples/Fib.py	(revision f8cd310f8a2e04f07eba9dbf60597d9236e4932f)
+++ doc/papers/concurrency/examples/Fib.py	(revision e73d44905c72c8c7253f4760fc3de0c316343b79)
@@ -1,3 +1,3 @@
-def Fibonacci():
+def Fib():
 	fn = 0;	fn1 = fn; yield fn  # suspend
 	fn = 1; fn2 = fn1; fn1 = fn; yield fn
@@ -7,6 +7,6 @@
 
 
-f1 = Fibonacci()
-f2 = Fibonacci()
+f1 = Fib()
+f2 = Fib()
 for i in range( 10 ):
 	print( next( f1 ), next( f2 ) )  # resume
Index: doc/papers/concurrency/examples/FibRefactor.py
===================================================================
--- doc/papers/concurrency/examples/FibRefactor.py	(revision f8cd310f8a2e04f07eba9dbf60597d9236e4932f)
+++ doc/papers/concurrency/examples/FibRefactor.py	(revision e73d44905c72c8c7253f4760fc3de0c316343b79)
@@ -1,7 +1,8 @@
-def Fibonacci():
+def Fib():
 	def Refactor():
-		nonlocal fn, fn1, fn2
+		nonlocal fn, fn1
 		fn = 0;	fn1 = fn
 		yield fn						# suspend
+
 	def Refactor2():
 		nonlocal fn, fn1, fn2
@@ -14,6 +15,6 @@
 		fn = fn1 + fn2; fn2 = fn1; fn1 = fn; yield fn
 
-f1 = Fibonacci()
-f2 = Fibonacci()
+f1 = Fib()
+f2 = Fib()
 for i in range( 10 ):
 	print( next( f1 ), next( f2 ) )		# resume
Index: doc/papers/concurrency/examples/Format.cc
===================================================================
--- doc/papers/concurrency/examples/Format.cc	(revision f8cd310f8a2e04f07eba9dbf60597d9236e4932f)
+++ doc/papers/concurrency/examples/Format.cc	(revision e73d44905c72c8c7253f4760fc3de0c316343b79)
@@ -31,5 +31,4 @@
 // Local Variables: //
 // tab-width: 4 //
-// fill-column: 120 //
 // compile-command: "u++-work -O2 -nodebubg Format.cc" //
 // End: //