Re: Seeking for papers about tagged types vs access to subprograms

["Yannick Duchêne (Hibou57)" <yannick_duchene@yahoo.fr>]

Le Sat, 11 May 2013 02:18:30 +0200, Randy Brukardt <randy@rrsoftware.com>  
a écrit:
> Thanks for the reference. I doubted that the idea was new (there are no  
> new
> ideas), but I hadn't heard of it before. I don't like the name much,  
> because
> it feeds into the "type is everything" madness that Dmitry exhibits so
> clearly. This clearly (just like constraints and predicates) is something
> that's added in addition to type analysis; it's not part of it at all.

I agree this cannot be checked with typing and needs an additional  
analysis, that seems obvious. But where would you state the predicates to  
be verified, if not in something which is bounded to the type? The type  
definition it self or its methods, is the only one place where to requires  
the predicates to be verified; this can't move around freely, this have to  
be bound to it in some way.

-- 
“Syntactic sugar causes cancer of the semi-colons.” [1]
“Structured Programming supports the law of the excluded muddle.” [1]
[1]: Epigrams on Programming — Alan J. — P. Yale University