[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Axiom-developer] combinat mailing list
From: |
Stephen Wilson |
Subject: |
Re: [Axiom-developer] combinat mailing list |
Date: |
26 Jun 2007 15:57:54 -0400 |
User-agent: |
Gnus/5.09 (Gnus v5.9.0) Emacs/21.4 |
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's abilities to describe
mathematics.
Take care,
Steve
Martin Rubey <address@hidden> writes:
> Stephen Wilson <address@hidden> 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 have.
> > > >
> > > > I am afraid I would not be able to contribute much to that discussion.
> > >
> > > I'm quite sure that this is not true. But even if true, it might make
> > > clearer which features the language lacks.
> >
> > There is a mailing list? I could lurk there and contribute as appropriate.
>
> https://lists.sourceforge.net/lists/listinfo/aldor-combinat-devel
>
> What concerns the trouble with tuples, Ralf has already forwarded the
> appropriate mail.
>
> What concerns my parser and domain generator, there have been long discussions
> a while back, concluding that my code is not legal Aldor code, but since it
> works and Aldor (the language) doesn't seem to provide an alternative, we kept
> it.
>
> The main function is
>
> interpret(p: List ExpressionTree): List LabelSpecies == {
> import from MachineInteger, LabelSpecies, List LabelSpecies;
> A: LabelSpecies == coerce EmptySetSpecies;
> res: List LabelSpecies := [A for x in p];
> E(i: MachineInteger)(L: LabelType): CombinatorialSpecies(L) ==
> (coerce evaluate(p.i, res))(L) add;
> for i in 1..#p repeat res.i := coerce E(i);
> res;
> }
>
>
> which you find in trunk/combinat/src/interp.as.nw of the aldor-combinat tree.
> There, you will also find quite precise documentation.
>
> Martin
- Re: [Axiom-developer] Axisp news, (continued)
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] Axisp news, Martin Rubey, 2007/06/26
- Re: [Axiom-developer] Axisp news, Martin Rubey, 2007/06/26
- [Axiom-developer] Problem kTuple wish 2., Ralf Hemmecke, 2007/06/26
- [Axiom-developer] Re: Problem kTuple wish 2., Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] Axisp news, Ralf Hemmecke, 2007/06/26
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] Axisp news, Martin Rubey, 2007/06/26
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] combinat mailing list, Martin Rubey, 2007/06/26
- Re: [Axiom-developer] combinat mailing list,
Stephen Wilson <=
- Re: [Axiom-developer] Axisp news, Ralf Hemmecke, 2007/06/26
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] Axisp news, Ralf Hemmecke, 2007/06/26
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] Axisp news, Ralf Hemmecke, 2007/06/26
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/26
- Re: [Axiom-developer] Axisp news, Martin Rubey, 2007/06/27
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/27
- Re: [Axiom-developer] Axisp news, C Y, 2007/06/27
- Re: [Axiom-developer] Axisp news, Stephen Wilson, 2007/06/27