Ralf Hemmecke <[EMAIL PROTECTED]> writes: > I've just looked at your code... and I will immediately remove the function > export > > coerce: % -> Record(subset: SetSpecies L, rest: SetSpecies L); > > because Records are a pain in further use.
I don't know much about Cross. It seems, that Cross doesn't exist in Axiom. > What you actually want is > > coerce: % -> SetSpecies L; > > subsetAndComplement: % -> Cross(SetSpecies L, SetSpecies L) > > You could also leave out the "Cross". > > If I now look at the last function... a "subset" always knows about its > superset. Interesting. ??? > I also don't know whether "subsetAndComplement" is the best name for the > function. Maybe coerce: % -> Partition L? That looks good to me. No, not quite: we need it ordered, i.e., it is more like coerce: % -> Combination(k)(L). But that introduces a dependent type, which I dislike... Subsets and Combinations are really cousins, since a subset is simply "any combination"... > >> PS2: Are you documenting your code? > > I was going to document Subsets and Combinations today. But if you think > > they are unnecessary, I won't. I simply have too much work to do. > > I am for Subsets, but don't bother with Combinatitions. We can implement this > later if we really need efficiency. OK, I'll document Subset as soon as possible. I guess you still dislike the extension to MultiSet input. So I'll leave that out, even though it was most of the work... Martin ------------------------------------------------------------------------- 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
