1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
 void fibonacci(int n) {
   int tmp;
   int result;
   int i;
   int b;
   int a;
   i = 0;
   a = 0;
   b = 1;
   while (i <= n) {
     i = (i + 1);
     tmp = (⟨(a + b)⟩ → ⟨a⟩);
     a = b;
     b = (⟨tmp⟩ → ⟨(b + tmp)⟩);
   };
   result = a;

 }