1. Parallelism in Lisp There are two main approaches to executing Lisp in parallel. One is to use existing code and clever compiling methods to parallelize the execution of the code [9, 14, 11]. This approach is very attractive because it allows the use of already existing code without modification, and it relieves the programmer from the significant conceptual overhead of parallelism. This app...

Compiler benchmarks provide a means for compiler writers to measure their performance, as well as for potential users to estimate whether a given implementation will suit their performance needs. We present a simple application of clustering algorithms in the programmatic examination of a freely-available suite of benchmarks to estimate the similarity of the codepaths tested, and find a groupin...

We present the derivation of a solution to a LISP programming exercise. The derivation is in three steps. First, an ineecient solution is given. Second, the quintessence of a more eecient solution is captured in a number of equalities. Third, an ecient solution is derived from the ineecient o n e b y a n umber of transformation steps, each of which is justiied by the equalities.

We present a metacircular compiler written in Scheme that compiles Emacs Lisp to Scheme code. The compiler either emits source text or a Scheme function immediately useable at the prompt of the Scheme implementation running the compiler. This characteristic makes the compiler especially useful in an interactive setting. Thus, our compiler provides a basis for running unchanged Emacs Lisp code i...

In this paper, we describe an extension of Common Lisp which allows the deeni-tion of parallel programs within that functional and object-oriented language. In particular, the extensions are the introducing of active objects, sending synchronous and asynchronous messages between them, automatic and manual distribution of active objects to object spaces, and transparent object managing. With the...

This paper reports on a quite large experience in implementing a procedurally introspective system (PIS), ALICE, in which a well known problem is faced: the integration between LISP and Horn clauses. This exercise is motivated by a recognized lack of experience in implementing PISs to deal with actual A.I. programming problems. ALICE is composed of two procedurally introspective languages based...

Common Lisp Quick Reference Revision 134 [2012-04-05] Copyright © 2008, 2009, 2010, 2011, 2012 Bert Burgemeister LTEX source: http://clqr.boundp.org Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no FrontCover Texts...

There exist many applications where both symbolic and floating-point computations are required at the same time. Image recognition, for example, requires huge amounts of numeric calculation to extract features from raw image data before the actual recognition is performed according to those features. Systems for symbolic computation should perform type-checking on numeric calculations. Although...