Fibonacci sequence: Difference between revisions
m
→{{header|Lean}}
Line 6,691:
<lang Lean>
-- Our first implementation is the usual recursive definition:
def fib1 : ℕ
| 0 := 0
| 1 := 1
|