Let me introduce a new (concatenative?) programming language called SPREAD. SPREAD has - what I believe - many properties that might interest you. SPREADs most...
4940
William Tanksley
wtanksle
Jan 14, 2013 10:40 pm
Just for the fun of it, I've created a Google+ "Community" for us. If you'd like to help me try it out, please feel free to swing on by. ...
4939
Jason Erb
the.sparist
Jan 6, 2013 8:32 pm
I've filled out the Om documentation to hopefully clarify how the whole thing works and explain it from a concatenative standpoint. ...
4938
Jason Erb
the.sparist
Jan 5, 2013 7:40 pm
Fixing formatting issues in the last message... Some examples of valid operators: operator o`p`e`r`a`t`o`r an` operator an` operator` with` `{braces`} an`...
4937
Jason Erb
the.sparist
Jan 5, 2013 7:39 pm
William, Thanks for the in-depth questions. Discussions like this are extremely helpful in figuring out what I need to explain better in the documentation. ...
4936
Jason Erb
the.sparist
Jan 5, 2013 6:46 pm
Thanks for the good words and the addition at concatenative.org. Â I hadn't realized that editing was open for all -- I've created an account and filled in the...
4935
William Tanksley, Jr
wtanksle
Jan 5, 2013 5:06 pm
... It looks cool and fun, and I'd like to see examples for something more than swap and copy. Until I see more, I'll say that it looks like a language in...
4934
Ruurd
wodan58
Jan 5, 2013 10:06 am
Hi, It is nice to see some activity here. An impressive web site you have there. Makes me feel like an amateur. Now, about concatenative.org. I have managed to...
4933
Jason Erb
the.sparist
Jan 3, 2013 6:22 am
Dear Concatenativists, I've developed a unique concatenative language that I would like to share: http://om-language.org The goal was to find "God's...
4932
efliski
Dec 5, 2012 8:52 am
... That's right, 2011, over a year ago. I could not, though, find that information anywhere on this forum, thought it should belong here. -EF...
4931
John Cowan
johnwcowan
Dec 5, 2012 7:02 am
... Note that this was 23 October 2011. -- John Cowan http://www.ccil.org/~cowan cowan@... if if = then then then = else else else = if;...
4930
efliski
Dec 5, 2012 6:38 am
http://hosted.verticalresponse.com/291390/14a69b5ba4/1473484945/be83724914/#news "Vale Manfred - the philosophical programmer Alumni and staff will be...
4928
dustin.deweese
Apr 25, 2012 11:38 am
... Peg also uses lazy evaluation, but the pureness of the language means that: 1 2 + 3 7 4 - are all equivalent and indistinguishable, whether evaluated or...
4927
dustin.deweese
Apr 25, 2012 11:12 am
... This is why I prefer a pencil to a pen. Oh well. Point and laugh. ... I considered having separate stacks for each type in Peg. Each argument to a word...
4926
eas lab
lab.eas@...
Apr 25, 2012 9:54 am
... Didn't anybody pick up this 'typo'? ... Think rather in term of the 'most recent' element. ] We know concatenative languages that use an accumulator and...
4925
Joshua Shinavier
icouldntthin...
Apr 23, 2012 4:25 am
On Fri, Apr 20, 2012 at 1:21 PM, William Tanksley, Jr <wtanksleyjr@... ... Present, just lazy :-) That's an interesting property, but it's not true of...
4924
dustin.deweese
Apr 22, 2012 9:09 pm
... The stack for any particular execution path has a total ordering. You could use non-determinism to make the stack appear only partially-ordered, though,...
4923
William Tanksley, Jr
wtanksle
Apr 20, 2012 5:22 pm
... That's a clever approach. Although I liked it at first glance, I think it's not quite complete. We know concatenative languages that use an accumulator and...
4922
dustin.deweese
Apr 19, 2012 8:53 am
... The stack works essentially as a sort of caching structure. Whichever caching strategy you choose determines the data structure. Last in, first out =...
4921
William Tanksley, Jr
wtanksle
Apr 19, 2012 5:50 am
... That's a good question. You'd have to provide more structure than a simple "graph", since a graph has no orientation. Obviously you've got a root and at...
4920
Stephen De Gabrielle
spdegabrielle
Apr 17, 2012 3:46 pm
On Tue, Apr 17, 2012 at 3:48 PM, William Tanksley, Jr <wtanksleyjr@... ... possibility of a concatenative language that operated on a 'graph-structured ...
4919
William Tanksley, Jr
wtanksle
Apr 17, 2012 2:48 pm
... "Convenient" is kind of vague. A stack is the only parameter-passing data structure we know of that's computationally complete/Turing equivalent and...
Agreed. Peg is the most interesting variant I've seen in quite a while. I haven't looked deeply yet but it seems to have an Icon flavor to it. Of course, any...
4916
William Tanksley, Jr
wtanksle
Apr 17, 2012 12:27 pm
... Amazing... This is creative. He's parsing right to left, and executing only what's needed to evaluate the last word. In cases where evaluation is...
4915
John Nowak
john@...
Apr 16, 2012 2:47 pm
https://github.com/HackerFoo/peg Not mine. - jn...
4914
William Tanksley, Jr
wtanksle
Mar 25, 2012 5:03 pm
... Computers with i/o are categorically different from ones without it, capable of computing tasks in completely different time orders. Turing machines help...
4913
Ruurd
wodan58
Mar 25, 2012 9:59 am
Hi, You don't have to add i/o primitives to your language. All computers are permutations of a Turing machine and a Turing machine does not have i/o. First you...
4912
William Tanksley, Jr
wtanksle
Mar 24, 2012 9:15 pm
... Informally, yes. Formally, nontermination. There are many ways of doing that which aren't as simple to discover as infinite loops. ... Okay, that's fine,...
4911
William Tanksley, Jr
wtanksle
Mar 24, 2012 8:51 pm
... I'm sorry -- I didn't realize that. Using the same notation as iepos' page: [B] [A] q == [[B]] [A B] So, q serves three purposes: it makes A and B into...
