From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Received: by 2002:a6b:c382:: with SMTP id
 t124-v6mr6275533iof.43.1527914630864;
        Fri, 01 Jun 2018 21:43:50 -0700 (PDT)
X-Received: by 2002:a9d:5608:: with SMTP id e8-v6mr72157oti.5.1527914630762;
 Fri, 01 Jun 2018 21:43:50 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!news.uzoreto.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!u74-v6no2749373itb.0!news-out.google.com!f20-v6ni1680itd.0!nntp.google.com!v8-v6no2741489itc.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Fri, 1 Jun 2018 21:43:50 -0700 (PDT)
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=76.113.16.86;
 posting-account=lJ3JNwoAAAAQfH3VV9vttJLkThaxtTfC
NNTP-Posting-Host: 76.113.16.86
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <5e86db65-84b9-4b5b-9aea-427a658b5ae7@googlegroups.com>
Subject: Ada Successor Language
From: Shark8 <onewingedshark@gmail.com>
Injection-Date: Sat, 02 Jun 2018 04:43:50 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Xref: reader02.eternal-september.org comp.lang.ada:52847
Date: 2018-06-01T21:43:50-07:00
List-Id: <comp.lang.ada>

	It occurs to me that in order to design a successor to Ada, there=E2=80=99=
s not merely one language that ought to be defined =E2=80=94 but five =E2=
=80=94 and the reason is that Ada is several languages all at once: there=
=E2=80=99s a language for generics, a language for proofs [SPARK], low-leve=
l hardware, and a language for tasking in addition to the Ada that maps to =
=E2=80=9Cnormal=E2=80=9D programming languages.
	One of the frustrations about Ada as-it-is is that there is a lot that see=
ms like it could be =E2=80=9Cfolded together=E2=80=9D, things like (eg) all=
 the Ada.[Wide_[Wide_]]Strings packages. Or, some sort of mechanism for [ex=
plicitly] showing the relationships between types.
	In order to do that we would need some sort of meta-language, wherein all =
the rest of the languages (ideally both syntactic and semantic) could be de=
fined.

(1)	The Meta language
(2)	The Generic Language
(3)	The Concurrent/Parallelism language
(4)	The Proving language [SPARK]
(5)	The HW/Representation language

----------
Your thoughts?