Duologue is high-level interaction library for Common Lisp. It features coloured printing via cl-ansi-text and readline completion.

HTML-TEMPLATE is a Common Lisp library which can be used to fill templates with arbitrary (string) values at runtime. The result does not have to be HTML.

It is loosely modeled after the Perl module HTML::Template and partially compatible with a its syntax, though both libraries contain some extensions that the other does not support.

HTML-TEMPLATE translates templates into efficient closures which can be re-used as often as needed. It uses a cache mechanism so you can update templates while your program is running and have the changes take effect immediately.

jzon is a correct and safe JSON RFC 8259 parser for Common Lisp.

This package provides KONS-9 which can be considered as a traditional user interface driven 3D application for general artists, or as a REPL-based development environment for technical artists and software developers. These two approaches can be seamlessly combined into a flexible and powerful workflow, where non-technical users can immediately benefit from software tools and extensions developed by technical users.

This package provides Common Lisp bindings for libev.

iterate is an iteration construct for Common Lisp. It is similar to the CL:LOOP macro, with these distinguishing marks:

• it is extensible,

• it helps editors like Emacs indent iterate forms by having a more lisp-like syntax, and

• it isn't part of the ANSI standard for Common Lisp.

Trial is a game engine written in Common Lisp. Unlike many other engines, it is meant to be more of a loose connection of components that can be fit together as required by any particular game.

This is a very simple color library for Common Lisp, providing:

• Types for representing colors in HSV, HSL, and RGB spaces.

• Simple conversion functions between the above types.

• Function printing colors to HEX, RGB, RGBA, and HSL.

• Predefined colors from X11, SVG, and GDK.

The Common Foreign Function Interface (CFFI) purports to be a portable foreign function interface for Common Lisp. The CFFI library is composed of a Lisp-implementation-specific backend in the CFFI-SYS package, and a portable frontend in the CFFI package.

Common Lisp already has major 2 namespaces, function namespace and value namespace (or variable namespace), but there are actually more — e.g., class namespace. This library offers macros to deal with symbols from any namespace.

A hook, in the present context, is a certain kind of extension point in a program that allows interleaving the execution of arbitrary code with the execution of a the program without introducing any coupling between the two. Hooks are used extensively in the extensible editor Emacs.

In the Common LISP Object System (CLOS), a similar kind of extensibility is possible using the flexible multi-method dispatch mechanism. It may even seem that the concept of hooks does not provide any benefits over the possibilities of CLOS. However, there are some differences:

• There can be only one method for each combination of specializers and qualifiers. As a result this kind of extension point cannot be used by multiple extensions independently.

• Removing code previously attached via a :before, :after or :around method can be cumbersome.

• There could be other or even multiple extension points besides :before and :after in a single method.

• Attaching codes to individual objects using eql specializers can be cumbersome.

• Introspection of code attached a particular extension point is cumbersome since this requires enumerating and inspecting the methods of a generic function.

This library tries to complement some of these weaknesses of method-based extension-points via the concept of hooks.

This library provides an OS and implementation independent access to timeouts.

This package provides an ANSI CL adaptation of the SBCL mailbox utility.

This is a Common Lisp version of UglifyJS, a JavaScript compressor. It works on data produced by parse-js to generate a minified version of the code. Currently it can:

• reduce variable names (usually to single letters)

• join consecutive var statements

• resolve simple binary expressions

• group most consecutive statements using the sequence operator (comma)

• remove unnecessary blocks

• convert IF expressions in various ways that result in smaller code

• remove some unreachable code

Optima is a fast pattern matching library which uses optimizing techniques widely used in the functional programming world.

This is a simple queue library for Common Lisp with features such as non-consing thread safe queues and fibonacci priority queues.

This Common Lisp library contains various handy utilities to help autowrapping with claw.

This is a system for two dimensional computational geometry for Common Lisp.

Note: the system assumes exact rational arithmetic, so no floating point coordinates are allowed. This is not checked when creating geometric objects.

Cells is a mature, stable extension to CLOS allowing one to create classes whose instances can have slot values determined by instance-specific formulas.

This is futures implementation for Common Lisp. It plugs in nicely to cl-async.

A Common Lisp library implementing a few different kinds of queues:

• Bounded and unbounded FIFO queues.

• Lossy bounded FIFO queues that drop elements when full.

• Unbounded random-order queues that use less memory than unbounded FIFO queues.

Additionally, a synchronization wrapper is provided to make any queue conforming to the jpl-queues API thread-safe for lightweight multithreading applications. (See Calispel for a more sophisticated CL multithreaded message-passing library with timeouts and alternation among several blockable channels.)

An implementation of Relax NG schema validation written in Common Lisp, including support for compact syntax, DTD Compatibility, and the XSD type library.

This package provides functions for base32 encoding and decoding as defined in RFC4648.

A Common Lisp library for generating a human-readable diff of two HTML documents.