... 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...
4910
Robbert van Dalen
r_v_dalen
Mar 24, 2012 7:57 pm
... of course, never to reach fixed point is an 'infinite loop'. to reach fixed point is called the normal form of an expression. see:...
4909
William Tanksley, Jr
wtanksle
Mar 24, 2012 4:35 pm
... Looking elsewhere in your email, I see the problem. This is a good time to ask that implied question: "is there any difference between []k and drop, or...
4908
Ruurd
wodan58
Mar 24, 2012 9:12 am
Hi, I can't find q on iepos' webpage, but I do find cake. Is q the same as cake ? Can zeroone be used to write a brainfuck interpreter in 112 bytes or less ?...
4907
Robbert van Dalen
r_v_dalen
Mar 24, 2012 7:11 am
... but the result [] k cannot be expressed with the defined combinators 0 and 1, except implicitly with "01" isn't that a problem? aren't there actually five...
4906
William Tanksley, Jr
wtanksle
Mar 22, 2012 8:28 pm
... Yes. Given 'q' and 'k', both defined in iepos' webpage, we can define: "0" = [] [q] [k] and "1" = k. So, for example, "01" evaluates as follows: "01" = []...
4905
Robbert van Dalen
r_v_dalen
Mar 22, 2012 5:43 pm
... can you give an example of a flat - two combinator - base? does such flat base mean that you can cut an valid expression anywhere to produce two valid...
4904
William Tanksley, Jr
wtanksle
Mar 20, 2012 3:36 pm
... Yes, exactly two; and yes, the languages are different. Iota and Jot are not concatenative. One simple consequence of this is that in Iota or Jot, knowing...
4903
Robbert van Dalen
r_v_dalen
Mar 20, 2012 7:26 am
... Does zeroone have exactly two combinators and are they different from iota or jot? http://semarch.linguistics.fas.nyu.edu/barker/Iota/ ... i believe the...
4902
William Tanksley, Jr
wtanksle
Mar 20, 2012 2:42 am
... Wow, that's something. I remember typing in BASIC programs from magazines, but I'd never heard of that. ... Oh, I'd mentioned that "my zeroone language was...
4901
stevan apter
sa@...
Mar 19, 2012 7:38 pm
yes please. more zeroone. (sounds like a planet in flash gordon's univese, doesn't it?)...
4900
Robbert van Dalen
r_v_dalen
Mar 19, 2012 7:36 pm
http://en.wikipedia.org/wiki/BASICODE it was a dutch/german experience....
4899
Robbert van Dalen
r_v_dalen
Mar 19, 2012 7:33 pm
i still remember the days when basicode programs were broadcasted! you could actually hear the 0's and 1's. Seriously, i do want to hear about your zeroone...
