Oje.
> isomorphismTypes(s: SetSpecies L): Generator % == generate {
> empty? s => ...
> labels: SetSpecies L := set([first s for x in s]$List(L)); -- (*)
> s: Set % := [structures labels]; -- (+)
> for x in s repeat yield x;
> }
I think I have to modify the lines (*) and (+). A counter example has
already been given by Martin at
http://www.mail-archive.com/aldor-combinat-devel@lists.sourceforge.net/msg00131.html
But still, the problem is finite and thus solvable in principle by
applying all permutations from S_n and building cosets.
Anyway, Martin's example shows, that labels must be kept and can only be
removed at printing time.
Ralf
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys - and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Aldor-combinat-devel mailing list
Aldor-combinat-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/aldor-combinat-devel
