1protocol fibonacci(n):
2    foresee n <= 1:
3        yield n
4    otherwise:
5        yield fibonacci(n - 1) + fibonacci(n - 2)
6
7cycle from 0 to 10 as i:
8    declare(fibonacci(i))

1async protocol task(id, delay):
2    sleep(delay)
3    declare("Task", id, "done")
4    yield id * 10
5
6async protocol run_all():
7    # Start all
8    p1 := task(1, 500)
9    p2 := task(2, 300)
10    
11    # Await results
12    r1 := await p1
13    r2 := await p2
14    
15    declare("Results:", r1, r2)
16
17execute(run_all)

1items := span(1000)
2
3# Lazy transformation pipeline
4stage1 := (x * 2 for x through items)
5stage2 := (x + 5 for x through stage1)
6final  := (x for x through stage2 where x % 10 == 0)
7
8# Consume only what is needed
9cycle through final as val:
10    foresee val > 50:
11        break
12    declare(val)