Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!bloom-beacon!LUCID.COM!hbs From: hbs@LUCID.COM (Harlan Sexton) Newsgroups: comp.lang.scheme Subject: dynamic compilation for scheme, with inlining, etc? Message-ID: <8809221854.AA17374@kent-state> Date: 22 Sep 88 18:54:50 GMT References: <19880922144647.6.ACW@ROCKY-MOUNTAINS.S4CC.Symbolics.COM> Sender: daemon@bloom-beacon.MIT.EDU Organization: The Internet Lines: 10 I wouldn't be surprised to find interpreted representations bigger than machine-code. However, you can usually get byte-code to be smaller than machine-code by factors of about 4 to 10 (higher for RISC machines, in my limited experience), so compiling to byte-codes can win. Also, in spite of what someone said, memory is NOT so cheap that it doesn't matter how big the code for an application is, and I can imagine that it will never be so for certain classes of applications. --Harlan