> If you can come up with a SPAD-compatible replacement for the construct
>
> SPECIES == (L: LabelType) -> CombinatorialSpecies L;
> Plus(
> F: SPECIES,
> G: SPECIES
> )(L: LabelType): CombinatorialSpecies(L) == add [...]
>
> you shall be praised and I'll stop talking about language semantics from now
> on
> and refer to you instead.
It would be even better if that could become
Plus(
F: SPECIES,
G: SPECIES
): SPECIES == (L: LabelType): CombinatorialSpecies(L) +-> add {...}
But then (as you see) Plus is an ordinary function (that produces
domains) and not a functor (or rather domain in Aldor-speak). According
to the Aldor specification that should be equivalent (at least as I read
it), but I remember that I had some problems if I write that. Especially
when it comes to domains like L (list) that are recursively defined as L
= 1 + X*L. (If somebody wants more details, I try to produce a concrete
problem description.)
Ralf
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
open-axiom-devel mailing list
open-axiom-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/open-axiom-devel
