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 X-Google-Thread: 103376,21960280f1d61e84 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!postnews.google.com!v33g2000cwv.googlegroups.com!not-for-mail From: "Harald Korneliussen" Newsgroups: comp.lang.ada Subject: Re: How come Ada isn't more popular? Date: 25 Jan 2007 00:27:58 -0800 Organization: http://groups.google.com Message-ID: <1169713678.841150.214760@v33g2000cwv.googlegroups.com> References: <1169531612.200010.153120@38g2000cwa.googlegroups.com> <1169588206.234714.312650@k78g2000cwa.googlegroups.com> <1169624573.534128.172610@s48g2000cws.googlegroups.com> <3CLth.75328$wP1.8787@newssvr14.news.prodigy.net> NNTP-Posting-Host: 213.184.192.82 Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Trace: posting.google.com 1169713684 14936 127.0.0.1 (25 Jan 2007 08:28:04 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 25 Jan 2007 08:28:04 +0000 (UTC) In-Reply-To: <3CLth.75328$wP1.8787@newssvr14.news.prodigy.net> User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; nb-NO; rv:1.8.1.1) Gecko/20061204 Firefox/2.0.0.1,gzip(gfe),gzip(gfe) Complaints-To: groups-abuse@google.com Injection-Info: v33g2000cwv.googlegroups.com; posting-host=213.184.192.82; posting-account=5vUApw0AAADF5Kx_4-L9ZPdL9lZywYoQ Xref: g2news2.google.com comp.lang.ada:8536 Date: 2007-01-25T00:27:58-08:00 List-Id: Richard Riehle wrote: > The type model of Ada does enhance expressiveness since it allows a > lot of extensions. There are certainly things I would do differently in > that type system, and future languages will come along that improve on > Ada. At present, that has not happened -- certainly not with a type > model that I like. Just wondering, what do you think is the problem with H-M-type systems, like ML and Haskell use? It seems to me they are a wonderful tool for extending the type system to check properties at compile time that would otherwise have to be checked at run time. I recently read about an XML combinator library for Haskell that some researcher had written that ensured that only valid XML could be generated - and it guaranteed this at compile time!