Ralf Hemmecke writes: (roughly)
(1) -> g := (x +-> ((y+-> y+x) 1))
(1) x +-> y +-> y + x(1)
Type: AnonymousFunction
(2) -> g 2
>> System error:
|*1;anonymousFunction;1;frame1;internal|: variable #:G3466 has no value
> g := (x +
Francois Maltey writes:
> Hello,
>
> I have installed an new ubuntu 9.04 and try to install easily an axiom.
> In my school we'll very slowly migrate from MS-Win to Linux-Ubuntu for
> mathematics computations.
>
> I only find THE axiom, but this version is this one, and I get an
> error !
Fri
Dear Gaby, dear all,
congratulations to your release!
I'm curious about a few features that you announced. Quoting from
http://www.open-axiom.org/1.2
> 2.1.1 Interpreter
[...]
> The interpreter now accepts instantiation of a domain or category
> constructor with a homogeneous variable leng
Dear Gaby, Waldek, Ralf,
Waldek Hebisch writes:
> 1) Yes. Currently operations from IntegerMod can not be inlined, so
>every operation from IntegerMod pays cost of function call. The
>reason is that p is parameter of the type so to perform operations
>you need the type. Spad compi
I just noticed that in the interpreter, has does not work on operations:
in FriCAS:
(1) -> Float has random: Float -> Float
>> System error:
newHasTest expects category from
OpenAxiom returns false always, it seems.
Should I report this to IssueTracker? Or is this a known bug?
Martin
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> What about putting
>
>toHere: (X: UPOLYC) -> X -> %
>
> into the category of UPOLYC and then
>
>toHere(X: UPOLYC)(x: X): % == coerce(x)$UPOLYCoerce(X, %)
>
> as default implementation?
just to make the analogy with CoercibleTo:
coercib
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > But I hesitate to write
> > UnivariatePolynomial(var, R) == with Join(CoercibleTo SUP R,
> > CoercibleTo Polynomial R,
> > CoercibleTo DMP([var], R),
> > CoercibleTo MPOLY([var], R) ...)
> > This doesn't look right.
>
> Doesn't seem to look right. But
Dear Ralf, Waldek,
Due to other, by far more pressing issues, I'd like to stop work on this thread
for now. I should have put in large letters at the beginning:
This is a theoretical question, no need for action right now.
> I think, I stop here and wait for very concrete use cases of yours.
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > UPOLYCoerce(A: UPOLYC, B: UPOLYC): with
> > coerce: A -> B
> > add
> > coerce a ==
> > resta := a
> > res: B := 0
> > while not zero? resta repeat
> > res := res + leadingCoeff
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > One can hardly say that these two domains differ only in the representation
> > of
> > their elements.
>
> Well, what about Dom1, Dom2, and DomS on
> http://axiom-wiki.newsynthesis.org/SandboxIsomorphic ?
Oh dear, it seems difficult to explain what
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > Now, I would like that for domains of the same category, say
> > UnivariatePolynomialCategory, that differ only in the representation of
> > their elements, say sparse or dense, we would have
>
> > A has CoercibleTo B and B has CoercibleTo A
>
> OK,
I'd like to report on a curious problem I have with SPAD/Aldor, which Python
does not seem to have.
In Axiom, we currently have the (mostly unused) Categories
CoercibleTo S, RetractableTo S and ConvertibleTo S that provide
coerce: % -> S, coerce: S -> % and retract: % -> S
respectively. One ca
Martin Rubey <[EMAIL PROTECTED]> writes:
> Dear Gaby, Waldek,
Below a little more debugging information, that may be helpful. (I deleted
inessential output)
For a reason I do not know, upDollar passes in the case of "::" coercion (note
that the definitions of co and co
Dear Gaby, Waldek,
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> I am slightly suprized that the file compiles and is doing someting
> sensible.
I was, too. Well, it doesn't quite work yet, but it would be very nice if it
did. Since it does not seem to be the case that Aldor is going to become
I did the following experiment.
In FriCAS, I get an error when I uncomment the line containing the Rep in
SPECIES. This does not happen in Open-Axiom. Otherwise, it compiles and I can
do
(1) -> S1 := 1$Species INT
(1) "CharacteristicSpecies(1)"
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> Martin Rubey wrote:
> >
> > Waldek,
> >
> > didn't you want to release? Is there something missing?
> >
>
> We will have release, I was just pretty busy last few days so there
> is a delay.
G
Alejandro Jakubi <[EMAIL PROTECTED]> writes:
> Fine. Now, how I recover the algebraic expressions, as produced by
> 'radicalSolve', associated with such labels like %A1, %A2 ?
perhaps
(63) -> mainDefiningPolynomial(first allRootsOf(numer fp)$RECLOS(FRAC INT))
4 3 3 2
(63) ?
Alejandro Jakubi <[EMAIL PROTECTED]> writes:
> Now, my next question is about selecting the two real roots out of the four
> produced by 'radicalSolve' here:
>
> f:=(x^3+x^2-4*x-4)/(2*x^2+7*x-4)
> fp:=differentiate(f,x)
> radicalSolve(fp,x)
>
> The problem is that
>
> allRootsOf(fp)$RealClosure(
"Bill Page" <[EMAIL PROTECTED]> writes:
> Hmmm... So what is the meaning of < in AN? Ok, I guess that it is just
> whatever is exported by Expression Integer. The fact that the positive
> roots appear < 0 while the negative roots appear > 0 must be just an
> accident of some strange lexical orderi
"Bill Page" <[EMAIL PROTECTED]> writes:
> As I understand it AlgebraicNumber is supposed to be able to properly
> order the roots.
No, that's RECLOS.
Unfortunately, there is no coercion from AN to RECLOS, and this would actually
be tricky, since sqrt(-3) is not allowed in RECLOS.
Martin
Martin Rubey <[EMAIL PROTECTED]> writes:
> Oh, I found it:
>
> )lisp (sb-ext::set-floating-point-modes :traps nil)
>
> this should go into
>
> (defun set-initial-parameters()
> (setf *read-default-float-format* 'double-float))
>
> shouldn't i
Martin Rubey <[EMAIL PROTECTED]> writes:
> I just checked ecl:
>
> g(x:DFLOAT):DFLOAT == 10^155
> draw(g, -1..1)
>
> fails, while 10^154 seems to work.
The failing routine is norm in CLIP, being called by iClipParametric. I find
the following behaviour:
gcl:
(2) -&g
Whoever Japp is, he's doing a great job!
Many thanks,
Martin
-
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand
"Gabriel Dos Reis" <[EMAIL PROTECTED]> writes:
> As I had indicated to Francois in private conversations over the last couple
> of weeks, I have a basic patch in an experimental local branch, but it causes
> regressions elsewhere. I have not had a chance to work it out mostly because
> of daytime
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> This is an old bug. IIRC in Issue Tracker we have a few reports
> that looks like this problem.
OK, I found "#274 Can't get a parameter in an anonymous function"
> In the past I looked at code handling closures and my impression was that the
> code w
Martin Rubey <[EMAIL PROTECTED]> writes:
> "Gabriel Dos Reis" <[EMAIL PROTECTED]> writes:
>
> > The original problem is completely orthogonal to this currification stuff,
> > can and should be fixed -- it it just an oversight in the codes.
>
> I
"Gabriel Dos Reis" <[EMAIL PROTECTED]> writes:
> The original problem is completely orthogonal to this currification stuff,
> can and should be fixed -- it it just an oversight in the codes.
It would be wonderful if you could fix that. I hope that my examples are
helpful...
Sorry for not cross
Dear all,
I now have managed to do a proper patch, no regressions.
If there is no complaint, I'll commit, although I must say that the code in
open-axiom looks much cleaner.
Since I do not understand what I'm doing here, help and comments would be
greatly appreciated. (The comments in the patch
Martin Rubey <[EMAIL PROTECTED]> writes:
> Dear Gaby, Waldek,
>
> I tried today to port from open-axiom the feature that allows an ordinary
> function to return a type, but failed. I.e.:
>
> -
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > bottomUp t ==
> >-- bottomUp takes an attributed tree, and returns the modeSet for it.
> >-- As a side-effect it also evaluates the tree.
> > @@ -258,6 +263,11 @@
> > argModeSetList:= [bottomUp x for x in argl]
> >
> > ms :
Dear Gaby, Waldek,
I tried today to port from open-axiom the feature that allows an ordinary
function to return a type, but failed. I.e.:
---
)abbrev package EXPORT ExportType
ExportType(x: Ring): with
baseRing: () -
Martin Rubey <[EMAIL PROTECTED]> writes:
> Maybe it would make sense to compare speed with the definition taken from
> URAGG. Well, no, I think it's best to fix this and move ahead. I add an
> issue on MathAction, so we can fix it.
Sorry: NO, we should compare with the
"Bill Page" <[EMAIL PROTECTED]> writes:
> On Mon, Sep 1, 2008 at 2:30 PM, Martin Rubey wrote:
> > ...
> > Yes, it's not caught under FriCAS/sbcl, too, where we also get an
> > infinite loop. The responsible part is in ILIST, where we have
>
"Bill Page" <[EMAIL PROTECTED]> writes:
> On Mon, Sep 1, 2008 at 12:44 PM, Alfredo Portes wrote:
> >
> > This looks like it is not working in OpenAxiom. It looks like I run into
> > an infinite loop.
> >
> > Thanks.
> >
> > On Mon, Sep 1, 2008 at 12:28 PM, Bill Page wrote:
> >
> >> (1) -> u:= [9,2
"Bill Page" <[EMAIL PROTECTED]> writes:
> On Fri, Aug 22, 2008 at 2:53 PM, Martin Rubey wrote:
> >
> > Dear all,
> >
> > I'm trying to debug one of the very last quirks of the aldor interface, to
> > get aldor-combinat completely functional
Dear all,
I'm trying to debug one of the very last quirks of the aldor interface, to get
aldor-combinat completely functional in axiom.
1) (hopefully) easy question:
what is the semantics of
foo is bar
in boot. In particular, from hashcode.boot:
type is ['QUOTE, val] => hashType(v
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> However, I hope that people with more interests in this style of programming
> will come up with a coherent, reasonably complete, proposal that I could
> study and hopefully influence my preference. I know of programming languages
> (and have written
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > The return type clearly says what the function returns, no dispute
> > there. How do you feel about
> >
> > f(a: Integer): (Integer, DoubleFloat) == {
> > b: Integer == 2;
> > b: DoubleFloat == 7.0;
> > (b, b);
> >
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> Dear Peter, dear "whoever knows about the following"
>
> In src_aldor3 you call $(MNT)/bin/AXIOMsys to generate the dependencies
> and the .ap files for the Axiom domains.
>
> Furthermore, I find ${OBJ}/bin/depsys in the Makefile stanza
>
> $(aldor_l
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
>
> | Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> |
> | > | Gaby, after some experiments, I could not find an example where "A add
> B", A
> | > |
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> | Gaby, after some experiments, I could not find an example where "A add B", A
> | and B sharing representation, exports an operation from A instead of from B,
> | when the signature is present in both.
>
> That is basically what my oiriginal example
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> | I think, A add B is (currently) only well defined when the value of Rep in A
> | and B is the same. (well, at least roughly the same.)
> |
> | I admit that I do not understand (yet) why
> |
> | > my `*' was not being picked if I test with R=Intege
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> | So, my question is: how would you interpret an operation that is inherited
> from
> | IndexedDirectProductAbelianGroup(R,S), when the representations are
> | incompatible as they are here?
>
> Of course when the data layout are not right, disaster
Dear Gaby,
"Gabriel Dos Reis" <[EMAIL PROTECTED]> writes:
> The problem I had is that I wanted to use a LeftFreeModule, but only a
> FreeModule is available. So I decided to cook one. That should be easy. In
> addition, the lack of facility to specify `coordinates' was really very
> annoying.
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
>
> [...]
>
> | By the way, how will this work in the interpreter? I.e., do you think it
> makes
> | sense to force a rewrite of the currently legal
> |
> | f x =
//www.risc.uni-linz.ac.at/about/conferences/summer2008/registration/
Please note that the fee (30 EUR) does not cover hotel, lunch, dinner, and
transportation to Hagenberg. You may reserve a hotel room in Hagenberg
through the registration page.
Organisers
--
Ralf Hemmecke an
"Bill Page" <[EMAIL PROTECTED]> writes:
> On Thu, May 15, 2008 at 4:24 AM, Martin Rubey wrote:
> > ...
> > In this spirit: if there are good reasons for loops and conditionals
> > introducing new scope, I'm all for it. In that case, I'd argue that
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> On 05/15/2008 11:27 AM, Martin Rubey wrote:
> > Thanks to Gaby, I was looking at the micro-semantics of the loop in the
> > following:
> >
> > lift?(p1:SUPP,p2:SUPP,uterm:UTerm,ldeg:List NNI,
> >
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> On 05/15/2008 11:27 AM, Martin Rubey wrote:
> > Thanks to Gaby, I was looking at the micro-semantics of the loop in the
> > following:
> >
> > lift?(p1:SUPP,p2:SUPP,uterm:UTerm,ldeg:List NNI,
> >
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> So, if you must, make a variable implicitly local to branches of "if" if
> it is not used outside the "if". Also that would make the above code
> legal. And I think that would be a better way to express the conceptual
> level. Of course, that can only
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> As you know Aldor has a difference between Variables and constants.
> The following code is OK in Aldor and prints T and 1.
>
> ---BEGIN aaa.as
> #include "aldor"
> #include "aldorio"
> foo1(): Integer -> Boolean == (x: Integer): Boolean +-> true;
> foo
Thanks to Gaby, I was looking at the micro-semantics of the loop in the
following:
lift?(p1:SUPP,p2:SUPP,uterm:UTerm,ldeg:List NNI,
lvar:List OV) :
Union(s:SUPP,failed:"failed",notCoprime:"notCoprime") ==
leadpol:Boolean:=false
(listpol,lval):=(uterm.lpol,uterm.lint.fi
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> | In any case,
> |
> | +uf: SUP
> | for uf in listpol repeat
> |--note uf and d not necessarily primitive
> |degree gcd(uf,d) =0 => nolift:=false
> |
> | looks very strange to me. I'd really prefer
> |
This is for the record. I guess I stated my opinion on that topic already, but
I hope that restating doesn't make anybody angry, but rather helps making
things more precise. (I believe that iteration of informal discussion may help
make things more precise).
This is also why I crosspost.
"Gabrie
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> To me the problem is bad design.
>
> halfExtendedSubResultantGcd1 and
> halfExtendedSubResultantGcd2 could well have returned the same type
> Record(gcd: P, coef: P). By the name of the function it would have been
> clear how to interpret the coef entr
Christian, I'm copying you since I'm interested in your Senf. :-)
We are discussing whether
test() ==
for i in 1..5 repeat
j := i^2
output(i::OutputForm)$OutputPackage
output(j::OutputForm)$OutputPackage
should produce an error, saying that
Dear Gaby,
judging from the comment alone (I did not yet compile this revision):
am I right that both snippets below will produce an error in SPAD?
(1)
for i in 1..5 repeat
j: Integer := i^2
output(i::OutputForm)$OutputPackage
output(i::OutputFor
Dear Waldek, Peter,
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> I belive that the change to Makefile.in and changes to 'foam_l.lisp' can go
> in. [...]
I just wanted to commit the change to Makefile.in, and wanted to write a line
of explication. Then I found that Makefile.pamphlet exists, and
Dear all,
here are the changes necessary to make aldor (precisely, src_aldor2.tgz) work
with sbcl-based FriCAS. I guess that they should also work for OpenAxiom.
Abstract:
*) the right way to get oneself into the underlying lisp from within the
FriCAS/OpenAxiom interpreter is )fin, I believe
Martin Rubey <[EMAIL PROTECTED]> writes:
> Gaby,
>
> could you please elaborate? I found this on the wiki:
Oh, Bill answered already!
Martin
-
This SF.net email is sponsored by the 2008 JavaOne(SM) Co
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> "Bill Page" <[EMAIL PROTECTED]> writes:
>
> | Gaby,
> |
> | On Tue, May 6, 2008 at 11:19 PM, you wrote:
> | > ...
> | > OpenAxiom already moved many of syntactic transformations and
> | > coercions to library. More remains to do done; but that woul
"Bill Page" <[EMAIL PROTECTED]> writes:
> I have been thinking specifically about the algorithms that the Axiom
> interpreter uses to do type inference and function selection. Some part of
> the behaviour is "hard coded" into the interpreter and not easy to change,
> but a large part of it depends
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> On 04/30/2008 02:10 PM, Martin Rubey wrote:
> > In my case, I consider x and y in fact as formal power series in t
> > themselves, and I think I also want that sqrt(x^2)=x.
>
> Replace x by the formal power series in t havin
Dear William, Dear Waldek,
many thanks for your help!
I guess, the real problem is that
(71) -> ex :=
((-2*t*x*y)+(-2*t*x^2))/(y*(t^2*y^4+((-4*t^2)+(-2*t))*x*y^3+((-6*t^2)+1)*x^2*y^2+((-4*t^2)+(-2*t))*x^3*y+t^2*x^4)^(1/2)+t*y^3+(-x*y^2)+t*x^2*y)
I'd be very grateful if somebody could look at the input file below. (Don't be
afraid, most of the definitions are not needed)
I would have thought that bug() would yield twice the same thing. It may be a
mistake on my side, of course, but note that
* axiom does not compute
map(c +-> sqrtrul
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> What do you find wrong? AFAICS everything works as designed --
> the messages are not very helpful, but you can see from them
> that dot needs vectors as arguments.
I think that the interpreter should try to coerce from List to Vector.
Martin
---
"Bill Page" <[EMAIL PROTECTED]> writes:
> > Why on earth is it interpreting [a,b] as List OrderedVariableList [a,b]?
> > That doesn't make sense!
> >
>
> Why not? Again what would you expect?
>
> (4) -> [a,b]
>
>(4) [a,b]
>Type: List OrderedVariabl
"Bill Page" <[EMAIL PROTECTED]> writes:
> Martin,
> Are you saying that it should not be necessary to give the interpreter
> such mode hints?
Not quite sure, but I'd say: no!
In any case, look again what the interpreter is doing:
(1) -> l1: List POLY INT := [a,b]; l2: List POLY INT := [x,y];
I'm currently wondering about the message below. Is this a known misfeature of
the type inference algorithm?
Martin
(1) -> dot([1,2],[a,b])
There are 2 exposed and 2 unexposed library operations named dot
having 2 argument(s) but none was determined to be applicable.
Use HyperDo
"Gary Furnish" <[EMAIL PROTECTED]> writes:
> I'd be interested in hearing which features of FriCAS/OpenAxiom has that
> might be useful in more detail.
I'm not quite sure what you are interested in. I attach some things that I
know to be working well or that I used recently below.
> My main t
Dear Michael,
just a short recap, whether I have understood things correctly:
the problem you currently face with external symbolic calculus is that the
representation of the objects is not identical in SAGE and in the external
progam (Maxima).
you are using something called "pexpect
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
>
>
> [...]
>
> | > I can see how this can be limiting in some cases, but I suspect it makes
> an
> | > interesting language design choice. A fundamental quest
Dear Gaby,
thanks for looking into this!
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> I spent some time thinking about this issue, pondering pros and cons, looking
> at the compiler code. My conclusion is that the existing behaviour was a
> deliberate design choice to mimic `forgetful functor
Francois Maltey <[EMAIL PROTECTED]> writes:
> Hello,
>
> I'll present Axiom to some mathematical teachers in undergraduate the
> next month.
Do you happen to know the topics they like?
> So I'm writing/looking for slides for about 20 or 30 minutes. I discover
> beamer.
> Do you know/see where
Dear all,
it just occurred to me that I think I want to have another optimization
done. Consider, again, qelt$IIARRAY2. I currently have
---
InnerIndexedTwoDimensionalArray(R,mnRow,mnCol,Row,Col):
[...]
qelt(m,i,j)
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> Juergen Weiss wrote:
> >
> > Main idea was to allow f(x +-> 2*x, y) without parentheses where
> > f is a function accepting a function as the first argument.
> >
>
> Yes, that is important case. Given that interpreter behaves in the
> same way I thi
Anybody knows anything about that one?
Index: interp/newaux.lisp
===
--- interp/newaux.lisp (revision 268)
+++ interp/newaux.lisp (working copy)
@@ -108,6 +108,9 @@
(/\\ 250 251) (\\/ 200 201)
(\.\. SEGMENT 4
Sorry if I missed it -
what does get/set shellEntry do, what does shellEntry mean?
Many thanks,
Martin
-
This SF.net email is sponsored by the 2008 JavaOne(SM) Conference
Register now and save $200. Hurry, offer ends at
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > | Note that at first I thought that introducing Aldor's extend would
> > invalidate
> > | my reasoning. But it turns out, that at least the current Aldor compiler
> > does
> > | *not* allow overriding domain definitions either. I could not find
>
Dear Gaby,
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
>
> [...]
>
> | > | But I have no idea at what point during compilation the names of the
> | > | operations are determined.
> | >
> | > Could you
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
>
> [...]
>
> | > Every (exported) function is characterized by its modemap (be sure you
> | > appreciate the differences between the two kinds of modemap). So if you
&g
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
> If there is anything about Spad you think I can answer, then it would be good
> if it is recorded on open-axiom for reference in the future.
OK, best thing is to CC posts then, I gues
Francois Maltey <[EMAIL PROTECTED]> writes:
> Dear all,
>
> I have just finished a package for basis of subspaces which looks like
> maple or mupad functions.
>
> This code has comments and I write an *.input test file. I write it with the
> actual fricas cvs version.
>
> I'll use it for exerc
Does anybody know about the relationship between these files? It seems that
many definitions are (nearly) duplicate. If I want to start hacking (infovec
code), which one should I look at?
Martin
-
This SF.net email is spon
I found the place where things went wrong, it's compileADEFBody in
i-spec1.boot. Now the tests seem to pass.
I do not think that my fix is correct though. Maybe somebody could check. I
wonder, maybe |compQuietly| in comp.lisp should return a function?
Martin
compileADEFBody(t,vars,types,body,
Dear Gaby, Juegen, Waldek, Dear all,
here is a report on what I found in the last few days. I believe it's quite
encouraging. (Juergen, I CC you since I hope you might know something about
(1) below...)
Waldek Hebisch <[EMAIL PROTECTED]> writes:
[...]
> Below is a simple input script which on
Help needed...
Martin Rubey <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes:
>
> > Dear Waldek,
> >
> > thanks a million!
> >
> > > Basically, one must find all places where we use symbols which may end up
> > &g
I was experimenting with the following:
Martin Rubey <[EMAIL PROTECTED]> writes:
> By the way, there seems to be another, extremely simple optimization to do in
> SPADCALL:
>
> (defmacro SPADCALL (&rest L)
>(let ((args (butlast l))
>(fn (car (las
Martin Rubey <[EMAIL PROTECTED]> writes:
> b) isn't the domain vector constant for domains and packages? I guess it
> won't
>be constant for default domains, right? I believe it should be that way,
>because there is no way that a function definition in a d
Dear all,
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> Some source of inefficiency is clear: profile shows that access to matrix
> elements is done via function calls and that those calls take substantial
> time (more than arithmetic). Also aritmetic in Z_p is done via function
> calls which is
Dear Gaby,
> On 22 Mar 2008 11:50:34 +0100, Martin Rubey <[EMAIL PROTECTED]>
> wrote:
> > Do you know, or can you point me to, the place where SPADreplace is used?
> > Up to now I thought the lisp compiler would just compile the code.lsp
> > files, but how would
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> Well, what you see here? I see function calls :) All Spad function calls
> crossing constructor boundary are indirect function calls, which basically
> gives Lisp compiler almost no chance to optimize. Some functions are
> inlined, in such case Lisp c
Dear all, especially dear friCAS users,
I have now completed the first step in what I believe to be a cleanup of the
aggregate world. I would greatly appreciate comments.
There are two major changes:
1) members returns now a Set, namely the set of distinct elements of the
homogeneous aggrega
Dear all,
I'm copying this to open-axiom, in the hope that somebody there is also
interested in looking at the algorithm that chooses the signatures. Note that
I did already a very little research on that topic, see
http://groups.google.at/group/fricas-devel/msg/7133b4ee2b13055b
Now the main r
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> On 02/29/2008 09:27 AM, Martin Rubey wrote:
> > make SQMATCAT inherit from MATCAT.
>
> I am sure you don't want that.
I'm not so sure...
> We have
>
> MatrixCategory(R,Row,Col): Category == D
"Bill Page" <[EMAIL PROTECTED]> writes:
> > By the way Record(Integer, Integer) is not allowed in Aldor.
> > I do not understand why, isn't that a bug:
> >
> > %13 >> import from Record(String, String)
> > ...^
> > [L13 C29] #1 (Error) Duplicate selector/type pair
Francois Maltey <[EMAIL PROTECTED]> writes:
> Dear Ralf and all,
>
> > In particular [List and] Record provide such bracket function of type [...]
> > which allows the usual list construction.
> >
> > (in Record(a: Integer, b: String, c: Float))
> >bracket: (Integer, String, Float) -> %
> >
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> | Sure there is no semicolon, but I don't understand. (Unfortunately, I
> | can only speak of Aldor...). Cannot
> |
> |{1}
>
> The point is that if the contained single expression is all you have,
> there is no point in putting in a brace. If y
Dear Gaby, Waldek,
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> I have just removed support for a few constructs that I consider
> obsolete:
> - usage of '(|', '|)', '(<' and '>)' insted of '[', ']', '{' and '}'
> - APL like syntax for maps
> - "scripted symbols" in the Spad parser.
>
> Rational
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> Hi,
>
> Here is a problem -- currently failing -- for type inference in the
> interpreter. Consider (taken from current testsuite)
>
> primes == [p := nextPrime(i = 0 => 2; p) for i in 1..]
> primes
I guess you meant to type i = 1 above. In that
1 - 100 of 176 matches
Mail list logo
