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: border1.nntp.dca3.giganews.com!backlog3.nntp.dca3.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!feeder.erje.net!eu.feeder.erje.net!news.ecp.fr!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Your wish list for Ada 202X Date: Sat, 12 Apr 2014 11:38:57 +0200 Organization: cbb software GmbH Message-ID: <1126zcuq75dmc.1pgvr5xlvkxp5$.dlg@40tude.net> References: <7f1c01c5-3563-4b94-9831-152dbbf2ecdc@googlegroups.com> <8bhozh836pyt$.1qctlysud0s2q$.dlg@40tude.net> <1cdsyxjzsfgzm.1synpaujysv21$.dlg@40tude.net> <1aa804jg9qq4o$.wdiq33yo621l.dlg@40tude.net> <1w6eh0aiksmdh$.1h16p7y0b8c6h.dlg@40tude.net> <17twpp4p8u7o$.1idvzaaio4f3t$.dlg@40tude.net> <1wjmcbk375lzk.6o7dpqcp3va3.dlg@40tude.net> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: AuYlnUSfTZrfhAkRjyySpQ.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 X-Original-Bytes: 3155 Xref: number.nntp.dca.giganews.com comp.lang.ada:185696 Date: 2014-04-12T11:38:57+02:00 List-Id: On Sat, 12 Apr 2014 03:39:44 -0500, Nasser M. Abbasi wrote: > On 4/12/2014 3:20 AM, Dmitry A. Kazakov wrote: > >> I need a language for software engineering. More static checks, >> more means to make static checks possible. The whole language should >> revolute around helping restructuring my programs in order to support >> static checks. No Constraint_Error to me, please! > > New languages seems to be all going the other way? They are going nowhere. There were no new language ideas for decades. > In Julia, the way I understand it, when defining a function > with some signature, then a compiled instance of this function > is made for all the possible primitive types (int16, int32, > real32, real64, etc...) Is made by whom? > and when the program is run, > the run-time automatically dispatches to the correct matching > function based on the argument used at time the call is made. Really? What is the "correct matching" function of int16/real32? Can I have real_bounded_interval_64? What would be int16/real_bounded_interval_64? Who does linear system equation resolution function for int16? The idea that there exist "primitive" and "non-primitive" types is garbage. The idea that any operation is applicable to any type is garbage. > Those good old fashioned, strong static type checking > at compile time computer languages, seem like, well, old > fashioned these days. If even members of ARG seem not to believe in merits of strong typing or whatever typing... -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de