You can subscribe to this list here.
2008 
_{Jan}
(4) 
_{Feb}
(2) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}
(2) 
_{Sep}

_{Oct}
(27) 
_{Nov}

_{Dec}
(6) 

2009 
_{Jan}
(3) 
_{Feb}

_{Mar}

_{Apr}
(1) 
_{May}

_{Jun}
(27) 
_{Jul}

_{Aug}

_{Sep}
(3) 
_{Oct}
(22) 
_{Nov}
(12) 
_{Dec}

2010 
_{Jan}
(11) 
_{Feb}
(3) 
_{Mar}
(2) 
_{Apr}
(11) 
_{May}
(29) 
_{Jun}
(59) 
_{Jul}

_{Aug}
(3) 
_{Sep}
(2) 
_{Oct}
(8) 
_{Nov}
(3) 
_{Dec}

2011 
_{Jan}
(5) 
_{Feb}

_{Mar}

_{Apr}
(6) 
_{May}

_{Jun}

_{Jul}
(13) 
_{Aug}
(4) 
_{Sep}
(4) 
_{Oct}
(19) 
_{Nov}

_{Dec}
(2) 
2012 
_{Jan}
(2) 
_{Feb}
(1) 
_{Mar}
(3) 
_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

2013 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}
(78) 
_{Jun}
(10) 
_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}
(2) 
2014 
_{Jan}
(2) 
_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}
(1) 
_{Oct}
(1) 
_{Nov}

_{Dec}

2017 
_{Jan}

_{Feb}
(1) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}
(1) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 


1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18
(3) 
19

20
(3) 
21

22

23

24

25

26

27

28

29

30

31




From: Gabriel Dos Reis <gdr@cs...>  20081220 18:17:53

"Gabriel Dos Reis" <gdr@...> writes: [...]  >  > I don't understand either error message much less why they are  > different.  >  > Then there is this:  > (18) > PQ  > (18) >  > (18) UnivariatePolynomial(x,Fraction Integer)  > Type: Domain  > (19) > has(PQ, Ring)  > 19) >  > >> System error:  > The variable PQ is unbound.   The root cause is that, historically, `has' takes its arguments unevaluated  so here it its that PQ is a domain constructor (as opposed to a  variable that has a domain value), so proceed to call a Lisp function.  Then, the Lisp runtime system bombs. I consider this a bug that will  be fixed shortly. with this patch. Tested on an x86_64suselinux. Applied to both 1.2 branch and trunk.  Gaby 20081220 Gabriel Dos Reis <gdr@...> * interp/ianaly.boot (elaborateForm): New. * interp/ispec2.boot (uphas): Use it. Evaluate first operand. *** src/doc/msgs/s2us.msgs (revision 12489)  src/doc/msgs/s2us.msgs (local) *************** S2IE0014 *** 169,174 ****  169,176  packagecall context. S2IE0020 Only identifiers can be used as Record of Union field names. + S2IE0021 + %1b as first argument to %b has %d does not evaluate to a type. S2IF0001 A $expression must have a fully specified domain or package on the righthand side. *** src/interp/ianaly.boot (revision 12489)  src/interp/ianaly.boot (local) *************** pushDownOp?(op,n) == *** 207,212 ****  207,218   Also see ISPEC BOOT for special handlers and IMAP BOOT for  user function processing. + ++ Take a parse form and return the VAT for its elaboration. + elaborateForm pf == + t := mkAtree1 pf + bottomUp t + t + bottomUp t ==  bottomUp takes an attributed tree, and returns the modeSet for it.  As a sideeffect it also evaluates the tree. *** src/interp/ispec2.boot (revision 12489)  src/interp/ispec2.boot (local) *************** uphas t == *** 210,228 **** t isnt [op,type,prop] => nil  handler for category and attribute queries type := ! isLocalVar(type) => ! $genValue => ["evaluateType", ["unabbrev", type]] !  At this point, type will have already been reduced to !  its object representation. ! ["devaluate", type] ! MKQ unabbrev type catCode :=  FIXME: when we come to support category valued variable  this code needs to be adapted. prop := unabbrev prop evaluateType0 prop => ["evaluateType", MKQ prop] MKQ prop ! code:=["newHasTest",type, catCode] if $genValue then code := wrap timedEVALFUN code putValue(op,objNew(code,$Boolean)) putModeSet(op,[$Boolean])  210,228  t isnt [op,type,prop] => nil  handler for category and attribute queries type := ! x := elaborateForm type ! getModeSet x is [m] and (conceptualType m = $Type or categoryForm? m) => ! val := objValUnwrap getValue x ! $genValue => MKQ val ! ["devaluate",val] ! throwKeyedMsg("S2IE0021",[type]) catCode :=  FIXME: when we come to support category valued variable  this code needs to be adapted. prop := unabbrev prop evaluateType0 prop => ["evaluateType", MKQ prop] MKQ prop ! code := ["NOT",["NULL",["newHasTest",type, catCode]]] if $genValue then code := wrap timedEVALFUN code putValue(op,objNew(code,$Boolean)) putModeSet(op,[$Boolean]) 
From: Gabriel Dos Reis <gdr@in...>  20081220 14:43:20

