Lazy Fibonacci implementation using the Totally Lazy library.

TotallyLazyFibonacci.java

import static com.googlecode.totallylazy.Callables.first;
import static com.googlecode.totallylazy.Computation.computation;
import static com.googlecode.totallylazy.Pair.reduceLeftShift;

import com.googlecode.totallylazy.Pair;
import com.googlecode.totallylazy.Sequence;
import com.googlecode.totallylazy.numbers.Sum;

public class TotallyLazyFibonacci {
  
	public static Sequence<Number> fibonacciSequence  = 
			computation(Pair.<Number, Number>pair(0, 1), reduceLeftShift(new Sum())).map(first(Number.class));

	public static void main(String[] args) {
		System.out.println(fibonacciSequence.take(25).toList());
	}

}