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

Safe HaskellNone
LanguageHaskell2010

Documentation.SBV.Examples.Lists.Fibonacci

Description

Author : Joel Burget License : BSD3 Maintainer: erkokl@gmail.com Stability : experimental

Define the fibonacci sequence as an SBV symbolic list.

Synopsis

Documentation

mkFibs :: Int -> IO [Integer] Source #

Compute a prefix of the fibonacci numbers. We have: >>> mkFibs 10 [1,1,2,3,5,8,13,21,34,55]

genFibs :: Symbolic [Integer] Source #

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