Re: [Haskell-cafe] Formalizing lazy lists?

How about: nil = \ n c . n cons x xs = \ n c . c x xs zero = \ z s . z suc n = \ z s . s n listFromZero = Y ( \ from n . cons n (from (suc n))) zero (Untested, so I might have some mistake.) -- Lennart Greg Woodhouse wrote:

--- Lennart Augustsson wrote:

...

What do you mean by represent? It's easy enough to write down the lambda term that is the encoding of [0..].

-- Lennart

You mean like \x -> x ? If I apply it to the Church numeral i, I get i in return. But that hardly seems satisifying because infinite lists seem to be a wholly different type of object.

=== Gregory Woodhouse

"Interaction is the mind-body problem of computing."

--Philip Wadler

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe