This document is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
The copyright holder grants you permission to redistribute this
document freely as a verbatim copy. Furthermore, the copyright
holder permits you to develop any derived work from this document
provided that the following conditions are met.
a) The derived work acknowledges the fact that it is derived from
this document, and maintains a prominent reference in the
work to the original source.
b) The fact that the derived work is not the original OpenMath
document is stated prominently in the derived work. Moreover if
both this document and the derived work are Content Dictionaries
then the derived work must include a different CDName element,
chosen so that it cannot be confused with any works adopted by
the OpenMath Society. In particular, if there is a Content
Dictionary Group whose name is, for example, `math' containing
Content Dictionaries named `math1', `math2' etc., then you should
not name a derived Content Dictionary `mathN' where N is an integer.
However you are free to name it `private_mathN' or some such. This
is because the names `mathN' may be used by the OpenMath Society
for future extensions.
c) The derived work is distributed under terms that allow the
compilation of derived works, but keep paragraphs a) and b)
intact. The simplest way to do this is to distribute the derived
work under the OpenMath license, but this is not a requirement.
If you have questions about this license please contact the OpenMath
society at http://www.openmath.org.
The constructor of Polynomials built with Straight Line Program
representation.
The first argument is the polynomial ring containing the polynomial
built with poly_ring_SLP,
The second argument is the program body built with prog_body.
Example:
The polynomial x^2 + y^2,
which may be represented as the Straight Line Program :
line 1 : InputNode x
line 2 : InputNode y
line 3 : OperationNode times line 1, line 1
line 4 : OperationNode times line 2, line 2
line 5 : OperationNode plus line 3, line 4 >
may be encoded as :
The constructor of the body of the straight line program
the arguments represent straight line instructions, as constructed by the
following three constructors, op_node, inp_node and const_node, possibly
wrapped in the return symbol (from the opnode CD). The order
is taken to be the order in which they appear.
This constructor takes three arguments.
The first argument is a symbol from opnode, meant to specify
whether the node is a plus, minus times or divide node,
the second and third arguments are integers, which are the numbers
of the lines which are the arguments of the operation
A unary function taking an slp as argument and returning the
greatest depth of any leaf node, that is the length of the longest
contiguous path to any leaf node.
This is a Monte-Carlo equality test,
it takes three arguments, the first two are slps representing
polynomials, the third argument is the maximum probability of
incorrectness that is required of the equality test.
(Monte-Carlo equality tests are very important for slps as they
offer the only tractable method of solving the equality problem
in many cases)
