On Sun, 11 Mar 2018 08:12:03 -0700, Liang Ng wrote:
...
> whatever mathematicians have proven in the past on paper, should
> be provable using RPN.
What is provable in "infix notation" is obviously proable in RPM.
Like: VI + IV = X ==> 6 + 4 = 10
But explain how/why "RPN is a representation of graph" ?
Is this related to:
functional languages <are expressions, rather than statements>;
they are representable by a tree/graph;
which is reducable to <the answer> ?