The source has an example:
fib = (n):
if (n <= 1): 1. else: fib (n - 1) + fib (n - 2)..
Interesting. Looks a bit like OCaml/Haskell. Sort of.
A microbenchmark for calculating fibonacci number in a very inefficient way :-)
Let's time it:
$ time ./potion example/fib.pn
Now I'll try the similar-looking lua code:
local ret = 1;
if (n > 1) then
ret = fib(n-1) + fib(n-2)
$ time lua fib.lua
Now, with all my non-love to microbenchmarks, this does look quite interesting.
If this baby has zero-based arrays, I might get seduced :-)