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=2.1 required=5.0 tests=BAYES_05,INVALID_DATE,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!attcan!uunet!microsoft!jamesth
From: jamesth@microsoft.UUCP (James THIELE)
Newsgroups: comp.lang.ada
Subject: Re: A self reproducing program in Ada
Message-ID: <53671@microsoft.UUCP>
Date: 21 Mar 90 16:48:35 GMT
References: <900319200431.23c00532@SIC.Epfl.CH>
Reply-To: jamesth@microsoft.UUCP (James THIELE)
Organization: Microsoft Corp., Redmond WA
List-Id: <comp.lang.ada>

In article <900319200431.23c00532@SIC.Epfl.CH> madmats%elcgl.epfl.ch@VMA.CC.CMU.EDU (Mats Weber) writes:
>----------------- cut here (non inclusive) ------------------------
>[146 lines of Ada code deleted]
>----------------- cut here (non inclusive) ------------------------
I've seen *much* shorter self-reproducing programs in FORTRAN.

Does this mean FORTRAN is more sophisticated than Ada?

James Thiele -- Standard Disclaimer