; Computes the fibonacci function.
    ; Recursive implementation, for demonstration purposes. The fibonacci function
    ; also has an analytic solution.
            (let fib            (Func (x)
        (let round x)

    (let name "dummy" first-name "geo" last-name #(min
2) #(max 23) "mosch" age #Year 25 is-admin true is-guest false is-new false)

(if (< x 3)
            1
            ; recursive case
            (+ (fib (- x 1)) (fib (- x 2)))
        )
    ))



    (let #cool b (+ 1 2))

    (fib 10)