If you compile the library and make a frontend for it, sure, it will run.
In terms of simplifying, it is basic at the moment. For example, the string "3+x+2" symbolically is seen as [3+[x+2]]. gCAS2 has simplifying in the sense that it can group like-bases and spit back out "5+x" (or x+5, don't remember if cas_node_vs has base sorting). It has expanding support, so it can expand (x+2)*(5-x)
In terms of simplifying, it is basic at the moment. For example, the string "3+x+2" symbolically is seen as [3+[x+2]]. gCAS2 has simplifying in the sense that it can group like-bases and spit back out "5+x" (or x+5, don't remember if cas_node_vs has base sorting). It has expanding support, so it can expand (x+2)*(5-x)
