Greg, you are referring to src_aldor2.tgz that relies on Java, as the "old build process", right? By you "new one" you mean the new build system recently posted by Peter in the file "src_aldor3.tgz",
This patch, by Peter Broadbery, makes the hashcode generated by Axiom compatible with the hashcode generated for Aldor for Mapping types. == diff --git a/changelog b/changelog index ec2debe..6a0d90e
Hello, On Wed, 05 Sep 2007 18:11:24 +0200, Bill Page <address@hidden> wrote: [APL2 concerns] If issues and rights such as these were specifically addressed in published document that is intended to c
[...] export ALDORROOT=<ALDOR-directory>/linux/1.0.2 In the past, I have documented that you can just lndir in the ax-build dir and have everything setup... -- Gaby
Dear Tim, Waldek, I'm currently experimenting with libdb.text files generated by aldor when compiling for axiom. Would you have an idea why +++ \begin{adusage} +++ x: \adthistype{} := \adname[Combina
Has anyone ever heard exactly what this "license issue" is? What exactly is the problem? Who objects to making Aldor open source? And what needs to be done to satisfy those objections? ??? Why not pu
Since "prime?: % -> Boolean" segfaults, let us test "prime?: Integer -> Partial Boolean". aldor -q1 -fx -lalgebra -laldor aaa.as aaa [T] Either my Aldor compiler doesn't like me or it looks like a go
Hello again, thank you for all your help you gave last time. I am still new to axiom/aldor and perhaps somebody can point out to me the difference between the following two snippets: --BEGIN strange.
Dear list, I installed the binary Axiom+Aldor package from http://wiki.axiom-developer.org/Mirrors?go=/public/axiom-aldor-20060621.tgz&it=Axiom+with+Aldor+binary according to the instructions on http
Hello what is wrong with the following code: -- extend List (R:Ring) : with { sumlist:(ll: %)->R; } == {add { sumlist ( ll: %) : R == { s: R :=0; for x:R in generator ll repeat s:= s+x; return s } }
I was going to write a fairly long flame as a reply. I'll just state that the aldor compiler is actually better structured than most 200K+ line pieces of code I've had to deal with. There are one or
[...] I believe there is place for both. Algebraic types without pattern matching is close to useless. Boot (src/boot) has a primitive support for algebraic types and pattern matching. Its "case expr
Gernot, Could you post the patches necessary to make this work? I have a thread of work similar to this and I'd like to see how you are doing your version. Tim
Excellent news! Many thanks. We really need something to "replace" the NAG library in the free Axiom. Just one important moment. GSL is GPL-licensed. So, Axiom wich can be linked with GSL (even dynam
Hi there, With great help from Gregory, I have started to implement a wrapper library to access GSL (GNU scientific library) functions from Aldor/Axiom. I use the Lisp approach with dynamic loading o
I said it is "my impression". By that I mean that the project appears or looks like it is closed to me. Of course I know about it from cross-postings to other lists like the aldor list and the Axiom
Well, in fact I need more than that, namely mutually dependent recursively defined types. I.e., I want to be able to say A: SomeCat; B: SomeCat; A == f(A,B) add; B == g(A,B) add; as currently possibl
What I showed is the code for the SPAD to Axiom interface. The SPAD interpreter likes "elt" and works with it. indeed, it is not for the interpreter. See the comment in interp/Makefile around it. Too
Aha! Thanks. So whenever I write a spad function "elt" internally it is translated to "apply" and thus the interpreter never sees "elt". Is that interpretation of the snippet correct? Or what is that
test(a:Fraction UnivariatePolynomial(x, F)):Fraction UnivariatePolynomial(x, F) == elt(a,1$Fraction(UnivariatePolynomial(x, F)))$UnivariatePolynomial(x, F) but Aldor continues to insist that there is