What does "Normal types are dynamic" mean to you?
I'm pretty sure that Waldek can only have meant that domains are
constructed at runtime while categories are considered to be static,
i.e. must be determined at compile time.
In fact, it sounds a bit strange for situations like
PolynomialRing(R : Join(SemiRng, AbelianMonoid),
E : OrderedAbelianMonoid) : T == C
where
T == FiniteAbelianMonoidRing(R,E) with
...
where the concrete return type is only known when this domain is
instantiated.
In particular, for categories like
Cat(X: SetCategory): Category == with
if X has Ring then ...
...
the dynamic/static concept can lead to confusion.
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.
