Hi Nicolas, On 2012-10-12, Nicolas M. Thiery <nicolas.thi...@u-psud.fr> wrote: > By the way, to throw in some more keyword: SearchForest and > TransitiveIdeal are really about computing the *closure* of a set > under some operations. So at this point my two preferred variants are > RecursiveSet or anything build with close: ClosedSet? ClosureOfSet? > ClosureSet? However this is a bit too general and could get people to > think that this is about analysis-related topology.
In my former life (until PhD), I mainly did topology, and indeed ClosedSet would remind me of topology. AlgorithmicallyClosedSet would avoid that association, but is too long. Hence, I still prefer RecursiveSet. By the way, did you think about a construction functor for the new parents? If I understand correctly, you have some algorithmic procedure A that you apply to some basic data (a root) R. Hence, it would not be totally absurd to have an AlgorithmicClosure functor F(A), such that F(A) applied to R returns the associated RecursiveSet. The existence of a construction functor would support the construction of coerce maps - *IF* one is able to guess the priority of F(A) (i.e., would one first apply F(A) or another functor in a pushout?) and how it merges/commutes with other functors - both would depend on the mathematical properties of A. That's a pretty big "if". So, perhaps having construction functors would be unfeasible. But perhaps you have ideas of how to make it work. Best regards, Simon -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
