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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,2ea02452876a15e1
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Real OO (was Choice of OO primitives in Ada95)
Date: 1996/02/24
Message-ID: <Dn970I.7w5@world.std.com>#1/1
X-Deja-AN: 140857417
references: <199602221711.SAA18350@email.enst.fr>
 <yrgg2c3dmz1.fsf@borniche.rennes.enst-bretagne.fr>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-02-24T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <yrgg2c3dmz1.fsf@borniche.rennes.enst-bretagne.fr>,
Valery Croizier <croizier@rennes.enst-bretagne.fr> wrote:
>If you can simulate Eiffel-like assertions in a trivial way, then
>please show it.

Yes, please do!

>... I know how to check arguments and raise an exception,
>but not so that these checkings are inherited by children, like in Eiffel. 

More importantly, how do you do class invariants in Ada?
The only way I know of, is to put some code in *every*
procedure, which is a pain.

I think that Eiffel's assertions are a pretty nice feature,
especially class invariants, which are hard to do by hand.

- Bob