From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.6
Path: eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Adacore joins with Ferrous Systems to support Rust
Date: Wed, 02 Feb 2022 18:20:04 -0800
Organization: A noiseless patient Spider
Message-ID: <8735l0zo6j.fsf@nightsong.com>
References: <87o83pzlvm.fsf@nightsong.com> <stdvgv$76k$1@gioia.aioe.org>
	<87bkzpyqx3.fsf@nightsong.com> <stfbf5$bvi$1@gioia.aioe.org>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: reader02.eternal-september.org; posting-host="1b28e044a1ccf561961d75bc5f6dbab6";
	logging-data="5669"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+Ob7HCeUOTU+Rslp39/ge1"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/27.1 (gnu/linux)
Cancel-Lock: sha1:dk2gPAgEHDqiRbaz8naaI0JxRg4=
	sha1:uDLHAOExa4UtgHztjKdirVbv+8E=
Xref: reader02.eternal-september.org comp.lang.ada:63459
List-Id: <comp.lang.ada>

"Luke A. Guest" <laguest@archeia.com> writes:
> [Ada vs Rust] Er, try learning both and you'll see?

It's a big effort to become expert at either, let alone both.  Basic or
superficial knowledge isn't helpful for such comparisons.  I've read
"Ada Distilled" (Ada 95 version) but still have no clue understanding
most of the Ada discussions in this newsgroup, so there is a big gap
between basic and advanced knowledge of Ada.

>> system really is more precise than Ada's in general, although it doesn't
> How is it?

>From what I've heard, Rust's type system is similar to Haskell's.
Haskell's type system can verify stuff just by typechecking, that might
be doable in Ada using SPARK and maybe an external proof assistant, but
not with just types.  Example: a red-black tree using Haskell GADT's
(Generalized Algebraic Data Types):

https://www.reddit.com/r/haskell/comments/ti5il/redblack_trees_in_haskell_using_gadts_existential/

> Ada's ahead in most things.

Idk, I'd like to know more.  I've never done anything serious in Ada and
nothing at all in Rust, but C++ seems a lot more fluid than Ada, and
Rust is supposed to compare well with C++.  C++ of course is terrible in
terms of reliability but I'm only referring to the effort needed to bang
out a chunk of code.