Hello. Is it possible to define a binary operation ∪ such that A ∪ B gives A.union(B) with the latter taking care of all problems (not a Set, etc.)?
And if so, would it be possible to have an n-ary operation (n > 1) such that for instance A ∪ B ∪ C gives A.union(B).union(C) without having to write (A ∪ B) ∪ C ? Guillermo -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/CANnG1888y49%2BYkMmu3n5Qp%2BNvbfnNKCk42kuf1AdDWOYFzhqpA%40mail.gmail.com.
