I've recently started a blog explaining the details of a new concatenative language Enchilada. Here are some statements to give you a taste of Enchilada: -...
The examples of concatenative languages such as joy, forth, postscript, and factor, are all based on stack machines. Are there concatenative languages that is...
... Well, there is a quiet little implementation flourish within the bowels of Joy that leaves me hesitant to describe it as a pure stack machine as a...
... I'm struggling my way through it. Looks nice and original. Fun reading. ... There was a paper on the basic primitives of Joy... Let's see, who wrote...
... Thanks. Hopefully I didn't leave anything to trip over ;). ... Yes, I've read that paper (I've been lurking the concatenative group for almost two years,...
... I can't tell -- I'm still stumbling over my own shoelaces. ... Oh, I agree. As you very well know, I'm big on efficiency :-). Now that you've mentioned...
... Yeah I know what you mean. I'm still waiting for the school bell to ring so I can finally play outside -not to be bothered with mundane work. ... Right,...
I'm wondering how many concatenative languages are lazily evaluated. I'm aware that Joy can be lazily evaluated, although I believe that the C implementation...
... There is a lazy-lists library in Factor and the parser combinators code relies on it a lot. A parser combinator returns a 'lazy list of successes' as the...
APL, J, and K are strict. i'm not sure what you mean by saying that some data structures in APL are lazy. SLACK is a lazy implementation of K, based on SASL....
stevan apter
sa@...
Sep 9, 2006 1:27 pm
2970
... Just copied this from wikipedia: "A widely cited paper "The APL Machine" perpetuated the myth that APL made pervasive use of lazy evaluation where...
... Lazy data structures (that is, data structures that contain code that generate later values) are easy in any language. Actual lazy evaluation is...
However every term in a concatenative language can be viewed as a function which takes a single function (a stack) and outputs a single value (another stack). ...
... I can see that being acceptable, yes. This is one of the things I've been trying to figure out to see if I can think of a way to control the cartesian...
... Billy, I also agree with you and Christopher. I always think of lazy evalutation to be some kind of stream. Every time you get an element from a stream,...
A preview of the new version of the Cat programming language is now available at http://www.cat-language.com . For those who don't know or remember, Cat is a...
robbert - can you give us an update on where you're at with enchilada? i notice that your blog hasn't been updated in a while. best sa [Non-text portions of...
stevan apter
sa@...
Sep 26, 2006 10:48 pm
2977
Hi Stevan, Thanks for pushing me a little bit ;) I've updated my blog just now. Although I was keen on doing a full implementation, I 'released' a early...
There has been a new version of Cat released into the public domain at http://www.cat-language.com . This version introduces a lot of bug fixes, and is...
Hi Christopher, I've just downloaded your source code. I can't execute the executable or compile the source but I can see where you're heading to: everything...
I'm sorry that the executable and source code didn't work for you (is it because you don't have C#, and the .NET framework installed?). I appreciate the...
... I'm not him, but if I were I'd probably answer "because it's an interesting problem." :-) IMO typeless languages are fun and easy to work with, but typed ...
I just released a new update of Cat ... I just found and killed a couple of new bugs. Sorry to anyone who downloaded it. I've also written a bit about type...
... That definitely plays into it. :-) ... My view on types is that it makes it easier to 1) verify that a program does what you expect 2) tell someone what it...
Somehow my post got lost. Hopefully it will not appear twice. ... Yes, types can help understand programs in a declaritive manner. But I think the most...
... Yes, types can help understand programs in a declaritive manner. But I think the most (interesting but complex) problems are encounted at runtime. Examples...
... From: "Robbert van Dalen" <r_v_dalen@...> To: <concatenative@yahoogroups.com> Sent: Saturday, September 30, 2006 10:50 AM Subject: Re: [stack] Cat...
stevan apter
sa@...
Oct 1, 2006 12:31 am
2987
... For guaranteed time/memory usage, take a look at something like the statically typed Hume language... http://www-fp.dcs.st-and.ac.uk/hume/ You might like...
... Yeah, I'm a mac user. But I can read the source because it's very clear (trying to execute it in my head). Just read your blog - you have approached the ...
This discussion on static typing and type inference brings up (in an indirect way) a question that I've been itching to ask for some time. Haskell is a...
