From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: *
X-Spam-Status: No, score=1.1 required=3.0 tests=BAYES_05,REPLYTO_WITHOUT_TO_CC
	autolearn=no autolearn_force=no version=3.4.5-pre1
Path: eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From: "G.B." <bauhaus@notmyhomepage.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Lower bounds of Strings
Date: Tue, 19 Jan 2021 22:02:45 +0100
Organization: A noiseless patient Spider
Message-ID: <ru7hdm$i5h$1@dont-email.me>
References: <1cc09f04-98f2-4ef3-ac84-9a9ca5aa3fd5n@googlegroups.com>
 <c0409256-1edd-4a06-8243-7120ea38b632n@googlegroups.com>
 <rtpiti$hri$1@dont-email.me> <rtpkov$cn0$1@gioia.aioe.org>
 <6450332c-89a8-476d-a112-c98b8bb08009n@googlegroups.com>
 <rtpom9$ca1$1@gioia.aioe.org>
Reply-To: nonlegitur@notmyhomepage.de
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 19 Jan 2021 21:02:46 -0000 (UTC)
Injection-Info: reader02.eternal-september.org; posting-host="5bd3bf3d63992a0e1244c6968dca3a2d";
	logging-data="18609"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18ot8l6LeheoHi6zN3gta/efF24qTkHJDE="
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:78.0)
 Gecko/20100101 Thunderbird/78.6.1
Cancel-Lock: sha1:RSqOuY31TUs7ALF8qc1K5ABP6j4=
In-Reply-To: <rtpom9$ca1$1@gioia.aioe.org>
Content-Language: en-US
Xref: reader02.eternal-september.org comp.lang.ada:61173
List-Id: <comp.lang.ada>

On 14.01.21 16:41, Dmitry A. Kazakov wrote:
>
> That would be a sequential access interface. A common sequence as in mathematics has nth-element random access on top of it.

Mathematical sequences are not real. Their description is:

The finite variants are tuples. Component access is "at random".
The infinite variants tend to be construed so that randomness is a useful fiction;
a program can access an element if successors are produced one by one.
Order exists only after the fact.
The other sequences cannot be computed for the most part.

So, therefore, with regard to what should characterize sequences in
programming, I find sequential access to be the defining feature.

function Whop (S : Sequence) return Sequence with Impure;