I am sorry, but changing variable names inside source code because of
a project fork seems incorrect to me. I think it would be both wrong
and even more confusing if FriCAS and OpenAxiom tried to give the
impression that they had no relation to each other and no relation at
all to the original Axi
On 22 April 2013 13:42, u1204 wrote:
>> Already understood and I had already mirrored my comments
>> to the FriCAS-devel list; just forgot to include OpenAxiom.
>>
>> The issue is deeper though: An inspection of only the src/interp
>> source files reveals numerous references to 'axiom' or 'Axiom'.
ntion of the "Axiom Foundation" from the AxiomWiki.
Bill Page.
On 22 April 2013 09:21, Eugene Surowitz wrote:
> Personally, I would very much prefer a single wiki.
>
> I believe that users would have great difficulty in distinguishing
> the various forks in a systematic way; they
le further.
Regards,
Bill Page.
On 21 April 2013 18:54, Tim Daly wrote:
> Bill,
>
> You posted a note to the FriCAS mailing list about Frobenius algebras,
> pointing to a web page on the "Axiom Wiki".
>
> Today I received an Axiom bug report...
>"the enumerate()
/SandBoxSedenionAlgebraIsFrobeniusInJustOneWay
Bill Page.
On 20 April 2013 11:11, Serge D. Mechveliani wrote:
> To my request
> Prof. Dr. Johannes Grabmeier wrote on Apr 20, 2013:
>
> > AXIOM/FriCAS has a whole bunch of very general algebras
> > (not -necessarily associative) (impl
Waldek,
Running Axiom on the AxiomWiki VM requires that
# echo 0 >/proc/sys/kernel/randomize_va_space
See: http://www.axiom-developer.org/axiom-website/download.html
Do you have any objection to running the VM with this option disabled?
Bill Page.
--
You received this message because
compiler? Is there a
reasonably simple way to do that, say like compiling from gcc sources,
without messing up the current dependencies?
Bill Page.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from
d latex macros and uses
several legacy constructs that are supported. MathJax would be a
better option if some time was first spent on cleaning up the tex
output from FriCAS.
On the other hand we already have MathML support in FriCAS and it
would be very nice to expose that on the wiki as an alt
On 26 March 2013 12:49, Waldek Hebisch wrote:
>
> I have set a similar rule, so 'mathaction' can be dropped from
> wiki URL-s.
>
That's excellent. Thanks again.
Bill.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsu
On 25 March 2013 16:35, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> BTW, do you intend to support email notification from the wiki server?
>
> Well, if you want notifications I can look into this. Currently
> the host is has no mail software but I can install it
e attempts at things like
link spam and/or link redirection but it is easy to monitor page
changes via email notices and to revert pages quickly.
BTW, do you intend to support email notification from the wiki server?
Regards,
Bill Page.
--
You received this message because you are subscr
natively on the host. It is easier and one has
additional motivations for wanting to protect the host itself. In
comparison the security of the VM seems mostly trivial to me. But
perhaps I do not understand exactly what you mean by getting root
inside VM. If the VM has no exposed ports it is di
On 25 March 2013 12:43, Waldek Hebisch wrote:
> Bill Page wrote:
>> ...
>> Do you think I should correct these links to the new URL format where
>> I am able or are you planning to change the webserver configuration
>> to get rid of mathaction in the name?
>
>
name?
Regards,
Bill Page.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to fricas-devel+unsubscr...@googlegroups.com.
To post to
b.
One thing that might make sense and reduce the size of the wiki VM
itself would be to off-load the handling of the LaTeX to image
conversion to a separate VM host using a system such as
http://www.forkosh.com/mimetex.html
Regards,
Bill Page.
--
You received this message because you are subscribe
idea to base a new "Axiom Wiki" on
the Media Wiki software that is used by Wikipedia. It certain is
active and mature enough now while at the mean time ZWiki as a live
project has all but disappeared and Zope and Plone have moved on to
much newer, revised, and mostly incompatible ver
hat is a technical detail. In the VM that we got from Bill, mathaction
> runs on top of zwiki and zwiki inside plone.
Yes.
> It's only a question of
> knowing how to program new page types in plone that would make running
> fricas inside vanilla plone possible. The problem is that
to assume
"ownership" for some part ot the content by offering them more control
over who to see their work. Plone has a more structured "publishing"
type of workflow in contrast to the free wheeling style of the wiki.
Bill Page.
--
You received this message because you are
ias in updated pages.
>
It would be great to see some of this kind of wiki "gardening". I
think that who ever does this needs to be both dedicated and brutal!
I am willing to help if some takes the lead.
> To put this differently: I want the wiki to work well as FriCAS
>
I found the interesting stuff here: skpol.spad.pamphlet
But no documentation?
On Tue, Sep 18, 2012 at 12:21 PM, Bill Page wrote:
> Waldek,
>
> Thank you for this new release!
>
> Could you give a quick summary of the mutivariate Ore algebra domain
> and the non-commutativ
Waldek,
Thank you for this new release!
Could you give a quick summary of the mutivariate Ore algebra domain
and the non-commutative Groebner package?
Can I find some fairly self-explanatory example usage in the
distribution source?
Regards,
Bill Page.
On Tue, Sep 18, 2012 at 9:55 AM, Waldek
Thanks Waldek,
On Wed, Jul 25, 2012 at 1:00 PM, you wrote:
> Gabriel Dos Reis wrote:
>>
>> Bill Page writes:
>>
>> | Maybe it is a bit late to ask this question but why not just define a
>> | default hash function for FriCAS directly in terms of the hash
>
in SPAD.
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 to
fricas-deve
On Fri, Jul 20, 2012 at 5:23 AM, Ralf Hemmecke wrote:
> ...
> After having read the wikipedia page about open adressing and double
> hashing, I'm not sure anymore whether it's a good idea. A good hashing
> function on Strings, would have to digest the whole string. If I use a
> second (independent
I think what Waldek meant when he said avoid Record was something like this:
arrKey: PrimitiveArray Key,
arrEntry: PrimitiveArray Entry,
bucketsKey: PrimitiveArray List Key,
bucketsEntry: PrimitiveArray List Entry
That way the arrays point directly to the data rather t
urn something more useful?
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 ema
What advantage do you see in enforcing such a separate between
built-in and library constructors?
Bill Page.
On Tue, Jul 10, 2012 at 5:25 PM, Ralf Hemmecke wrote:
>> If you request strong separation between builtin stuff and library
>> then you effectively force a lot of thing to
able with entries that do not
>> support equality?
>
>
> Why not? I think we had this issue some time ago. To make it clear: we have
> Table(Key, Entry) and I am speaking about loosening the conditions for
> Entry, not for Key.
>
OK, thanks for the clarification
ry.
>
Does it make sense to have a HashTable with entries that do not
support equality?
> If you were positive for such a change, I'd go and investigate whether
> that indeed wouldn't harm other parts of FriCAS. Grepping for Table,
> actually seems to indicate that a change will
database, if
one were to design something new for FriCAS it might be a good idea to
take a look at these projects.
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
ation. If no )abbrev command involving F was previously
given than F would be both the full name of the constructor and its
abbreviation.
On Fri, Jun 22, 2012 at 12:59 PM, Gabriel Dos Reis wrote:
> Bill Page writes:
>
> | So a reasonable proposal might be to eliminate the restriction on
So a reasonable proposal might be to eliminate the restriction on the
length of the abbreviation and make the "abbreviation" default to the
full constructor name unless it was previously specified to be
something different.
--
You received this message because you are subscribed to the Google Gro
it
the limit of 7 characters was related to an ancient limitation in file
name length.
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@googlegrou
stuck and still want to proceed
with Aldor I would be willing to do one or the other.
Bill Page.
On Thu, Jun 21, 2012 at 11:49 AM, Serge D. Mechveliani wrote:
> On Wed, Jun 20, 2012 at 02:28:19AM -0700, Grigory Sarnitsky wrote:
>> So try the solution from https://bugzilla.redhat.com/sho
Waldek,
I strongly agree that it is premature to discount the future public
availability of Aldor sources. In the mean time it is certainly
possible for these sources to be distributed by request privately.
Regards,
Bill Page.
On Mon, Jun 18, 2012 at 1:48 PM, Waldek Hebisch
wrote:
>
> I
s would be close to impossible.
---
Personally I don't see the point of
> 2) Make the IPython notebook understand %%fricas as a cell magic and provide
> a server that enables people to run some code.
since the Sage notebook interface to FriCAS already exists. And in
any case it wo
Perhaps this not exactly what you wanted but, try hyperdoc click
Browse / *multivar* / Constructors
You'll see
...
MutlivariateTaylorSeriesCategory
SparseMuiltivariateTaylorSeries
Click on MultiVarieateSeriesCategory, click on Domains
You'll see
SparseMultivariateTaylorSeries
TaylorSeries
Cli
uch better reasons for
doing this.) you would probably be well advised to learn more linear
algebra.
Regards,
Bill Page.
On Fri, Jun 1, 2012 at 3:47 AM, Victor Eijkhout wrote:
> Can someone tell me if the following can be solved in FriCAS, and hence
> whether I should bother learning the sys
ybe, Tree).
> I wonder whether it is simpler in Aldor.
>
In the context of this group I find your comment rather annoying and I
wonder how you define "complex" in such a way that it allows an
objective comparison.
Regards,
Bill Page.
--
You received this message because you are
On Fri, Mar 30, 2012 at 9:51 AM, Serge D. Mechveliani wrote:
> Earlier, we wrote about adding instances to a library domain:
> ...
> Bill Page:
>> ...
>> In Axiom there is a way to introduce new operations related to Integer
>> without redefining what you mean by Intege
I think it is most similar to what is done for Sage. In this case
InputForm is essential.
Regards,
Bill Page.
On Tue, Mar 13, 2012 at 10:15 AM, Ralf Hemmecke wrote:
> Hi Martin,
>
> good to hear from you.
>
> What lately came to my mind was efricas. You must have been commu
e are some problems with openness and license.
Yes.
Whether this is important or not depends on you objective.
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 emai
Rep is not exported. Packages should avoid making assumptions about
internal representation if at all possible. Usually this means adding
additional exports that provide appropriate access.
On Sat, Mar 10, 2012 at 9:01 AM, Serge D. Mechveliani wrote:
> People,
>
> In the below Spad program, the d
Contrary. Product is much more complicated than Record.
Regards,
Bill Page.
On Thu, Mar 8, 2012 at 11:05 AM, Serge D. Mechveliani wrote:
...
> Product is simpler than Record
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra syste
mpty) -> Boolean
?case? : (%,node) -> Boolean coerce : % -> OutputForm
construct : empty -> %?.? : (%,empty) -> empty
?~=? : (%,%) -> Boolean
construct : Record(val: Integer,left: NIL,right: NIL) -> %
?.? : (%,node) -> Record(val: Integer,left: NIL,right: NIL)
One place to start is DeRhamComplex. Look for this domain by browsing
constructors in HyperDoc. Try the examples.
Regards,
Bill Page
On Wed, Feb 29, 2012 at 7:05 PM, Ianhoolihan wrote:
> Hi all,
>
> I'm just geeting started with FriCAS, and have decided to learn by
> working
would become something like this:
)abbrev package SIZED Sized
Sized(A:OrderedRing): with
size: A -> Integer
size: List A -> Integer
size: DirectProduct(2,A) -> Integer
== add
size(a:A):Integer == abs(a)
size(a:List A):Integer == reduce(+,map(size$SizedInt(A),a))
On Feb 21, 2012 12:33 PM, "Gabriel Dos Reis" wrote:
>
> Bill Page writes:
>
> | I think your comment is very appropriate. Since the semantics of
> | Record is well represented as a limit (and dually, Union is
> | represented as a co-limit), selecting a field is just
e and then uses if for some
computation?
Regards,
Bill Page.
On Tue, Feb 21, 2012 at 11:29 AM, Waldek Hebisch
wrote:
> Bill Page wrote:
>>
>> Waldek,
>>
>> What does "Normal types are dynamic" mean to you? E.g.
>>
>> http://en.wikipedia.org
idRing is not "instantiated" by the compiler?
Perhaps we also need to define what it means to be "instantiated".
Regards,
Bill Page.
On Fri, Feb 17, 2012 at 3:22 PM, Ralf Hemmecke wrote:
>> I am not really sure what you mean by "concrete return type". What
>>
tor is a type expression
consisting of a functor applied to specific arguments just like an
ordinary expression can be a function applied to some argument. E.g.
'sin' is a function, 'sin(x)' is an expression.
I am not really sure what you mean by "concrete return type".
Waldek,
What does "Normal types are dynamic" mean to you? E.g.
http://en.wikipedia.org/wiki/Type_system#Dynamic_typing
does not seem to me to be describing Spad.
Regards,
Bill Page.
On Thu, Feb 16, 2012 at 2:07 PM, Waldek Hebisch
wrote:
> Bill Page wrote:
>>
>> It
hope you
will continue to ask and also to point out the obvious. Perhaps FriCAS
will be improved and you will achieve your goal!
On Tue, Feb 14, 2012 at 12:30 PM, Serge D. Mechveliani wrote:
> On Tue, Feb 14, 2012 at 09:19:05AM -0500, Bill Page wrote:
>> Record does not need SetCategor
Type: Boolean
(4) ->
On Tue, Feb 14, 2012 at 9:19 AM, Bill Page wrote:
> Record does not need SetCategory. Could you give specific reference from
> docs?
>
> FriCAS has very poor support for List and Record that contain types
> as values. (This is better supp
I think your comment is very appropriate. Since the semantics of
Record is well represented as a limit (and dually, Union is
represented as a co-limit), selecting a field is just projection (or
injection in the case of Union). Axiom should respect this by have
Record (and Union) export these opera
Record does not need SetCategory. Could you give specific reference from docs?
FriCAS has very poor support for List and Record that contain types
as values. (This is better suppored in OpenAxiom so there is hope that
it can also be in FriCAS.)
You could try eliminating the 'dom' component of t
Perhaps
Record(pi1:Ring, pi2:Any)
?
What properties of Product do you need?
On Mon, Feb 13, 2012 at 1:23 PM, Serge D. Mechveliani wrote:
> People,
>
> It looks like Product(Ring, Any)
>
> is not possible, because `Product' needs SetCategory for each
> component. The same is with Record.
pplies to a lot of code in the
library.
Regards,
Bill Page.
On Wed, Feb 8, 2012 at 2:01 AM, Ralf Hemmecke wrote:
> On 02/07/2012 09:28 PM, Ralf Hemmecke wrote:
>>
>> It's not that I consider the above code invalid, I just don't like that
>> the return type of
Ralf,
Thanks for doing this and describing how to do it.
You might be interested in
https://www.usharesoft.com/partners/ubuntu-offer.html
I use quite extensively a similar online build service for SuSE Linux
called SUSEstudio
http://susestudio.com
At both sites it is possible to build and
On Thu, Jan 19, 2012 at 2:24 PM, Gabriel Dos Reis wrote:
> ...
> Bill Page writes:
> |
> | I think there are very good reasons to consider at least Record, Union
> | and Mapping as constructs that are essentially free of conventions -
> | at least from the point of view of the in
On Thu, Jan 19, 2012 at 5:00 PM, Ralf Hemmecke wrote:
> On 01/19/2012 10:04 PM, Bill Page wrote:
>
>> Can you give an example of a domain in the Axiom library that does not
>> use Rep?
>
> I wouldn't have know immediately, but Gaby just pointed to reducedSystem.
&
ategory == with
f:(R,%%) -> %%
when it is used in F. There is even a case where we may see %%% as an
intermediate form.
What I really want is a way to refer to the functor without
parameters. But Gaby has almost convinced me that this amounts to
solving a much harder problem than the one so
een H*-algebras in the category of sets and relations, and locally
cancellative regular semigroupoids. Finally, we study a universal
passage from the former setting to the latter.
--
This paper is about Frobenius algebras in the category of sets and
relations. It is the first time I have seen both
On Thu, Jan 19, 2012 at 1:09 PM, Waldek Hebisch wrote:
> ...
> Bill Page wrote:
>> When I see the prefix DoubleFloat and Float in the names of these
>> packages I think immediately that something must be wrong with this
>> design. DoubleFloat and Float are names of do
[Comment moved to this thread.]
On Thu, Jan 19, 2012 at 12:59 PM, Gabriel Dos Reis wrote:
> Ralf Hemmecke writes:
>
> | On 01/19/2012 06:17 PM, Bill Page wrote:
> | > Ok, so Aldor builds these into the language too. Why not Rep?
> |
> | Because that is just a convention a
OK, new thread. This is an important subject but nothing to do with
graph theory.
On Thu, Jan 19, 2012 at 12:34 PM, Bill Page wrote:
> One could easily argue that the difference between Cross and Record is
> "just a convention" too but Aldor implements both, SPAD only Record.
>
e would be more awkward. Consider Sage for example.
But I shall desist from further comment here since this is clearly off topic.
On Thu, Jan 19, 2012 at 12:24 PM, Ralf Hemmecke wrote:
> On 01/19/2012 06:17 PM, Bill Page wrote:
>>
>> Ok, so Aldor builds these into the language too.
ually from Rep:= (without per
and rep) to Rep == (inserting calls to per and rep where necessary).
On Thu, Jan 19, 2012 at 11:56 AM, Ralf Hemmecke wrote:
> On 01/19/2012 04:34 PM, Bill Page wrote:
>>
>> do not see anything wrong with the fact that SPAD builds in the notion
>>
ngs. By right way I mean
something like an appeal to generality, something like category
theory.
Regards,
Bill Page.
On Thu, Jan 19, 2012 at 9:37 AM, Ralf Hemmecke wrote:
>> Ralf, Why would you suggest using a macro when a function definition
>> is sufficient? These functions do not int
Just like in Aldor compiling a .spad file
> should start with empty knowledge. Imports should be explicit.))
>
Ralf, Why would you suggest using a macro when a function definition
is sufficient? These functions do not introduce any overhead. Worse,
why suggest two different ways of doing th
On Wed, Jan 18, 2012 at 1:25 PM, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> I have a similar "lack of respect" for macro usage. SPAD should
>> consistently be a high level language. Macros belong (perhaps) at a
>> lower level in Boot and in Lisp.
Waldek,
Thanks for the clarification.
Maybe it is only Aldor that does this? When the Aldor interface is
built it takes care to identify cliques and compile them as a signle
source unit. Is that right Ralf?
Regards,
Bill Page.
On Wed, Jan 18, 2012 at 11:55 AM, Waldek Hebisch wrote:
> B
could try combining the clique of related modules
into one source file and compiling it in one step.
Regards,
Bill Page.
On Wed, Jan 18, 2012 at 10:07 AM, Martin Baker wrote:
> On Wednesday 18 Jan 2012 10:48:48 Martin Baker wrote:
>> Are you interested in an implementation of graph theory
Yes, yes, yes. Very cool.
On Wed, Jan 18, 2012 at 5:48 AM, Martin Baker wrote:
> Are you interested in an implementation of graph theory I have put
> here:
> https://github.com/martinbaker/fricas/blob/master/src/algebra/graph.spad.pamphlet
>
> If so there is a tutorial here:
> http://www.euclidea
ion is much more reflective of
> the intent and more elegant. Writing it as a macro only hides the
> original intent, it does not make it clearer.
>
I think these semantics are obviously more economical than thinking of
nullary functions as "delayed assignment".
Regards,
Bill Pa
appreciate later unless all programmer adhere to
some agreed on disciplined style. I think it is one of the features of
a language like SPAD that these sort of features are of lesser
importance than in some other languages and the Axiom library benefits
from that.
Regards,
Bill Page.
On Tue, Jan 17
Ralf,
Apparently you can avoid triggering this bug by writing:
Rep == X
(using == instead of :=).
Perhaps this avoids trigger the automatic coercions that normally make
rep and per unnecessary in Spad.
Regards,
Bill Page.
On Sun, Jan 15, 2012 at 4:05 PM, Ralf Hemmecke wrote:
>
> Al
sense to extend this scheme to all
non-negative Integer literals though I am currently at a loss as to
how to extend the naming scheme since Two(), Three(), etc. seem
increasingly arbitrary. Maybe symbols like '0, '1, '2, etc. would be
better. Need I mention again that an extension of
in FriCAS.
Regards,
Bill Page.
On Fri, Jan 13, 2012 at 3:50 PM, Ralf Hemmecke wrote:
> Hello Waldek,
>
> I realized that the compiler accepts domain implementations that
> obviously miss the implementation for certain signatures.
>
> Why does that make sense? Cannot the *
to modify some .spad files in certain places,
> but I'm willing to do this on a branch and see how far I can get.
> (Maybe I should first restart my testsuite stuff, though.)
>
Why are you so motivated to make this change?
> ...
Regards,
Bill Page.
--
You received this messag
ut my impression is that it must
be quite small.
> I'll look a bit into getting ecl working but otherwise wasting time with
> making something work that nobody is interested in is not my objective.
>
That seems correct to me.
Regards,
Bill Page.
--
You received this message becaus
On Mon, Jan 9, 2012 at 9:17 AM, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> On Sat, Jan 7, 2012 at 11:38 AM, Waldek Hebisch wrote:
>> > ...
>> > I am a bit disappointed that after rewrite you find FriCAS
>> > version so hard to understand. =A0Could you
Waldek,
I applied your patch to Ralf's git source and re-built FriCAS and the
Aldor interface with no problems. The interface appears to function
normally.
Regards,
Bill Page.
On Sat, Jan 7, 2012 at 12:04 PM, Waldek Hebisch wrote:
> Ralf, Bill,
>
> Could you test the attache
does. With the FriCAS version I find I am
still uncertain.
I am especially convinced that using accessor macros such as '
categoryPrincipals' makes is easier to read the code without having to
first memorize the basic Axiom data structures.
Regards,
Bill Page.
--
You received this m
On Fri, Jan 6, 2012 at 8:05 PM, Ralf Hemmecke wrote:
> Bill Page wrote:
>> I think it is unfortunate that as an operator that returns
>> Union(...,"failed") the name is irregular. Most such operators have
>> names like 'subtractIfCan' with 'IfCan'
On Fri, Jan 6, 2012 at 5:04 PM, Ralf Hemmecke wrote:
> ...
> [in Aldor]
>
>ll: List List I := [[1,2,3],[4,5,6],[7,8,9]];
>a := first ll.2;
>b := first (ll).2;
>c := first(ll).3;
> ...
> a = 4
> b = 2
> c = 3
>
> Looks like parens force precedence of prefix function application over
after escape
> in interpreter
>
Yes.
> BTW: This is just one part of differences. Eventually
> I would like to use the same compiler for interpeter and
> Spad (the only difference would be that interpeter should
> be more forgiving for type errors (by automatically
> inse
OpenAxiom
> still contains at least part of original craziness.
>
I am sure you are correct. Improvement has to be an iterative process.
I should add the usual encouragement that more sharing of
understanding and methods would be beneficial to both projects.
Regards,
Bill Page.
--
You rec
in OpenAxiom this same code is written as:
PrinAncb := categoryPrincipals CatEval(bname,$e)
If FriCAS does not soon adopt a similar approach I cannot imagine a good future.
But of course advocating is one thing, finding time, energy and help
to do it is another.
Regards,
Bill Page.
On Thu
Ralf,
On Thu, Jan 5, 2012 at 10:45 PM, you wrote:
> Bill Page wrote:
>> Re: Fixing lisp-ish boot. Your choice. Maybe we'll find time to do it
>> some day, eh?
>
> Well, I'm not against your patch, I just wanted to separate issues. After
> I've committed to t
Ralf,
Thanks for your work on this.
Re: Fixing lisp-ish boot. Your choice. Maybe we'll find time to do it
some day, eh?
I took a quick look for other suspicious cases of ). in the boot code.
I found this one:
+411 src/interp/category.boot
PrinAncb:= first(b).(4)
This is probably correct
Thanks Ralf and Waldek!
I can confirm that the precedence change in the BOOT language
identified by Waldek - when applied to all relevant cases of dot
following parenthesis, i.e. xxx).yyy in interop.boot - does in fact
solve the problem that I reported earlier.
I've attached a patch which also cl
#x27;t know how to do this on Open SuSE 11.4
Regards,
Bill Page.
On Sun, Jan 1, 2012 at 6:44 PM, Ralf Hemmecke wrote:
> ...
>> FriCAS (AXIOM fork) Computer Algebra System
>> Version: FriCAS 2011-12-12
>> Timestamp: Sa
:|codes-105| (200143 51482908)
:|names-106| ("ff type
LIST.
(1) ->
Regards,
Bill Page.
On Sat, Dec 31, 2011 at 1:58 PM, Ralf Hemmecke wrote:
> Success! Fixed FriCAS-Aldor-Interface again! Please test!
>
> ...
--
You received this message
495481649 51488814
200143 200145 200144 51482908)
:|names-106| ("<=%
(1) ->
--
The printing of this error message seems to be terminated early.
I am not sure yet why this result differs from an old version of
FriCAS and the Aldor interface.
e system. In this case the memory
usage is likely to be quite different (although not necessary better)
than when using Lisp.
I hope some of this information helps.
Regards,
Bill Page.
On Sun, Dec 18, 2011 at 7:29 AM, Udo Ott wrote:
> Hello,
>
> since some days I am using Axiom-U
UPUP, R)
>
> i.e. the first argument of FiniteDivisor is really #2.
>
Ah. Then if this actually worked properly before some recent change to
FriCAS I wonder if if might something to do with a change in the way
macros are processed?
Regards,
Bill Page.
--
You received this message beca
(|Apply| |UnivariatePolynomialCategory| (|PretendTo| |#1|
|Ring|)))
(|PretendTo| |#4|
(|Apply| |UnivariatePolynomialCategory|
(|PretendTo|
(|Apply| |Fraction| (|PretendTo| |#2| |IntegralDomain|))
|Ring|))))))
(1) ->
On Thu, Dec 15, 20
27;|FiniteDivisor| '|#1| '|#2| '|#3|
'|#4|)
Value = (|Apply| |FiniteDivisor| |#2| |#3| |#4| |#5|)
This is the result after changing 'ax.boot' as I suggested above and running
(1) -> )read /home/wspage/fricas-src/src//interp/ax.boot
Regards,
Bill Page.
On
On Fri, Dec 9, 2011 at 11:01 AM, Waldek Hebisch wrote:
> Bill Page wrote:
>
> Well, FriCAS is open source and you are supposed to look at
> anything. But in closed source setting documenting something
> is an implicit promise of support/handholding. Not documenting
> something
701 - 800 of 1443 matches
Mail list logo
