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,fef3ad775ef4b0b7
X-Google-Attributes: gid103376,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!feeder.news-service.com!npeer.de.kpn-eurorings.net!npeer-ng2.kpn.DE!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Ada for 1st year students
Newsgroups: comp.lang.ada
User-Agent: 40tude_Dialog/2.0.15.1
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Reply-To: mailbox@dmitry-kazakov.de
Organization: cbb software GmbH
References: 
 <60e0c5f0-1e17-4add-b21e-b1ef622d5233@v13g2000pro.googlegroups.com>
  <6gj2s5-0f9.ln1@newserver.thecreems.com>
 <543356bc-7862-45d2-9004-dfef69deab26@79g2000hsk.googlegroups.com>
 <3m65s5-33u.ln1@newserver.thecreems.com>
 <606df221-6074-4732-b5e7-de74700b3e9a@t41g2000hsc.googlegroups.com>
Date: Sat, 11 Oct 2008 16:46:16 +0200
Message-ID: <158iljyiunpyy$.172hhzc98hoef$.dlg@40tude.net>
NNTP-Posting-Date: 11 Oct 2008 16:46:17 CEST
NNTP-Posting-Host: 9c55503c.newsspool2.arcor-online.net
X-Trace: 
 DXC=[:9=Q;HabDG02Sh8E_NfIAA9EHlD;3YcB4Fo<]lROoRA4nDHegD_]REflN`;\W<\iNDNcfSJ;bb[EIRnRBaCd<MN:Mi^CKWU4KLUnXoBm:E=4A
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:2327
Date: 2008-10-11T16:46:17+02:00
List-Id: <comp.lang.ada>

On Sat, 11 Oct 2008 06:46:36 -0700 (PDT), amado.alves@gmail.com wrote:

> On 11 Out, 01:15, Jeffrey Creem <j...@thecreems.com> wrote:
>> Too OO is an interesting topic.
> 
> It is a fascinating topic :-)

I strongly disagree.
 
> I've ruled out Java immediatly when I saw that a nice imperative
> algorithm must start with

The opposite to "imperative" is "declarative." Typing is an independent
issue.

In my view students should be exposed to typing together with algorithms.

> package public class ... or whatever
> 
> ---nothing to do with the logic of the algorithm.

The logic of any algorithm, except for primitive state machines, has no
meaning without the types of things being computed. A good course should
show this first. After all, using predefined types is bad taste in Ada.

Generations of students become programmers incapable to understand
difference between real, floating-point and fixed-point numbers. Didn't
they start with "nice imperative algorithm," before learning what the
number is?

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