... I recently posted a justification for the restricted order nature of 5th in responses to one of the comments on LtU: ...
John Nowak
john@...
Oct 17, 2008 3:00 pm
4131
It's been a long time since I've participated in this forum, but it hasn't been because of loss of interest. Mostly, I've been preoccupied with other things....
... --snip-- ... Having just read 75% of 'The collapse of chaos' by Cohen & Ian Stew[au]rt I'm less believing than when I read of some claimed successes in...
chris glur
crglur@...
Nov 15, 2008 7:32 am
4133
... Joy as the ... You might be interested in the work by Lee Spector on the Push, PushGP and Pushpop systems [1]. jan [1]...
or search back in the concatenative archives and read billy tanksley's remarks about his languages 01 and 10 and their suitability for darwinian evolutionary...
Stevan Apter
sa@...
Nov 16, 2008 7:25 pm
4135
... The nice thing about 01 (or 10, it's just a logical NOT away) is that you can cut and splice anything anywhere and it's still a valid program. The bad...
... From: "William Tanksley, Jr" <wtanksleyjr@...> ... perhaps you can post your 10 unit tests. i'd like to try running them in my implementation....
Stevan Apter
sa@...
Nov 16, 2008 10:00 pm
4137
Hi, you would probably be really interested in the work of Jurgen Schmidhuber, in particular the 'OOPS' optimal ordered problem solver[1]. It is an algorithm...
If it's to run as an auto-evolving machine, then decoding, analysing & reverse-engineering the results is not realistic. And not a goal. What is the advantage...
chris glur
crglur@...
Nov 18, 2008 4:37 pm
4139
Hello all. One of the problems I've run into with a second-order language is that you don't get partial application. (I've recently been able to extend the...
John Nowak
john@...
Nov 19, 2008 2:13 pm
4140
... Minor correction: ('a0 .. 'aN) 'x \y. [F y G] map y ('a0 .. 'aN) [F 'x G] map 'x ('a0 F 'x G .. 'aN F 'x G) 'x...
John Nowak
john@...
Nov 19, 2008 2:16 pm
4141
Did anybody else follow up on the good links which John Meacham gave ? Jürgen Schmidhuber starts laying out the algorithms in: ...
Chris Glur
crglur@...
Nov 22, 2008 3:59 pm
4142
Did anybody else follow up on the good links which ementation 2 gave ? ... == Chris Glur PS. I'm testing the hack: post via gmail without bogging down in...
Chris Glur
crglur@...
Nov 22, 2008 4:49 pm
4143
... You do have to decide the relative fitness of the results, so some amount of decoding results is needed. ... There's a reason why this hasn't been done --...
... There are a wide variety of languages that would be suitable for the techniques he describes, Appendix A of this paper gives the specification for the...
... Even a fan of lower-order logic like myself can applaud this result. Good luck! ... Interestingly, Factor just eliminated its retain stack words. This ...
... I should say, the main reason I recommended 'floy' instead of joy was not for easy interpretation of the results, but rather to have a more convinient base...
... Wouldn't a retain stack only give one just one order more expressive power? as in, you have second order, and a psuedo third order (with a different...
... An additional benefit of retain stacks arises in the case of linear types. Because it is easy to shuffle objects onto and off of the retain stack, it's...
John Nowak
john@...
Nov 25, 2008 2:12 am
4149
... What type system are you currently using? Is your restriction to second order due to your inference algorithm or something more fundamental to the...
... It was both, but now it's just the latter. Well, that, and certain things are just easier to handle when first class functions aren't involved. ... The...
John Nowak
john@...
Nov 25, 2008 8:13 am
4151
I know little of joy and none of floy. ... Please define 'linear style'. From your description, machine-code is linear, because all 'constructs' are acheived...
chris glur
crglur@...
Nov 29, 2008 5:54 pm
4152
Hi all, I am looking for a name for a combinator that is equivalent to: In Cat: dip apply Or in Joy: dip i This turns out to be a very useful combinator when...
There are many nice things about concatenative languages: Good abstraction potential, easy handling of multiple value returns, simple left-to-right syntax,...
John Nowak
john@...
Dec 7, 2008 12:52 pm
4154
Ow. Sorry for the line wrapping issues. Here's another copy. (Not sure if sending this again is more annoying than the line wrapping, but here we are.) - - - ...
John Nowak
john@...
Dec 7, 2008 12:59 pm
4155
... I can't say that I understand what you'd use this for and hence I'm having trouble coming up with a name. I've often used 'dup dip i' (aka 'twice'), but...
John Nowak
john@...
Dec 7, 2008 1:08 pm
4156
... Sigh. That should read as follows: sum = [id, 0] fold:+ I swear I proofread this thing before I sent it. - John...
John Nowak
john@...
Dec 7, 2008 1:14 pm
4157
... No I don't. I have only seen it when refactoring concatenative code. Lets call it q for a second: ... [a] [b] q => ... b a I believe the following is the...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
