|
From: Terrence B. <sch...@gm...> - 2007-12-24 15:59:36
|
Raymond Toy wrote: > Terrence Brannon wrote: >> Terrence Brannon wrote: >> >>> Hello, I am developing a library of array processing code in Common >>> Lisp inspired by the J programming language. I am using Windows XP >>> for development. >>> > Have you heard of matlisp? Yes, in my survey of Lisp array processing I came across it. My feedback: * Re: http://matlisp.sourceforge.net/ - MatLisp adds to this richness by giving you a *matrix fast class *based on BLAS <http://www.netlib.org/blas> and LAPACK <http://www.netlib.org/lapack>. -- grammatically, that should be fast matrix class * I am on Windows, so CMUCL does not run and Allegro is too expensive for a hobbyist like me. Also, I desire the blinding speed of SBCL or GCL over Clisp for the ultimate product. Not that my project will ever matter, but I still want to see this little baby crank. * I turned a guy on to Matlisp recently. He goes by the handle mogonus in #lisp. His name is Marco. * I didnt see a manual at the website. * I'm mainly doing this to create an open-source package which is just like the J programming language. A key idea of J is verb rank, which allows verbs to operate on data of any rank. * Matlisp is not limited to rank-2 arrays is it? The README in the distro imply that.. or rather dont discuss anything else. * Precompiling BLAS and LAPACK is fine, but what if a new arch wants to use the library? I like the fortran to lisp approach of Maxima. * I'm not sure about the overhead of using a matrix class. My approach so far has been to use the built in ARRAY type. * There is a great amount of care in documenting the code. A lot of work has gone into this. Has there been no reason for a release since 2003? > There's also at least one other matrix package bug I've forgotten > its name. Hmm... the only other thing I came across was LUSH - which is Lisp-like syntax but not genuine common lisp. Oh wait, actually from a thread I started: http://groups.google.com/group/comp.lang.lisp/browse_thread/thread/d44a7c5c6b3276d8 there is NLISP - http://nlisp.info/index.html there is also RCL and RCLG, listed here - http://www.cliki.net/Mathematics > > (Full disclosure: I wrote parts of matlisp.) nice work! > >> >(funcall (intern (symbol-name :operate-on-system) :mk) "maxima" >> :load :verbose t)) >> > You probably want to use :compile instead of :load. Then all the > files will be compiled (and loaded). >> ; - Loading module "info" >> ; - Binary file binary-gcl/nregex.o is old or does not exist. >> ; Compile (and load) source file src/nregex.lisp instead? >> > Not sure why you get this, but there is a bug in gcl in that it > doesn't know how to create directories. You might want to create the > binary-gcl directory by hand first. yes, that helped out a lot. Thanks. And for readers of the mail archive. the binary-gcl directory should be made in the root of the distro, not in lisp-utils or src. > > Ray > The whole thing built. Now the only issue is that GCL doesnt work with SLIME. So I might try the whole build process over again with SBCL soon. |
|
From: A.J. R. <bli...@gm...> - 2007-12-24 16:59:06
|
On Dec 24, 2007 4:59 PM, Terrence Brannon <sch...@gm...> wrote: > Raymond Toy wrote: > > Terrence Brannon wrote: > >> Terrence Brannon wrote: > >> > >>> Hello, I am developing a library of array processing code in Common > >>> Lisp inspired by the J programming language. I am using Windows XP > >>> for development. > >>> > > Have you heard of matlisp? > Yes, in my survey of Lisp array processing I came across it. My feedback: > * Re: http://matlisp.sourceforge.net/ - MatLisp adds to this richness by > giving you a *matrix fast class *based on BLAS > <http://www.netlib.org/blas> and LAPACK <http://www.netlib.org/lapack>. > -- grammatically, that should be fast matrix class > * I am on Windows, so CMUCL does not run and Allegro is too expensive > for a hobbyist like me. Also, I desire the blinding speed of SBCL or GCL > over Clisp for the ultimate product. Not that my project will ever > matter, but I still want to see this little baby crank. > * I turned a guy on to Matlisp recently. He goes by the handle mogonus > in #lisp. His name is Marco. > * I didnt see a manual at the website. > * I'm mainly doing this to create an open-source package which is just > like the J programming language. A key idea of J is verb rank, which > allows verbs to operate on data of any rank. > * Matlisp is not limited to rank-2 arrays is it? The README in the > distro imply that.. or rather dont discuss anything else. > * Precompiling BLAS and LAPACK is fine, but what if a new arch wants to > use the library? I like the fortran to lisp approach of Maxima. > * I'm not sure about the overhead of using a matrix class. My approach > so far has been to use the built in ARRAY type. > * There is a great amount of care in documenting the code. A lot of work > has gone into this. Has there been no reason for a release since 2003? > > > There's also at least one other matrix package bug I've forgotten > > its name. > Hmm... the only other thing I came across was LUSH - which is Lisp-like > syntax but not genuine common lisp. Oh wait, actually from a thread I > started: > http://groups.google.com/group/comp.lang.lisp/browse_thread/thread/d44a7c5c6b3276d8 > > there is NLISP - http://nlisp.info/index.html > there is also RCL and RCLG, listed here - http://www.cliki.net/Mathematics (Full disclosure - I've got a vested interest in statistical applications of matrices) Having documented/packaged RCLG and fully read RCL, I just want to note that yes you could use them for arrays in CL with exactly what you want, it would be silly (the prime use for them is to handle the features in R that CL doesn't yet have natively -- one of these days CL will). best, -tony bli...@gm... Muttenz, Switzerland. "Commit early,commit often, and commit in a repository from which we can easily roll-back your mistakes" (AJR, 4Jan05). Drink Coffee: Do stupid things faster with more energy! |