Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!uunet!sco!seanf
From: seanf@sco.COM (Sean Fagan)
Newsgroups: comp.lang.misc
Subject: Re: How to make a language downward-extensible?
Message-ID: <8111@scolex.sco.COM>
Date: 9 Oct 90 23:09:25 GMT
References: <7950@scolex.sco.COM> <18718:Oct120:03:0090@kramden.acf.nyu.edu> <7976@scolex.sco.COM> <975:Oct800:52:3590@kramden.acf.nyu.edu>
Sender: news@sco.COM
Reply-To: seanf (Sean Fagan)
Organization: The Santa Cruz Operation, Inc.
Lines: 16


In article <975:Oct800:52:3590@kramden.acf.nyu.edu> brnstnd@kramden.acf.nyu.edu (Dan Bernstein) writes:
>Well, it is a language issue, insofar as the language has to provide
>quickpick (or something like it) in the first place.

No, it doesn't.  It *can*, but it doesn't need to.  The compiler can take a
look at code sections, and decide whether or not it should replace the code
with completely different algorithms.  See "The SuperOptimizer" for some
reality.

-- 
-----------------+
Sean Eric Fagan  | "Never knock on Death's door:  ring the bell and 
seanf@sco.COM    |   run away!  Death really hates that!"
uunet!sco!seanf  |     -- Dr. Mike Stratford (Matt Frewer, "Doctor, Doctor")
(408) 458-1422   | Any opinions expressed are my own, not my employers'.