Re: [stack] recursion is too hard

John Nowak <[email protected]>
Newsgroups gmane.comp.lang.concatenative
Message-ID <[email protected]> 
On Mar 9, 2009, at 5:41 PM, John Nowak wrote:

> Assume these operations (where curly braces denote lists):
>
>    cons   = \((s, x), xs) -> (s, x:xs)
>    uncons = \(s, x:xs) -> ((s, x), xs)

Sorry. Ignore that parenthetical. ':' denotes 'cons' and (,) denotes a  
tuple as in Haskell.

- John
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.