p://ftp.cs.cmu.edu/afs/cs.cmu.edu/user/shivers/lib/papers/diss.ps.Z"
>higher-order
control-flow analysis</a>, type
inference, automated theorem proving, partial evaluation, escape
analysis, and so on.  Ur-Scheme doesn't do any of those things.
(Well, actually, it does do a little bit of escape analysis.)  In
fact, Ur-Scheme doesn't even do <i>register allocation</i>, and it
does full dynamic type checking at run-time.  I imagine that if you
wanted to get performance only 2 or 3 or 4 times worse than C compi