On Sat, Dec 20, 2008 at 12:56 AM, harke <rharke@...> wrote: > Thanks. I was able to get several steps farther. > > But, when I try to go beyond the book and try new things > I get results that baffle me. > I tried to make a matrix with: > > (18) > m : SquareMatrix(2, PQ) := [[x, x**2],[x**3, x**4]] > 18) > > You cannot declare m to be of type SquareMatrix(2, > UnivariatePolynomial(x,Fraction Integer)) because either the > declared type of m or the type of the value of m is different > from SquareMatrix(2,UnivariatePolynomial(x,Fraction Integer)) . Hi, This is because in your session you have declared x to be of type PQ, so OpenAxiom is confused by your simulatenous use of x as a variable (of type PQ), and as a literal symbol with value x (the x in UnivariatePolynomial(x, Fraction Integer)). If I remove the declaration for x then, everything works fine and I get (4) > m: SQMATRIX(2,PQ) := [[x,x^2],[x^3,x^4]] + 2+ x x  (4)    3 4 +x x + Type: SquareMatrix(2,UnivariatePolynomial(x,Fraction Integer)) (sorry if the copyandpaste is mangled). > > But if I type in the long version: > > (18) > m: SquareMatrix(2,UnivariatePolynomial(x,Fraction Integer)) := > [[x,x**2],[x**3,x**4]] > 18) > > Cannot convert from type UnivariatePolynomial(x,Fraction Integer) to > Symbol for value > x This is because you are using x simultenously as both a variable and a symbol. The x in UnivariatePolynomial(x,Fraction Integer) must be a symbol (so you should quote it, as you did in your previous declaration). > > I don't understand either error message much less why they are > different. > > Then there is this: > (18) > PQ > (18) > > (18) UnivariatePolynomial(x,Fraction Integer) > Type: Domain > (19) > has(PQ, Ring) > 19) > > >> System error: > The variable PQ is unbound. The root cause is that, historically, `has' takes its arguments unevaluated so here it its that PQ is a domain constructor (as opposed to a variable that has a domain value), so proceed to call a Lisp function. Then, the Lisp runtime system bombs. I consider this a bug that will be fixed shortly. Many thanks for your report, and patience withe OpenAxiom. Your feedback is most appreciated.  Gaby 
From: harke <rharke@ea...>  20081220 06:57:10

Thanks. I was able to get several steps farther. But, when I try to go beyond the book and try new things I get results that baffle me. I tried to make a matrix with: (18) > m : SquareMatrix(2, PQ) := [[x, x**2],[x**3, x**4]] 18) > You cannot declare m to be of type SquareMatrix(2, UnivariatePolynomial(x,Fraction Integer)) because either the declared type of m or the type of the value of m is different from SquareMatrix(2,UnivariatePolynomial(x,Fraction Integer)) . But if I type in the long version: (18) > m: SquareMatrix(2,UnivariatePolynomial(x,Fraction Integer)) := [[x,x**2],[x**3,x**4]] 18) > Cannot convert from type UnivariatePolynomial(x,Fraction Integer) to Symbol for value x I don't understand either error message much less why they are different. Then there is this: (18) > PQ (18) > (18) UnivariatePolynomial(x,Fraction Integer) Type: Domain (19) > has(PQ, Ring) 19) > >> System error: The variable PQ is unbound. (19) > has(UnivariatePolynomial(x,Fraction Integer), Ring) (19) > (19) true Richard Harke On Thursday 18 December 2008, Bill Page wrote: > Richard, > > There is a typo in the book. The correct statement is: > > Dx: LODO2(Q, PQ) := D() > > This has been corrected in the new electronic verison of the book: > > http://axiomdeveloper.org/axiomwebsite/bookvol0.pdf > > Regards, > Bill Page. > > On Thu, Dec 18, 2008 at 1:35 AM, harke wrote: > > I have been trying to learn Axiom but it has been going > > rather slowly, I'm afraid. > > > > My immediate problem has to do with > > LinearOrdinaryDifferentialOperator in > > section 9.35.1 of the book.(I'm working from a hard copy, > > 1992 vintage) > > > > The input sequence is: > > Q := Fraction Iteger > > PQ := UnivariatePolynomial('x, Q) > > x: PQ := 'x > > Dx: LODO(Q, PQ) := D() > > This last is not accepted. > > I've done > > )show LODO > > and I get > > LinearOrdinaryDifferentialOperator(A: Ring,diff: (A > A)) is a domain > > constructor > > > > but what function A > A should diff be? > > how is PQ to be brought into this? > > > > Note: I built this from the source tarball on a Debian system > > running the unstable version > > I tried to find the pdf of the book in the set of files but > > could not. I did find a directory full of .ps files but the ones > > named bookvol* seemed to have just little bits and pieces. > > > > Richard Harke > > > > > >  > > SF.Net email is Sponsored by MIX09, March 1820, 2009 in Las Vegas, > > Nevada. The future of the web can't happen without you. Join us at MIX09 > > to help pave the way to the Next Web now. Learn more and register at > > http://ad.doubleclick.net/clk;208669438;13503038;i?http://2009.visitmix.c > >om/ _______________________________________________ > > openaxiomhelp mailing list > > openaxiomhelp@... > > https://lists.sourceforge.net/lists/listinfo/openaxiomhelp 
From: Bill Page <bill.page@ne...>  20081218 15:37:49

