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,99ab4bb580fc34cd X-Google-Attributes: gid103376,public From: jsa@organon.com (Jon S Anthony) Subject: Re: Q: access to subprogram Date: 1996/07/09 Message-ID: #1/1 X-Deja-AN: 167462639 sender: news@organon.com (news) references: <4rb9dp$qe6@news1.delphi.com> organization: Organon Motives, Inc. newsgroups: comp.lang.ada Date: 1996-07-09T00:00:00+00:00 List-Id: In article <4rr5tu$sap@watnews1.watson.ibm.com> ncohen@watson.ibm.com (Norman H. Cohen) writes: > (By the way, I share Bob Duff's amazement at the noninclusion of downward > closures--we called them downward at the time--in Ada 95, and I say this > as one of those Bob described as urging the removal rather than the > addition of proposed Ada-95 features. I viewed the inclusion of downward > closures as the REMOVAL of an arbitrary restriction. The decision was > not made in ignorance. Bill Taylor had made what I considered an > irrefutable case for downward closures, showing how much easier it would > be to write iterators if downward closures were allowed. It came down to > a conflict between the interests of Ada programmers and the interests of > a minority of Ada implementors, and in this case the interests of the few > implementors using displays prevailed.) While the lack of direct support for recursive types across package boundaries and lack of assertions are more important (IMO) goofs, and while the evinced reasons for the latter one are mind numbingly incomprehensible, this latest example would appear to take the crown for the most stupefying goof. Just amazing... /Jon -- Jon Anthony Organon Motives, Inc. 1 Williston Road, Suite 4 Belmont, MA 02178 617.484.3383 jsa@organon.com