Index: doc/papers/concurrency/examples/Fib2.c
===================================================================
--- doc/papers/concurrency/examples/Fib2.c	(revision 466fa013f2bfa1aed287add52d969087ca7f4721)
+++ doc/papers/concurrency/examples/Fib2.c	(revision e068c8a8da15b590c9ee6dc1bf9fefcffcc2b1dc)
@@ -1,26 +1,19 @@
 #include <stdio.h>
 
-void mary() {
-	printf( "MARY\n" );
-}
-
 #define FIB_INIT { 0 }
-typedef struct { int next; int fn1, fn2; } Fib;
+typedef struct { int restart; int fn1, fn2; } Fib;
 int fib( Fib * f ) {
-	static void * states[] = { &&s1, &&s2, &&s3 };
-	goto *states[f->next];
+	static void * states[] = { &&s0, &&s1, &&s2 };
+	goto *states[f->restart];
+  s0:
+	f->fn1 = 0;
+	f->restart = 1;
+	return f->fn1;
   s1:
-	mary();
-	f->fn1 = 0;
-	f->next = 1;
-	return f->fn1;
-  s2:
-	mary();
 	f->fn2 = f->fn1;
 	f->fn1 = 1;
-	f->next = 2;
+	f->restart = 2;
 	return f->fn1;
-  s3:;
-	mary();
+  s2:;
 	int fn = f->fn1 + f->fn2;
 	f->fn2 = f->fn1;