Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!ucsd!ames!hc!lanl!opus!ted
From: ted@nmsu.edu (Ted Dunning)
Newsgroups: comp.sw.components
Subject: Re: Inheritance vs. component efficienc
Message-ID: <TED.89Jun17223624@kythera.nmsu.edu>
Date: 18 Jun 89 04:36:24 GMT
References: <5682@hubcap.clemson.edu> <130200005@p.cs.uiuc.edu>
Sender: news@nmsu.edu
Organization: NMSU Computer Science
Lines: 13
In-reply-to: johnson@p.cs.uiuc.edu's message of 17 Jun 89 23:16:39 GMT


In article <130200005@p.cs.uiuc.edu> johnson@p.cs.uiuc.edu writes:


   You could implement an object-oriented Ada with a preprocessor by 
   rewriting late-bound procedure calls into case statements.  In this case,
   your preprocessor would be automatically maintaining the case statements.

   Ralph Johnson


but doesn't this get directly into the are of language extension?
doesn't this violate the `ada is revealed truth' axiom?