I know this thread is kind of dead, but I could not help but point out that traditional closures have a more immediate mapping onto quotations in factor than Pinochio indicates in his post above. The factor word '[ provides a kind of intelligent quotation construction (similar to backquote in lisps) which allows a programmer to "close over" elements on the stack in a simple way. Combine this facility with the words curry and compose and quotations acquire the full power of closures, albeit in a way consistent with the style of stack based programming. I am pretty sure that one could even implement the "counter" example using objects and quotations, although if you are programming functionally you wouldn't want to have this kind of side effect dependent code anyway.
On Apr 15, 5:02 pm, CuppoJava <patrickli_2...@hotmail.com> wrote: > Thanks for all your replies. I was most interested in whether stack > languages provided any easier abstraction capabilities beyond that of > lisp/clojure. I read about the Factor implementation, and about how > continuations, coroutines, and generators were almost trivial to > implement and only required a few lines of code. > > For now I think Clojure is still the best fit for getting a lot of > work done, due to its ease of debugging and connectivity with java. > But I will definitely check outForthfor my microcontroller projects > in the future. > > -Patrick --~--~---------~--~----~------------~-------~--~----~ 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 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 -~----------~----~----~----~------~----~------~--~---
