Waldek Hebisch wrote:
> I think we have conflicting paradigms here. I belive that history
> has place in documentation only if it explains _significant_ aspect
> of current system. In case of current filename change past status
> really tells you nothing about new system.
(insert 'mouth 'foot)
With this patchlet we return whather shoeNotFound returns when the
input file is invalid. This behaviour now matches that of other
translation functions.
-- Gaby
2006-11-15 Gabriel Dos Reis <[EMAIL PROTECTED]>
* ptyout.boot.pamphlet (shoeClLines): Return the result of
shoeNo
Hi,
This patchlet makes the functions boottocl and boottoclc translators
pretty print their results -- instead of producing long lines of
unreadable sequences of parenthesis and vertical bars.
I just bootsys from stage 2 to check the results and alter
the cached version.
Built and tested on
Waldek,
On Wednesday, November 15, 2006 9:26 PM you wrote:
> ...
> You forgot to remove the second copy of util.ht (so I did that).
>
Thanks. It's been a long day but your night must be even longer...
:-)
Cheers,
Bill Page.
___
Axiom-developer mai
Bill Page wrote:
> On Wednesday, November 15, 2006 12:47 PM Gaby wrote:
> > ...
> > Bill Page wrote:
> > | Here is my proposed documentation patch to src/hyper/Makefile:
> >
> > That is excellent! Go!
> >
>
> Ok, done. I compiled Axiom with the two patches - one for file renames
> and one for
"Page, Bill" <[EMAIL PROTECTED]> writes:
[...excellent stuff snipped...]
| Now having thought about Stream as a type constructor solution
| of the equation X = 1 + T * X, I would like to ask you what you
| think might be the equivalent greatest fixed point solution of
|
| X = 1 + T * X * X
|
On Wednesday, November 15, 2006 7:39 PM Ralf Hemmecke wrote:
>
> On 11/16/2006 01:20 AM, Gabriel Dos Reis wrote:
> > | > The definition you gave is it: least fixed point of
> > | > X |-> 1 + T × X × X
> > |
> > | Hmmm, good question. In Aldor-combinat (AC) we deal with
> > | combinatorial sp
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
| On 11/16/2006 01:20 AM, Gabriel Dos Reis wrote:
| > Ralf Hemmecke <[EMAIL PROTECTED]> writes:
| > | > The definition you gave is it: least fixed point of
| > | > X |-> 1 + T × X × X
| > | | Hmmm, good question. In Aldor-combinat (AC) we deal with
| >
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
[...]
| that builds libaxiom.al. And so I am not even sure about whether
| elt=apply actually holds. I am certainly missing something.
I don't if it is of any help, see ax.boot:
axOpTran(name) ==
ATOM name =>
name = 'elt => 'app
On 11/16/2006 01:20 AM, Gabriel Dos Reis wrote:
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
| > The definition you gave is it: least fixed point of
| > X |-> 1 + T × X × X
|
| Hmmm, good question. In Aldor-combinat (AC) we deal with combinatorial
| species. They encode actual structures. The
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
| > The definition you gave is it: least fixed point of
| > X |-> 1 + T × X × X
|
| Hmmm, good question. In Aldor-combinat (AC) we deal with combinatorial
| species. They encode actual structures. The corresponding generating
| series G(x) for binary
On 11/15/2006 01:55 PM, Page, Bill wrote:
I tried writing:
test(a:Fraction UnivariatePolynomial(x, F)):Fraction
UnivariatePolynomial(x, F) ==
elt(a,1$Fraction(UnivariatePolynomial(x,
F)))$UnivariatePolynomial(x, F)
but Aldor continues to insist that there is no such elt that
returns Fract
"Page, Bill" <[EMAIL PROTECTED]> writes:
[...]
| Oops, I guess you asked that they be separate commits... Sorry. But
| the changes are simple and related so perhaps better treated as one
| anyway.
No, that is fine. Waldek explained why it is better they are
committed jointly.
Thanks!
-- Gab
Bill Page wrote:
> BTW, the output of the algebra/Makefile looks a little strange:
>
> ...
> rm -rf /home/page/axiom.test/int/algebra/FTEM.NRLIB
> copying FTEM.NRLIB to FTEM.o
> compiling GENEEZ.spad to GENEEZ.NRLIB
> rm -rf /home/page/axiom.test/int/algebra/GENEEZ.NRLIB
> copying GENEEZ.NRLIB to
On Wednesday, November 15, 2006 12:47 PM Gaby wrote:
> ...
> Bill Page wrote:
> | Here is my proposed documentation patch to src/hyper/Makefile:
>
> That is excellent! Go!
>
Ok, done. I compiled Axiom with the two patches - one for file renames
and one for file cleanup
http://lists.nongnu.org
The definition you gave is it: least fixed point of
X |-> 1 + T × X × X
Hmmm, good question. In Aldor-combinat (AC) we deal with combinatorial
species. They encode actual structures. The corresponding generating
series G(x) for binary trees given by your X above has to fulfil the
equatio
Waldek Hebisch <[EMAIL PROTECTED]> writes:
[...]
| +The system uses another optimization: database contains a stamp
| +(consisting of offset to the main list and build time). Before
| +saving the image selected data is fetched to memory. When the
| +saved image starts it checks if the stamp of
quit
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
test
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
I created now a new branch named wh-sandbox. ATM there only new file
id README.wh, but in few days there will be more changes.
--
Waldek Hebisch
[EMAIL PROTECTED]
___
Axiom-developer mailing list
Axiom-developer@nongnu.
The following patch makes caching of databases effective and
reduces startup time of AXIOMsys. Debian uses similar patch
and claims huge reduction of time needed to run tests, but
for me test time remained effectively unchanged.
diff -ru build-improvements.bb/src/etc/Makefile.in
build-improvemen
Bravo! Thank you Tim. Your work and writings are inspiring.
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
"Page, Bill" <[EMAIL PROTECTED]> writes:
| On Wednesday, November 15, 2006 10:48 AM Gaby wrote:
| >
| > Bill Page writes:
| >
| > [...]
| >
| > | My suggestiong is that when we start to work on a patch, we first
| > | ask on the axiom-developer list for someone to play the role of
| > | 2nd per
On Wednesday, November 15, 2006 10:48 AM Gaby wrote:
>
> Bill Page writes:
>
> [...]
>
> | My suggestiong is that when we start to work on a patch, we first
> | ask on the axiom-developer list for someone to play the role of
> | 2nd person. Perhaps this is a way for people who do not yet feel
>
Hello,
I test my own expand function in its package UsualExpand.
The code is in ~/Axiom/expand.spad file.
I can compile this function without problem.
)cd
)cd Axiom
)co expand.spad
When I run a new axiom session I use this function by :
)cd-- go to the home diectory
)cd Axi
The main difference between boottran::boottocl and boottran::boottoclc
is that the latter includes the Boot codes (as comment) in
translation.
Well, that is the theory.
In practice, they happen to translate very subtly in different ways.
I think the reason for that is bug instead of design.
boo
On Tue, 14 Nov 2006, Humberto Ortiz Zuazaga wrote:
| Humberto Ortiz-Zuazaga wrote:
|
| >> | I built --without-noweb --with-gcl, the configure for the built in gcl
| >> | isn't working right.
|
| I think I tracked down the problem. In build-improvements, on the Mac,
| the configure for gcl was bein
Waldek Hebisch <[EMAIL PROTECTED]> writes:
| > Not because you can come up with a silly explanation means that any
| > explanation should be silly. Please, let's keep things in perspective.
| >
| > What about:
| >
| >There are two files for each (special) character glyph, one
| >for the
> Not because you can come up with a silly explanation means that any
> explanation should be silly. Please, let's keep things in perspective.
>
> What about:
>
>There are two files for each (special) character glyph, one
>for the upper case form, and one for the lower case form.
>Hi
"Page, Bill" <[EMAIL PROTECTED]> writes:
[...]
| My suggestiong is that when we start to work on a patch, we first
| ask on the axiom-developer list for someone to play the role of
| 2nd person. Perhaps this is a way for people who do not yet feel
| bold enough to work on Axiom themselves yet to
On Wednesday, November 15, 2006 9:47 AM Gaby wrote:
> ...
> Not because you can come up with a silly explanation means that
> any explanation should be silly. Please, let's keep things in
> perspective.
>
I am sympathetic to Waldek's complaint - not because I think
explanations are silly but ra
Waldek Hebisch <[EMAIL PROTECTED]> writes:
| Gabriel Dos Reis wrote:
| > Please include explanation in pamphlets so as not to delay patch
| > review.
|
| > (2) one for deletiing the redundant file -- also must contain
| > explanation of why.
| >
|
| I must say here that I want a priva
Waldek Hebisch <[EMAIL PROTECTED]> writes:
[...]
| Sorry, I do not get what you mean:
| > Please let separate the patches:
|
| Do you mean that I should test and apply renaming patch without
| removing 'util.ht'? I really do not like this -- that would mean
| patching both copies or leaving a
Gabriel Dos Reis wrote:
> Please include explanation in pamphlets so as not to delay patch
> review.
> (2) one for deletiing the redundant file -- also must contain
> explanation of why.
>
I must say here that I want a private branch for experiments precisely
to avoid fuss about trivia
> Waldek Hebisch <[EMAIL PROTECTED]> writes:
>
> | > "Page, Bill" <[EMAIL PROTECTED]> writes:
> | >
> | > | Gaby,
> | > |
> | > | Are you willing to give Waldek the "go ahead" to commit the
> | > | following patch?
> | >
> | > Yes.
> | > During the conversion, I thought I agreed with this rena
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
| >> And that would match the usual definition of List as the least fixed
| >> point of the functor
| >>
| >> X |-> 1 + X
| >>
| >> in CPO.
| > In case anyone is wondering what Gaby is talking about, I think the
| > following paper by Dos Reis and Jar
Waldek Hebisch <[EMAIL PROTECTED]> writes:
| > "Page, Bill" <[EMAIL PROTECTED]> writes:
| >
| > | Gaby,
| > |
| > | Are you willing to give Waldek the "go ahead" to commit the
| > | following patch?
| >
| > Yes.
| > During the conversion, I thought I agreed with this renaming you
| > proposed.
Ralf,
On Wednesday, November 15, 2006 7:14 AM you wrote:
>
> >> And I cant compile Martin one, maybe I should not assume that
> >> a Field is an INTDOM ...
>
> > No it not necessary to assume that a Field is an INTDOM.
>
> But it is true.
>
> Field(): Category == Join(EuclideanDomain,UniqueFa
Humberto Ortiz Zuazaga <[EMAIL PROTECTED]> writes:
[...]
| I suspect a problem with the ENV= definition in the top-level
| Makefile, but haven't been able to track it down. Are we supposed to
| define GCLDIR? It currently isn't being defined, and an empty GCLDIR
| is being passed on to make in th
Gabriel Dos Reis wrote:
On Tue, 14 Nov 2006, Humberto Ortiz Zuazaga wrote:
| Humberto Ortiz-Zuazaga wrote:
|
| >> | I built --without-noweb --with-gcl, the configure for the built in gcl
| >> | isn't working right.
|
| I think I tracked down the problem. In build-improvements, on the Mac,
| the
On 11/15/2006 07:44 AM, Page, Bill wrote:
On Tuesday, November 14, 2006 6:20 PM Antoine Hersen wrote:
I get nasty FOAM run time error with Ralf solution (I used it
in a more involved context)
Ralf wrote:
Replace "eval(a, x, 1)" by
z: SingletonAsOrderedSet := create();
eval(numer a,
And I cant compile Martin one, maybe I should not assume that
a Field is an INTDOM ...
No it not necessary to assume that a Field is an INTDOM.
But it is true.
Field(): Category == Join(EuclideanDomain,UniqueFactorizationDomain,
DivisionRing) with ...
EuclideanDomain(): Category == Princip
> "Page, Bill" <[EMAIL PROTECTED]> writes:
>
> | Gaby,
> |
> | Are you willing to give Waldek the "go ahead" to commit the
> | following patch?
>
> Yes.
> During the conversion, I thought I agreed with this renaming you
> proposed.
>
I waited for:
http://lists.nongnu.org/archive/html/axiom-d
Gabriel Dos Reis wrote:
> Waldek Hebisch <[EMAIL PROTECTED]> writes:
>
> | Gaby,
> |
> | You applied change in version 259 only to Makefile.in (Makefile.pamphlet
> | stayed unchanged).
>
> I just synced my tree with SVN and it says that Makefile.pamphlet was
> modified as well. Then, I looked i
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> Oh, by the way, the above recursive definition of binary trees not only
> defines the data structure but also the exponential and ordinary generating
> series. So one could ask how many trees are there with 7 nodes (labelled or
> unlabelled). In fact, it
"Page, Bill" <[EMAIL PROTECTED]> writes:
> [...] It defines a List as the least fixed
> point of
>
> X |-> 1 + T x X
>
By the way, in aldor-combinat (or axiom-combinat, if you like), you can define
an equivalent to "List L" as
macro {
I == EmptySetSpecies;
X == SingletonSpe
And that would match the usual definition of List as the least fixed
point of the functor
X |-> 1 + X
in CPO.
In case anyone is wondering what Gaby is talking about, I think the
following paper by Dos Reis and Jarvi:
What is Generic Programming?
Library-Centric Software Design LCSD'0
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
>
> [...]
>
> | ++ A set over a domain D models the usual mathematical notion of
> | ++ a finite set of elements from D.
> |
> | Although
> |
> | i: Integer
> |
> | and
> |
> | s: FinitePowerSet T
> |
> | would be in perfect analogy if one read ":" a
boottoclc translates .boot files to .clisp files (and not .oclisp).
-- Gaby
2006-11-15 Gabriel Dos Reis <[EMAIL PROTECTED]>
* ptyout.boot.pamphlet (boottoclc): Fix description to match
implementation.
* Makefile.pamphlet: Likewise.
(BOOT_TO_LISP): Use boottran:
Waldek Hebisch <[EMAIL PROTECTED]> writes:
| Gaby,
|
| You applied change in version 259 only to Makefile.in (Makefile.pamphlet
| stayed unchanged).
I just synced my tree with SVN and it says that Makefile.pamphlet was
modified as well. Then, I looked in my archive of axiom-commits.
Same thing.
50 matches
Mail list logo
