Ok, but can you explain, why Axiom can compile test2 ?the only difference is line n(i,j) := fallingPower(i+j,j) in test0andn(i,j) := fallingPower(i,j) in test2
Well my guess is that because fallingPower (p,0) == 1 fallingPower (p,n) == p*fallingPower(p-1,(n-1)::NNI) is a recursive definition. Otherwise, I have no idea. Ralf _______________________________________________ Axiom-developer mailing list Axiom-developer@nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-developer
