Thank you for your answers; that's all what i do:
matteo@vaio:~$ axiom
GCL (GNU Common Lisp) 2.6.7 CLtL1 Feb 1 2012 08:59:12
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files set to /tmp/
AXIOM Computer Algebra System
Version: Axiom (January 2012)
Timestamp: Monday April 23, 2012 at 15:48:15
-----------------------------------------------------------------------------
Issue )copyright to view copyright notices.
Issue )summary for a summary of useful system commands.
Issue )quit to leave AXIOM and return to shell.
Visit http://axiom-developer.org for more information
-----------------------------------------------------------------------------
Re-reading compress.daase Re-reading interp.daase
Re-reading operation.daase
Re-reading category.daase
Re-reading browse.daase
(1) ->
(1) -> Q:=FRAC INT
(1) ->
(1) Fraction(Integer)
Type:
Domain
(2) -> vl:=[t1,t2,t3,t4,t5,t6,t7,t8,t9,t10]
(2) ->
(2) [t1,t2,t3,t4,t5,t6,t7,t8,t9,t10]
Type:
List(OrderedVariableList([t1,t2,t3,t4,t5,t6,t7,t8,t9,t10]))
(3) -> RG:= DMP(vl,Q)
(3) ->
(3)
DistributedMultivariatePolynomial([t1,t2,t3,t4,t5,t6,t7,t8,t9,t10],Fraction(I
nteger))
Type:
Domain
(4) -> FRG:=FRAC(RG)
(4) ->
(4)
Fraction(DistributedMultivariatePolynomial([t1,t2,t3,t4,t5,t6,t7,t8,t9,t10],F
raction(Integer)))
Type:
Domain
(5) -> IRG:=IDEAL(Q,DirectProduct(#vl,NNI),OrderedVariableList vl, RG)
(5) ->
>> System error:
Lisps arglist maximum surpassed
(5) ->
I don't know how to solve this problem. do you think that it may be a
problem due to ubuntu 12.04?
Thank you
Matteo
2013/10/29 Tim Daly <[email protected]>
> I just tried your example:
>
> AXIOM Computer Algebra System
> Version: Axiom (May 2012)
> Timestamp: Friday September 27, 2013 at 20:12:11
>
> -----------------------------------------------------------------------------
> Issue )copyright to view copyright notices.
> Issue )summary for a summary of useful system commands.
> Issue )quit to leave AXIOM and return to shell.
> Visit http://axiom-developer.org for more information
>
> -----------------------------------------------------------------------------
>
> Re-reading compress.daase Re-reading interp.daase
> Re-reading operation.daase
> Re-reading category.daase
> Re-reading browse.daase
> (1) ->
> (1) -> Q:=FRAC INT;
>
> Type:
> Domain
> (2) -> vl:=[t1,t2,t3,t4,t5,t6,t7,t8,t9,t10];
>
> Type:
> List(OrderedVariableList([t1,t2,t3,t4,t5,t6,t7,t8,t9,t10]))
> (3) -> RG:=DMP(vl,Q);
>
> Type:
> Domain
> (4) -> FRG:=FRAC(RG);
>
> Type:
> Domain
> (5) -> IRG:=IDEAL(Q,DirectProduct(#vl,NNI),OrderedVariableList vl,RG)
>
> (5)
>
> PolynomialIdeals(Fraction(Integer),DirectProduct(10,NonNegativeInteger),Order
>
> edVariableList([t1,t2,t3,t4,t5,t6,t7,t8,t9,t10]),DistributedMultivariatePolyn
> omial([t1,t2,t3,t4,t5,t6,t7,t8,t9,t10],Fraction(Integer)))
> Type:
> Domain
>
> and it doesn't fail here. There is a join function used in Axiom which
> has the potential to exceed the lisp limit for argument lists if the
> join function is compiled. However, it works fine interpreted. As a
> result the join function is never compiled in Axiom. It looks like you
> managed to compile that function somehow.
>
> Tim Daly
>
_______________________________________________
Axiom-developer mailing list
[email protected]
https://lists.nongnu.org/mailman/listinfo/axiom-developer
