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,b78c363353551702 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.68.220.230 with SMTP id pz6mr3021630pbc.3.1341324366517; Tue, 03 Jul 2012 07:06:06 -0700 (PDT) Path: l9ni10736pbj.0!nntp.google.com!news2.google.com!goblin3!goblin1!goblin2!goblin.stu.neva.ru!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: about the new Ada 2012 pre/post conditions Date: Tue, 3 Jul 2012 16:06:12 +0200 Organization: cbb software GmbH Message-ID: <183wlkgrg23ks.klpbrem5pi5j$.dlg@40tude.net> References: <1oih2rok18dmt.avbwrres5k12.dlg@40tude.net> <4fe59ea0$0$9502$9b4e6d93@newsspool1.arcor-online.net> <1mkp7fzlk1b0y.1ueinfjn48fcy$.dlg@40tude.net> <4fe72b6b$0$9504$9b4e6d93@newsspool1.arcor-online.net> <1bbvp3ghpjb5s.1go1s1qvcmagh$.dlg@40tude.net> <4fe76fad$0$9507$9b4e6d93@newsspool1.arcor-online.net> <1jt8vhzxfrv2i.eohce4d3rwx1$.dlg@40tude.net> <4fe83aaa$0$6624$9b4e6d93@newsspool2.arcor-online.net> <1pkfv0tiod3rn$.onx6dmaa3if9$.dlg@40tude.net> <1i1mp8xs3vtl2.1oc4m66qtfgzq.dlg@40tude.net> <4ff2f831$0$6566$9b4e6d93@newsspool3.arcor-online.net> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: FbOMkhMtVLVmu7IwBnt1tw.user.speranza.aioe.org Mime-Version: 1.0 X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Date: 2012-07-03T16:06:12+02:00 List-Id: On Tue, 03 Jul 2012 15:48:32 +0200, Georg Bauhaus wrote: > Yes. Normal program design can hope to get close to a primitive > recursive programming process. If you look how iterative solutions of optimization problems work, you will notice that the goal function is a *function*. Looking from this angle the program P under design is a point in the space of possible programs. The goal function g takes P as an argument. P cannot compute g, it is an argument of. Design process needs g() upfront, which we all know as an empiric rule: you better know what you are going to write. Even such notably poor practices as TDD don't go that far as you would go by putting g into P. TDD keeps g outside P as a set of external test programs. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de