This document contains a description of a Common Lisp extension that allows a programmer to write functional programs that use normal order evaluation, as in non-strict languages like Haskell. The extension is relatively straightforward, and it appears to be the first one such that is integrated in the overall Common Lisp framework.

This paper presents the development of a Natural Language Interface (NLI) which is semantic-based and uses Conceptual Dependency representation. The system was developed using Lisp and currently runs on a Symbolics Lisp machine. A key point is that the parser handles morphological analysis, which expands its capabilities of understanding more words. t. L_," " ?,,1 _. ( \ I'; _ '(

A comprehensive evaluation of the recently developed Fraunhofer line depth (FLD) and laser-induced saturation pulse (FLD-LISP) method was conducted to measure chlorophyll fluorescence (ChlF) parameters of the quantum yield of photosystem II (ΦPSII), non-photochemical quenching (NPQ), and the photosystem II-based electron transport rate (ETR) in three plant species including paprika (C3 plant), ...

We present a discrete approximation method for planar algebraic curves. This discrete approximation is hierarchical, curvature dependent, and provides eecient algorithms for various primitive geometric operations on algebraic curves. We consider applications on the curve intersections , the distance computations, and the common tangent and convolution computations. We implemented these approxim...

This paper describes the Common Lisp system that BBN is developing for its ButterflyTM multiprocessor. The BBN ButterflyTM is a shared memory multiprocessor which may contain up to 256 processor nodes. The system provides a shared heap, parallel garbage collector, and window based I/O system. The future construct is used to specify parallelism. THE BUTTERFLYTM LISP SYSTEM For several decades, d...

The FRPOLY Lisp performance benchmark [3] was based on a circa1968 piece of code for computing powers of polynomials. We address two questions: (a) What algorithm would you use if you really wanted to compute powers of polynomials fast? and (b) Given that Common Lisp supports many types of data structures other than the simple lists used for the benchmark, what more efficient representations mi...

The network research community has recently started to work on the design of an alternate Internet Architecture aiming at solving some scalability issues that the current Internet is facing. The Locator/ID separation paradigm seems to well fit the requirements for this new Internet Architecture. The principle of this paradigm is to separate the identification part from the localization one. In ...

In the recent years, all major academic events have suffered from a decreasing level of attendance and contribution, Lisp being no exception to the rule. Organizing ELS 2011 in this context was hence a challenge of its own, and I'm particularly happy that we have succeeded again. For the first time this year, we had a " special focus " on parallelism and efficiency, all very important matters f...

This paper presents an ongoing effort to develop a domain specific language that would simplify exploiting hardware acceleration in grid-based scientific models. The project is being implemented in Common Lisp, which has the best built-in metaprogramming capabilities among industrial-level compiled programming languages. The DSL is applied to a hydrodynamic model of the atmosphere. Keywords-GPU...

We examine the use of read-time feature conditionals, with particular emphasis on writing portable Common Lisp code which aspires to both forwardsand backwards-compatibility. We examine cases from real libraries which demonstrate the various pitfalls, and propose a scheme for robust treatment of implementation-specific functionality by performing programmatic tests at the appropriate time. We d...