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.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: =?UTF-8?B?QmrDtnJuIEx1bmRpbg==?= Newsgroups: comp.lang.ada Subject: Re: If not Ada, what else... Date: Wed, 29 Jul 2015 19:01:44 +0200 Organization: A noiseless patient Spider Message-ID: References: <06f8a6f9-d219-4d40-b9ac-8518e93839bd@googlegroups.com> <87y4io63jy.fsf@jester.gateway.sonic.net> <7a29d3e9-d1bd-4f4a-b1a6-14d3e1a83a4d@googlegroups.com> <87mvz36fen.fsf@jester.gateway.sonic.net> <2215b44f-8a89-47c6-a4c4-52b74d2dac45@googlegroups.com> <9e492c82-868d-43d3-a18a-38274400e337@googlegroups.com> <40184feb-4053-4ac3-8eaa-c3bd9cd8a77c@googlegroups.com> <10272577-945f-4682-85bc-8ad47f3653ae@googlegroups.com> <87si8i81k2.fsf@atmarama.net> <8076cbd0-2655-4c98-b70e-cb5f0c32e4ba@googlegroups.com> <5e6cb30b-5f8c-4fed-969e-3941315ecba0@googlegroups.com> <87si87nf8k.fsf@jester.gateway.sonic.net> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 8bit Injection-Date: Wed, 29 Jul 2015 16:58:25 +0000 (UTC) Injection-Info: mx02.eternal-september.org; posting-host="0ab8e511d6c2639fe68122da9aae2e08"; logging-data="9603"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/QXEXVuLd+DDEUecGwudz8" User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Icedove/31.7.0 In-Reply-To: <87si87nf8k.fsf@jester.gateway.sonic.net> Cancel-Lock: sha1:8ODeiG0odn1G4yBNmn+G1VSYWoI= Xref: news.eternal-september.org comp.lang.ada:27131 Date: 2015-07-29T19:01:44+02:00 List-Id: On 2015-07-29 17:41, Paul Rubin wrote: > > 2) recurring abstractions like dynamically > growable lists, strings, dictionaries, etc. might be doable in Ada but > are built into Haskell, Python, etc. See Ada.Containers.* > Or even simpler: print a list of the first 100 primes. This is 3 lines > of code in Haskell, see the illustration at the top of www.haskell.org . > > Here is an exercise that is easy in Haskell but surprisingly tedious in > languages like Ada: a number is "5-smooth" or "Hamming" if it has no > prime factors greater than 5. So 10, 12, and 15 are 5-smooth but 11, > 13, and 14 are not. The first 20 Hamming numbers are: > > [1,2,3,4,5,6,8,9,10,12,15,16,18,20,24,25,27,30,32,36] > > I was going to ask for the millionth such number, but you need arbitrary > precision arithmetic for it. So, what is the 10000th such number? That > one fits in 64 bits, but is not really feasible to reach by counting. > They look really mathematical. Haskell territory ? How is Haskell doing in Ada territory, like concurrency etc ? -- Björn