On Tue, May 01, 2012 at 12:20:09PM -0700, Grigory Sarnitsky wrote:
> Hello! Citing Axioms's doc:
>
> Conceptually, an object of type Expression can be thought of a quotient of
> multivariate polynomials, where the "variables" are kernels. The arguments
> of the kernels are again expressions and so the structure recurses. See
> Expression for examples of using kernels to take apart expression objects.
>
> You can find this in HyperDoc in the description of "Kernel" or in the
> bookvol0 (9.44 Kernel).
>
> As far as I understand this definition, Expression is defined through
> Kernel, and Kernel through Expression. How is this loop resolved?
Probably, similar as the definition of a binary tree.
"A binary tree is either a Leaf
or a Node who's left is a binary tree and right is a binary tree."
So, a binary tree is defined trough itself (+ through a leaf).
For example, each point in this graph defines a tree:
Node
/ \
Node (Leaf 3)
/ \
(Leaf 1) (Leaf 2)
------
Sergei
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
