Martin Baker <[email protected]> writes:
[...] | > They are used to build symolic expressions, for example: | > | > conjunction(p,q) == | > per kernel(operator(AND, 2), [p, q], 1 + max(level p, level q)) | | > Here, AND has not other meaning than being the internal name of the | > logical conjunction operators. I kept the name close to the | > intermediate language representation since they have similar (or exact) | > semantics. | | So since operator is defined like this: | | TermAlgebraOperator(S: SetCategory): Public == Private where | Public == OperatorCategory S with | operator: (S,Arity) -> % Hmm, I think you should not need to get there -- unless you also want to implement the full universal algebra machinery (which isn't completely done in OpenAxiom yet.) For the time being, OpenAxiom just reuses the existing BasicOperator domain, which I think should be sufficient (if a little bit heavy, but not much.) If you just copied the current PropositionalFormula domain. you should not need a lot before getting it working in FriCAS. Am I underestimating something? -- Gaby -- 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.
