: DirectProduct(2,Fraction Polynomial Integer)
(9) -
Why is this 2nd result for (8) not of the same form as the first
result for (8)? The only difference is
R:=Polynomial Integer
instead of
R:=Integer
Regards,
Bill Page.
On Fri, Jun 11, 2010 at 9:05 AM, Bill Page bill.p
Ralf,
What does the following have to do with Monoid?
On Thu, Jun 10, 2010 at 1:06 PM, Ralf Hemmecke r...@hemmecke.de wrote:
On 06/10/2010 06:33 PM, Bill Page wrote:
Ralf,
I think that the map
coerce : Fraction Polynomial Complex Integer - %
which is apparently x+- [x,x]
in
)sh
Module(R).
If it did, then I think the question of coercion would be moot.
Regards,
Bill Page.
On Thu, Jun 10, 2010 at 2:05 PM, Ralf Hemmecke r...@hemmecke.de wrote:
On 06/10/2010 07:17 PM, Bill Page wrote:
Ralf,
What does the following have to do with Monoid?
On Thu, Jun 10, 2010 at 1:06
: CROSS(A,B,C) - CROSS(D,E)
There could be a similar short notation for UNION perhaps using [A, B,
C] where again A, B, and C are Types and there is no danger of
confusion with a list,
Regards,
Bill Page.
--
You received this message because you are subscribed to the Google Groups
FriCAS
On Mon, Mar 22, 2010 at 4:21 PM, Waldek Hebisch wrote:
...
Note: this is about reomoving support for building gcl
inside FriCAS build tree. Building FriCAS using already
installed gcl giving --with-lisp option should work as
before.
Anybody opposed this idea?
+1 Good idea!
--
You
Rather than lying or expecting the system prove that x^2+1 is
irreducible in R I think the usual approach in Axiom would be to
introduce a declaration in the algebra library to this effect, i.e.
introduce a new category such as Irreducible(x^2+1,R).
On Fri, Mar 19, 2010 at 3:31 AM, Ralf
this sort of thing
at the moment?
I do not think there are any fundamental restrictions.
Regards,
Bill Page.
--
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 fricas-de...@googlegroups.com
if R has additiveValuation then additiveValuation
if R has Field then-- this is a lie; we must know that
Field-- x^2+1 is irreducible in R
...
Regards,
Bill Page.
--
You received this message because you are subscribed to the Google Groups
FriCAS
Type: DoubleFloat
(7) - )version
Value = Saturday November 28, 2009 at 18:17:42
Regards,
Bill Page.
On Fri, Mar 5, 2010 at 9:22 AM, Ralf Hemmecke r...@hemmecke.de wrote:
This one deserves its own thread.
Another problem is that I am somehow
unable to define a function like this:
foo
if u occurs
somewhere deeper in the body of the conditions it might help
u case A =
...
(u::A).x
...
( At least for those people who remain indentation challenged. :-)
Regards,
Bill Page.
On Fri, Feb 26, 2010 at 5:19 AM, Ralf Hemmecke r...@hemmecke.de wrote
specific change might have corrected the problem.
http://axiom-wiki.newsynthesis.org/305
Thanks.
Regards,
Bill Page.
On Sun, Feb 21, 2010 at 6:23 PM, Waldek Hebisch
hebi...@math.uni.wroc.pl wrote:
Bill,
Did you wrote Issue 305 and SandBox Lorentz Transformations?
Examples in the sandbox use
I use
\def\zag#1#2{
{{\hfill \left. {#1} \right|}
\over
{\left| {#2} \right. \hfill}
}
}
on the axiom-wik.newsynthesis.org
I think I got that from either axiom.sty or perhaps some code embedded
in the Axiom book.
Regards,
Bill Page.
On Fri, Jan 15, 2010 at 11:32 AM, leh
On Sat, Dec 5, 2009 at 8:12 AM, Waldek Hebisch wrote:
Bill Page wrote:
Martin Rubey wrote:
I would also like to see the rudimentary test file I sent to go with
this patch. ?One remark: as you probably know, I'm strongly in favour of
having InputForm keep all type information. ?I tried
contributed anything to the acceptance of Axiom in the potential
user/developer community.
Needless to repeat I suppose that this is of course only my personal
opinion. :-)
Regards,
Bill Page.
--
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra
issues with the change of order in 'plus(f,
g)' below?
Question 3: Do you think the order defined on FreeGroup is a good one?
Regards,
Bill Page.
wsp...@debian:~/fricas-sources$ svn status
? src/share/spadhelp
--- Changelist 'free':
M src/algebra/boo-cat.input
M src/algebra
domain had a constructor function I think there would be no
negative impact - perhaps in some special cases even an improvement.
No?
Regards,
Bill Page.
--
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra system group.
To post to this group, send
fits what you want to do with SMP.
Regards,
Bill Page.
--
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 fricas-de...@googlegroups.com.
To unsubscribe from this group, send email to
fricas
this (keeping in mind
that I am a beginner with FriCAS)
I think you bring up a good point that this should be made easier to do.
Regards,
Bill Page
--
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra system group.
To post to this group, send
be included
and which should not.
Regards,
Bill Page.
--
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 fricas-de...@googlegroups.com.
To unsubscribe from this group, send email to
fricas
is a questionable trade-off.
Regards,
Bill Page.
--
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 fricas-de...@googlegroups.com.
To unsubscribe from this group, send email to
fricas-devel+unsubscr
of useful system commands.
Issue )quit to leave FriCAS and return to shell.
-
(1) -
---
Regards,
Bill Page.
On Tue, Nov 10, 2009 at 7:56 AM, Waldek Hebisch
hebi...@math.uni.wroc.pl wrote:
Martin Baker wrote:
Waldek
during testing and are busy solving them or you are occupied with
something else...
On Wed, Oct 28, 2009 at 5:05 PM, Bill Page wrote:
About Comparable: Yes, it was important for some things I was working
on at the time and I did commit at least part of these changes. But
they were also
the binary is not compatible with
your system. I almost always build all flavors for Axiom from current
source. Would this be difficult for you?
Regards,
Bill Page.
On Mon, Nov 9, 2009 at 1:43 PM, Martin Baker gad9...@martinb.com wrote:
Hi,
I am attempting to install and run fricas-1.0.8
am not sure that this very useful. One feature that I think we want
for a hash code is that identical *values* should always hash to the
the same code. The address is not of much importance. Or did I
misunderstand your proposal?
Regards,
Bill Page
On Mon, Nov 9, 2009 at 4:33 PM, Gabriel Dos Reis wrote:
Bill Page writes:
[...]
| Of course with the definition above this is not possible. *If* FriCAS
| did provide a good hash value for things of type Record (it currently
| does not), then what you suggest would be possible
saw your reply to Martin.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe
Message:
---
* interp/buildom.boot: Tidy.
---
When ever you think the version of OpenAxiom installed on axiom-wiki
should be updated, please let me know and I will do so as soon as I am
able.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received
On Mon, Nov 9, 2009 at 10:54 PM, Waldek Hebisch wrote:
Bill Page wrote:
As you see above, there is not explicit pointer to an algebra object.
Rep := Record(value: S)
is simply a container for things of type S.
ref v == [v]
returns this container as an object
should use :: InputForm .
If this is a systematic failure someone should look at the code rather
than generating a lot of test cases.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS
On Sat, Nov 7, 2009 at 1:24 PM, Martin Rubey wrote:
Bill Page writes:
On Sat, Nov 7, 2009 at 4:26 AM, Martin Rubey wrote:
Afterthought:
maybe generate a list of all domains D with Finite, and write a
unparse(random()$D::INFORM)
to a file, and generate a testsuite starting
and merge versus Morton statistically would probably
be difficult for most practical applications.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra system group.
To post
lehmerCodeToPermutation(lst:L I):% ==
perm: % := (vector lst)
perm
per vector lst
---
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra
frequently - I have simultaneous
changes in my source tree for different reasons but I sometimes want
to commit just some of these changes as a related group.
Finding out about svn changelists has delayed my decision to resort to
a more intelligent local source repository manager.
Regards,
Bill Page
Bill Page wrote:
Well as Waldek pointed out: The whole point of hashing is performance.
Having all hashing implemented in Spad might be nice conceptually but
it is quite possible that it might be difficult to obtain sufficiently
high performance to justify the effort - at least not without
is rather trivial. I think just listing such
references should be adequate.
For the record here are a few references to Morton codes:
http://www.codexon.com/posts/morton-codes
http://en.wikipedia.org/wiki/Z-order_%28curve%29
http://www.cs.umd.edu/~hjs/pubs/bulkload.pdf
Regards,
Bill Page
Bill Page wrote:
Does any of this give you a better clue what is happening?
On Sun, Nov 1, 2009 at 11:33 PM, Waldek Hebisch wrote:
Not much. One thing is if '/tmp/jazz1' was correctly created.
Second, if '/tmp/jazz1' is owned by user trying to build FriCAS, etc.
Output from strace
Waldek,
Thank you for your comments on hash tables.
Bill Page wrote:
So I think it would be a good idea to
make the 'hashable' function in 'spad.lisp':
(defun |knownEqualPred| (dom)
(let ((fun (|compiledLookup| '= '((|Boolean|) \$ \$) dom)))
(if fun (get (bpiname (car fun
Bill Page wrote:
(1) - writing: ifile:File List Integer:=open(/tmp/jazz1,output)
writing: write!(ifile, [-1,2,3])
writing: write!(ifile, [10,-10,0,111])
writing: write!(ifile, [7])
writing: reopen!(ifile, input)
writing: read! ifile
writing: read! ifile
Franz,
On Sat, Oct 31, 2009 at 4:24 AM, you wrote:
On Fri, Oct 30, 2009 at 11:51:03PM -0400, Bill Page wrote:
like to try to encourage you to commit the tensor code first in its
current state without resolving this design decision.
This was my intention, but I wouldn't commit if the build
On Sat, Oct 31, 2009 at 12:53 PM, leh...@bayou.uni-linz.ac.at wrote:
On Sat, Oct 31, 2009 at 10:30:31AM -0400, Bill Page wrote:
Do you think we can define exactly what it should mean?
I don't understand this question.
What does the following recursive definition mean?
Coalgebra(R
with the
same prefix. By adding original category ... awk no longer sees
these chunks.
With this change the build proceeds to completion and I am now
enjoying the new Tensor domain in FriCAS. Thank you!
Regards,
Bill Page.
On Sat, Oct 31, 2009 at 7:25 PM, ceram...@users.sourceforge.net wrote
would like to comment on this but it is going to take me some more
time to consider the alternatives.
In the mean time I still would encourage you to commit first and ask
questions later. :-)
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message
.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe from this group, send email
://axiom-wiki.newsynthesis.org/book--main--1/Bookvol4
(recently updated from the Axiom git repository)
Regards,
Bill Page.
On Thu, Oct 29, 2009 at 4:01 PM, Ralf Hemmecke wrote:
Tim Daly allowed me to post this message to the mailing list... so... if
somebody is interested to dig deeper
Yes, strange. Which Lisp? Which version?
On Wed, Oct 28, 2009 at 11:14 AM, Martin Rubey wrote:
Bill Page writes:
On Wed, Oct 28, 2009 at 4:01 AM, Martin Rubey wrote:
Bill Page writes:
Do you mean that 'unparse(%)' works for you? What version of FriCAS
and lisp are you using?
fricas
. Waldek, do you recall?
Maybe newer versions of sbcl are better at trapping errors?
On Wed, Oct 28, 2009 at 11:37 AM, Martin Rubey wrote:
Bill Page writes:
Yes, strange. Which Lisp? Which version?
sbcl, I think 1,0.11 debian.
--~--~-~--~~~---~--~~
You
by a somewhat different construction.
...
Regards,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
On Wed, Oct 28, 2009 at 1:54 PM, Bertfried Fauser wrote:
Bill Page wrote:
No, this is a fairly common confusion about 'Polynomial' and related
domains like 'Expression'. The parameter 'Integer' or 'Fraction
Integer' refers only and specifically to the domain of the
coefficients
On Wed, Oct 28, 2009 at 2:17 PM, Martin Rubey wrote:
Bill Page writes:
On Wed, Oct 28, 2009 at 12:54 PM, Bertfried Fauser wrote:
isn't it rather Polynomial Fraction Integer then?
I am actually not sure what kind of difference there is between
FPI == Fraction Polynomial(Integer
recursiveDefine(fib,(n:I):I+-if n2 then 1 else fib(n-1) + fib(n-2))
is enough.
I mean, can you use the output of recursiveDefine directly in a map, e.g.
map(fib,[10,20,30,40])
If you could, how would that compare to?
map(function fib,[10,20,30,40])
Regards,
Bill Page
,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe from this group, send email
== x.fun
the operation
map(function fib,[10,20,30,40])
is not cached. But it's not such a big deal. One can always write:
map(x+-fib(x),[10,20,30,40])
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
to a machine here and
set up a git ?
As I understand it, git like darcs does not require anything other
than a common web server to be able to distribute a public repository.
All of the rest of the work is done by the programs installed on your
local workstation/laptop. No?
Regards,
Bill Page
not use a tool that is more complicated than necessary for the task.
Like svn, git seems too complicated to me. But I am sure it could do
the job and it is fully distributed too.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you
wrap it up as the original two argument
function like this:
MurNak(x,y) == MurNakCached2 [x,y]
It's easier than this sounds.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS - computer
!
Bill Page wrote:
I guess it's no excuse for a break condition but I presume you
intended to write:
(11) - unparse((2*product(factorial i, i=0..n))::INFORM)
(11) 2*%defprod(factorial(%A),%A,i,0,n)
Type: String
Another
with FriCAS.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe from this group, send
x is [=, arg1, arg2] or x is ['=, arg1, arg2] =
concat(sumOrParen(arg1), '=, sumOrParen(arg2))
-sumOrParen(x)
sumOrParen(x)
sumOrParen(x) ==
---
Perhaps there is another bug lurking there?
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You
treat it as a real
function to the rest of FriCAS instead of having to depend on 'apply'.
I think there are some instances where 'apply' does not apply such as
when passing a function to 'map'.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message
(Expression(Integer))
I have not tried to look at the TEX output yet.
Regards,
Bill Page.
On Mon, Oct 26, 2009 at 2:35 AM, Martin Rubey wrote:
since you are an expert of i-output now, could you have a look at
http://axiom-wiki.newsynthesis.org/8SavannahBug9297OutputMissesSomeParenthesis
I admit
Martin,
On Mon, Oct 26, 2009 at 5:32 PM, you wrote:
Bill Page writes:
Please try the attached patch and let me know if it produces the
results you expect.
well, nearly. First of all, please don't change = to = in the
same patch, because it makes comparing the testsuite more difficult
\ j
\right)}}
\leqno(3)
$$
Type: Expression(Integer)
Regards,
Bill Page
On Mon, Oct 26, 2009 at 10:28 PM, Bill Page bill.p...@newsynthesis.org wrote:
Martin,
On Mon, Oct 26, 2009 at 5:32 PM, you wrote:
Bill Page writes:
Please try
actual example code and the specific error
message generated?
Regards,
Bill Page.
On Sun, Oct 25, 2009 at 7:44 AM, Bertfried Fauser wrote:
Hi,
I have a question about the constructon of for loops. I noticed the following
(odd?) behaviour in spad code:
dumy: Partition := partition
ahead and do so. partitions is not much used, so there is no
danger of breakage.
I agree that it would be good to re-think these domains.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS
Waldek,
Do you agree that it is desirable to extend FriCAS to permit streams
in for-loops?
Regards,
Bill Page.
On Sun, Oct 25, 2009 at 5:20 PM, Waldek Hebisch
hebi...@math.uni.wroc.pl wrote:
FriCAS can iterate over streams:
(4) - ss0 := [i for i in 0..]
(4) [0,1,2,3,4,5,6,7,8,9
Axiom has the annoying (to me) behavior of
showing equality like this:
a= b
(i.e. with no space preceding the equal sign but one space after) and
changed that to be consistent with the treatment of '+' with spaces on
both sides.
Regards,
Bill Page.
On Sun, Oct 25, 2009 at 6:08 PM, Franz Lehner
Martin,
Seems to work for me on Windows 7 with new Cygwin install. I've
uploaded it here:
http://axiom-wiki.newsynthesis.org/FriCASonCygwin
I think more people should try it.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you
Franz,
On Fri, Oct 23, 2009 at 12:10:51AM -0400, Bill Page wrote:
I am sorry that this took me a little longer than I had hoped. As
usual some other activities interfered with my time available for
FriCAS programming... :-(
On Fri, Oct 23, 2009 at 5:28 AM, you wrote:
thank you very much
.
I just hope that there is enough space to add fricas to this VM.
If the Sage people don't do this then we certainly could distribute a
version of it that does include FriCAS. If you would like to work on
this Ralf, I would be glad to help.
Regards,
Bill Page
how much you know about
Sage and I don't think our time would be well spent unless we could
agree first on those areas where we both feel qualified to comment.
Regards,
Bill Page.
On Fri, Oct 23, 2009 at 1:31 PM, Martin Rubey
martin.ru...@math.uni-hannover.de wrote:
Bill Page bill.p
,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe from this group, send email
between FriCAS and OpenAxiom. Could you explain a little
more your intention here?
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra system group.
To post to this group, send
miss with svn. The darcs project is still alive and
evolving a little but it only seems to favored by people with a
natural interest in exotic languages like Haskell and Lisp ... ;-)
Regards,
Bill Page.
On Wed, Oct 21, 2009 at 11:41 AM, Ralf Hemmecke r...@hemmecke.de wrote:
On 10/21/2009 05:23 PM
Ralf,
It looks very likely to me that this is all related to
AXL_EDIT_1_1_13_18 in 'aldor/src/gf_add.c' but I have to admit that
this twist in the hash algorithm still seems rather opaque to me.
Regards,
Bill Page.
On Tue, Oct 20, 2009 at 2:00 AM, Ralf Hemmecke r...@hemmecke.de wrote:
What I
Waldek,
On Mon, Oct 19, 2009 at 6:51 AM, you wrote:
Bill Page wrote:
wsp...@debian:~$ echo ')lisp (setf *print-circle* t)
atan(tan(3))
)tr EF_;iatan
atan(tan(3))
)quit' | fricas -nosman | tail
#822#)))
(|%eval| #829# . #(#1856# #822#)) (|rtrig
Thanks, Tim.
That seems to work very well. It completely prevents the infinite loop
and allows some measure of control over the detail.
Does anyone see any disadvantage to making (setq *print-level* 1) the default?
Regards,
Bill Page.
On Mon, Oct 19, 2009 at 9:51 AM, Tim Daly d...@axiom
1.0.30, an implementation of ANSI Common Lisp.
...
This was run under 32 bit Debian 5.0.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra system group.
To post to this group
in this architecture. If this was not due to Aldor
one would expect the patch to cause the interface to fail when used on
a 32 bit machine. No?
Can you see anything else happening here?
Regards,
Bill Page.
On Mon, Oct 19, 2009 at 4:28 PM, Ralf Hemmecke r...@hemmecke.de wrote:
Waldek, can you explain, why you
the patch, only: Against
aldor-1.1 you'll need a small patch to the way axiom computes hash
codes.
-- Forwarded message --
From: Peter Broadbery p_broadb...@hotmail.com
Date: Fri, Nov 9, 2007 at 4:45 PM
Subject: RE: Building the Aldor interface on FriCAS or OpenAxiom
To: Bill Page bill.p
On Sun, Oct 18, 2009 at 9:04 PM, Waldek Hebisch
hebi...@math.uni.wroc.pl wrote:
Bill Page wrote:
I think think it is bad to have a default that can cause an infinite
loop in an FriCAS command even if it is a system level command like
')trace'. So if setting this flag prevents such loops, I
for it's licensing seem to be devoted mostly to destroying
any future this language might have. :-(
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
FriCAS - computer algebra system group.
To post
in
FriCAS seem to be working fine. But thank you for reminding me about
the hashcode.spad patch. That may very well be the problem.
I think we should commit this patch to FriCAS and just make the new
version of Aldor a requirement.
Regards,
Bill Page.
On Thu, Oct 15, 2009 at 3:36 AM, Waldek
will probably
forget it again. ;-)
Regards,
Bill Page.
On Thu, Oct 15, 2009 at 4:25 AM, Waldek Hebisch
hebi...@math.uni.wroc.pl wrote:
Ralf Hemmecke wrote:
This is _not_ the most recent source. New makefiles for Aldor
interface are revision 677 and current revision is 684.
For just compiling fricas
reverse_! (r::%)
+-- Inserted by Bill Page, based on 'divide' from 'FreeMonoid'
+(lar:% div a:%) ==
+(a = 1) = [lar, 1]
+Na : Integer := #(la := listOfMonoms(a)$Rep)
+Nlar : Integer := #(llar := listOfMonoms(lar)$Rep)
+l:List(REC
. The only old version I know for 64 bits
systems is the one here:
http://axiom-wiki.newsynthesis.org/Aldor
that I built and distributed in binary before Aldor was officially
available as open source. But I have never tried it with the Aldor
interface.
Regards,
Bill Page.
On Thu, Oct 15, 2009 at 5
with the examples?
Regards,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe from
with code 1050701442
System error:
The function FOAM-USER::|fiRaiseException| is undefined.
(1) -
Any ideas what might be wrong? Are you able to reproduce this problem?
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you
to FreeModuleCategory.
Can you do this?
Ok, done. It took me two commits to get it right. The 2nd commit
reverted some changes I did not intend to make (yet). Below is the end
result.
Regards,
Bill Page.
wsp...@debian:~/fricas-sources$ svn diff -r 677:head
Index: src/algebra/op.spad.pamphlet
Waldek,
On Fri, Oct 9, 2009 at 8:55 PM, you wrote:
Bill Page wrote:
... so I modified 'FreeModuleCategory' as follows:
snip
to provide a default 'smaller?' operation inherited by the XPOLY domains.
That looks like good change.
Testing revealed the 'constandOperator' problem
On Mon, Oct 5, 2009 at 2:03 PM, Waldek Hebisch wrote:
Bill Page wrote:
...
Although it is currently a stand alone domain, 'Void' could be easily
made to satisfy 'SetCategory' by providing a simple '=' operation.
Since by definition 'Void' has only a single canonical value we can
simply
On Sun, Oct 4, 2009 at 10:42 PM, Waldek Hebisch wrote:
...
Bill Page wrote:
(4) 1
Type: BadCode(Integer)
--
Notice the result in (4) above. I expected to see the output more.
snip
Can you reproduce this? Can anyone see why
On Sun, Oct 4, 2009 at 10:53 PM, Bill Page wrote:
...
I guess I may have done more damage than I thought! I'll
revert changes and take another more careful look.
Sorry. I confirm that it's my fault. (Don't know exactly what yet.)
Both problems disappear when I revert and rebuild.
Thanks
Ralf,
It looks like maybe you were doing a parallel build because of the
order of the output near the end of the log. I have sometimes had
problems. Maybe you could try it without this option?
Regards,
Bill Page.
On Tue, Sep 29, 2009 at 4:47 PM, Ralf Hemmecke r...@hemmecke.de wrote:
Hello
Ralf,
Do you recall the following email concerning the ecl upgrage?
sage -i -s http://sage.math.washington.edu/home/ghitza/ecl-9.8.4.spkg
Regards,
Bill Page.
-- Forwarded message --
From: Bill Page bill.p...@newsynthesis.org
Date: Thu, Sep 3, 2009 at 6:01 PM
Subject: Re: [sage
get libaxiom.al
from there and can (without much build time) complete the necessary
compilation of just the runtime files locally.
Excellent.
Ralf
PS: Just give me a few more days to finish the infrastructure stuff.
+1 :-)
Thanks Ralf!
Regards,
Bill Page
if sorted?(alpha,beta) then ...
This seems easy to read for me. Or if you want a more specific name maybe
if machineSorted?(alpha,beta) then ...
Ideas? Opinions?
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed
On Wed, Sep 16, 2009 at 2:41 PM, Gabriel Dos Reis wrote:
Bill Page writes:
[...]
| The problem is that FriCAS and OpenAxiom have choosen different
| names for the machine ordering. In FriCAS it is called smaller?.
| smaller?(alpha,beta) evaluates to true if the value of alpha comes
to use it.
Regards,
Bill Page.
--~--~-~--~~~---~--~~
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 fricas-devel@googlegroups.com
To unsubscribe from this group
On Wed, Sep 16, 2009 at 4:21 PM, Gabriel Dos Reis wrote:
Bill Page writes:
| I think it is good to cite an existing standard but I am not so sure
| how relevant it is in this context. Perhaps C++ is a little obscure
| for the average mathematically-oriented developer ... but no matter
and OpenAxiom (and
original Axiom)? Do we need to implement some kind of compatibility
layer such as a 'Comparable' category for OpenAxiom and a 'before?'
operator in FriCAS?
Regards,
Bill Page.
--~--~-~--~~~---~--~~
You received this message because you are subscribed
801 - 900 of 1077 matches
Mail list logo
