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,ad06d2d7cb045687
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.222.71 with SMTP id qk7mr13518553pbc.1.1328607536998;
        Tue, 07 Feb 2012 01:38:56 -0800 (PST)
Path: 
 lh20ni269991pbb.0!nntp.google.com!news2.google.com!news.glorb.com!feeder.erje.net!news.mixmin.net!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Silly and stupid post-condition or not ?
Date: Tue, 7 Feb 2012 10:38:07 +0100
Organization: cbb software GmbH
Message-ID: <151veva0p7hlu$.1p73kv6w39feh$.dlg@40tude.net>
References: <op.v8w6ptk5ule2fv@douda-yannick>
 <82wr86fzos.fsf@stephe-leake.org>
 <5af407fc-2868-44ca-84d2-c51a2a64104d@o4g2000pbc.googlegroups.com>
 <82k445fu9n.fsf@stephe-leake.org> <jgfjc4$u4b$1@munin.nbi.dk>
 <MPG.29972ec7befb6ae9989682@news.zen.co.uk> <jgl70g$l9i$1@munin.nbi.dk>
 <MPG.299868e7ebbd43b1989683@news.zen.co.uk> <jgq0so$7o1$1@munin.nbi.dk>
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-02-07T10:38:07+01:00
List-Id: <comp.lang.ada>

On Mon, 6 Feb 2012 20:05:04 -0600, Randy Brukardt wrote:

>> (Personally I wouldn't want to write a compiler at all .....)
> 
> Well, there's the problem. :-) Real programmers always want to write a 
> compiler (and already have written several). [Not necessarily for a language 
> the size of Ada, though. That requires a form of insanity. ;-)]

Actually it would be very interesting to be able to write a compiler using
proofs.

Due to combinatorial explosion of variants, it is impossible to test a
compiler properly, especially its back-end with regard to optimization and
other switches influencing the outcome. Showing equivalence of programs
would also be extremely useful here.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de