Thank you for you help, I'm studying your example. But a little
problem has arisen. The following dummy package cannot be compiled,
there is an error with using reduce:
)abbrev package MYEXP MyExp
MyExp(F: Ring): with
myexp: F -> F
myexp: (F, PositiveInteger) -> F
== add
myexp(x: F, n: PositiveInteger): F == reduce(+,[1,2,3,4])
The current line is:
6> myexp(x: F, n: PositiveInteger): F == reduce(+,[1,2,3,4])
^
The number of valid tokens is 2.
The prior token was #S(TOKEN :SYMBOL |(| :TYPE KEYWORD :NONBLANK T)
The current token is #S(TOKEN :SYMBOL + :TYPE KEYWORD :NONBLANK T)
The next token is #S(TOKEN :SYMBOL |,| :TYPE KEYWORD :NONBLANK T)
Although reduce in intepreter works fine
(1) -> reduce(+,[1,2,3,4])
(1) 10
Type:
PositiveInteger
--
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.
