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!feeder.eternal-september.org!news.unit0.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: Niklas Holsti <niklas.holsti@tidorum.invalid>
Newsgroups: comp.lang.ada
Subject: Re: How to get Ada to ?cross the chasm??
Date: Tue, 8 May 2018 23:44:34 +0300
Organization: Tidorum Ltd
Message-ID: <fleghiFj0qjU2@mid.individual.net>
References: <1c73f159-eae4-4ae7-a348-03964b007197@googlegroups.com>
 <dbcb51b9-8ab9-4d39-bb70-47fdb15ebfd8@googlegroups.com>
 <pb7eii$bf1$1@dont-email.me>
 <b75ad71f-a917-4638-9b38-ccfe69b04e53@googlegroups.com>
 <slrnpdpiv9.ntv.address@is.invalid> <pbr3mi$leu$1@franka.jacob-sparre.dk>
 <87k1su7nag.fsf@nightsong.com> <pbtlno$3k2$1@franka.jacob-sparre.dk>
 <87po2la2qt.fsf@nightsong.com> <87in8buttb.fsf@jacob-sparre.dk>
 <87wowqpowu.fsf@nightsong.com>
 <16406268-83df-4564-8855-9bd0fe9caac0@googlegroups.com>
 <87o9i2pkcr.fsf@nightsong.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>
Mime-Version: 1.0
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: individual.net ll545l9LVxh2E2G8PROmQAoFZBeOFT+HnwmAVcLp5lRJQVBzqz
Cancel-Lock: sha1:yc20ujt7Nb3zd2YaokDjNcI81Zk=
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:45.0)
 Gecko/20100101 Thunderbird/45.8.0
In-Reply-To: <87zi1gz3kl.fsf@nightsong.com>
Xref: reader02.eternal-september.org comp.lang.ada:52125
Date: 2018-05-08T23:44:34+03:00
List-Id: <comp.lang.ada>

On 18-05-04 03:07 , Paul Rubin wrote:
> "Randy Brukardt" <randy@rrsoftware.com> writes:
>> I don't see anything "cyclic" or "self-referential" here. This is just a set
>> of lists, and there is nothing particularly interesting about them (in
>> partcular, there are *no* references involved in a list unless you need to
>> keep a reference to a particular element, certainly doesn't happen here).
>
> This list contains a reference to itself:
>
>     x = 1 : 2 : 3 : x

Can you construct such a list in Haskell without using and setting 
explicit references? I know very little about Haskell, but I can't see 
how it could be done using just functions and applications. Is there 
some kind of "letrec" for recursive data objects (as opposed to 
recursive functions)?

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .