Re: Question on bounded / unbounded strings

["J-P. Rosen" <rosen@adalog.fr>]

Le 22/09/2016 à 11:53, Dmitry A. Kazakov a écrit :
>> => Bounded_String is the way to go.
> 
> Never. It is very difficult to find cases where
> 
> 1. There is a hard upper bound, so hard that it would be feasible to
> mold it into the type.
> 
> 2. There is no cases where the upper bound implies another type. There
> is nothing in the first name's length that makes first name different
> from the second name. These are just unrelated things.
> 
> The major reason for that is that constraint whatever it be is most
> likely an implementation detail, which type difference is to reflect the
> problem space.
> 
?? I don't follow you here. I may not have been explicit enough, but of
course each type corresponds to a different instantiation of bounded
strings, wich provide different types with unrelated lengths.


-- 
J-P. Rosen
Adalog
2 rue du Docteur Lombard, 92441 Issy-les-Moulineaux CEDEX
Tel: +33 1 45 29 21 52, Fax: +33 1 45 29 25 00
http://www.adalog.fr