Dear Stephen,
Just to make sure: I hope Ralf and myself have not discouraged you from your
work on SPAD. However, I think it would be more promising to try to make SPAD
converge towards the Aldor language:
* Aldor (the language) is relatively well understood - thanks for recalling the
article
On 6/25/07, Gabriel Dos Reis wrote:
...
On Mon, 25 Jun 2007, Tim Daly wrote:
| ...
| I have a pending downcase change which is complete and ready to
| undergo testing. Since it is guaranteed to make your changeset
| incompatible I'll withhold it until your changeset is ready to
| apply. Then I'll
On 6/26/07, William Sit wrote:
The following email (with minor changes) was originally sent
to Tim and he replied: "Post your suggestion publicly. Ask
for a vote. We will go with the majority opinion. You get to
keep the final count."
So please feel free to comment, and may be Bill Page can set
> Le samedi 23 juin 2007 ? 21:08 +0200, Waldek Hebisch a écrit :
> > Do you think we should set *read-default-float-format*
> > to T? I must admit that in Lisp/boot sources I would prefer to
> > explicitly specify double precision (when needed), while for
> > Spad/input we are (or should be) usi
William
On Tue Jun 26 18:55:59 -0500 2007 you commented:
I think everyone can "vote" using the page rating just above the "Add Comments"
area. However, the rating choices right now are biased positively. I think the
range
should be from -2 to +2 and not -1 to +3. Comments, in particular, dicus
On 6/26/07, William Sit wrote:
The following email (with minor changes) was originally sent
to Tim and he replied: "Post your suggestion publicly. Ask
for a vote. We will go with the majority opinion. You get to
keep the final count."
So please feel free to comment, and may be Bill Page can set
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> > Im not going to try and defend the idea, as I feel I can work with
> > simpler notions. But 1 and + would be considered value identifiers.
>
> You might be right, but what I will certainly do in a near future is
> an implementation of a domain whose
Im not going to try and defend the idea, as I feel I can work with
simpler notions. But 1 and + would be considered value identifiers.
You might be right, but what I will certainly do in a near future is an
implementation of a domain whose elements are combinatorial species.
That domain will
The following email (with minor changes) was originally sent
to Tim and he replied: "Post your suggestion publicly. Ask
for a vote. We will go with the majority opinion. You get to
keep the final count."
So please feel free to comment, and may be Bill Page can set
up a sandbox page to keep votes?
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> >> I must say, no matter whether it is syntactic sugar or not, a
> >> definition of the form
> >>
> >> (*) D(P : Polynomial (R : Ring)) : ... == ...
> >>
> >> would confuse me. How am I supposed to used that? Should I write
> > Boy, my first email th
> Greetings! My cvs is down at the moment. Until I get the fix in, you
> can replace
>
> (declare (ignore tpn))
>
> with
>
> tpn
>
> in lsp/gcl_callhash.lsp, function do-recompile.
>
> Please let me know if problems persist.
>
Thank you for the hint. After editing lsp/gcl_callhash.lsp an
I must say, no matter whether it is syntactic sugar or not, a
definition of the form
(*) D(P : Polynomial (R : Ring)) : ... == ...
would confuse me. How am I supposed to used that? Should I write
Boy, my first email this morn had a few more typos than I would have
liked. Ill try to ensure
William,
Post your suggestion publicly. Ask for a vote. We will go with
the majority opinion. You get to keep the final count.
Tim
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
Camm,
Camm Maguire <[EMAIL PROTECTED]> writes:
> Greetings! My cvs is down at the moment. Until I get the fix in, you
> can replace
>
> (declare (ignore tpn))
>
> with
>
> tpn
>
> in lsp/gcl_callhash.lsp, function do-recompile.
>
> Please let me know if problems persist.
FYI, this change
On Tue, 26 Jun 2007, Martin Rubey wrote:
| Dear Gaby,
|
| Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
|
| > It is obvious to me that automated version updated can run as follows:
| >
| > * daily bump: anywhere, preferably a machine that is almost always
| > up -- we can use the c
Greetings! My cvs is down at the moment. Until I get the fix in, you
can replace
(declare (ignore tpn))
with
tpn
in lsp/gcl_callhash.lsp, function do-recompile.
Please let me know if problems persist.
Take care,
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> > Greetings, and thanks Waldek
I would like to propose a new unit of measurement for fixes per day and call it
Waldek.
Many thanks, Waldek!
Martin
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
Vadim --
I completely agree with your assessment.
Please just pick 4.0 and be done with it.
-- Gaby
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
Martin,
I subscribed to the combinat list. I am also in the process of
setting up an older machine which I hope will allow me to get an aldor
binary running.
I will look at you code, and at the archives, and attempt to
understand the issues involved.
I have high hopes that we can enrich Axiom'
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> On 06/26/2007 08:07 PM, Stephen Wilson wrote:
> > Martin Rubey <[EMAIL PROTECTED]> writes:
> >> Dear Stephen,
> >>
> >> many thanks for your detailed answer. I must admit however, that I dislike
> >> your idea writing
> >>
> >>D(P : Polynomial (R :
Bill Page writes:
On 6/26/07, Vadim V. Zhytnikov wrote:
Ralf Hemmecke writes:
> ...
> Even more interesting. Since I see September 2006 on my banner
> (which is> --patch-50), that should probably be something > 3.6.
>
No, quarterly gold releases in 2005 was numbered 3.4 (April 2005),
3.6 (June
Stephen Wilson <[EMAIL PROTECTED]> writes:
> > > > Maybe you want to join our discussion on how to implement multisort
> > > > species in Aldor? There, we are pushing the limits of Aldor, I guess.
> > > > Also, the parser and domain generator I wrote shows some features one
> > > > may want to ha
Martin,
Martin Rubey <[EMAIL PROTECTED]> writes:
> Stephen Wilson <[EMAIL PROTECTED]> writes:
>
> > Martin Rubey <[EMAIL PROTECTED]> writes: Big difference is that with
> > a parametrized type, the parametrization forms a part of the `public
> > interface' to the type. No domain/category should
On 6/26/07, Vadim V. Zhytnikov wrote:
Ralf Hemmecke writes:
> ...
> Even more interesting. Since I see September 2006 on my banner
> (which is> --patch-50), that should probably be something > 3.6.
>
No, quarterly gold releases in 2005 was numbered 3.4 (April 2005),
3.6 (June 2005), 3.9 (October
On 06/26/2007 08:07 PM, Stephen Wilson wrote:
Martin Rubey <[EMAIL PROTECTED]> writes:
Dear Stephen,
many thanks for your detailed answer. I must admit however, that I dislike
your idea writing
D(P : Polynomial (R : Ring)) : ... == ...
for
D(R : Ring, P : Polynomial R) : ... == ...
I
C Y <[EMAIL PROTECTED]> writes:
> Martin, once we get the development version stuff worked out, did you have
> any objections to the Gold numbering proposal?
I suggest that we discuss that part once you (or somebody) has implemented the
(possibly semi-)automatic version information in the banner.
Stephen Wilson <[EMAIL PROTECTED]> writes:
> Martin Rubey <[EMAIL PROTECTED]> writes: Big difference is that with
> a parametrized type, the parametrization forms a part of the `public
> interface' to the type. No domain/category should be allowed to `hide' their
> parametrization, nor should the
Hello Ralf,
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
[...]
> Try to define this apply function.
>
> Important, I want to have as much type safety as possible, i.e. If I
> would have written
>
> c := m(1, "x", false);
>
> the compiler should already shout that the type of the first argument
> d
--- "Vadim V. Zhytnikov" <[EMAIL PROTECTED]> wrote:
> No, quarterly gold releases in 2005 was numbered 3.4 (April 2005),
> 3.6 (June 2005), 3.9 (October 2005). In 2006 this numbering
> scheme was abolished.
Hmm. Tim, does 3.9 correspond to the last update of the arch archive,
or was there some
Martin Rubey <[EMAIL PROTECTED]> writes:
> Dear Stephen,
>
> many thanks for your detailed answer. I must admit however, that I dislike
> your idea writing
>
>D(P : Polynomial (R : Ring)) : ... == ...
>
> for
>
>D(R : Ring, P : Polynomial R) : ... == ...
>
> Isn't this just syntactic
Hi, Camm --
My reply is interspersed below.
Sender: [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED], axiom-developer@nongnu.org, [EMAIL PROTECTED],
[EMAIL PROTECTED]
From: Camm Maguire <[EMAIL PROTECTED]>
Date: 26 Jun 2007 13:25:31 -0400
X-SpamAssassin-Status: No, hits=-2.3 requ
Dear Gaby,
Gabriel Dos Reis <[EMAIL PROTECTED]> writes:
> It is obvious to me that automated version updated can run as follows:
>
> * daily bump: anywhere, preferably a machine that is almost always
> up -- we can use the cron job facility at SF.
Yes, of course. But suppose that
Greetings!
Gernot Hueber <[EMAIL PROTECTED]> writes:
> Dear Camm,
>
> this is great! Thanks for your effort related to this issue.
>
> First I want to ask, is this version running on FreeBSD as well and how
> can I access the source for this version?
>
Probably, but untested.
export CVSROOT=
Greetings!
Matt Kaufmann <[EMAIL PROTECTED]> writes:
> Hi, Camm --
>
> Here is some feedback with respect to the use of ACL2 on top of GCL,
> as I see it.
>
> >>A final question remains of
> >>whether or not to actually use ftype declaims if provided.
>
> As you know, in ACL2 we do our
Ralf Hemmecke writes:
On 06/26/2007 05:07 PM, Bill Page wrote:
On 6/26/07 Ralf Hemmecke wrote:
Ooops. There is already version 3.4 of Axiom. Very interesting. ;-)
http://rpmfind.net/linux/RPM/mandriva/2007.1/i586/media/contrib/release/axiom-3.4-0.20050901.1mdk.i586.html
I think Tim has def
Martin --
It is obvious to me that automated version updated can run as follows:
* daily bump: anywhere, preferably a machine that is almost always
up -- we can use the cron job facility at SF.
* release with version number: this should be done when the
release is mad
On Tue, 26 Jun 2007, Ralf Hemmecke wrote:
| Hi Gaby, Cliff, Martin,
|
| isn't that a bit of overkill if the script updates every file?
The script I sent does not update every file.
It modifies only a handful of GCC files: exclusively those that
contain version information.
In case of Axiom, it
Hi Gaby, Cliff, Martin,
isn't that a bit of overkill if the script updates every file?
SVN is different from CVS, there are global revision numbers. So it is
simply enough if there is one file that contains some specific version
information. (I guess the same is true for any newer SCM like git
On 06/26/2007 05:07 PM, Bill Page wrote:
On 6/26/07 Ralf Hemmecke wrote:
Ooops. There is already version 3.4 of Axiom. Very interesting. ;-)
http://rpmfind.net/linux/RPM/mandriva/2007.1/i586/media/contrib/release/axiom-3.4-0.20050901.1mdk.i586.html
I think Tim has defined at least axiom vers
Cliff --
You don't need to have separate programs for sepaerate branches.
Please find attached the script
$GCC/maintainer-scripts/update_version_svn
that we use for GCC. It is reltively simple. It was originally written
for our CVS repository and quickly adapted to SVN -- without modif
Waldek Hebisch <[EMAIL PROTECTED]> writes:
> Note that checked out source should work without svn (think about source tree
> copied to a machine without network access).
> Gaby proposed script running on the svn server and that should be fine.
> Somebody just has to work out how to install such s
On 6/26/07 Ralf Hemmecke wrote:
Ooops. There is already version 3.4 of Axiom. Very interesting. ;-)
http://rpmfind.net/linux/RPM/mandriva/2007.1/i586/media/contrib/release/axiom-3.4-0.20050901.1mdk.i586.html
I think Tim has defined at least axiom version 3.6 ((June 2005). See:
http://cvs.sava
Martin Rubey wrote:
> C Y <[EMAIL PROTECTED]> writes:
>
> > I'll take a look at following Gaby's hints and make a file that
> > contains the key information for autoconf (or whatever) to target.
> > That file could be script updated or hand updated as needed (say on a
> > platform where the scrip
--- Martin Rubey <[EMAIL PROTECTED]> wrote:
> For svn
>
> LC_ALL=C svn info | grep "Last Changed Rev:"
>
> might be appropriate (as already pointed out by Ralf), although I do
> not know how stable "Last Changed Rev:" is.
>
> It seems that git uses a different sort of revision numbers, and I d
Ooops. There is already version 3.4 of Axiom. Very interesting. ;-)
http://rpmfind.net/linux/RPM/mandriva/2007.1/i586/media/contrib/release/axiom-3.4-0.20050901.1mdk.i586.html
Ralf
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://li
I promised to write about dependecies in build machinery. First
I would like classify changes to build process:
1) adding autoconf part (configure.ac.pamphlet + config subdirectory)
2) changes to Makefiles
3) new directory layout
4) improvements to tools (notably document script and bootsys)
5) fi
C Y <[EMAIL PROTECTED]> writes:
> I'll take a look at following Gaby's hints and make a file that
> contains the key information for autoconf (or whatever) to target.
> That file could be script updated or hand updated as needed (say on a
> platform where the script doesn't work). I'll start on
--- Martin Rubey <[EMAIL PROTECTED]> wrote:
> > But we do have one that works with the current situation -
> > yymm.branch.revision.
>
> But it's not implemented. In a parallel email, Gaby pointed out how
> this could be done. Maybe you could take an afternoon to implement
> it for build-impro
I wrote:
> On more basic level: currently I can not build out of the box
> gold or silver. Silver recently made big progress: it used to
> fail early in the build process, now it fails during graphic
> build (it can not find libXpm.a).
Tim Daly wrote:
> Waldek,
>
> Try using AXIOM=`pwd`/mnt/fedo
Yes, constants may contain mutable data. But that's just as in other
languages. It is true that you can say
l: List Integer == [1,2,3];
l.1 := 4;
but in my opinion, you are not really modifying l, but rather l.1, and that's a
different story.
And I would even need mutable constants. I want t
* the problem of needing both AbelianMonoid as well as Monoid.
Its been mentioned before that OBJ has a facility for defining these
kinds of relationships. A solution is likely to derive from there.
Could you give a short account on how this code looks in OBJ?
Thanks
Ralf
* certain difficulties transforming Tuples
I assume your talking about the issues raised in the article I mentioned
above?
I just checked. Although I'm still not completely sure, but I think the
problem we have is that Tuples are *not quite* first class citizens, quite
contrary to the recomme
Martin Rubey <[EMAIL PROTECTED]> writes:
> > > * certain difficulties transforming Tuples
> >
> > I assume your talking about the issues raised in the article I mentioned
> > above?
I just checked. Although I'm still not completely sure, but I think the
problem we have is that Tuples are *not q
Dear Stephen,
many thanks for your detailed answer. I must admit however, that I dislike
your idea writing
D(P : Polynomial (R : Ring)) : ... == ...
for
D(R : Ring, P : Polynomial R) : ... == ...
Isn't this just syntactic sugar? My feeling (!) is that this will pose more
questions than
Martin Rubey <[EMAIL PROTECTED]> writes:
> Stephen Wilson <[EMAIL PROTECTED]> writes:
>
> > > Rather, PLEASE try to follow the Aldor User Guide. Since Christian
> > > Aistleitner
> > > wrote a parser for Aldor some time ago (in Aldor, sources being available
> > > from
> > > himself, I believe
55 matches
Mail list logo
