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

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

Le Tue, 30 Apr 2013 02:31:37 +0200, Yannick Duchêne (Hibou57)  
<yannick_duchene@yahoo.fr> a écrit:

> Le Sun, 28 Apr 2013 07:14:15 +0200, Yannick Duchêne (Hibou57)  
> <yannick_duchene@yahoo.fr> a écrit:
>> As an additional aside but related question, I'm also interested in the  
>> question in the particular context of storage‑pools, which use tagged  
>> types instead of simple sub‑program designated by some attributes or  
>> operator overloading (I imagine simple sub‑programs could have been an  
>> option for the `new` operator, just like for the other operators).
>
> Same question in the context of `Ada.Finalization`. Similar semantic  
> could have been made available without requiring tagged types.
>

I also looked at the RM about user‑defined indexing, and could not find a  
reason why it is legal for tagged types only. May be I will understand a  
future day why it requires a tagged type, so far, it makes me feel it's  
lacking orthogonality.

Or else, may be it suggest types should rather be tagged by default but  
the primitives ones or derived from the primitive ones.


-- 
“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