On Thu, Dec 18, 2008 at 1:35 AM, Richard Harke wrote: > I have been trying to learn Axiom but it has been going > rather slowly, I'm afraid. > ... > Note: I built this from the source tarball on a Debian system > running the unstable version > I tried to find the pdf of the book in the set of files but > could not. I did find a directory full of .ps files but the ones > named bookvol* seemed to have just little bits and pieces. > The source on Debian is very old. I highly recommend that you upgrade to a more recent version from: http://www.openaxiom.org/download.html Note: OpenAxiom is a fork of the original Axiom project. There is another fork called FriCAS. All three projects are maintaining separate new versions of "Axiom" with some small and some larger variations. Regards, Bill Page. 
From: Bill Page <bill.page@ne...>  20081218 15:30:37

Richard, There is a typo in the book. The correct statement is: Dx: LODO2(Q, PQ) := D() This has been corrected in the new electronic verison of the book: http://axiomdeveloper.org/axiomwebsite/bookvol0.pdf Regards, Bill Page. On Thu, Dec 18, 2008 at 1:35 AM, harke wrote: > I have been trying to learn Axiom but it has been going > rather slowly, I'm afraid. > > My immediate problem has to do with > LinearOrdinaryDifferentialOperator in > section 9.35.1 of the book.(I'm working from a hard copy, > 1992 vintage) > > The input sequence is: > Q := Fraction Iteger > PQ := UnivariatePolynomial('x, Q) > x: PQ := 'x > Dx: LODO(Q, PQ) := D() > This last is not accepted. > I've done > )show LODO > and I get > LinearOrdinaryDifferentialOperator(A: Ring,diff: (A > A)) is a domain > constructor > > but what function A > A should diff be? > how is PQ to be brought into this? > > Note: I built this from the source tarball on a Debian system > running the unstable version > I tried to find the pdf of the book in the set of files but > could not. I did find a directory full of .ps files but the ones > named bookvol* seemed to have just little bits and pieces. > > Richard Harke > > >  > SF.Net email is Sponsored by MIX09, March 1820, 2009 in Las Vegas, Nevada. > The future of the web can't happen without you. Join us at MIX09 to help > pave the way to the Next Web now. Learn more and register at > http://ad.doubleclick.net/clk;208669438;13503038;i?http://2009.visitmix.com/ > _______________________________________________ > openaxiomhelp mailing list > openaxiomhelp@... > https://lists.sourceforge.net/lists/listinfo/openaxiomhelp > 
From: harke <rharke@ea...>  20081218 06:36:12

I have been trying to learn Axiom but it has been going rather slowly, I'm afraid. My immediate problem has to do with LinearOrdinaryDifferentialOperator in section 9.35.1 of the book.(I'm working from a hard copy, 1992 vintage) The input sequence is: Q := Fraction Iteger PQ := UnivariatePolynomial('x, Q) x: PQ := 'x Dx: LODO(Q, PQ) := D() This last is not accepted. I've done )show LODO and I get LinearOrdinaryDifferentialOperator(A: Ring,diff: (A > A)) is a domain constructor but what function A > A should diff be? how is PQ to be brought into this? Note: I built this from the source tarball on a Debian system running the unstable version I tried to find the pdf of the book in the set of files but could not. I did find a directory full of .ps files but the ones named bookvol* seemed to have just little bits and pieces. Richard Harke 