On Feb 14, 4:35 pm, Bill Page <[email protected]> wrote: > BTW, the type Any is like an "infinite" Union unfortunately it does > not export 'case'. So for the application that you illustrate perhaps > it would be better to be more explicit and write an actual Union. E.g. > > ----------------------------------------- > ANY1 ==> AnyFunctions1 > AnyLex ==> Union(Integer,String,Float) > SetAnyLexList ==> > Record( val : AnyLex, remList : List String)
I strongly support Bill's suggestion of *not* using the Any type. Whenever it is possible, to be more explicit, one should use this information in the spad program. "Any" is more or less containing everything. It's nearly like forgetting about all types. IMHO, using Any is against the wish to do computer algebra with types that FriCAS focuses on. "Any" might be useful in rare cases and it still contains more information than an ordinary expression in a typeless CA system, but to me it feels like not using the full power of types, but rather program like in a typeless CAS. Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
