What golfing languages are better suited as an object for genetic programming? I see GolfScript, Pyth, CJam and similar languages can make compex-ish algorithms in few bytes. This terseness makes think about genetic programming applications (using said languaes as the thing being mutated).

I assume that to make a good GP language, it should have following characteristics:


Programs are typically short;
Random bytes should have high change of being a well-formed program;
Programs should compile and run fast;
Typical programs should not fall into endless loop often, or such loops should be early-detectable in most cases;
Contatenations, extraction of substrings, small modifications should often lead to something related to the original program;
Program should be easy to put in a sandbox (i.e. should not crash the interpreter);
Be turing-complete or near it.


How much languages typically used for golfing suit for genetic programming?
I would be surprised if any golfing languages were appropriate for genetic programming. Pyth, at least, is very unlikely to form a valid program with random bytes, and I believe the same is true of most golfing languages. This, if nothing else, probably invalidates them as genetic programming languages.