Re: [stack] Concatenative Hardware

Most interesting. Haskell is another language I know a bit about
and need to learn much more. So little time, so many languages ;-)
--
Don


On Nov 1, 2007, at 19:11 , Christopher Diggins wrote:

>> I'm planning on including generators in my experimental concatenative
>> language > as well as other Icon ideas. For example, [1 2 ...] is  
>> a lazy list of
>> positive integers. The ellipsis is a generator which unconses the  
>> next integer and
>> produces [2 3 ...], > [3 4 ...], etc.
>
> Cat has lazy lists too. Cat is sometimes lazy and sometimes eager
> depending on the constructors used. The "unfold" function generates a
> Haskell style lazy list. It takes a successor function and a
> termination predicate (which can be always return true) and a next
> function. In other words the type signature is:
>
> unfold : ('a ('a -> 'a) ('a -> bool) -> list)
>
> - Christopher
>
>
>
> Yahoo! Groups Links
>
>
>
>