sbv-8.7: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.

Documentation.SBV.Examples.Lists.Fibonacci

Description

Define the fibonacci sequence as an SBV symbolic list.

Synopsis

# Documentation

Compute a prefix of the fibonacci numbers. We have:

>>> mkFibs 10
[1,1,2,3,5,8,13,21,34,55]


Generate fibonacci numbers as a sequence. Note that we constrain only the first 200 entries.