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,587e0e0a16d65b10
X-Google-Attributes: gid103376,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news2.google.com!news1.google.com!npeer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!nntp.club.cc.cmu.edu!195.114.241.41.MISMATCH!feeder.news-service.com!feeder4.cambrium.nl!feed.tweaknews.nl!193.141.40.68.MISMATCH!npeer.de.kpn-eurorings.net!npeer-ng2.de.kpn-eurorings.net!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Thu, 26 Feb 2009 01:52:34 +0100
From: Georg Bauhaus <rm.tsoh.plus-bug.bauhaus@maps.futureapps.de>
Reply-To: rm.tsoh+bauhaus@maps.futureapps.de
User-Agent: Thunderbird 2.0.0.19 (Windows/20081209)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Invade wikipedia!
References: <l6k0og.o0o.ln@hunter.axlog.fr>
 <49a415c4$0$32675$9b4e6d93@newsspool2.arcor-online.net>
 	<08cbf95f-1a72-4a93-8c21-55b1411b6608@j12g2000vbl.googlegroups.com>
 	<49a47c51$0$30227$9b4e6d93@newsspool1.arcor-online.net>
 <f0d14faf-29a9-484b-8705-591f6a439340@i38g2000yqd.googlegroups.com>
In-Reply-To: 
 <f0d14faf-29a9-484b-8705-591f6a439340@i38g2000yqd.googlegroups.com>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
Message-ID: <49a5e7d4$0$31337$9b4e6d93@newsspool4.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 26 Feb 2009 01:52:36 CET
NNTP-Posting-Host: 01f66b2b.newsspool4.arcor-online.net
X-Trace: 
 DXC=Z=o]8RPU2e>;]cDoEWD6A44IUK<Cl32<14Fo<]lROoR1^YC2XCjHcb9G8jFOKO>H_8A:ho7QcPOV3AU;JQnh`]9;Y=LY_AGY4@=
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:4778
Date: 2009-02-26T01:52:36+01:00
List-Id: <comp.lang.ada>

Hibou57 (Yannick Duch�ne) wrote:

>>> If this kind of pseudo code was suffiscient to really and precisely
>>> express algorithms, it would be a real language.
>> Pseudo code of the kind in question is a real language.
>> By analogy, no one writes Turing machine programs in
>> commercial applications[***]. Still, his fictional(!)
>> machine is entirely programmed using "pseudo code"[****].
>> A Turing machine is defined precisely and
>> its languages are real programming languages.
> When I read you, I'm thinking about something like LISP. Is that Ok if
> got this image in mind ?

The gist of it is that there is a sufficiently small
and simple language and machine model to work with.

Maybe SPARK minus the annotation language plus
I/O, recursion, and named pointers is a good one?