I have been looking through the joy papers, and have this confusion: The help on ifte says: ifte [B] [T] [F] -> ... Executes B. If that yields true, then...
... Yup. Me too. But that's not what Joy does; some of Joy's combinators save the stack's state when they're performing certain types of actions. You simply...
Hi, First (alpha) release of V is available here http://v-language.googlecode.com/files/v_0.001.jar It is nothing more than a dialect of Joy at this point ...
I love to see languages running on the JVM. A couple of pointers just in case you're not aware: 1. Consider binding your implementation to the scripting...
... Cool, congrats on nice progress. ... Curiosity: what's your goals? Your definition syntax looks nice, by the way. Simple and clean... Although I suppose...
... This would seem to generally fit my theory -- that applicative syntax is more powerful in its greater complexity, because an applicative syntax allows a...
... dont have any goals (other than minimal syntax - (just '[' and ']')) for now, I think I will let the language evolve and see where it goes. ... thanks, ......
I tried to define ifte as it is implemented in joy1 and I found this: [T] [A] [B] ifte == [[[stack] dip] dip [dip swap] dip] dip #save stack and run T ...
... The speed is probably not important in this case. I had not expected a change in behavior for a quote when it is inside an 'ifte' and when it is evaluted...
... Would there be situations when this is less efficient? If we are modifying n members in the stack in the condition, then we may need to save only that n...
... Joy also provides that operator, under the name of "choice". -- John Cowan cowan@... http://ccil.org/~cowan Half the lies they tell about me are...
... In fact, for Joy the stack is just another linked list in the heap, so saving and restoring it is just a matter of storing the stack pointer in a local...
On 24/2/07 9:45 PM, "Brent L Kerby" <bkerby@...> wrote: [..] ... Not a NICE flat programming language, but interesting in the present context: machine...
... Actually, we can do without them. The machine whose sole instruction is "subtract 1 from data item D, and if it is now zero, jump to instruction J,...
For a long time I had been dreaming of static type checking for Joy, and perhaps even a Joy compiler of some kind. Only recently did I have a lucky thought:...
... Have you looked at the most recent Cat paper (http://www.cat-language.com/paper.html)? It could prove to be a useful starting point for designing a type...
... I've been hammering this in my mind, but I can't get it to work out right. ... The problem is that machine language/assembler uses explicit offsets to...
... Grin. Unfortunately, that's neither single-instruction nor flat. Its instruction stream consists of (data index ,jump offset) pairs, so in effect if both...
... Very few Lisps allow you to recover the source form of a definition from its executable form (decompiling), but essentially all allow you to evaluate...
what is the difference between app1 and i in joy? The documentation on app1 says app1 X [P] -> R Executes P, pushes result R on stack without X. so executing ...
Hi, The next release of V is available here http://v-language.googlecode.com/files/v_0.002.tar.gz Updates: more combinators are in place, an error handling...
On 9/3/07 6:54 PM, "Christopher Diggins" <cdiggins@...> wrote: I did look at your paper and read it with great interest. I am not really competent to...
Most embarrassing. Seems I made one mistake in the documentation and a separate one in the implementation. Most of the other app¹s are marked ³obsolescent²...
Thanks for this, I had a vague suspicion that it might be so for the Lisps. In fact for any interpreter written in some implementation language it seems that...
... Since the language had assignments, there was no referential transparency to start with. But take the purely functional subset of just about any language ...
