Revisedn Report on the Algorithmic Language /prog/ (RnR/P/). This is the official thread for the /prog/s dialect of the popular Scheme and Lisp programming languages
Your feeble attempts memeforcing have been met with failure, why keep trying
Name:
Anonymous2014-06-17 19:02
==Proposal #00001: Parallel uniqure worlds for side effects==
Splinting a world to 2 worlds: (world-splint world) =>(list world1 world2)
Joining worlds: (world-join world1 world2) => world
Using a world and getting the next one: (print file "shit" world) => (#t world2)
Name:
Anonymous2014-06-17 19:25
down vote
The obvious answer is "yes" -- unsurprising given that S-expressions were intended as a simple & uniform representation of parsed code. The thing is that languages like Haskell or ML tend to have some problems with that. I once did something similar to OCaml (abused CamlP4 and wrote some function that translates the P4 AST into some sexpr-like representation), and the fun begins when you run into similar kinds of AST nodes that have different types because they're not really the same... For example, there's function application, and there's a similar form that is used in patterns, and yet another form that is used in type expressions.
My guess is that trying to do genetic programming this way is likely to suffer from too much junk programs that don't have any meaning. But that's unsurprising too for any statically typed language -- a dynamically typed language will allow more junk in. Comparing the two worlds WRT to genetic programming might be interesting for reasons beyond the AI...
N ON ANOTHER MATTER, I PROPOSE DAT WE CHANGE DA NAME OF 1 OF DA FIRST TWO LEVELZ ON BANGO KAZOOIE. ITZ A FUKIN OUTRAGE DAT BOTH OF DA FIRST LEVELZ R MOUNTAIN LEVELS. WAT WERE DESE FUKIN RETOIDS THINKIN?