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=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.ada
Subject: Re: How to get Ada to ?cross the chasm??
Date: Wed, 09 May 2018 00:23:23 -0700
Organization: A noiseless patient Spider
Message-ID: <87bmdp47is.fsf@nightsong.com>
References: <1c73f159-eae4-4ae7-a348-03964b007197@googlegroups.com>
	<pc8l7e$km5$1@franka.jacob-sparre.dk> <87in88m43h.fsf@nightsong.com>
	<cd866ee8-ad4d-489e-a38b-d8e5f5d4af00@googlegroups.com>
	<87efiuope8.fsf@nightsong.com> <pcdagp$7pn$1@franka.jacob-sparre.dk>
	<87lgd1heva.fsf@nightsong.com> <pcg54t$gul$1@franka.jacob-sparre.dk>
	<87zi1gz3kl.fsf@nightsong.com> <pciqcd$ou1$1@franka.jacob-sparre.dk>
	<878t8x7k1j.fsf@nightsong.com> <fl7t0uF410rU1@mid.individual.net>
	<pcmjao$1soj$1@gioia.aioe.org> <fl8lgcF9dqgU1@mid.individual.net>
	<pcnem2$19mn$1@gioia.aioe.org> <fl938cFchk8U1@mid.individual.net>
	<pcnqgm$1tb4$1@gioia.aioe.org> <87k1sg2qux.fsf@nightsong.com>
	<pcov1b$1cvt$1@gioia.aioe.org> <flej4mFjjs4U1@mid.individual.net>
	<pct5qu$el7$1@gioia.aioe.org>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: reader02.eternal-september.org;
 posting-host="a15f8e13c869a4517dec92123a650d01";
	logging-data="9131"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX1+xCUuWugvQVUMlz7A8yXRr"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.3 (gnu/linux)
Cancel-Lock: sha1:f0VJetqlN959j8tpkfwPaAUbQPg=
	sha1:kMyenpRdXwOjqEqWijiD9x+w/+k=
Xref: reader02.eternal-september.org comp.lang.ada:52147
Date: 2018-05-09T00:23:23-07:00
List-Id: <comp.lang.ada>

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> writes:
> Yes, but my argument is that it only hides the logical error. The
> reference that is semantically weak acts as a strong one preventing
> collection of an unused object. Circular references are never right.

I don't see the issue here.  Circular linked lists are a venerable data
structure of which there are many assembly code examples in Knuth vol 1
from the 1960s.  Similarly, graphs are data and some of them have
cycles.  Some algorithms might have trouble with cyclic data, but others
handle it ok.