[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: why is tree-shaking hard?

To: info-mcl@digitool.com
Subject: Re: why is tree-shaking hard?
From: mj@cs.brown.edu (Mark Johnson)
Date: 15 Mar 1995 20:15:20 GMT
Organization: Brown University
References: <DAVIS.95Mar14124022@passy.ilog.fr>, <3k6u6u$k42@kernighan.cs.umass.edu>, <ojNmH_y00WBNM3t4pU@andrew.cmu.edu>
Sender: owner-info-mcl@digitool.com

In article <ojNmH_y00WBNM3t4pU@andrew.cmu.edu>,
Steven Ritter  <sr0o+@andrew.cmu.edu> wrote:
>It may be possible to build a Lisp that relies on runtime libraries in
>this way (and, if so, I hope someone does it) but as of now, Lisp is not
>practical in a compound-document world.

It may interest you to know that Chez Scheme for SVR4 (a Unix system)
uses shared libraries to do exactly this.  Very handy on a multi-processor
platform!

Mark



-- 
Mark Johnson
Cognitive and Linguistic Sciences, Box 1978
Brown University, Providence, RI 02912 
(401) 863 1670, fax (401) 863 2255

References:
- Re: why is tree-shaking hard?
  - From: davis@ilog.fr (Harley Davis)
- Re: why is tree-shaking hard?
  - From: eliot@cs.umass.edu (CHRISTOPHER ELIOT)
- Re: why is tree-shaking hard?
  - From: Steven Ritter <sr0o+@andrew.cmu.edu>

Prev by Date: Re: why is tree-shaking hard?
Next by Date: MCL 3.0 Questions
Previous by thread: Re: why is tree-shaking hard?
Next by thread: Re: why is tree-shaking hard?
Index(es):
- Date
- Thread