Respawning Factorial Write a program that does one step of the computation of factorial, then, generate (quine) a new program, and performs the rest of the process in the new program
The seed and spawned programs will have a variable n for the factorial to be computed and m for the accumulator.

I don't care if you use scripted or compiled language.
You can use the cheat of "reading the source file".
You MUST create a new file and run the new file to qualify: no self-modifying code or using code loaded in memory, but spawning with data: url in JS is allowed.

Here is an example in Java: https://gist.github.com/968033

Shortest code wins.
Perl, 95

 

$m=1;$n=12||die$m;@ARGV=$0;$_=&lt;&gt;;$m*=$n--;s/\|/;\$m=$m;\$n=$n|/;open _,"&gt;$0";print _;exec$^X,$0


The program really has to be on a single line, and overwrites itself at each iteration.