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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,330ec86e1824a689
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-08-28 06:56:12 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!news-out.cwix.com!newsfeed.cwix.com!news.binc.net!kilgallen
From: Kilgallen@SpamCop.net (Larry Kilgallen)
Newsgroups: comp.lang.ada
Subject: Re: Run-Time Type Assignment
Date: 28 Aug 2002 08:56:09 -0600
Organization: LJK Software
Message-ID: <VsGQTT8PXH3v@eisner.encompasserve.org>
References: <mailman.1030517642.16877.comp.lang.ada@ada.eu.org>
 <5ee5b646.0208280304.614d11fc@posting.google.com>
 <wccvg5vhzsp.fsf@shell01.TheWorld.com>
NNTP-Posting-Host: eisner.encompasserve.org
X-Trace: grandcanyon.binc.net 1030541894 22519 192.135.80.34 (28 Aug 2002
 13:38:14 GMT)
X-Complaints-To: abuse@binc.net
NNTP-Posting-Date: Wed, 28 Aug 2002 13:38:14 +0000 (UTC)
Xref: archiver1.google.com comp.lang.ada:28494
Date: 2002-08-28T08:56:09-06:00
List-Id: <comp.lang.ada>

In article <wccvg5vhzsp.fsf@shell01.TheWorld.com>, Robert A Duff <bobduff@shell01.TheWorld.com> writes:
> dewar@gnat.com (Robert Dewar) writes:
> 
>> it is of course the case that anything you can do in Pascal
>> can easily be done in Ada
> 
> downward closures

What is a downward closure ?

> tagless variant records