I'm trying to understand infinite sequences. Wikipedia defines an implementation of the Fibonacci sequence as:
(def fibs (cons 0 (cons 1 (lazy-seq (map +' fibs (rest fibs)))))) However, when I wrote fibs in the repl as: (def fibs (lazy-seq (cons 0 (cons 1 (map +' fibs (rest fibs)))))) executing (first fibs) produces a StackOverflow exception. What is the reason that the second, incorrect definition throws a StackOverflow exception, but the first generates an infinite sequence? Thanks. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
