generators in Haskell without conduits/pipes

gistfile1.txt

def fib(n):
    a, b = 0, 1
    for _ in range(n):
        a, b = b, a + b
    return a

# fib n = go 0 1 n
#   where go a _ 0 = a
#         go a b n = go b (a + b) (n - 1)

def fibs():
    a, b = 0, 1
    while True:
        yield a
        a, b = b, a + b

#data Generator a = G a (() -> Generator a)
#fibs :: Generator Integer
#fibs = go 0 1
#  where 
#    go :: Integer -> Integer -> Generator Integer
#    go a b = G a (\() -> go b (a + b))