There is one part of Joy that I'll admit I'm not comfortable with. This is quitely likely a failure on my part to understand... The == operator that assigns a...
Implementing a lazy variant of Joy or creating a lazy library for current Joy are indeed possibilites. A third possibility (which would actually be my own...
On any Unix-like system, do a "man dc". 'dc' (desk calculator) has a stack and a namespace (with only single-character names). A single character denotes...
actually, it's even simpler - i don't need i at all: ()E/quine (`dup `cons `dup `cons) i.e. start evaluating on the empty stack (), and successively...
manfred's joy quine [[dup cons] dup cons] is really quite beautiful. on my drive into work this morning i was so entranced by it that i pulled away from the...
Actually what you wrote made me realize something about what Manfred wrote in his previous post. I do not think it is correct to say that "[non-strictness]...
On the main Joy page: Frequently Asked Questions about Joy It is longer and more theoretical than I intended originally. Also, it does not yet have all those...
Is Joy a suitable notation in which to demonstrate how to implement/simulate/model a functional programming language where the functions are nonstrict in their...
From: Jack Waugh [mailto:waugh@...] ... I'm not sure what 'strict' means here. Assuming it has something to do with typechecking, then I don't think Joy...
Please forgive the apparent spam. I am passing this message to all Yahoo Groups lists I am subscribed to. ... The problem is probably with Yahoo Groups, not...
A misplaced brace in the implementation of max and min caused them not to do anything unless at least one argument was a float. You can fix interp.c by moving...
Since ! is now a terminator equivalent to ., the != operator does not work. I have changed it to /=, a non-backward-compatible change. /= is the form used in...
... You are exactly right. What I wrote in that paper is wrong. It should be newstack stack => newstack [] I can fix that straight away in the web page....
From: Jack Waugh [mailto:waugh@...] ... You'll have to read up on functional languages... This group is a little more specialised. ... Yes, you can work...
In this message, I will write feelings. I distingush feelings from thoughts with the sense that thoughts are articulations I could argue for. In the case of...
I just encountered Joy and find it breathtakingly elegant. Kudos in particular for synthesizing the concepts of list and program. Of course, Lisp regards a...
... A few: the implementation parameters maxint and setsize; the state variables autoput, undeferror, and echo; the environment enquiries stack, conts, clock,...
Geof Bishop found another two bugs in "fremove" and "fseek": again, these were returning false for success and true for failure. Fixed. Remove a single "!"...
Currently frename returns false for success and true for failure. To fix this, remove one of the ! characters in line 736 of interp.c, or download from the...
The group blurb says, among other things, "In short, concatenative languages behave in a way [that] looks imperative (like C or Perl), but can be reasoned...
Hello, I am interested creating a forth-like language for high level programming, and implemented in C, similar to the way Lua (www.lua.org) is implemented....
I have gotten rid of all the things that made gcc -ansi -pedantic complain, including all the (Types) casts. This involved creating a macro for each node...
... Setjmp and longjmp are rather like labels and gotos, except that the jmp_buf is a fully reified continuation. Thus one can have code something like this: ...
This is to announce the first beta release of Joy 1.0, an Open Source implementation of Joy based on Manfred's source code. After it is debugged, it will...
... A wonderful sentiment! I have been waiting for this to come up. I wrote a Joy-like language interpreter in Oberon last year and will dust it off if anyone...
