- Let Over Lambda
Let Over Lambda is a book about advanced Common Lisp programming techniques written by Doug Hoyte - let-plus
LET+ extends let* with destructuring forms, slot access, hash table elements and various other constructs with a consistent interface - Levenshtein
The Levenshtein Distance algorithm finds the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character - Levente Mészáros
A lisper - lexer
Lexers (also called tokenizers) can be used to prepare a string or stream of character data into a form suitable as an input for parsers generated by parser generators - lfarm
a library for distributing work across machines using the lparallel API - lfe
LFE, Lisp Flavoured Erlang, is a lisp s-exp syntax front-end to the Erlang compiler - LGPL
LGPL refers to GNU Library General Public License, also known as the Lesser General Public License - lgtk
Lgtk is Common Lisp GTK binding; not available for CLISP - lh-usb
lh-usb is a set of bindings for the Linux usbfs interface for writing usb device drivers from user-space Lisp code
Result page:<123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291>