Here is the C translated into Perl in a straightforward way:

use strict;
my ($x, $y, $k, $counter);
my @b = split //, " .:,;!/>)|&IH%*#";
my ($r, $i, $z, $Z, $t, $c, $C);
my ($begin, $end);
my $counter = 0;

$begin = time;

while($counter < 1000){
    for ($y=30; print("\n"), $C = $y*0.1 - 1.5, $y--;) {
     for ($x=0; $c = $x*0.04 - 2, $z=0, $Z=0, $x++ < 75;) {
      for ($r=$c, $i=$C, $k=0; $t = $z*$z - $Z*$Z + $r, $Z = 2*$z*$Z +
+ $i, $z=$t
, $k<112; $k++) {
        last if ($z*$z + $Z*$Z > 10);
      }
      printf ($b[$k%16]);
    }
  }
  $counter++;
}

$end = time;

printf ("%d count in %ld secs \n", $counter, $end - $begin);
[download]

Note that this is going to be much slower than both Parrot and C. Without knowing much about Parrot, I'd be surprised if Perl 6 actually gets compiled to Parrot that is as efficient as the handrolled code above.