From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=0.1 required=3.0 tests=BAYES_00,DEAR_SOMETHING
	autolearn=no autolearn_force=no version=3.4.5-pre1
Date: 10 Sep 93 18:08:14 GMT
From: pipex!sunic!news.lth.se!dag@uunet.uu.net  (Dag Bruck)
Subject: Re: Hoare's gripes about Ada (should be so what)
Message-ID: <26qfqe$p4m@nic.lth.se>
List-Id: <comp.lang.ada>

In <comp.lang.ada> dewar@cs.nyu.edu (Robert Dewar) writes:
>.... I have to report to you that in the Ada world, we are quite
>interested in correct reliable programs.
>
>Consequently, I am afraid that the judges will have to reject your 
>submission in the "shortest search contest". 

Dear Sirs,

I kindly ask you to reconsider my submission with the following
motivation.

I claim that my program is intuitively and _provably_ correct for a
semi-infinite number of inputs, i.e., those already sorted.  I also
hope that the structure of my program lends itself to automated
correctness proving.  This is a in my view a great asset over many
other algorithms that are very hard, or impossible, to _prove_
correct.

You should also take into consideration the significant practical
advantages of the code:

	- easy to understand
	- fits on one page
	- easy to maintain
	- runtime efficient

Sorting routine follows:

	.... IS
	    NULL;
	END;

Best regards,


Dag M. Bruck
C++ programmer, LSD is no fun