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 Newsgroups: comp.lang.ada Subject: Re: How to get Ada to ?cross the chasm?? Date: Tue, 01 May 2018 17:23:05 -0700 Organization: A noiseless patient Spider Message-ID: <87in86oqhi.fsf@nightsong.com> References: <1c73f159-eae4-4ae7-a348-03964b007197@googlegroups.com> <87k1su7nag.fsf@nightsong.com> <87po2la2qt.fsf@nightsong.com> <87in8buttb.fsf@jacob-sparre.dk> <87wowqpowu.fsf@nightsong.com> <16406268-83df-4564-8855-9bd0fe9caac0@googlegroups.com> <87o9i2pkcr.fsf@nightsong.com> <87bme2oy91.fsf@nightsong.com> <877eoom26h.fsf@nightsong.com> <87y3h3lpel.fsf@nightsong.com> <41092874-0561-43f3-8f94-23886cb002cb@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="c542ccd1be7cc45dffb8a8de81e34fd0"; logging-data="21593"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/hv/PcfzlnU4gMKgTpIXow" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.3 (gnu/linux) Cancel-Lock: sha1:b0NW2JOgIVLzfyqEtBADIYqDu9k= sha1:58J92BUc99SX+Jf8bgzirxEweOY= Xref: reader02.eternal-september.org comp.lang.ada:51904 Date: 2018-05-01T17:23:05-07:00 List-Id: "Dan'l Miller" writes: > I would jettison as much of Ada1983 (lacking OO!) as possible, > focusing instead on Ada1995 (with OO!) if you absolutely must narrow > to one edition. In the functional-programming world we tend to think of OO as a failed 1990s experiment that still has a zombie following in the "enterprise" sector. Even C++ has moved mostly from OO to template generics. > rather a 1000-page encyclopedia of Ada-by-recipes... : > 1) here are smart pointers in C++2017, but here is better memory > management in Ada2012; > 2) here is spooky mistake-making type inference in other languages... This would be great to see. Rosettacode.org might be a good place to put some examples. There's lots of Ada code there already that mostly looks ok, but I don't remember any that really stand out. > especially to lambasting Python/Ruby/Lua/Haskell/ML/F#/C#/Java/Kotlin > on performance via actual empirical timing measurements on > analogously-designed implementations in those languages versus Ada. That will persuade almost nobody using those languages, since they are primarily writing internet stuff. We just don't care how slow the languages are. Any query you make over the internet will require at least a 100 msec communication roundtrip, plus whatever the computation time is. If Ada can do the computation in 20 microseconds while Python takes a whole millisecond, the user will never notice that 50x slowdown. And the developer is happy to take the slowdown in order to ship their product a week earlier. Obviously there are exceptions and bottlenecks but those are correctly handled as special cases. The old 90-10 rule is now more like 95-5 or even 99-1. See: https://cr.yp.to/talks/2015.04.16/slides-djb-20150416-a4.pdf > that youth will find attractive, because it is like a bound book form > of StackOverflow. Even an oldie like me doesn't look at bound books that much any more. I doubt many young'uns even know what they are. If it's not online it doesn't exist.