The family of functional programming languages inspired by John McCarthy's original notation for computations, later becoming Lisp 1.5, MacLisp, InterLisp, and some of the more modern implementations.

The key feature of the Lisp family is that they all are late-bound languages that use parentheses as the basic delimiter of evaluation forms, and all forms are expressions without exception. The uniform syntax turned out to allow the use of metaprogramming through manipulation (via macros) of the list-representation of this syntax, called symbolics expressions, or S-Expressions for short (even shorter, "SEXP").

Lisp is also defined as a program in itself: (loop (print (eval (read)))), called the read-eval-print loop. Many great books in computer science have been written using or covering this language.

LISP stands for LISt Processing

Pages in this topic: Better Scheme   Common Lisp   EuLisp   Goo   Guile   Qi   REPL   Scheme   Stella language   Syntax in Lisp  

Also linked from: Abstraction   Alan Bawden   Appetizers   Artificial Intelligence   C Compiler dlopen VM   Continuation   Dylan   Erlang   Forth is NOT intrinsically slow   Genera   Henry Baker   Io   John McCarthy   K   Lambda VM   Languages ToDo   Lisp Literate Engine   Lisp machine   LispOS   Literate Programming   LOGO   Lython   MACSYMA   Marc Santoro   Meta-Circular   Meta-Object Protocol   Meta-System Transition   Microkernel   Microkernel Debate   Object   Object-Oriented   OJOS   Orthogonal Persistence   Parsing   POP-11   PostScript   Python   REBOL   Resilient   RPL   SECD   Self   Sigil   Squeak   Symmetric Lisp   The True Story of Ada   Trotskyite Tunes   Type System   Unified   Vapour