18. A system as in claim 15 , wherein the operations further comprise: transforming a representation of each cell having at least one formula into a pre-defined notation format prior to the recursive evaluation; wherein each formula in the transformed notation comprises one or more tokens, and wherein the recursively evaluating comprises: creating a result stack; for each token in the transformed representation: if the token corresponds to a value, pushing the token onto the result stack; if the token corresponds to a function: popping required arguments off the result stack; evaluating the function; pushing the result of the function onto the result stack; if the token corresponds to at least one cell reference: recursively fetching the value of the at least one referenced cell.
15. A computer program product as in claim 11 , wherein the operations further comprise: transforming a representation of each cell having at least one formula into a pre-defined notation format prior to the recursive evaluation.