~~ Recursive Fibonacci function
Def Fib as (
   ~~ If n <= 1, return n
   Dup 1 <= if Return ;
   ~~ Otherwise: fib(n-1) + fib(n-2)
   Dup 1 - Fib
   Swap 2 - Fib
   +
);

~~ Print first 10 Fibonacci numbers
Let I be 0;
While I < 10 (
   Print I Fib ;
   Let I be I + 1 ;
);