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.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From: "Nasser M. Abbasi" <nma@12000.org>
Newsgroups: comp.lang.ada
Subject: Re: How to get Ada to ?cross the chasm??
Date: Thu, 3 May 2018 19:59:03 -0500
Organization: Aioe.org NNTP Server
Message-ID: <pcgb8m$be9$1@gioia.aioe.org>
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>
Reply-To: nma@12000.org
NNTP-Posting-Host: G2uLfO5bcFe5XEkB0XsC5A.user.gioia.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
X-Complaints-To: abuse@aioe.org
User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:52.0) Gecko/20100101
 Thunderbird/52.7.0
X-Notice: Filtered by postfilter v. 0.8.3
Content-Language: en-US
Xref: reader02.eternal-september.org comp.lang.ada:51961
Date: 2018-05-03T19:59:03-05:00
List-Id: <comp.lang.ada>

On 5/2/2018 5:28 PM, Paul Rubin wrote:

> Here's a complete Haskell program for printing the first 20 prime
> numbers, using cyclic data (what you call "spaghetti"):
> 
>      main = print . take 20 . sieve $ [2..] where
>        sieve (p:xs) = p : sieve [a | a <- xs, a`rem`p /= 0]
> 

fyi, Here is the equivalent Mathematica program

          Prime[Range[20]]

which gives

{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
53, 59, 61, 67, 71}

Shorter, and much easier to understand :)

Mathematica is higher level language, so in a way, the whole
program of prime is build-into the language.

--Nasser