Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a2353f4e0eca90ce

Jump to content

Talk:CMU Common Lisp

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 20 years ago by BlakeStone in topic "there is no interpreter"?

"there is no interpreter"?

[edit]

I think whoever wrote this was thinking of SBCL. CMUCL compiles to interpreted bytecode as well as native code; SBCL doesn't have bytecode. I don't think the CMUCL bytecode is used for much(I don't have the manual handy, and the site is down.), but it does exist.

Aha, here's the part I was looking for:Byte Coded Compilation--BlakeStone 01:43, 12 August 2005 (UTC)Reply

Numerical performance

[edit]
And it's not just non-assignment based functional languages where you can see supposedly less-efficient high level languages crushing the performance of C/C++. CMU CommonLisp can beat C/C++ on numeric code. There was a paper a few years back documenting it: using a Sun SPARC workstation, if you use the optional type declarations, and write scientific/numeric code in Lisp, using vectors (Lisp arrays) and assignments to implement exactly the same algorithm as C, the CMU CommonLisp code will perform better than C code generated by either the Solaris C compiler or GCC with maximum optimization.

Can't seem to find the paper he references; all the CMUCL benchmarks I've dug up were inter-Lisp implementation benchmarks.