Re: [stack] A Joy VM in OCaml
Don Groves <[email protected]>
| Newsgroups | gmane.comp.lang.concatenative |
|---|---|
| Message-ID | <[email protected]> |
I have always found stack programming and Unix shell programming to be very similar, the stack being a LIFO pipe connecting successive refinements rather than the FIFO pipe used in Unix. As with the Unix shell, the transformations of the stack can be verified at each step of the process. -- don On Aug 31, 2009, at 10:02 PM, chris glur wrote: > What is this good for ? > The answer that I didn't get directly, but which hints led to, > for my previous question: "what is cat-style good for"; > could have been "it facilitates successive refinement, which > aids software productivety". > > Unix shell programming, which amazingly is several decades old, > allows remarkable economy in effort by using the 'data view' > [vs. procedural or OO views], by merely passing the data through > multiple stages of simple filters. > > Successive-refinement applies [which allows the programmer to > confirm each step] because the data transformation can be confirmed > at the output of each serial-filter. > > == Chris Glur. > > > On 8/26/09, Tom Schouten <[email protected]> wrote: >> ... and another one: extensional, non-linear Joy stack machine that >> works using binary tree representation of code, and a binary tree >> rotation in the interpreter, with again the continuation = a >> quotation. >> >> http://zwizwa.be/darcs/libprim/pf/seq.ml >> >> > > > ------------------------------------ > > Yahoo! Groups Links > > >