Re: [stack] recursive combinators in other languages

Christopher Diggins:

>> Are there other languages that use the same form?
>
> Well this isn't so much a language property, as a feature of the
> standard library. Some languages make it easy to define combinators of
> that form, but they aren't idiomatic (Haskell for example).

Well, it is certainly possible to achieve the same in any language that
support lambdas, but none are as elegent as in Joy (AFAIK). I was
surprised by the very consise definition and pervasive use of these
in Nial. (Is it done the same way in K and J ?)

see also Q5 in
http://www.latrobe.edu.au/philosophy/phimvt/joy/faq1.html




...
>> The definition of factorial in Nial is given by
>>
>> factorial is recur [ 0 =, 1 first, pass, product, -1 +]

------------------------------------

Yahoo! Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/concatenative/

<*> Your email settings:
    Individual Email | Traditional

<*> To change settings online go to:
    http://groups.yahoo.com/group/concatenative/join
    (Yahoo! ID required)

<*> To change settings via email:
    mailto:[email protected] 
    mailto:[email protected]

<*> To unsubscribe from this group, send an email to:
    [email protected]

<*> Your use of Yahoo! Groups is subject to:
    http://docs.yahoo.com/info/terms/