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 X-Google-Thread: 103376,ab1d177a5a26577d X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII Path: g2news1.google.com!news4.google.com!proxad.net!feeder1-2.proxad.net!194.25.134.126.MISMATCH!newsfeed01.sul.t-online.de!t-online.de!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail From: "Dmitry A. Kazakov" Subject: Re: What's wrong with C++? Newsgroups: comp.lang.ada User-Agent: 40tude_Dialog/2.0.15.1 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit Reply-To: mailbox@dmitry-kazakov.de Organization: cbb software GmbH References: <1ee1a434-4048-48f6-9f5e-d8126bebb808@r19g2000prm.googlegroups.com> <17coueqbf1p27.1g0wj3010saxe$.dlg@40tude.net> Date: Fri, 18 Feb 2011 10:41:11 +0100 Message-ID: <1mo4loux3m4yq$.19tu64gyz8yt2.dlg@40tude.net> NNTP-Posting-Date: 18 Feb 2011 10:41:12 CET NNTP-Posting-Host: f3aef99a.newsspool3.arcor-online.net X-Trace: DXC=J5cU;e8bAF=^8FBo0_81f>McF=Q^Z^V384Fo<]lROoR18kF[ On Thu, 17 Feb 2011 20:34:03 +0100, Yannick Duch�ne (Hibou57) wrote: > Le Thu, 17 Feb 2011 17:12:37 +0100, Dmitry A. Kazakov > a �crit: >> The third note is that if inferred, then why should we care of types? > No, you have to care, and you still define types. You just don't have to > be so much redundant as you would be with, say, Ada. I didn't mean redundancy, I did a meta language that binds the program to its application domain. In Ada it is largely the type system. Without types what takes its place? > This is required with > functional language where you do not use side-effect (there may be some > side effect in SML which is not stricly pure, but you may not use side > effects as long as you don't want), where function returns rather complex > types and get numerous parameters which are as much complexes. Without > type inference... functional program texts would simply be an unreadable > mess (:-)) And with type inference they still are. (:-)) >> Now the main objection is computability and decidability. Only "simple" >> things can be inferred. The compiler cannot solve problems beyond >> Turing-completeness. > Actually, SML interpreters are required to complain if ever that occurs, Occurs what? The point is that you fundamentally cannot infer some things, and there is no way even to infer that these things exist or need to be inferred. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de