Information AboutCommon Lisp |
| CATEGORIES ABOUT COMMON LISP | |
| lisp programming language family | |
| functional languages | |
| object-oriented programming languages | |
| imperative programming languages | |
| SHOPPER'S DELIGHT | |
|
Common Lisp is a general-purpose programming language, in contrast to Lisp variants such as Emacs Lisp and AutoLISP which are embedded extension languages in particular products. Unlike many earlier Lisps, Common Lisp (like Scheme ) uses lexical variable Scope . Common Lisp is a multi-paradigm Programming Language that:
SYNTAX Common Lisp is a Lisp; it uses S-expression s to denote both code and data structure. Function and macro calls are written as lists, with the name of the function first, as in these examples: (+ 2 2) ; adds 2 and 2, yielding 4 (setf p 3.1415) ; sets the variable "p" equal to 3.1415 ; Define a function that squares a number:
; Execute the function: (square 3) ; Returns "9" ; construction - variables existing only in 'let' block, so you can easily give any new ; values to any existing variables without changing them. Old values are restored after ; the end of the block. (let ((a 6) (b 4)) (+ a b)) ; returns 10 DATA TYPES Common Lisp has a plethora of data types, more than many languages. Scalar types ''Number'' types include Integer s, Ratio s, Floating-point Number s, and Complex Number s. Common Lisp uses Bignum s to represent numerical values of arbitrary size and precision. The ratio type represents fractions exactly, a facility not available in many languages. Common Lisp automatically coerces numeric values among these types as appropriate. The Common Lisp '' Character '' type is not limited to ASCII characters -- unsurprising, as Lisp predates ASCII. Some modern implementations allow Unicode characters. {Link without Title} The '' Symbol '' type is common to Lisp languages, but largely unknown outside them. A symbol is a unique, named data object. Symbols in Lisp are similar to identifiers in other languages, in that they are used as variables to hold values; however, they are more general and can be used for themselves as well. Normally, when a symbol is evaluated, its value as a variable is returned. Exceptions exist: ''keyword'' symbols such as :foo evaluate to themselves, and ''Boolean'' values in Common Lisp are represented by the reserved symbols T and NIL. Data structures ''Sequence'' types in Common Lisp include lists, vectors, bit-vectors, and strings. There are many operations which can work on any sequence type. As in any other Lisp, ''lists'' in Common Lisp are composed of ''conses'', sometimes called ''cons cells'' or ''pairs''. A cons is a data structure with two slots, called its ''car'' and ''cdr''. A list is a linked chain of conses. Each cons's car refers to a member of the list (possibly another list). Each cons's cdr refers to the next cons -- except for the last cons, whose cdr refers to the nil value. Conses can also easily be used to implement trees and other complex data structures; though it is usually advised to use structure or class instances instead. Common Lisp supports multidimensional ''arrays'', and can dynamically resize arrays if required. Multidimensional arrays can be used for matrix mathematics. A ''vector'' is a one-dimensional array. Arrays can carry any type as members (even mixed types in the same array) or can be specialized to contain a specific type of members, as in a vector of integers. Many implementations can optimize array functions when the array used is type-specialized. Two type-specialized array types are standard: a ''string'' is a vector of characters, while a ''bit-vector'' is a vector of Bit s. '' Hash Table s'' store associations between data objects. Any object may be used as key or value. Hash tables, like arrays, are automatically resized as needed. ''Packages'' are collections of symbols, used chiefly to separate the parts of a program into Namespace s. A package may ''export'' some symbols, marking them as part of a public interface. ''Structures'', similar in use to C structs and Pascal records, represent arbitrary complex data structures with any number and type of fields (called ''slots''). Class ''instances'', similar to structures, but created by the object system, CLOS . Functions In Common Lisp, the type of ''functions'' is a data type. For instance, it is possible to write functions that take other functions as arguments or return functions as well. This makes it possible to describe very general operations. The Common Lisp library relies heavily on such higher-order functions. For example, the sort function takes a Comparison Operator as an argument. This can be used not only to sort any type of data, but also to sort data structures according to a key.(sort (list 5 2 6 3 1 4) #'>) ; Sorts the list using the > function as the comparison operator. ; Returns (6 5 4 3 2 1). (sort (list '(9 a) '(3 b) '(4 c)) #'(lambda (x y) (< (car x) (car y)))) ; Sorts the list according to the first element (car) of each sub-list. ; Returns ((3 b) (4 c) (9 a)). The evaluation model for functions is very simple. When the evaluator encounters a form (F A1 A2...) then it is to assume that the symbol named F is one of the following:# A special operator (easily checked against a fixed list) # A macro operator (must have been defined previously) # The name of a function (default), which may either be a symbol, or a sub-form beginning with the symbol lambda.If F is the name of a function, then the arguments A1, A2, ..., An are evaluated in left-to-right order, and the function is found and invoked with those values supplied as parameters. Defining functions The macro defun defines functions. A function definition gives the name of the function, the names of any arguments, and a function body: (defun square (x)
Function definitions may include ''declarations'', which provide hints to the compiler about optimization settings or the data types of arguments. They may also include ''documentation strings'' (docstrings), which the Lisp system may use to provide interactive documentation: (defun square (x) (declare (number x) (optimize (speed 3) (debug 0) (safety 1))) "Calculates the square of the number x."
Anonymous functions are defined using the lambda special operator. Lisp programming style frequently uses higher-order functions for which it is useful to provide anonymous functions as arguments.There are a number of other operators related to the definition and manipulation of functions. For instance, a function may be recompiled with the compile operator. (Some Lisp systems run functions in an interpreter by default unless instructed to compile; others compile every entered function on the fly.)The function namespace The namespace for function names is separate from the namespace for data variables. This is a key difference between Common Lisp and Scheme . Operators which define names in the function namespace include defun, flet, and labels.To pass a function by name as an argument to another function, one must use the function special operator, commonly abbreviated as #'. The first sort example above refers to the function named by the symbol > in the function namespace, with the code #'>.Scheme's evaluation model is simpler: there is only one namespace, and all positions in the form are evaluated (in any order) -- not just the arguments. Code written in one dialect is therefore sometimes confusing to programmers more experienced in the other. For instance, many CL programmers like to use descriptive variable names such as ''list'' or ''string'' which could cause problems in Scheme as they would locally shadow function names. Whether a separate namespace for functions is an advantage is a source of contention in the Lisp community. It is usually referred to as the ''Lisp-1 vs. Lisp-2 debate''. These names were coined in a 1988 paper by Richard P. Gabriel and Kent Pitman , which extensively compares the two approaches. {Link without Title} Other types Other data types in Common Lisp include:
Common Lisp also includes a toolkit for Object-oriented Programming , the Common Lisp Object System or CLOS , which is one of the most powerful object systems available in any language. Macros A '' Macro '' in Lisp superficially resembles a function in usage. However, rather than representing an expression which is evaluated, it represents a transformation of the program source code. Macros allow Lisp programmers to create new syntactic forms in the language. For instance, this macro provides the until loop form, which may be familiar from languages such as Perl :
All macros must be expanded before the source code containing them can be evaluated or compiled normally. Macros can be considered functions that accept and return abstract syntax trees (Lisp S-expressions). These functions are invoked before the evaluator or compiler to produce the final source code. Macros are written in normal Common Lisp, and may use any Common Lisp (or third-party) operator available. The backquote notation used above is provided by Common Lisp specifically to simplify the common case of substitution into a code template. Variable capture and shadowing Common Lisp macros are capable of ''variable capture'', a situation in which symbols in the macro-expansion body coincide with those in the calling context. Variable capture is sometimes a desired effect: it allows the programmer to create macros wherein various symbols have special meaning. However, it can also introduce unexpected and unusual errors. Some Lisp systems, such as Scheme, avoid variable capture by using macro syntax — so-called "hygienic macros" — that does not allow it. In Common Lisp, one can usually avoid unwanted capture by using Gensym s: guaranteed-unique symbols which can be used in a macro-expansion without threat of capture. Another issue is the inadvertent ''shadowing of operators'' used in a macroexpansion. For example, consider the following (incorrect) code: (macrolet ((do (...) ... something else ...)) (until (= (random 10) 0) (write-line "Hello"))) The UNTIL macro will expand into a form which calls DO which is intended to refer to the built-in macro DO. However, in this context, DO may have a completely different meaning.Common Lisp ameliorates the problem of operator shadowing by forbidding the redefinition of built-in operators, such as DO in this example. Moreover, users may separate their own code into ''packages''. Built-in symbols are found in the COMMON-LISP package, which will not be shadowed by a symbol in a user package.COMPARISON WITH OTHER LISPS Common Lisp is most frequently compared with, and contrasted to, Scheme —if only because they are the two most popular Lisp dialects. Scheme antedates CL, and comes not only from the same Lisp tradition but from some of the same engineers— Guy L. Steele , who with Gerald Jay Sussman designed Scheme, chaired the standards committee for Common Lisp. Most of the Lisp systems whose designs contributed to Common Lisp—such as Zetalisp and Franz Lisp—used dynamically Scoped variables in their interpreters and lexically Scoped variables in their compilers. Scheme introduced the sole use of lexically-scoped variables to Lisp; an inspiration from ALGOL 68 which was widely recognized as a good idea. CL supports dynamically-scoped variables as well, but they must be explicitly declared as "special". There are no differences in scoping between ANSI CL interpreters and compilers. Common Lisp is sometimes termed a ''Lisp-2'' and Scheme a ''Lisp-1'', referring to CL's use of separate namespaces for functions and variables. (In fact, CL has ''many'' namespaces, such as those for go tags, block names, and loop keywords.) There is a long-standing controversy between CL and Scheme advocates over the tradeoffs involved in multiple namespaces. In Scheme, it is (broadly) necessary to avoid giving variables names which clash with functions; Scheme functions frequently have arguments named lis, lst, or lyst so as not to conflict with the system function list. However, in CL it is necessary to explicitly refer to the function namespace when passing a function as an argument -- which is also a common occurrence, as in the sort example above.CL also differs from Scheme in its handling of boolean values. Scheme uses the special values #t and #f to represent truth and falsity. CL follows the older Lisp convention of using the symbols T and NIL, with NIL standing also for the empty list. In CL, ''any'' non-NIL value is treated as true by conditionals such as if. This allows some operators to serve both as predicates (answering a boolean-valued question) and as returning a useful value for further computation.Lastly, the Scheme standards documents require Tail-call Optimization , which the CL standard does not. Most CL implementations do offer tail-call optimization, although often only when the programmer uses an optimization directive. Nonetheless, common CL coding style does not favor the ubiquitous use of recursion that Scheme style prefers -- what a Scheme programmer would express with tail recursion, a CL user would usually express with an iterative expression in do, dolist, loop, or (more recently) with the iterate package.IMPLEMENTATIONS Common Lisp is defined by a specification (like Ada and C ) rather than by a single implementation (like Perl ). There are many implementations, and the standard spells out areas in which they may validly differ. In addition, implementations tend to come with library packages, which provide functionality not covered in the standard. Free Software libraries have been created to support such features in a portable way, most notably Common-Lisp.net and the Common Lisp Open Code Collection project. Common Lisp has been designed to be implemented by incremental compilers. Standard declarations to optimize compilation (such as function inlining) are proposed in the language specification. Most Common Lisp implementations compile functions to native Machine Code . Others compile to Bytecode , which reduces speed but eases binary-code portability. The misconception that Lisp is a purely-interpreted language is most likely due to the fact that Common Lisp environments provide an interactive prompt and that functions are compiled one-by-one, in an incremental way. Some Unix -based implementations, such as CLISP, can be used as script interpreters; that is, invoked by the system transparently in the way that a Perl or Unix Shell interpreter is. List of implementations Freely redistributable implementations include:
Commercial implementations are available from Franz, Inc. , LispWorks Ltd. , Digitool, Inc. , Corman Technologies and Scieneer Pty Ltd. . APPLICATIONS Common Lisp is used in many successful commercial applications, the most famous (no doubt due to Paul Graham 's promotion) being the Yahoo! Store web-commerce site. Other notable examples include:
There also exist successful open-source applications written in Common Lisp, such as:
As well, Common Lisp is used by many government and non-profit institutions. Examples of its use in NASA include:
EXTERNAL LINKS
|