Re: Ada Successor Language

[Shark8 <onewingedshark@gmail.com>]

On Monday, June 18, 2018 at 4:23:41 PM UTC-6, Dmitry A. Kazakov wrote:
> On 2018-06-18 23:20, Shark8 wrote:
> > On Monday, June 18, 2018 at 2:45:39 PM UTC-6, Niklas Holsti wrote:
> >> On 18-06-18 23:22 , Jeffrey R. Carter wrote:
> >>> On 06/18/2018 09:16 PM, Niklas Holsti wrote:
> >>>>
> >>>> Nah... invites "Ada'Succ sucks".
> >>>
> >>> Also, in Ada, Ada'Succ is not the successor of Ada.
> >>
> >> But perhaps the successor language will let us write X'Succ as an
> >> abbreviation of X_Type'Succ(X) ... similarly to the recent introduction
> >> of X'Image.
> > 
> > I'd honestly like the ability to use X'Type; this would allow us to say something like this:
> > 
> > Procedure Swap( A, B : in out Some_Type ) is
> >    Temp : Constant B'Type := B;
> > Begin
> >    B:= A;
> >    A:= Temp;
> > End Swap;
> > 
> > Yeah, I know, it's a little thing and you can do it with generics, etc. But that's not entirely the point, the point is that this allows the declaration of types dependent on objects... it provides some of the niceties of type-inference without having to resort to such lazy/possibly-error-prone methodologies.
> 
> It is not a little thing. It requires classes for all types.

No, it doesn't.
A 'Type attribute could simply mean "the [sub]type of this object", and thereby given "A : Positive" we know that A'Type is positive, statically, at compile time, and without any notion of classes.

> 
> Then all types with assignment (non-limited types) will be members of 
> the class Not_Limited [*]. E.g.
> 
>     type Integer is ... and Not_Limited;
>     type String  is ... and Not_Limited;
>     ...

Why would they need to have a Not_Limited class? We already know they're not limited from the type declaration "Type Integer is new System.Integer;"...
We can currently use the generic-language "type T (<>) is abstract tagged limited private;" to specify "Any tagged type, abstract or concrete, limited or not."


> Then you could write a class-wide Swap:
> 
>     procedure Swap (A, B : in out Not_Limited'Class) is
>        Temp : constant Not_Limited'Class := B;
>     begin
>        B := A;
>        A := Temp;
>     end Swap;
> 
> -----------------------------
> * You must also deal with type cloning, so that
> 
>     type X is new Integer;
> 
> will get its own copy of the Not_Limited class. I.e. the whole type tree 
> must be copied. It is not a little thing.

Why would it need a Not_Limited class? It looks like you're trying to combine regular "Interface" with the attributes-and-classification of the type.