Knowledge

Lisp (programming language)

Source 📝

1457: 651: 9721: 9281: 9271: 9251: 9693: 9241: 662: 1442: 9261: 3321: 49: 4993:, and thus the reason that the use of tail recursion is generally encouraged for Scheme is that the practice is expressly supported by the language definition. By contrast, ANSI Common Lisp does not require the optimization commonly termed a tail call elimination. Thus, the fact that tail recursive style as a casual replacement for the use of more traditional 2429:. However, the S-expression syntax is also responsible for much of Lisp's power: the syntax is simple and consistent, which facilitates manipulation by computer. However, the syntax of Lisp is not limited to traditional parentheses notation. It can be extended to include alternative notations. For example, XMLisp is a Common Lisp extension that employs the 7257:
instance, (#1=(a b) . #1#) would normally be printed as ((a b) a b) (without circular structure printing enabled), but makes the reuse of the cons cell clear. #1=(a . #1#) cannot normally be printed as it is circular, although (a...) is sometimes displayed, the CDR of the cons cell defined by #1= is itself.
7994:, University of Minnesota, Minneapolis. McCarthy discusses his role in the development of time-sharing at the Massachusetts Institute of Technology. He also describes his work in artificial intelligence (AI) funded by the Advanced Research Projects Agency, including logic-based AI (LISP) and robotics. 7089:
I invented conditional expressions in connection with a set of chess legal move routines I wrote in FORTRAN for the IBM 704 at M.I.T. during 1957–58 ... A paper defining conditional expressions and proposing their use in Algol was sent to the Communications of the ACM but was arbitrarily demoted
4676:
Macros expand before the compilation step, and thus offer some interesting options. If a program needs a precomputed table, then a macro might create the table at compile time, so the compiler need only output the table and need not call code to create the table at run time. Some Lisp implementations
7107:
I didn't understand the monster LISP idea of tangible metalanguage then, but got kind of close with ideas about extensible languages ... The second phase of this was to finally understand LISP and then using this understanding to make much nicer and smaller and more powerful and more late bound
5054:
Often, the same algorithm can be expressed in Lisp in either an imperative or a functional style. As noted above, Scheme tends to favor the functional style, using tail recursion and continuations to express control flow. However, imperative style is still quite possible. The style preferred by many
4652:
Further, because Lisp code has the same structure as lists, macros can be built with any of the list-processing functions in the language. In short, anything that Lisp can do to a data structure, Lisp macros can do to code. In contrast, in most other languages, the parser's output is purely internal
2338:
With a few very basic principles at its foundation, it has shown a remarkable stability. Besides that, LISP has been the carrier for a considerable number of in a sense our most sophisticated computer applications. LISP has jokingly been described as "the most intelligent way to misuse a computer".
1861:
process has created a lot of quasi standard libraries and extensions for Scheme. User communities of individual Scheme implementations continue to grow. A new language standardization process was started in 2003 and led to the RRS Scheme standard in 2007. Academic use of Scheme for teaching computer
4660:
languages within languages. For example, the Common Lisp Object System can be implemented cleanly as a language extension using macros. This means that if an application needs a different inheritance mechanism, it can use a different object system. This is in stark contrast to most other languages;
2312:
in which the object system is defined in terms of itself: Lisp was only the second language after Smalltalk (and is still one of the very few languages) to possess such a metaobject system. Many years later, Alan Kay suggested that as a result of the confluence of these features, only Smalltalk and
4791:
function evaluates the data, returning zero or more other Lisp data as a result. Evaluation does not have to mean interpretation; some Lisp systems compile every expression to native machine code. It is simple, however, to describe evaluation as interpretation: To evaluate a list whose car names a
3290:
The essential difference between atoms and lists was that atoms were immutable and unique. Two atoms that appeared in different places in source code but were written in exactly the same way represented the same object, whereas each list was a separate object that could be altered independently of
7256:
NB: a so-called "dotted list" is only one kind of "improper list". The other kind is the "circular list" where the cons cells form a loop. Typically this is represented using #n=(...) to represent the target cons cell that will have multiple references, and #n# is used to refer to this cons. For
4465:
Self-evaluating forms and quoted forms are Lisp's equivalent of literals. It may be possible to modify the values of (mutable) literals in program code. For instance, if a function returns a quoted form, and the code that calls the function modifies the form, this may alter the behavior of the
2000:) not specified in Common Lisp. A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme. Scheme continues to evolve with a series of standards (Revised Report on the Algorithmic Language Scheme) and a series of 2217:". Thus, Lisp functions can be manipulated, altered or even created within a Lisp program without lower-level manipulations. This is generally considered one of the main advantages of the language with regard to its expressive power, and makes the language suitable for syntactic macros and 1957:), but was designed to be efficiently implementable on any personal computer or workstation. Common Lisp is a general-purpose programming language and thus has a large language standard including many built-in data types, functions, macros and other language elements, and an object system ( 4629:
A fundamental distinction between Lisp and other languages is that in Lisp, the textual representation of a program is simply a human-readable description of the same internal data structures (linked lists, symbols, number, characters, etc.) as would be used by the underlying Lisp system.
3429:
Thus, a Lisp list is not an atomic object, as an instance of a container class in C++ or Java would be. A list is nothing more than an aggregate of linked conses. A variable that refers to a given list is simply a pointer to the first cons in the list. Traversal of a list can be done by
7108:
understructures ... OOP to me means only messaging, local retention and protection and hiding of state-process, and extreme late-binding of all things. It can be done in Smalltalk and in LISP. There are possibly other systems in which this is possible, but I'm not aware of them.
5030:, equivalent to other languages' syntactic keywords. Expressions using these operators have the same surface appearance as function calls, but differ in that the arguments are not necessarily evaluated—or, in the case of an iteration expression, may be evaluated more than once. 4973:. Scheme's commonality in academic computer science has led some students to believe that tail recursion is the only, or the most common, way to write iterations in Lisp, but this is incorrect. All oft-seen Lisp dialects have imperative-style iteration constructs, from Scheme's 1409:. In the 1970s, as AI research spawned commercial offshoots, the performance of existing Lisp systems became a growing issue, as programmers needed to be familiar with the performance ramifications of the various techniques and choices involved in the implementation of Lisp. 4563:
Modifying a quoted form like this is generally considered bad style, and is defined by ANSI Common Lisp as erroneous (resulting in "undefined" behavior in compiled files, because the file-compiler can coalesce similar constants, put them in write-protected memory, etc.).
5033:
In contrast to most other major programming languages, Lisp allows implementing control structures using the language. Several control structures are implemented as Lisp macros, and can even be macro-expanded by the programmer who wants to know how they work.
1857:. Several significant new implementations (Chicken, Gambit, Gauche, Ikarus, Larceny, Ypsilon) have been developed in the 2000s (decade). The Revised Report on the Algorithmic Language Scheme standard of Scheme was widely accepted in the Scheme community. The 1849:
Fifty years of Lisp (1958–2008) was celebrated at LISP50@OOPSLA. There are regular local user meetings in Boston, Vancouver, and Hamburg. Other events include the European Common Lisp Meeting, the European Lisp Symposium and an International Lisp Conference.
5960:
One of the most important and fascinating of all computer languages is LISP (standing for "List Processing"), which was invented by John McCarthy around the time Algol was invented. Subsequently, LISP has enjoyed great popularity with workers in Artificial
1789:
to pursue a language others considered antiquated. New Lisp programmers often describe the language as an eye-opening experience and claim to be substantially more productive than in other languages. This increase in awareness may be contrasted to the
4668:
to run the program; a function is literally a piece of list structure which is traversed by the interpreter in executing it. However, most substantial Lisp systems also include a compiler. The compiler translates list structure into machine code or
4232:, to make it easier to define and use destructive functions. A frequent style in Common Lisp is to write code functionally (without destructive calls) when prototyping, then to add destructive calls as an optimization where it is safe to do so. 4101:
Sharing structure rather than copying can give a dramatic performance improvement. However, this technique can interact in undesired ways with functions that alter lists passed to them as arguments. Altering one list, such as by replacing the
1417:
Over its sixty-year history, Lisp has spawned many variations on the core theme of an S-expression language. Moreover, each given dialect may have several implementations—for instance, there are more than a dozen implementations of
695:
in April 1960, entitled "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I". He showed that with a few simple operators and a notation for anonymous functions borrowed from Church, one can build a
1716:
or "A Computational Logic for Applicative Common Lisp", an applicative (side-effect free) variant of Common LISP. ACL2 is both a programming language which can model computer systems, and a tool to help proving properties of those
1482:
LISP 1.5 – First widely distributed version, developed by McCarthy and others at MIT. So named because it contained several improvements on the original "LISP 1" interpreter, but was not a major restructuring as the planned
2523:. The first element in the list is the name of a function, the name of a macro, a lambda expression or the name of a "special operator" (see below). The remainder of the list are the arguments. For example, the function 3441:
Because conses and lists are so universal in Lisp systems, it is a common misconception that they are Lisp's only data structures. In fact, all but the most simplistic Lisps have other data structures, such as vectors
5062:
Because of Lisp's early heritage in list processing, it has a wide array of higher-order functions relating to iteration over sequences. In many cases where an explicit loop would be needed in other languages (like a
920:
The first complete Lisp compiler, written in Lisp, was implemented in 1962 by Tim Hart and Mike Levin at MIT, and could be compiled by simply having an existing LISP interpreter interpret the compiler code, producing
5050:
procedure, which allows a program to save (and later restore) a particular place in execution. Common Lisp does not support re-entrant continuations, but does support several ways of handling escape continuations.
2584:
in the preceding example is a "special operator" which returns its argument without evaluating it. Any unquoted expressions are recursively evaluated before the enclosing expression is evaluated. For example,
4761:, the number 1, and the number 2. It so happens that this list is also a valid piece of Lisp code; that is, it can be evaluated. This is because the car of the list names a function—the addition operation. 4240:
Lisp evaluates expressions which are entered by the user. Symbols and lists evaluate to some other (usually, simpler) expression – for instance, a symbol evaluates to the value of the variable it names;
1638:) to create successor dialects to Maclisp, with substantive influences from the Scheme dialect as well. This version of Common Lisp was available for wide-ranging platforms and was accepted by many as a 2269:; and in turn Lisp was influenced by Smalltalk, with later dialects adopting object-oriented programming features (inheritance classes, encapsulating instances, message passing, etc.) in the 1970s. The 5221:
Lisp syntax lends itself naturally to recursion. Mathematical problems such as the enumeration of recursively defined sets are simple to express in this notation. For example, to evaluate a number's
5593:, CLOS, is an integral part of ANSI Common Lisp. CLOS descended from New Flavors and CommonLOOPS. ANSI Common Lisp was the first standardized object-oriented programming language (1994, ANSI X3J13). 2339:
I think that description a great compliment because it transmits the full flavour of liberation: it has assisted a number of our most gifted fellow humans in thinking previously impossible thoughts.
5055:
Common Lisp programmers may seem more familiar to programmers used to structured languages such as C, while that preferred by Schemers more closely resembles pure-functional languages such as
1646:(SBCL), CMU Common Lisp (CMU-CL), Clozure OpenMCL (not to be confused with Clojure!), GNU CLisp, and later versions of Franz Lisp; all of them adhere to the later ANSI CL standard (see below). 4204:
avoid destructive functions. In the Scheme dialect, which favors the functional style, the names of destructive functions are marked with a cautionary exclamation point, or "bang"—such as
6812: 5037:
Both Common Lisp and Scheme have operators for non-local control flow. The differences in these operators are some of the deepest differences between the two dialects. Scheme supports
5015:) is discouraged in Common Lisp is not just a matter of stylistic preference, but potentially one of efficiency (since an apparent tail call in Common Lisp may not compile as a simple 4649:
programming languages), a macro returns code that can then be compiled. However, unlike C preprocessor macros, the macros are Lisp functions and so can exploit the full power of Lisp.
2924:
are a list of arguments, and the expression or expressions to which the function evaluates (the returned value is the value of the last expression that is evaluated). The expression
2967:
and returns the number one greater than that argument. Lambda expressions are treated no differently from named functions; they are invoked the same way. Therefore, the expression
8938: 610:, or parenthesized lists. A function call or syntactic form is written as a list with the function or operator's name first, and the arguments following; for instance, a function 7745: 4798:
first evaluates each of the arguments given in its cdr, then applies the function to the arguments. In this case, the function is addition, and applying it to the argument list
3402:
If a given cons is taken to be the head of a linked list, then its car points to the first element of the list, and its cdr points to the rest of the list. For this reason, the
1710:
of Common Lisp implementations. Although formally an ANSI standard, the implementation, sale, use, and influence of ANSI Common Lisp has been and continues to be seen worldwide.
929:, in which compiled and interpreted functions can intermix freely. The language used in Hart and Levin's memo is much closer to modern Lisp style than McCarthy's earlier code. 936: 354: 2421:
The use of parentheses is Lisp's most immediately obvious difference from other programming language families. As a result, students have long given Lisp nicknames such as
1977:, x86-64, PowerPC, Alpha, ARM, Motorola 68000, and MIPS, and operating systems such as Windows, macOS, Linux, Solaris, FreeBSD, NetBSD, OpenBSD, Dragonfly BSD, and Heroku. 8932: 6495: 751:. Once Lisp was implemented, programmers rapidly chose to use S-expressions, and M-expressions were abandoned. M-expressions surfaced again with short-lived attempts of 2343:
Largely because of its resource requirements with respect to early computing hardware (including early microprocessors), Lisp did not become as popular outside of the
2324:
looking for unused memory. Progress in modern sophisticated garbage collection algorithms such as generational garbage collection was stimulated by its use in Lisp.
5813: 1758:
After having declined somewhat in the 1990s, Lisp has experienced a resurgence of interest after 2000. Most new activity has been focused around implementations of
3839: 2758:
takes three arguments. If the first argument is non-nil, it evaluates to the second argument; otherwise, it evaluates to the third argument. Thus, the expression
2501:. These values are implicitly typed: they are respectively two integers and a Lisp-specific data type called a "symbol", and do not have to be declared as such. 2213:
Lisp was the first language where the structure of program code is represented faithfully and directly in a standard data structure—a quality much later dubbed "
1988:. It was designed to have exceptionally clear and simple semantics and few different ways to form expressions. Designed about a decade earlier than Common Lisp, 1809: 7228: 2038:, so that calls to Java can avoid reflection and enable fast primitive operations. Clojure is not designed to be backwards compatible with other Lisp dialects. 4989:
expressions. Moreover, the key issue that makes this an objective rather than subjective matter is that Scheme makes specific requirements for the handling of
3458:
Parenthesized S-expressions represent linked list structures. There are several ways to represent the same list as an S-expression. A cons can be written in
2418:), which express functions of S-expressions. M-expressions never found favor, and almost all Lisps today use S-expressions to manipulate both code and data. 4342:). This is almost the same as the plain quote, except it allows expressions to be evaluated and their values interpolated into a quoted list with the comma 8019: 1433:. Within a dialect that is standardized, however, conforming implementations support the same core language, but with different extensions and libraries. 8085: 1834: 4722:
The basic operation of the REPL is as follows. This is a simplistic description which omits many elements of a real Lisp, such as quoting and macros.
2918:, is used to bind variables to values which are then evaluated within an expression. This operator is also used to create functions: the arguments to 8841: 7715: 6945:"Armed Bear Common Lisp (ABCL) is a full implementation of the Common Lisp language featuring both an interpreter and a compiler, running in the JVM" 9765: 9760: 6442: 5801:
Lisp is a survivor, having been in use for about a quarter of a century. Among the active programming languages only Fortran has had a longer life.
4876:
To implement a Lisp REPL, it is necessary only to implement these three functions and an infinite-loop function. (Naturally, the implementation of
1862:
science seems to have declined somewhat. Some universities are no longer using Scheme in their computer science introductory courses; MIT now uses
819:, and then advertised this as a Lisp interpreter, which it certainly was. So at that point Lisp had essentially the form that it has today ... 4954:
Lisp originally had very few control structures, but many more were added during the language's evolution. (Lisp's original conditional operator,
9425: 6894: 1581: 5069:
loop in C) in Lisp the same task can be accomplished with a higher-order function. (The same is true of many functional programming languages.)
9785: 6218: 710:
language, from 1955 or 1956, and already included many of the concepts, such as list-processing and recursion, which came to be used in Lisp.
6820: 1821: 1539: 9265: 7290: 6157: 2034:
and places a very strong emphasis on immutability. Clojure provides access to Java frameworks and libraries, with optional type hints and
1516:
systems. MACLISP would later come to be called Maclisp, and is often referred to as MacLisp. The "MAC" in MACLISP is unrelated to Apple's
7856: 7227:
Sebesta, Robert W. (2012). ""2.4 Functional Programming: LISP";"6.9 List Types";"15.4 The First Functional Programming Language: LISP"".
5871:
Felleisen, Matthias; Findler, Robert; Flatt, Matthew; Krishnamurthi, Shriram; Barzilay, Eli; McCarthy, Jay; Tobin-Hochstadt, Sam (2015).
5792: 5715: 2359:
language. Because of its suitability to complex and dynamic applications, Lisp enjoyed some resurgence of popular interest in the 2010s.
1825: 1813: 4298:, it returns the value of the corresponding variable (or an error, if there is no such variable). To refer to the literal symbol, enter 9709: 8335: 3223:: atoms and lists. A list was a finite ordered sequence of elements, where each element is either an atom or a list, and an atom was a 1829: 1380: 7683:. Vol. IV, Functional and logic programming languages (1st ed.). Indianapolis, IN: Macmillan Technical Publishing. pp.  4280:
Any expression can also be marked to prevent it from being evaluated (as is necessary for symbols and lists). This is the role of the
2399:, it produces a value (possibly multiple values), which can then be embedded into other expressions. Each value can be any data type. 1664:– attempt to develop a new efficient and cleaned-up Lisp. Standardized as ISO/IEC 13816:1997 and later revised as ISO/IEC 13816:2007: 925:
output able to be executed at a 40-fold improvement in speed over that of the interpreter. This compiler introduced the Lisp model of
9775: 9285: 9245: 8568: 4731:
function accepts textual S-expressions as input, and parses them into an internal data structure. For instance, if you type the text
2444:
are written as lists, they can be processed exactly like data. This allows easy writing of programs which manipulate other programs (
1886: 9255: 9750: 9714: 9317: 8078: 2073:. The potential small size of a useful Scheme interpreter makes it particularly popular for embedded scripting. Examples include 143: 7640: 6423: 6370: 6189: 6037: 1666:
Information technology – Programming languages, their environments and system software interfaces – Programming language ISLISP
2448:). Many Lisp dialects exploit this feature using macro systems, which enables extension of the language almost without limit. 1992:
is a more minimalist design. It has a much smaller set of standard features but with certain implementation features (such as
9704: 9357: 8926: 8112: 7241: 6272: 5776: 5617: 2317: 2165: 1854: 1683: 932: 686: 547: 9745: 9275: 8977: 7267: 6338: 2752:"Special operators" (sometimes called "special forms") provide Lisp's control structure. For example, the special operator 7821: 6956: 4681:, that allows code to be present during compile time (when a macro would need it), but not present in the emitted module. 4214:), which replaces the car of a cons. In the Common Lisp dialect, destructive functions are commonplace; the equivalent of 4193:– a possibly unexpected result. This can be a source of bugs, and functions which alter their arguments are documented as 9445: 9418: 8215: 6673: 6622: 6111: 5817: 5666:, are based on Lisp (use Lisp features, conventions, methods, data structures, etc.), or are written in Lisp, including: 3955:
Lisp lists, being simple linked lists, can share structure with one another. That is to say, two lists can have the same
61: 6647: 6587: 6566: 4927:
The Lisp REPL typically also provides input editing, an input history, error handling and an interface to the debugger.
1812:
lists resources, #lisp is a popular IRC channel and allows the sharing and commenting of code snippets (with support by
1642:
until the publication of ANSI Common Lisp (ANSI X3.226-1994). Among the most widespread sub-dialects of Common Lisp are
9326: 9053: 9033: 8943: 8787: 8117: 8071: 7850: 6334: 6314: 5298:
An alternative implementation takes less stack space than the previous version if the underlying Lisp system optimizes
4697:(IDE). The user types in expressions at the command line, or directs the IDE to transmit them to the Lisp system. Lisp 4694: 2139: 2001: 1858: 1557: 1521: 767: 682: 674: 670: 555: 101: 89: 2085:
image processor under the generic name "Script-fu". LIBREP, a Lisp interpreter by John Harper originally based on the
9450: 8604: 7952: 7859:– Herbert Stoyan's history compiled from the documents (acknowledged by McCarthy as more complete than his own, see: 7765: 7751: 7724: 7692: 7653: 6531: 6387: 6164: 6020: 5953: 5847: 5638: 2207: 1782: 604:
The interchangeability of code and data gives Lisp its instantly recognizable syntax. All program code is written as
6063: 4633:
Lisp uses this to implement a very powerful macro system. Like other macro languages such as the one defined by the
9455: 3809:
procedure appends two (or more) lists to one another. Because Lisp lists are linked lists, appending two lists has
3636:
Lisp provides many built-in procedures for accessing and controlling lists. Lists can be created directly with the
2718:), able to take any number of arguments. A C-style '++' increment operator is sometimes implemented under the name 1605: 2109: 2105: 9048: 9012: 8351: 7893: 7306: 6330: 942:
During the 1980s and 1990s, a great effort was made to unify the work on new Lisp dialects (mostly successors to
703: 488: 293: 7783: 7589: 1927:
represent two major streams of Lisp development. These languages embody significantly different design choices.
964:
published the Common Lisp standard, "ANSI X3.226-1994 Information Technology Programming Language Common Lisp".
9780: 9724: 9656: 9529: 9411: 8372: 8356: 8201: 6474: 3345: 3325: 2270: 2159: 1980:
Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by
1728: 1402: 1254: 992: 7648:. The second ACM SIGPLAN conference on History of programming languages. New York, NY: ACM. pp. 231–270. 9770: 9699: 9677: 9631: 9604: 9579: 9539: 9121: 8713: 8405: 8326: 6548: 6404: 2374: 2298: 2171: 2019: 1989: 1924: 1898: 1863: 1801: 1775: 1763: 1672: 1611: 1300: 1110: 508: 504: 413: 329: 258: 248: 4828:
evaluates to the value of the symbol foo. Data like the string "123" evaluates to the same string. The list
2710:
Lisp has no notion of operators as implemented in Algol-derived languages. Arithmetic operators in Lisp are
9755: 9671: 9574: 9544: 8895: 8559: 8382: 8153: 8148: 4711: 2388: 2175: 1894: 1649: 571: 563: 496: 443: 438: 364: 339: 324: 7193: 9646: 9641: 9564: 9310: 9159: 8474: 8420: 8397: 8361: 8181: 7737: 6239:
The PDP-6 project started in early 1963, as a 24-bit machine. It grew to 36 bits for LISP, a design goal.
5090:
applies the function successively to the lists' elements in order, collecting the results in a new list:
4943: 1734: 593:
is made of lists. Thus, Lisp programs can manipulate source code as a data structure, giving rise to the
433: 369: 188: 6451: 2030:. It is designed to be a pragmatic general-purpose language. Clojure draws considerable influences from 1139: 9589: 9485: 9468: 8669: 8649: 8634: 8619: 8539: 7121: 6868: 5995: 5613: 5601: 1942: 1890: 1874: 1631: 1360: 1350: 1129: 1086: 428: 384: 374: 314: 253: 233: 223: 213: 153: 7102: 4226:
for "replace car". This function is rarely seen, however, as Common Lisp includes a special facility,
484: 9599: 9554: 9090: 8722: 8594: 8316: 8190: 7991: 6347: 5669: 5590: 5016: 3434:
the list; that is, taking successive cdrs to visit each cons of the list; or by using any of several
2282: 2185: 1958: 1953:, and Scheme. It has many of the features of Lisp Machine Lisp (a large Lisp dialect used to program 1882: 1878: 1699: 1370: 691: 389: 379: 349: 193: 7810: 6369:
McCarthy, John; Abrahams, Paul W.; Edwards, Daniel J.; Hart, Timothy P.; Levin, Michael I. (1985) .
6188:
McCarthy, John; Abrahams, Paul W.; Edwards, Daniel J.; Hart, Timothy P.; Levin, Michael I. (1985) .
3959:, or final sequence of conses. For instance, after the execution of the following Common Lisp code: 2828:. Of course, this would be more useful if a non-trivial expression had been substituted in place of 9636: 9519: 9372: 9007: 8820: 8430: 8163: 8137: 7997: 7322: 7318: 7177: 6931: 5915:"The Art of the Interpreter, or the Modularity Complex (Parts Zero, One, and Two), Part Zero, P. 4" 4638: 3377:
Of the many data structures that can be built out of cons cells, one of the most basic is called a
2858: 2356: 2321: 2128: 2090: 1905: 1622: 1535: 1202: 956: 831: 598: 594: 567: 418: 273: 7376: 7138: 6983: 6487: 6251:
Steele, Guy L.; Gabriel, Richard P. (January 1996), Bergin, Thomas J.; Gibson, Richard G. (eds.),
4661:
for example, Java does not support multiple inheritance and there is no reasonable way to add it.
917:) for the operations that return the first item in a list and the rest of the list, respectively. 9342: 9337: 9182: 8027: 5628: 4665: 2392: 2309: 2218: 2066: 2015: 1464: 1394: 859: 824: 707: 535: 7684: 7678: 7287: 5585:
Various object systems and models have been built on top of, alongside, or into Lisp, including
3726:
procedure is asymmetric in how it handles list arguments, because of how lists are constructed.
9505: 9303: 8825: 8664: 8310: 8275: 8248: 7133: 5676:; Medley, written in Interlisp, originally a family of graphical operating systems that ran on 5019:) and program correctness (since tail recursion may increase stack use in Common Lisp, risking 4867:
this is trivial. An expression which evaluated to a piece of list structure would require that
4673:
for execution. This code can run as fast as code compiled in conventional languages such as C.
4201: 2441: 2306: 1993: 1707: 1703: 1643: 1585: 243: 136: 73: 69: 65: 5796: 5766: 5723: 4573: 4339: 3023:
Named functions are created by storing a lambda expression in a symbol using the defun macro.
9134: 8836: 8792: 8770: 8292: 8127: 7756: 7620: 7084: 6136: 5663: 3435: 2131:
identifies nine important aspects of Lisp that distinguished it from existing languages like
1547: 1425:
Differences between dialects may be quite visible—for instance, Common Lisp uses the keyword
559: 543: 519: 35: 9250: 7846: 6519: 3298:
evolved, the concept of an atom lost importance. Many dialects still retained the predicate
9434: 9382: 9038: 8992: 8760: 7802: 7336: 6843: 3303: 2457: 2430: 2302: 2274: 2226: 2181: 2148: 2011: 1974: 1724: 926: 477: 56: 17: 6234: 3815: 1969:. Common Lisp implementations are available for targeting different platforms such as the 1456: 538:(AI) research. As one of the earliest programming languages, Lisp pioneered many ideas in 8: 9510: 8243: 8171: 7885: 7873: 6230: 5696: 4602: 3642:
procedure, which takes any number of arguments, and returns the list of these arguments.
3236: 1565: 1543: 827:
which could be used to run Lisp programs, or more properly, "evaluate Lisp expressions".
697: 6475:
Outils de generation d'interfaces : etat de l'art et classification by H. El Mrabet
778:. Russell had read McCarthy's paper and realized (to McCarthy's surprise) that the Lisp 9387: 9377: 9347: 9144: 9129: 9081: 8987: 8270: 8224: 8001: 7706: 7159: 5646: 4624: 4568: 3333: 3017: 2327: 2042: 1985: 1981: 1560:
project; later developed by Franz Inc. The name is a humorous deformation of the name "
985: 855: 499:
have existed over its history. Today, the best-known general-purpose Lisp dialects are
96: 6215:
was influenced by the usefulness of having two Lisp 18-bit pointers in a single word.
6038:"Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I" 4621:
use dynamic scoping. Since version 24.1, Emacs uses both dynamic and lexical scoping.
803:
is intended for reading, not for computing. But he went ahead and did it. That is, he
9490: 9220: 9139: 9106: 8740: 8624: 7866: 7761: 7720: 7688: 7659: 7649: 7237: 6527: 6427: 6383: 6268: 6110:. LFP '84: Proceedings of the 1984 ACM Symposium on LISP and functional programming. 6016: 5949: 5872: 5853: 5843: 5772: 4939: 3426:
when referring to conses which are part of a linked list (rather than, say, a tree).
3295: 2711: 2290: 2286: 1938: 1745:. It was written using Allegro Common Lisp and used in the development of the entire 1639: 1098: 7163: 6930:
Clasp is a Common Lisp implementation that interoperates with C++ and uses LLVM for
6799: 6226: 6041: 9086: 9058: 8972: 8890: 8699: 7779: 7741: 7677:
Veitch, Jim (1998). "A history and description of CLOS". In Salus, Peter H. (ed.).
7236:(10th ed.). Boston, MA, US: Addison-Wesley. pp. 47–52, 281–284, 677–680. 7207: 7151: 7143: 6972: 6608: 6260: 6222: 6115: 5918: 5687:; Mezzano; Interim; ChrysaLisp, by developers of Tao Systems' TAOS., and also Guix 5659: 5642: 4931: 2294: 2113: 1867: 1531: 894: 877: 539: 523: 458: 4086:
is the same structure in both lists. It is not a copy; the cons cells pointing to
2313:
Lisp could be regarded as properly conceived object-oriented programming systems.
9197: 9192: 8967: 8858: 8409: 8281: 8264: 8023: 7775: 7294: 7019: 6960: 6089: 5943: 4594: 3443: 3393:
points to a datum (which may be another cons structure, such as a list), and the
3291:
other lists and could be distinguished from other lists by comparison operators.
2520: 2445: 1966: 1962: 1786: 1687: 1491: 799: ... and I said to him, ho, ho, you're confusing theory with practice, this 531: 334: 84: 77: 7926: 6351: 2391:. Unlike most other languages, no distinction is made between "expressions" and 1588:
were widely used and ported, especially with the Computer Algebra System REDUCE.
9392: 9187: 9177: 9172: 9111: 8982: 8387: 8122: 7702: 6954: 6252: 5631:-based object system developed to aid the writing of Garnet, a GUI library for 5299: 5020: 4970: 4634: 4605:. Clojure, Common Lisp and Scheme make use of static scoping by default, while 4598: 4582: 3810: 2680: 2440:
The reliance on expressions gives the language great flexibility. Because Lisp
2093: 2035: 1797:
As of 2010, there were eleven actively maintained Common Lisp implementations.
1746: 950:
and NIL (New Implementation of Lisp) into a single language. The new language,
586: 551: 132: 7860: 6677: 6626: 4946:
order of arguments is undefined, leaving room for optimization by a compiler.
9739: 9609: 9352: 9149: 9096: 9076: 9028: 8997: 8679: 7710: 7044: 6943: 6651: 6326: 5914: 5199: 2214: 978: 760: 527: 481: 263: 8063: 6813:"Why MIT now uses python instead of scheme for its undergraduate CS program" 5945:
GĂśdel, Escher, Bach: An Eternal Golden Braid (Twentieth Anniversary Edition)
5857: 4653:
to the language implementation and cannot be manipulated by the programmer.
2961:
evaluates to a function that, when applied, takes one argument, binds it to
1652:
was in its first version a mix of Scheme with the Common Lisp Object System.
1598:, direct descendant of Maclisp. ZetaLisp had a big influence on Common Lisp. 9661: 9500: 9215: 8748: 8158: 8142: 7594: 7381: 7344: 6264: 5040: 4690: 3228: 2415: 2407: 2331: 2203: 1997: 1954: 1832:
is a service for announcing job offers and there is a weekly news service,
1595: 1446: 922: 816: 785: 775: 718: 714: 606: 7147: 6120: 5906: 5163:
function to each corresponding pair of list elements, yielding the result
9167: 9101: 9068: 9020: 9002: 8753: 8563: 8346: 8233: 8196: 8132: 7402: 7340: 6322: 6318: 5684: 5632: 5608: 5597: 5394: 4980: 4935: 4882:
will be complex, since it must also implement all special operators like
4642: 3370: 3232: 3227:
or a symbol. A symbol was essentially a unique named item, written as an
3110:
in the global environment. It is conceptually similar to the expression:
2410:, sexps), which mirror the internal representation of code and data; and 2370: 2192: 2058: 1930: 1920: 1759: 1742: 1679: 1617: 1561: 1509: 1419: 1214: 1159: 951: 847: 839: 650: 590: 582: 500: 168: 127: 9403: 7947: 7939: 7733: 5744: 9569: 9043: 8900: 8885: 8684: 8585: 8575: 8435: 8259: 7155: 5922: 5681: 4578: 4328: 3447: 2266: 2086: 2078: 2046: 2027: 1950: 1778:, and includes development of new portable libraries and applications. 1767: 1738: 1627: 1553: 1512:, MACLISP is a direct descendant of LISP 1.5. It ran on the PDP-10 and 1472: 1450: 1294: 1224: 1182: 1149: 359: 268: 183: 173: 7921: 7455: 6996: 6485: 5974: 5889: 4861:
function to represent output to the user. For a simple result such as
2395:; all code and data are written as expressions. When an expression is 1568:, the dialect of Common Lisp sold by Franz Inc., in more recent years. 1538:, later adopted as a "West coast" Lisp for the Xerox Lisp machines as 9666: 8905: 8599: 8415: 8392: 8367: 8287: 8033: 7562: 7483: 6379: 5673: 5621: 5222: 4994: 4990: 3711: 3220: 2262: 2199: 2153: 1843: 1791: 1527: 1517: 1320: 1074: 526:, influenced by (though not originally derived from) the notation of 448: 198: 7103:"Meaning of 'Object-Oriented Programming' According to Dr. Alan Kay" 4664:
In simplistic Lisp implementations, this list structure is directly
4625:
List structure of program code; exploitation by macros and compilers
3720:
procedure can be used to add an element to the front of a list. The
2516:. This is the only entity in Lisp which is both an atom and a list. 2297:. It has served as the template for many subsequent Lisp (including 1502:
operating system. It was rendered obsolete by Maclisp and InterLisp.
9367: 8689: 8674: 8659: 8549: 8544: 8492: 8453: 8166: 7958: 7535: 4755:
translates this into a linked list with three elements: the symbol
4670: 4610: 4292:(one quotation mark). For instance, usually if entering the symbol 3562:. An improper list may be written in a combination of the two – as 2861:
and will return their first nil and non-nil argument respectively.
2258: 2247: 2239: 2070: 2054: 1946: 1635: 1591: 1575: 1468: 1330: 1284: 1244: 1234: 947: 804: 278: 238: 158: 7070: 7049:
IEEE 1178-1990 - IEEE Standard for the Scheme Programming Language
7031: 6739: 5870: 5641:(KEE) used an object system named UNITS and integrated it with an 1961:). Common Lisp also borrowed certain features from Scheme such as 954:, was somewhat compatible with the dialects it replaced (the book 487:. Originally specified in the late 1950s, it is the second-oldest 9559: 9549: 8910: 8831: 8654: 8644: 8629: 8589: 8554: 8497: 8487: 8482: 8377: 8048: 7122:"A Real-Time Garbage Collector Based on the Lifetimes of Objects" 5393:
Contrast the examples above with an iterative version which uses
5056: 4618: 4606: 4462:. The backquote is most often used in defining macro expansions. 2348: 2231: 2132: 2062: 2031: 2007: 1934: 1909: 1817: 1771: 1720: 1513: 1505: 1499: 1340: 1310: 1172: 1062: 943: 835: 812: 771: 512: 492: 344: 228: 218: 163: 9295: 8058: 7916: 4265:. However, most other forms evaluate to themselves: if entering 2433:
to integrate S-expressions with the Extensible Markup Language (
1901:(Julia is inspired by Scheme, which in turn is a Lisp dialect). 661: 9626: 9594: 9478: 9207: 8717: 8614: 8580: 8526: 8515: 8507: 8445: 8341: 8305: 7567: 7540: 7488: 7460: 7407: 6486:
Gerald Jay Sussman & Guy Lewis Steele Jr. (December 1975).
6212: 6011:
Jones, Robin; Maynard, Clive; Stewart, Ian (December 6, 2012).
4709:
the result. For this reason, the Lisp command line is called a
3537:
in dotted-pair notation. This is conventionally abbreviated as
3294:
As more data types were introduced in later Lisp dialects, and
3224: 2230:
syntax was invented by McCarthy for a chess program written in
2117: 1661: 1655: 1601: 1495: 1484: 1460: 1441: 1406: 1398: 1274: 1264: 1050: 408: 319: 208: 203: 178: 7803:"The Programming Language Lisp: An Introduction and Appraisal" 7590:"UK micro pioneer Chris Shelton: The mind behind the Nascom 1" 6928: 6895:"MITx introductory Python course hits 1.2 million enrollments" 5607:
LOOPS (Lisp Object-Oriented Programming System) and the later
1542:. A small version called "InterLISP 65" was published for the 909: 9534: 9524: 9495: 9473: 8797: 8639: 8609: 8521: 8254: 7987: 7965: 7785:
The Programming Language LISP: Its Operation and Applications
7638: 6208: 5677: 4646: 4614: 3320: 2907: 2352: 2278: 2235: 2050: 1808:
is a wiki that collects Common Lisp related information, the
1805: 1691: 1571: 1490:
Stanford LISP 1.6 – A successor to LISP 1.5 developed at the
1401:
systems. Lisp was used as the implementation of the language
1192: 752: 423: 404: 309: 7975: 7008:
Clojure is a Lisp not constrained by backwards compatibility
6974:
Comparison of actively developed Common Lisp implementations
6759: 4969:
Programmers in the Scheme dialect often express loops using
1737:(or GOAL) is a video game programming language developed by 883: 48: 9616: 8933:
MIT Computer Science and Artificial Intelligence Laboratory
8727: 8425: 8297: 6699: 6368: 6187: 4716: 3315: 3016:. Here, we're doing a function application: we execute the 2651:
Arithmetic operators are treated similarly. The expression
2143: 2082: 2074: 2023: 1970: 1781:
Many new Lisp programmers were inspired by writers such as
1713: 1626:– a consolidation of several divergent attempts (ZetaLisp, 961: 780: 756: 597:
systems that allow programmers to create new syntax or new
399: 394: 31: 8043: 4684: 3235:, and used either as a variable name or as a data item in 903: 9651: 9621: 8038: 7970: 7510: 7430: 7268:"CSE 341: Scheme: Quote, Quasiquote, and Metaprogramming" 6779: 6313: 5768:
Milestones in computer science and information technology
5497:
The following function reverses a list. (Lisp's built-in
4776:
will be read as the number one hundred and twenty-three.
2494: 2434: 1658:– attempt to develop a new efficient and cleaned-up Lisp. 960:
notes the compatibility of various constructs). In 1994,
453: 8014: 7894:"NASA Programmer Remembers Debugging Lisp in Deep Space" 7829:. Belmont, California: Dickenson Publishing Company Inc. 6719: 2242:
specification. For Lisp, McCarthy used the more general
1842:
is a hosting site for open source Common Lisp projects.
1824:
collects the contents of various Lisp-related blogs, on
1388: 7757:
Hackers & Painters. Big Ideas from the Computer Age
5072:
A good example is a function which in Scheme is called
4873:
traverse the list and print it out as an S-expression.
3306:, defining it true for any object which is not a cons. 3189:
is a global function definition for the function named
3174:
is a macro used to set the value of the first argument
2382: 2344: 2191:
Notation for code made of trees of symbols (using many
2081:, both of which have been successfully embedded in the 838:
became the primitive operations for decomposing lists:
534:. It quickly became a favored programming language for 476:, an abbreviation of "list processing") is a family of 8054:
newLISP - A modern, general-purpose scripting language
8053: 7911: 7335:
4.3. Control Abstraction (Recursion vs. Iteration) in
6547:
Kantrowitz, Mark; Margolin, Barry (20 February 1996).
2456:
A Lisp list is written with its elements separated by
2402:
McCarthy's 1958 paper introduced two types of syntax:
30:"LISP" redirects here. For the speech impediment, see 7701: 7090:
to a letter to the editor, because it was very short.
6802:. schemers.org (2012-01-11). Retrieved on 2013-07-17. 6488:"Scheme: An Interpreter for Extended Lambda Calculus" 6090:"History of Lisp: Artificial Intelligence Laboratory" 3818: 2643:. The third argument is a list; lists can be nested. 1804:
community has created new supporting infrastructure:
1393:
Since inception, Lisp was closely connected with the
900: 880: 7734:
My Lisp Experiences and the Development of GNU Emacs
6977: 6015:. Springer Science & Business Media. p. 2. 4567:
Lisp's formalization of quotation has been noted by
4235: 2301:) object systems, which are often implemented via a 1436: 906: 7085:"LISP prehistory - Summer 1956 through Summer 1958" 6901:. MIT Electrical Engineering & Computer Science 6875:. MIT Electrical Engineering & Computer Science 6137:"LISP prehistory - Summer 1956 through Summer 1958" 6010: 5913:Steele, Guy Lewis; Sussman, Gerald Jay (May 1978). 3710:Because of the way that lists are constructed from 2529:returns its arguments as a list, so the expression 897: 795:Steve Russell said, look, why don't I program this 689:(MIT). McCarthy published its design in a paper in 7175: 6546: 4689:Lisp languages are often used with an interactive 3833: 685:began developing Lisp in 1958 while he was at the 495:. Lisp has changed since its early days, and many 8842:Structure and Interpretation of Computer Programs 7716:Structure and Interpretation of Computer Programs 4098:are in the same memory locations for both lists. 2285:provides multiple inheritance, multimethods with 2261:, the leader of the research team that developed 1723:, a recent dialect of Lisp which compiles to the 9737: 7639:Steele, Jr., Guy L.; Richard P. Gabriel (1993). 7220: 6197:. 15th printing (2nd ed.). p. Preface. 5771:. Greenwood Publishing Group. pp. 156–157. 4894:.) This done, a basic REPL is one line of code: 3453: 2045:in many applications, with the best-known being 1698:as a base document and to work through a public 1550:. Maclisp and InterLisp were strong competitors. 935:routines were developed by MIT graduate student 7119: 6216: 5997:Influential Programming Languages, Part 4: Lisp 5764: 5620:, and its descendant New Flavors (developed by 3586:for the list of three conses whose last cdr is 3492:the cdr. A longer proper list might be written 3207:special operator, returning a function object. 7867:History of LISP at the Computer History Museum 7774: 6861: 2460:, and surrounded by parentheses. For example, 1702:process to find solutions to shared issues of 1594:, also termed Lisp Machine Lisp – used on the 616:that takes three arguments would be called as 9419: 9311: 8093: 8079: 6250: 6219:"The History of TOPS or Life in the Fast ACs" 5912: 4322:Both Common Lisp and Scheme also support the 3631: 2010:is a dialect of Lisp that targets mainly the 1870:program and MITx massive open online course. 1608:(called SOS Interface) was written in LeLisp. 986: 713:McCarthy's original notation used bracketed " 480:with a long history and a distinctive, fully 7120:Lieberman, Henry; Hewitt, Carl (June 1983), 5842:(2nd ed.). Bedford, MA: Digital Press. 3387:(empty list) symbol, or a cons in which the 8939:Stanford Artificial Intelligence Laboratory 7377:"The wild world of non-C operating systems" 7307:Time of Evaluation - Common Lisp Extensions 7194:"A Look at Clojure and the Lisp Resurgence" 7068: 6887: 6259:, New York, NY, US: ACM, pp. 233–330, 5627:KR (short for Knowledge Representation), a 5604:and early versions of Macintosh Common Lisp 3356:. These are respectively equivalent to the 2293:, yielding a flexible and powerful form of 2104:Lisp has officially standardized dialects: 1604:is a French Lisp dialect. One of the first 518:Lisp was originally created as a practical 9692: 9426: 9412: 9318: 9304: 9240: 8086: 8072: 7943:, a comic-book style introductory tutorial 6362: 6128: 5941: 5084:. Given a function and one or more lists, 2908:Lambda expressions and function definition 2427:Lots of Irritating Superfluous Parentheses 1897:is implemented in Femtolisp, a dialect of 1794:" and Lisp's brief gain in the mid-1990s. 993: 979: 852:Contents of the Decrement part of Register 9433: 7988:Oral history interview with John McCarthy 7137: 7013: 6440: 6346:. Boston: Artificial Intelligence Group, 6119: 6004: 1690:for Common Lisp, created by subcommittee 1412: 1405:, which was used in the famous AI system 7819: 7800: 7618: 7533: 7509:Hartmann, Lukas F. (10 September 2015). 7508: 6919:Chapter 1.1.2, History, ANSI CL Standard 6553:FAQ: Lisp Frequently Asked Questions 2/7 6087: 6029: 5993: 5890:"Clojure - Differences with other Lisps" 4819:. This is the result of the evaluation. 3319: 2519:Expressions are written as lists, using 2510:is also represented as the special atom 2273:object system introduced the concept of 2099: 1873:There are several new dialects of Lisp: 1866:instead of Scheme for its undergraduate 1853:The Scheme community actively maintains 1455: 1440: 844:Contents of the Address part of Register 9766:Extensible syntax programming languages 9761:Dynamically typed programming languages 7560: 7481: 7337:Tutorial on Good Lisp Programming Style 7226: 6984:An In-Depth Look at Clojure Collections 6674:"Common Lisp Implementations: A Survey" 6350:and Research Laboratory. Archived from 5972: 5195:Here are examples of Common Lisp code. 4685:Evaluation and the read–eval–print loop 4593:The Lisp family splits over the use of 2478:is a list whose elements are the three 2369:This article's examples are written in 2362: 2123: 1893:(Lisp Flavored Erlang). The parser for 1180: 14: 9738: 8707: 7891: 7801:Berkeley, Edmund C. (September 1964). 7791:. Cambridge, Massachusetts: MIT Press. 7750: 7676: 7374: 7200: 7034:at Sawfish Wikia, retrieved 2009-10-29 7025: 6841: 6517: 6402: 6105: 5966: 5837: 5737: 4656:This feature makes it easy to develop 4286:special operator, or its abbreviation 3381:. A proper list is either the special 2679:evaluates to 10. The equivalent under 1846:is a library manager for Common Lisp. 1378: 1368: 1358: 1348: 1338: 1328: 1318: 1308: 1298: 1292: 1282: 1272: 1262: 1252: 1242: 1232: 1222: 1212: 1200: 1190: 1170: 1163: 1157: 1147: 1137: 1127: 1120: 1117: 1114: 1108: 1096: 1084: 1072: 1060: 1048: 9786:Programming languages created in 1958 9407: 9299: 8927:Massachusetts Institute of Technology 8067: 7587: 7359: 7350: 7329: 7312: 7300: 7281: 7260: 7250: 7186: 7169: 7113: 7095: 7077: 7037: 6989: 6966: 6963:Common Lisp Implementations: A Survey 6948: 6937: 6922: 6913: 6835: 6805: 6793: 6772: 6665: 6640: 6615: 6601: 6580: 6559: 6540: 6511: 6479: 6468: 6434: 6416: 6396: 6307: 6286: 6257:History of programming languages---II 6201: 6155: 6149: 6099: 6081: 6055: 5987: 4949: 3336:. Each cell of this list is called a 2837:Lisp also provides logical operators 1684:American National Standards Institute 1389:Connection to artificial intelligence 687:Massachusetts Institute of Technology 9260: 7871: 6549:"History: Where did Lisp come from?" 6134: 6035: 5806: 5785: 5758: 5708: 5653: 4588: 4466:function on subsequent invocations. 3266:contains three elements: the symbol 2383:Symbolic expressions (S-expressions) 1429:to name a function, but Scheme uses 854:number), where "register" refers to 7744:'s speech, 28 October 2002, at the 7561:Hinsley, Chris (23 February 2022). 7534:Hartmann, Lukas F. (11 June 2021). 7309:. Gnu.org. Retrieved on 2013-07-17. 6671: 6217:Peter J. Hurley (18 October 1990). 6112:Association for Computing Machinery 6088:McCarthy, John (12 February 1979). 3950: 3309: 2089:language, has been embedded in the 2041:Further, Lisp dialects are used as 1675:– IEEE standard, 1178–1990 (R1995). 24: 8944:University of California, Berkeley 8788:Scheme Requests for Implementation 7962:, freeware edition by Peter Seibel 7884:about the use of LISP software on 7611: 6403:Quam, Lynn H.; Diffle, Whitfield. 4782:will be read as the string "123". 4695:integrated development environment 4577:) and others as an example of the 2238:, but it was not made part of the 2002:Scheme Requests for Implementation 1859:Scheme Requests for Implementation 1753: 1558:University of California, Berkeley 1397:research community, especially on 1140:ZIL (Zork Implementation Language) 727:is equivalent to the S-expression 721:. As an example, the M-expression 25: 9797: 9325: 8605:Knowledge Engineering Environment 7835: 7680:Handbook of programming languages 7230:Concepts of Programming Languages 6869:"MIT EECS Undergraduate Programs" 6061: 5639:Knowledge Engineering Environment 5580: 5026:Some Lisp control structures are 4942:('leftmost innermost'), while in 4770:will be read as a single symbol. 4236:Self-evaluating forms and quoting 1915: 1437:Historically significant dialects 784:function could be implemented in 9776:Lisp programming language family 9720: 9719: 9691: 9280: 9279: 9270: 9269: 9259: 9249: 9239: 7872:Bell, Adam Gordon (2 May 2022). 6842:Broder, Evan (January 8, 2008). 6819:. March 24, 2009. Archived from 5942:Hofstadter, Douglas R. (1999) , 4693:, which may be combined with an 4637:(the macro preprocessor for the 4071:respectively. However, the tail 3368:fields discussed in the article 3332:A Lisp list is implemented as a 3328:diagram for the list (42 69 613) 2320:, in which the system walks the 2158:Treating variables uniformly as 893: 876: 717:" that would be translated into 660: 649: 47: 7581: 7554: 7527: 7502: 7475: 7448: 7423: 7395: 7368: 7270:. Cs.washington.edu. 1999-02-22 7179:The Humble Programmer (EWD 340) 7062: 6752: 6732: 6712: 6692: 6526:(2nd ed.). Digital Press. 6426:. March 3, 1979. Archived from 6244: 6181: 5935: 5722:. Read the Docs. Archived from 5501:function does the same thing.) 4852:evaluates to the list (1 2 3). 3438:to map a function over a list. 3399:points to another proper list. 2373:(though most are also valid in 2316:Lisp introduced the concept of 2234:. He proposed its inclusion in 1534:for PDP-10 systems running the 862:(CPU). Lisp dialects still use 704:Information Processing Language 581:derives from "LISt Processor". 489:high-level programming language 294:Information Processing Language 9751:Academic programming languages 7882:(podcast, transcript, photos). 7875:LISP in Space, with Ron Garret 7853:'s history of 12 February 1979 7588:Smith, Tony (21 August 2013). 7375:Proven, Liam (29 March 2022). 6108:Early LISP history (1956–1959) 6106:Stoyan, Herbert (1984-08-06). 5994:Chisnall, David (2011-01-12). 5882: 5864: 5831: 4613:and the embedded languages in 3828: 3822: 3020:by passing to it the value 5. 1937:. The primary influences were 1747:Jak and Daxter series of games 1727:and has a particular focus on 1479:LISP 1 – First implementation. 823:The result was a working Lisp 766:Lisp was first implemented by 13: 1: 8714:Common Lisp Interface Manager 7927:International Lisp Conference 7892:Cassel, David (22 May 2022). 7795:Article largely based on the 7746:International Lisp Conference 7619:McCarthy, John (1979-02-12). 6158:"AI Memo 39-The new compiler" 5702: 5078:and in Common Lisp is called 4938:, arguments are evaluated in 4332:in Scheme), entered with the 3454:S-expressions represent lists 3104:defines a new function named 2745:, returning the new value of 2184:data type, distinct from the 104:, Timothy P. Hart, Mike Levin 8113:Automatic storage management 7917:European Common Lisp Meeting 7797:LISP - A Simple Introduction 7621:"The implementation of Lisp" 7319:3.2.2.3 Semantic Constraints 6372:LISP 1.5 Programmer's Manual 6317:; Brayton, R.; Edwards, D.; 6235:84950@tut.cis.ohio-state.edu 6207:The 36-bit word size of the 6191:LISP 1.5 Programmer's Manual 5948:, Basic Books, p. 292, 4960:, is the precursor to later 3450:, structures, and so forth. 2646: 2389:expression oriented language 2318:automatic garbage collection 1494:, and widely distributed to 548:automatic storage management 7: 9746:Lisp (programming language) 8362:Game Oriented Assembly Lisp 8015:CLiki: the Common Lisp wiki 7719:(2nd ed.). MIT Press. 7403:"Symbolics Open Genera 2.0" 7183:(ACM Turing Award lecture). 7176:Edsger W. Dijkstra (1972), 6518:Steele, Guy L. Jr. (1990). 6013:The Art of Lisp Programming 5690: 5190: 4558:; returns (one two bizarre) 4360:operators. If the variable 4169:, but thereby also changes 3219:there were two fundamental 2198:Full language available at 1912:, "a new dialect of Lisp." 1855:over twenty implementations 1828:users discuss Lisp topics, 1735:Game Oriented Assembly Lisp 967: 491:still in common use, after 114:; 64 years ago 27:Programming language family 10: 9802: 7071:"What Made Lisp Different" 6800:Documents: Standards: R5RS 6650:. Faqs.org. Archived from 6444:InterLisp Reference Manual 6441:Teitelman, Warren (1974). 6424:"Maclisp Reference Manual" 5745:"Wolfram Language Q&A" 5672:, renamed Open Genera, by 5602:Lisp Machines Incorporated 4930:Lisp is usually evaluated 3811:asymptotic time complexity 3632:List-processing procedures 3628:in fully specified form). 3414:functions are also called 3313: 3183:to a new function object. 2912:Another special operator, 2904:will evaluate to "James". 2423:Lost In Stupid Parentheses 2170:Programs made entirely of 1694:, chartered to begin with 1376: 1366: 1356: 1346: 1336: 1054: 640: 29: 9687: 9464: 9441: 9333: 9237: 9206: 9158: 9120: 9067: 8963: 8956: 8919: 8878: 8871: 8851: 8813: 8806: 8780: 8769: 8739: 8698: 8506: 8473: 8466: 8444: 8325: 8232: 8223: 8214: 8191:Common Lisp Object System 8180: 8108: 8101: 8095:Lisp programming language 8020:The Common Lisp Directory 7992:Charles Babbage Institute 7912:Association of Lisp Users 7906:Associations and meetings 7482:froggey (1 August 2021). 7126:Communications of the ACM 6623:"The Road To Lisp Survey" 6348:M.I.T. Computation Center 6340:LISP I Programmers Manual 6299:(define f (lambda (x) x)) 5840:Common Lisp: the language 5591:Common Lisp Object System 5398: 5213:"Hello, World!" 5164: 5158: 5085: 5079: 5073: 5064: 5045: 5010: 5004: 4998: 4984: 4974: 4961: 4955: 4895: 4889: 4883: 4877: 4868: 4862: 4856: 4829: 4823: 4814: 4799: 4793: 4786: 4777: 4771: 4765: 4756: 4750: 4732: 4726: 4701:the entered expressions, 4445: 4424: 4403: 4382: 4367: 4361: 4352: 4343: 4333: 4314: 4299: 4293: 4287: 4281: 4272: 4266: 4260: 4242: 4227: 4221: 4215: 4205: 4176: 4170: 4152: 4146: 4114:, will affect the other: 4109: 4103: 4093: 4087: 4072: 4054: 4036: 4030: 4024: 3804: 3721: 3715: 3637: 3593: 3587: 3563: 3538: 3493: 3487: 3481: 3463: 3421: 3415: 3409: 3403: 3394: 3388: 3382: 3363: 3357: 3344:) and is composed of two 3273: 3267: 3240: 3202: 3196: 3190: 3184: 3175: 3169: 3105: 3078: 3011: 2962: 2919: 2913: 2829: 2811: 2753: 2684: 2620: 2579: 2578:. The "quote" before the 2561: 2524: 2511: 2505: 2495: 2488: 2482: 2461: 2283:Common Lisp Object System 2162:, leaving types to values 1959:Common Lisp Object System 1749:developed by Naughty Dog. 1696:Common Lisp: The Language 1564:", and does not refer to 1326: 1316: 1306: 1290: 1280: 1270: 1260: 1250: 1240: 1230: 1220: 1210: 1206: 1198: 1188: 1178: 1168: 1155: 1145: 1135: 1125: 1106: 1102: 1094: 1090: 1082: 1078: 1070: 1066: 1058: 974:Timeline of Lisp dialects 869: 863: 728: 722: 700:language for algorithms. 692:Communications of the ACM 617: 611: 599:domain-specific languages 305: 300: 292: 287: 149: 142: 126: 108: 95: 83: 55: 46: 8891:Bolt, Beranek and Newman 8821:Common Lisp the Language 7861:McCarthy's history links 7820:Weissman, Clark (1967). 7807:Computers and Automation 7208:"The Jargon File - Lisp" 7069:Paul Graham (May 2002). 6932:just-in-time compilation 6524:Common Lisp the Language 6406:Stanford LISP 1.6 Manual 6156:Hart, Tim; Levin, Mike. 5873:""The Racket Manifesto"" 5765:Edwin D. Reilly (2003). 5503: 5405: 5304: 5227: 5204: 5092: 4468: 4116: 3961: 3885: 3842: 3759: 3728: 3672: 3644: 3239:. For example, the list 3210: 3112: 3025: 2969: 2926: 2863: 2859:short-circuit evaluation 2760: 2724: 2653: 2587: 2531: 2451: 2219:meta-circular evaluation 1623:Common Lisp the Language 1620:(1984), as described by 1043: 1040: 1037: 1034: 1031: 1028: 1025: 1022: 1019: 1016: 1013: 1010: 1007: 1004: 957:Common Lisp the Language 832:assembly language macros 585:are one of Lisp's major 9338:Artificial intelligence 7922:European Lisp Symposium 7431:"Interlisp.org Project" 6648:"Trends for the Future" 6253:"The evolution of Lisp" 6062:Smith, David Canfield. 5838:Steele, Guy L. (1990). 4677:even have a mechanism, 3201:is an abbreviation for 2257:Lisp deeply influenced 2224:A conditional using an 2016:Common Language Runtime 1910:a specification for Bel 1465:University of Wisconsin 1395:artificial intelligence 927:incremental compilation 860:central processing unit 536:artificial intelligence 8826:How to Design Programs 8665:Portable Standard Lisp 8311:Steel Bank Common Lisp 8276:Embeddable Common Lisp 8249:Armed Bear Common Lisp 8128:Higher-order functions 7288:Quasiquotation in Lisp 7022:, Retrieved 2009-10-29 6986:, Retrieved 2012-06-24 6359:Accessed May 11, 2010. 6265:10.1145/234286.1057818 6227:alt.folklore.computers 5975:"Revenge of the Nerds" 5664:language-based systems 4271:into Lisp, it returns 4202:functional programming 4197:for this very reason. 3945:;Output: (1 2 3 a 5 6) 3835: 3436:higher-order functions 3329: 2619:evaluates to the list 2560:evaluates to the list 2341: 1994:tail-call optimization 1644:Steel Bank Common Lisp 1586:Portable Standard Lisp 1536:TENEX operating system 1508:– developed for MIT's 1475: 1453: 1413:Genealogy and variants 821: 791:According to McCarthy 560:higher-order functions 244:Portable Standard Lisp 34:. For other uses, see 9781:Programming languages 9435:Programming languages 9135:Shriram Krishnamurthi 8837:Practical Common Lisp 8793:Common Lisp HyperSpec 8317:Symbolics Common Lisp 8293:Macintosh Common Lisp 7959:Practical Common Lisp 7940:Casting SPELs in Lisp 7782:, eds. (March 1964). 7642:The evolution of Lisp 7627:. Stanford University 7324:Common Lisp HyperSpec 7148:10.1145/358141.358147 7020:Script-fu In GIMP 2.4 6934:(JIT) to native code. 6823:on September 17, 2010 6590:. Iso.org. 2013-10-30 6569:. Iso.org. 2007-10-01 6121:10.1145/800055.802047 4855:It is the job of the 3836: 3323: 2336: 2149:First-class functions 2100:Standardized dialects 1810:Common Lisp directory 1548:Atari 8-bit computers 1459: 1444: 815:machine code, fixing 793: 568:self-hosting compiler 520:mathematical notation 478:programming languages 36:Lisp (disambiguation) 9771:Functional languages 9383:McCarthy 91 function 9039:Robert Tappan Morris 8993:Robert Bruce Findler 8761:Space-cadet keyboard 8172:Tree data structures 8149:Read–eval–print loop 7356:pg 17 of Bobrow 1986 6588:"ISO/IEC 13816:2007" 6567:"ISO/IEC 13816:1997" 4997:constructs (such as 4712:read–eval–print loop 3834:{\displaystyle O(n)} 3816: 3798:;Output: ((1 2) 3 4) 3705:;Output: (1 (2 3) 4) 3460:dotted-pair notation 3304:legacy compatibility 3287:, and the number 2. 2404:Symbolic expressions 2363:Syntax and semantics 2310:meta-circular design 2275:multiple inheritance 2254:and popularized it. 2124:Language innovations 2012:Java virtual machine 1975:Java virtual machine 1725:Java virtual machine 1498:systems running the 1164: ANSI standard 572:read–eval–print loop 544:tree data structures 9756:American inventions 9373:McCarthy evaluation 8781:Technical standards 8244:Allegro Common Lisp 7933:Books and tutorials 7776:Berkeley, Edmund C. 7707:Sussman, Gerald Jay 7365:Veitch, p 108, 1988 6844:"The End of an Era" 5697:Self-modifying code 4574:GĂśdel, Escher, Bach 3237:symbolic processing 2431:metaobject protocol 2303:metaobject protocol 2043:scripting languages 2026:, and compiling to 1566:Allegro Common Lisp 1544:MOS Technology 6502 1049: LISP 1, 1.5, 1001: 755:by Horace Enea and 109:First appeared 43: 9388:Situation calculus 9378:McCarthy Formalism 9358:Garbage collection 9348:Dartmouth workshop 9145:Gerald Jay Sussman 9130:Matthias Felleisen 9082:Richard P. Gabriel 9013:Richard Greenblatt 8988:Matthias Felleisen 8271:Corman Common Lisp 8002:Richard P. Gabriel 7456:"Interlisp Medley" 7293:2013-06-03 at the 6997:"Clojure rational" 6959:2018-06-22 at the 6065:MLISP Users Manual 5747:. Wolfram Research 4950:Control structures 4813:yields the answer 4569:Douglas Hofstadter 4552:should-be-constant 4516:should-be-constant 4477:should-be-constant 3881:;Output: (1 2 3 4) 3831: 3668:;Output: (1 2 a 3) 3334:singly linked list 3330: 3296:programming styles 3018:anonymous function 2712:variadic functions 2328:Edsger W. Dijkstra 2289:, and first-class 2166:Garbage collection 1986:Gerald Jay Sussman 1982:Guy L. Steele, Jr. 1933:is a successor to 1820:written in Lisp), 1606:Interface Builders 1476: 1454: 972: 933:Garbage collection 858:of the computer's 601:embedded in Lisp. 41: 9733: 9732: 9715:Non-English-based 9401: 9400: 9293: 9292: 9233: 9232: 9229: 9228: 9221:Robin Popplestone 9140:Guy L. Steele Jr. 9107:Guy L. Steele Jr. 8952: 8951: 8867: 8866: 8735: 8734: 8625:Lisp Machine Lisp 8535: 8534: 8462: 8461: 8210: 8209: 7951:, a free book by 7780:Bobrow, Daniel G. 7243:978-0-13-139531-2 6848:mitadmissions.org 6672:Weinreb, Daniel. 6274:978-0-201-89502-5 5917:. MIT Libraries. 5778:978-1-57356-521-9 5660:operating systems 5654:Operating systems 5647:truth maintenance 5157:This applies the 5028:special operators 4940:applicative order 4601:(a.k.a. lexical) 4589:Scope and closure 4326:operator (termed 2890:"James" 2884:"never" 2291:generic functions 2287:multiple dispatch 1939:Lisp Machine Lisp 1904:In October 2019, 1640:de facto standard 1467:, displaying the 1386: 1385: 1121: R7RS small 1099:Lisp Machine Lisp 939:, prior to 1962. 811:in my paper into 524:computer programs 467: 466: 128:Typing discipline 16:(Redirected from 9793: 9723: 9722: 9695: 9694: 9428: 9421: 9414: 9405: 9404: 9320: 9313: 9306: 9297: 9296: 9283: 9282: 9273: 9272: 9263: 9262: 9253: 9243: 9242: 9087:Philip Greenspun 9059:Richard Stallman 8973:Daniel G. Bobrow 8961: 8960: 8876: 8875: 8811: 8810: 8778: 8777: 8700:Operating system 8471: 8470: 8230: 8229: 8221: 8220: 8106: 8105: 8088: 8081: 8074: 8065: 8064: 8049:Weekly Lisp News 8026:; archived from 7966:Lisp for the web 7901: 7883: 7830: 7828: 7814: 7792: 7790: 7771: 7742:Richard Stallman 7730: 7698: 7673: 7671: 7670: 7664: 7658:. Archived from 7647: 7635: 7633: 7632: 7606: 7605: 7603: 7602: 7585: 7579: 7578: 7576: 7575: 7558: 7552: 7551: 7549: 7548: 7531: 7525: 7524: 7522: 7521: 7506: 7500: 7499: 7497: 7496: 7479: 7473: 7472: 7470: 7469: 7452: 7446: 7445: 7443: 7442: 7427: 7421: 7420: 7418: 7417: 7412:. 7 January 2020 7410:Internet Archive 7399: 7393: 7392: 7390: 7389: 7372: 7366: 7363: 7357: 7354: 7348: 7333: 7327: 7316: 7310: 7304: 7298: 7285: 7279: 7278: 7276: 7275: 7264: 7258: 7254: 7248: 7247: 7235: 7224: 7218: 7217: 7215: 7214: 7204: 7198: 7197: 7190: 7184: 7182: 7173: 7167: 7166: 7141: 7117: 7111: 7110: 7099: 7093: 7092: 7081: 7075: 7074: 7066: 7060: 7059: 7057: 7055: 7041: 7035: 7029: 7023: 7017: 7011: 7010: 7005: 7003: 6993: 6987: 6981: 6975: 6970: 6964: 6952: 6946: 6941: 6935: 6926: 6920: 6917: 6911: 6910: 6908: 6906: 6891: 6885: 6884: 6882: 6880: 6873:www.eecs.mit.edu 6865: 6859: 6858: 6856: 6854: 6839: 6833: 6832: 6830: 6828: 6809: 6803: 6797: 6791: 6790: 6788: 6787: 6776: 6770: 6769: 6767: 6766: 6756: 6750: 6749: 6747: 6746: 6736: 6730: 6729: 6727: 6726: 6716: 6710: 6709: 6707: 6706: 6696: 6690: 6689: 6687: 6685: 6676:. Archived from 6669: 6663: 6662: 6660: 6659: 6644: 6638: 6637: 6635: 6634: 6625:. Archived from 6619: 6613: 6612: 6605: 6599: 6598: 6596: 6595: 6584: 6578: 6577: 6575: 6574: 6563: 6557: 6556: 6544: 6538: 6537: 6515: 6509: 6508: 6506: 6504: 6492: 6483: 6477: 6472: 6466: 6465: 6463: 6462: 6456: 6450:. Archived from 6449: 6438: 6432: 6431: 6420: 6414: 6413: 6411: 6400: 6394: 6393: 6378:(2nd ed.). 6377: 6366: 6360: 6358: 6356: 6345: 6311: 6305: 6304: 6303:(define (f x) x) 6300: 6295: 6290: 6284: 6283: 6282: 6281: 6248: 6242: 6241: 6205: 6199: 6198: 6196: 6185: 6179: 6178: 6176: 6175: 6169: 6163:. Archived from 6162: 6153: 6147: 6146: 6144: 6143: 6135:McCarthy, John. 6132: 6126: 6125: 6123: 6103: 6097: 6096: 6094: 6085: 6079: 6078: 6076: 6075: 6070: 6059: 6053: 6052: 6050: 6049: 6040:. Archived from 6036:McCarthy, John. 6033: 6027: 6026: 6008: 6002: 6001: 5991: 5985: 5984: 5982: 5981: 5970: 5964: 5963: 5939: 5933: 5932: 5930: 5929: 5910: 5904: 5903: 5901: 5900: 5886: 5880: 5879: 5877: 5868: 5862: 5861: 5835: 5829: 5828: 5826: 5825: 5816:. Archived from 5810: 5804: 5803: 5795:. Archived from 5793:"SICP: Foreword" 5789: 5783: 5782: 5762: 5756: 5755: 5753: 5752: 5741: 5735: 5734: 5732: 5731: 5720:The Julia Manual 5712: 5643:inference engine 5576: 5573: 5570: 5567: 5564: 5561: 5558: 5555: 5552: 5549: 5546: 5543: 5540: 5537: 5534: 5531: 5528: 5525: 5522: 5519: 5516: 5513: 5510: 5507: 5493: 5490: 5487: 5484: 5481: 5478: 5475: 5472: 5469: 5466: 5463: 5460: 5457: 5454: 5451: 5448: 5445: 5442: 5439: 5436: 5433: 5430: 5427: 5424: 5421: 5418: 5415: 5412: 5409: 5402: 5401: 5389: 5386: 5383: 5380: 5377: 5374: 5371: 5368: 5365: 5362: 5359: 5356: 5353: 5350: 5347: 5344: 5341: 5338: 5335: 5332: 5329: 5326: 5323: 5320: 5317: 5314: 5311: 5308: 5294: 5291: 5288: 5285: 5282: 5279: 5276: 5273: 5270: 5267: 5264: 5261: 5258: 5255: 5252: 5249: 5246: 5243: 5240: 5237: 5234: 5231: 5217: 5214: 5211: 5208: 5186: 5185: 5182: 5179: 5176: 5173: 5170: 5167: 5162: 5161: 5153: 5150: 5147: 5144: 5141: 5138: 5135: 5132: 5129: 5126: 5123: 5120: 5117: 5114: 5111: 5108: 5105: 5102: 5099: 5096: 5089: 5088: 5083: 5082: 5077: 5076: 5068: 5067: 5049: 5048: 5014: 5013: 5008: 5007: 5002: 5001: 4988: 4987: 4978: 4977: 4965: 4964: 4959: 4958: 4923: 4922: 4919: 4916: 4913: 4910: 4907: 4904: 4901: 4898: 4893: 4892: 4887: 4886: 4881: 4880: 4872: 4871: 4866: 4865: 4860: 4859: 4851: 4850: 4847: 4844: 4841: 4838: 4835: 4832: 4827: 4826: 4818: 4817: 4812: 4811: 4808: 4805: 4802: 4797: 4796: 4790: 4789: 4781: 4780: 4775: 4774: 4769: 4768: 4760: 4759: 4754: 4753: 4748: 4747: 4744: 4741: 4738: 4735: 4730: 4729: 4680: 4559: 4556: 4553: 4550: 4547: 4544: 4541: 4538: 4535: 4532: 4529: 4526: 4523: 4520: 4517: 4514: 4511: 4508: 4505: 4502: 4499: 4496: 4493: 4490: 4487: 4484: 4481: 4478: 4475: 4472: 4461: 4460: 4457: 4454: 4451: 4448: 4443: 4442: 4439: 4436: 4433: 4430: 4427: 4422: 4421: 4418: 4415: 4412: 4409: 4406: 4401: 4400: 4397: 4394: 4391: 4388: 4385: 4380: 4379: 4376: 4373: 4370: 4365: 4364: 4356: 4355: 4347: 4346: 4337: 4336: 4318: 4317: 4312: 4311: 4308: 4305: 4302: 4297: 4296: 4291: 4290: 4285: 4284: 4276: 4275: 4270: 4269: 4264: 4263: 4258: 4257: 4254: 4251: 4248: 4245: 4231: 4230: 4225: 4224: 4219: 4218: 4209: 4208: 4192: 4191: 4188: 4185: 4182: 4179: 4174: 4173: 4168: 4167: 4164: 4161: 4158: 4155: 4150: 4149: 4141: 4138: 4135: 4132: 4129: 4126: 4123: 4120: 4113: 4112: 4107: 4106: 4097: 4096: 4091: 4090: 4085: 4084: 4081: 4078: 4075: 4070: 4069: 4066: 4063: 4060: 4057: 4052: 4051: 4048: 4045: 4042: 4039: 4034: 4033: 4028: 4027: 4019: 4016: 4013: 4010: 4007: 4004: 4001: 3998: 3995: 3992: 3989: 3986: 3983: 3980: 3977: 3974: 3971: 3968: 3965: 3951:Shared structure 3946: 3943: 3940: 3937: 3934: 3931: 3928: 3925: 3922: 3919: 3916: 3913: 3910: 3907: 3904: 3901: 3898: 3895: 3892: 3889: 3882: 3879: 3876: 3873: 3870: 3867: 3864: 3861: 3858: 3855: 3852: 3849: 3846: 3840: 3838: 3837: 3832: 3808: 3807: 3799: 3796: 3793: 3790: 3787: 3784: 3781: 3778: 3775: 3772: 3769: 3766: 3763: 3756: 3755:;Output: (1 2 3) 3753: 3750: 3747: 3744: 3741: 3738: 3735: 3732: 3725: 3724: 3719: 3718: 3706: 3703: 3700: 3697: 3694: 3691: 3688: 3685: 3682: 3679: 3676: 3669: 3666: 3663: 3660: 3657: 3654: 3651: 3648: 3641: 3640: 3627: 3626: 3623: 3620: 3617: 3614: 3611: 3608: 3605: 3602: 3599: 3596: 3592:(i.e., the list 3591: 3590: 3585: 3584: 3581: 3578: 3575: 3572: 3569: 3566: 3557: 3556: 3553: 3550: 3547: 3544: 3541: 3536: 3535: 3532: 3529: 3526: 3523: 3520: 3517: 3514: 3511: 3508: 3505: 3502: 3499: 3496: 3491: 3490: 3485: 3484: 3479: 3478: 3475: 3472: 3469: 3466: 3425: 3424: 3419: 3418: 3413: 3412: 3407: 3406: 3398: 3397: 3392: 3391: 3386: 3385: 3367: 3366: 3361: 3360: 3310:Conses and lists 3286: 3285: 3282: 3279: 3276: 3271: 3270: 3265: 3264: 3261: 3258: 3255: 3252: 3249: 3246: 3243: 3215:In the original 3206: 3205: 3200: 3199: 3194: 3193: 3188: 3187: 3182: 3181: 3178: 3173: 3172: 3164: 3161: 3158: 3155: 3152: 3149: 3146: 3143: 3140: 3137: 3134: 3131: 3128: 3125: 3122: 3119: 3116: 3109: 3108: 3103: 3102: 3099: 3096: 3093: 3090: 3087: 3084: 3081: 3074: 3071: 3068: 3065: 3062: 3059: 3056: 3053: 3050: 3047: 3044: 3041: 3038: 3035: 3032: 3029: 3015: 3014: 3006: 3003: 3000: 2997: 2994: 2991: 2988: 2985: 2982: 2979: 2976: 2973: 2966: 2965: 2957: 2954: 2951: 2948: 2945: 2942: 2939: 2936: 2933: 2930: 2923: 2922: 2917: 2916: 2900: 2897: 2894: 2891: 2888: 2885: 2882: 2879: 2878:"zero" 2876: 2873: 2870: 2867: 2833: 2832: 2827: 2826: 2823: 2820: 2817: 2814: 2806: 2803: 2800: 2797: 2794: 2791: 2788: 2785: 2782: 2779: 2776: 2773: 2770: 2767: 2764: 2757: 2756: 2748: 2744: 2743:(setq x (+ x 1)) 2737: 2734: 2731: 2728: 2721: 2706: 2705: 2702: 2699: 2696: 2693: 2690: 2687: 2675: 2672: 2669: 2666: 2663: 2660: 2657: 2642: 2641: 2638: 2635: 2632: 2629: 2626: 2623: 2615: 2612: 2609: 2606: 2603: 2600: 2597: 2594: 2591: 2583: 2582: 2577: 2576: 2573: 2570: 2567: 2564: 2556: 2553: 2550: 2547: 2544: 2541: 2538: 2535: 2528: 2527: 2515: 2514: 2509: 2508: 2499: 2498: 2492: 2491: 2486: 2485: 2477: 2476: 2473: 2470: 2467: 2464: 2412:Meta expressions 2295:dynamic dispatch 2114:ANSI Common Lisp 2069:, and Scheme in 2022:VM, the Ruby VM 1967:lexical closures 1868:computer science 1835:Weekly Lisp News 1706:of programs and 1532:BBN Technologies 1432: 1428: 1002: 995: 988: 981: 971: 916: 915: 912: 911: 908: 905: 902: 899: 890: 889: 886: 885: 882: 873: 872: 867: 866: 750: 749: 746: 743: 740: 737: 734: 731: 726: 725: 664: 653: 636: 635: 632: 629: 626: 623: 620: 615: 614: 540:computer science 459:Wolfram Language 122: 120: 115: 85:Designed by 51: 44: 40: 21: 9801: 9800: 9796: 9795: 9794: 9792: 9791: 9790: 9736: 9735: 9734: 9729: 9683: 9460: 9437: 9432: 9402: 9397: 9343:Circumscription 9329: 9324: 9294: 9289: 9225: 9202: 9198:Cynthia Solomon 9193:Mitchel Resnick 9154: 9116: 9063: 9017:Timothy P. Hart 8978:William Clinger 8968:Edmund Berkeley 8948: 8915: 8863: 8859:ProgramByDesign 8847: 8802: 8772: 8765: 8731: 8694: 8531: 8502: 8458: 8440: 8321: 8282:GNU Common Lisp 8265:CMU Common Lisp 8235: 8216:Implementations 8206: 8176: 8097: 8092: 8024:Wayback Machine 7976:Let over Lambda 7847:History of Lisp 7838: 7833: 7826: 7823:LISP 1.5 Primer 7788: 7768: 7727: 7703:Abelson, Harold 7695: 7668: 7666: 7662: 7656: 7645: 7630: 7628: 7625:History of Lisp 7614: 7612:Further reading 7609: 7600: 7598: 7586: 7582: 7573: 7571: 7559: 7555: 7546: 7544: 7532: 7528: 7519: 7517: 7507: 7503: 7494: 7492: 7480: 7476: 7467: 7465: 7454: 7453: 7449: 7440: 7438: 7437:. 15 March 2022 7429: 7428: 7424: 7415: 7413: 7401: 7400: 7396: 7387: 7385: 7373: 7369: 7364: 7360: 7355: 7351: 7347:, August, 1993. 7334: 7330: 7317: 7313: 7305: 7301: 7295:Wayback Machine 7286: 7282: 7273: 7271: 7266: 7265: 7261: 7255: 7251: 7244: 7233: 7225: 7221: 7212: 7210: 7206: 7205: 7201: 7192: 7191: 7187: 7174: 7170: 7118: 7114: 7101: 7100: 7096: 7083: 7082: 7078: 7067: 7063: 7053: 7051: 7043: 7042: 7038: 7030: 7026: 7018: 7014: 7001: 6999: 6995: 6994: 6990: 6982: 6978: 6971: 6967: 6961:Wayback Machine 6953: 6949: 6942: 6938: 6927: 6923: 6918: 6914: 6904: 6902: 6893: 6892: 6888: 6878: 6876: 6867: 6866: 6862: 6852: 6850: 6840: 6836: 6826: 6824: 6811: 6810: 6806: 6798: 6794: 6785: 6783: 6780:"LISP50@OOPSLA" 6778: 6777: 6773: 6764: 6762: 6758: 6757: 6753: 6744: 6742: 6738: 6737: 6733: 6724: 6722: 6718: 6717: 6713: 6704: 6702: 6698: 6697: 6693: 6683: 6681: 6670: 6666: 6657: 6655: 6646: 6645: 6641: 6632: 6630: 6621: 6620: 6616: 6609:"X3J13 Charter" 6607: 6606: 6602: 6593: 6591: 6586: 6585: 6581: 6572: 6570: 6565: 6564: 6560: 6545: 6541: 6534: 6516: 6512: 6502: 6500: 6490: 6484: 6480: 6473: 6469: 6460: 6458: 6454: 6447: 6439: 6435: 6422: 6421: 6417: 6409: 6401: 6397: 6390: 6375: 6367: 6363: 6354: 6343: 6312: 6308: 6302: 6298: 6296: 6294:(defun f (x) x) 6293: 6291: 6287: 6279: 6277: 6275: 6249: 6245: 6206: 6202: 6194: 6186: 6182: 6173: 6171: 6167: 6160: 6154: 6150: 6141: 6139: 6133: 6129: 6114:. p. 307. 6104: 6100: 6092: 6086: 6082: 6073: 6071: 6068: 6060: 6056: 6047: 6045: 6034: 6030: 6023: 6009: 6005: 5992: 5988: 5979: 5977: 5971: 5967: 5956: 5940: 5936: 5927: 5925: 5911: 5907: 5898: 5896: 5888: 5887: 5883: 5875: 5869: 5865: 5850: 5836: 5832: 5823: 5821: 5812: 5811: 5807: 5799:on 2001-07-27. 5791: 5790: 5786: 5779: 5763: 5759: 5750: 5748: 5743: 5742: 5738: 5729: 5727: 5714: 5713: 5709: 5705: 5693: 5656: 5583: 5578: 5577: 5574: 5571: 5568: 5565: 5562: 5559: 5556: 5553: 5550: 5547: 5544: 5541: 5538: 5535: 5532: 5529: 5526: 5523: 5520: 5517: 5514: 5511: 5508: 5505: 5495: 5494: 5491: 5488: 5485: 5482: 5479: 5476: 5473: 5470: 5467: 5464: 5461: 5458: 5455: 5452: 5449: 5446: 5443: 5440: 5437: 5434: 5431: 5428: 5425: 5422: 5419: 5416: 5413: 5410: 5407: 5399: 5391: 5390: 5387: 5384: 5381: 5378: 5375: 5372: 5369: 5366: 5363: 5360: 5357: 5354: 5351: 5348: 5345: 5342: 5339: 5336: 5333: 5330: 5327: 5324: 5321: 5318: 5315: 5312: 5309: 5306: 5296: 5295: 5292: 5289: 5286: 5283: 5280: 5277: 5274: 5271: 5268: 5265: 5262: 5259: 5256: 5253: 5250: 5247: 5244: 5241: 5238: 5235: 5232: 5229: 5219: 5218: 5215: 5212: 5209: 5206: 5193: 5183: 5180: 5177: 5174: 5171: 5168: 5165: 5159: 5155: 5154: 5151: 5148: 5145: 5142: 5139: 5136: 5133: 5130: 5127: 5124: 5121: 5118: 5115: 5112: 5109: 5106: 5103: 5100: 5097: 5094: 5086: 5080: 5074: 5065: 5046: 5011: 5005: 4999: 4985: 4975: 4962: 4956: 4952: 4920: 4917: 4914: 4911: 4908: 4905: 4902: 4899: 4896: 4890: 4884: 4878: 4869: 4863: 4857: 4848: 4845: 4842: 4839: 4836: 4833: 4830: 4824: 4815: 4809: 4806: 4803: 4800: 4794: 4787: 4779:"123" 4778: 4772: 4766: 4757: 4751: 4749:at the prompt, 4745: 4742: 4739: 4736: 4733: 4727: 4687: 4678: 4627: 4591: 4561: 4560: 4557: 4554: 4551: 4548: 4545: 4542: 4539: 4536: 4533: 4530: 4527: 4524: 4521: 4518: 4515: 4512: 4509: 4506: 4503: 4500: 4497: 4494: 4491: 4488: 4485: 4482: 4479: 4476: 4473: 4470: 4458: 4455: 4452: 4449: 4446: 4440: 4437: 4434: 4431: 4428: 4425: 4419: 4416: 4413: 4410: 4407: 4404: 4398: 4395: 4392: 4389: 4386: 4383: 4377: 4374: 4371: 4368: 4362: 4353: 4344: 4334: 4315: 4309: 4306: 4303: 4300: 4294: 4288: 4282: 4273: 4267: 4261: 4255: 4252: 4249: 4246: 4243: 4238: 4228: 4222: 4216: 4206: 4200:Aficionados of 4189: 4186: 4183: 4180: 4177: 4171: 4165: 4162: 4159: 4156: 4153: 4147: 4143: 4142: 4139: 4136: 4133: 4130: 4127: 4124: 4121: 4118: 4110: 4104: 4094: 4088: 4082: 4079: 4076: 4073: 4067: 4064: 4061: 4058: 4055: 4049: 4046: 4043: 4040: 4037: 4031: 4025: 4021: 4020: 4017: 4014: 4011: 4008: 4005: 4002: 3999: 3996: 3993: 3990: 3987: 3984: 3981: 3978: 3975: 3972: 3969: 3966: 3963: 3953: 3948: 3947: 3944: 3941: 3938: 3935: 3932: 3929: 3926: 3923: 3920: 3917: 3914: 3911: 3908: 3905: 3902: 3899: 3896: 3893: 3890: 3887: 3884: 3883: 3880: 3877: 3874: 3871: 3868: 3865: 3862: 3859: 3856: 3853: 3850: 3847: 3844: 3817: 3814: 3813: 3805: 3801: 3800: 3797: 3794: 3791: 3788: 3785: 3782: 3779: 3776: 3773: 3770: 3767: 3764: 3761: 3758: 3757: 3754: 3751: 3748: 3745: 3742: 3739: 3736: 3733: 3730: 3722: 3716: 3708: 3707: 3704: 3701: 3698: 3695: 3692: 3689: 3686: 3683: 3680: 3677: 3674: 3671: 3670: 3667: 3664: 3661: 3658: 3655: 3652: 3649: 3646: 3638: 3634: 3624: 3621: 3618: 3615: 3612: 3609: 3606: 3603: 3600: 3597: 3594: 3588: 3582: 3579: 3576: 3573: 3570: 3567: 3564: 3554: 3551: 3548: 3545: 3542: 3539: 3533: 3530: 3527: 3524: 3521: 3518: 3515: 3512: 3509: 3506: 3503: 3500: 3497: 3494: 3488: 3486:is the car and 3482: 3476: 3473: 3470: 3467: 3464: 3456: 3422: 3416: 3410: 3404: 3395: 3389: 3383: 3364: 3358: 3318: 3312: 3283: 3280: 3277: 3274: 3268: 3262: 3259: 3256: 3253: 3250: 3247: 3244: 3241: 3213: 3203: 3197: 3191: 3185: 3179: 3176: 3170: 3166: 3165: 3162: 3159: 3156: 3153: 3150: 3147: 3144: 3141: 3138: 3135: 3132: 3129: 3126: 3123: 3120: 3117: 3114: 3106: 3100: 3097: 3094: 3091: 3088: 3085: 3082: 3079: 3076: 3075: 3072: 3069: 3066: 3063: 3060: 3057: 3054: 3051: 3048: 3045: 3042: 3039: 3036: 3033: 3030: 3027: 3012: 3008: 3007: 3004: 3001: 2998: 2995: 2992: 2989: 2986: 2983: 2980: 2977: 2974: 2971: 2963: 2959: 2958: 2955: 2952: 2949: 2946: 2943: 2940: 2937: 2934: 2931: 2928: 2920: 2914: 2910: 2902: 2901: 2898: 2895: 2892: 2889: 2886: 2883: 2880: 2877: 2874: 2871: 2868: 2865: 2830: 2824: 2822:"bar" 2821: 2818: 2815: 2812: 2808: 2807: 2804: 2802:"bar" 2801: 2798: 2795: 2792: 2789: 2786: 2784:"foo" 2783: 2780: 2777: 2774: 2771: 2768: 2765: 2762: 2754: 2746: 2742: 2739: 2738: 2735: 2732: 2729: 2726: 2719: 2703: 2700: 2697: 2694: 2691: 2688: 2685: 2677: 2676: 2673: 2670: 2667: 2664: 2661: 2658: 2655: 2649: 2639: 2636: 2633: 2630: 2627: 2624: 2621: 2617: 2616: 2613: 2610: 2607: 2604: 2601: 2598: 2595: 2592: 2589: 2580: 2574: 2571: 2568: 2565: 2562: 2558: 2557: 2554: 2551: 2548: 2545: 2542: 2539: 2536: 2533: 2525: 2521:prefix notation 2512: 2506: 2504:The empty list 2496: 2489: 2483: 2474: 2471: 2468: 2465: 2462: 2454: 2446:metaprogramming 2385: 2365: 2142:not limited to 2126: 2112:, IEEE Scheme, 2102: 1963:lexical scoping 1918: 1840:Common-lisp.net 1787:Eric S. Raymond 1756: 1754:2000 to present 1556:– originally a 1530:– developed at 1492:Stanford AI Lab 1439: 1430: 1426: 1415: 1391: 1000: 999: 970: 896: 892: 879: 875: 870: 864: 774:computer using 747: 744: 741: 738: 735: 732: 729: 723: 698:Turing-complete 680: 679: 678: 677: 667: 666: 665: 656: 655: 654: 643: 633: 630: 627: 624: 621: 618: 612: 587:data structures 532:lambda calculus 485:prefix notation 463: 283: 118: 116: 113: 39: 28: 23: 22: 15: 12: 11: 5: 9799: 9789: 9788: 9783: 9778: 9773: 9768: 9763: 9758: 9753: 9748: 9731: 9730: 9728: 9727: 9717: 9712: 9707: 9702: 9688: 9685: 9684: 9682: 9681: 9674: 9669: 9664: 9659: 9654: 9649: 9644: 9639: 9634: 9629: 9624: 9619: 9614: 9613: 9612: 9602: 9597: 9592: 9587: 9582: 9577: 9572: 9567: 9562: 9557: 9552: 9547: 9542: 9537: 9532: 9527: 9522: 9517: 9516: 9515: 9514: 9513: 9508: 9493: 9488: 9483: 9482: 9481: 9471: 9465: 9462: 9461: 9459: 9458: 9453: 9448: 9442: 9439: 9438: 9431: 9430: 9423: 9416: 9408: 9399: 9398: 9396: 9395: 9393:Space fountain 9390: 9385: 9380: 9375: 9370: 9365: 9360: 9355: 9350: 9345: 9340: 9334: 9331: 9330: 9323: 9322: 9315: 9308: 9300: 9291: 9290: 9238: 9235: 9234: 9231: 9230: 9227: 9226: 9224: 9223: 9218: 9212: 9210: 9204: 9203: 9201: 9200: 9195: 9190: 9188:Seymour Papert 9185: 9180: 9178:Wally Feurzeig 9175: 9173:Denison Bollay 9170: 9164: 9162: 9156: 9155: 9153: 9152: 9147: 9142: 9137: 9132: 9126: 9124: 9118: 9117: 9115: 9114: 9112:Daniel Weinreb 9109: 9104: 9099: 9094: 9084: 9079: 9073: 9071: 9065: 9064: 9062: 9061: 9056: 9051: 9046: 9041: 9036: 9031: 9026: 9023: 9018: 9015: 9010: 9005: 9000: 8995: 8990: 8985: 8983:R. Kent Dybvig 8980: 8975: 8970: 8964: 8958: 8954: 8953: 8950: 8949: 8947: 8946: 8941: 8936: 8930: 8923: 8921: 8917: 8916: 8914: 8913: 8908: 8903: 8898: 8893: 8888: 8886:Apple Computer 8882: 8880: 8873: 8869: 8868: 8865: 8864: 8862: 8861: 8855: 8853: 8849: 8848: 8846: 8845: 8839: 8834: 8829: 8823: 8817: 8815: 8808: 8804: 8803: 8801: 8800: 8795: 8790: 8784: 8782: 8775: 8767: 8766: 8764: 8763: 8758: 8757: 8756: 8745: 8743: 8737: 8736: 8733: 8732: 8730: 8725: 8720: 8711: 8704: 8702: 8696: 8695: 8693: 8692: 8687: 8682: 8677: 8672: 8667: 8662: 8657: 8652: 8647: 8642: 8637: 8632: 8627: 8622: 8617: 8612: 8607: 8602: 8597: 8592: 8583: 8578: 8573: 8557: 8552: 8547: 8542: 8536: 8533: 8532: 8530: 8529: 8524: 8519: 8512: 8510: 8504: 8503: 8501: 8500: 8495: 8490: 8485: 8479: 8477: 8468: 8467:Unstandardized 8464: 8463: 8460: 8459: 8457: 8456: 8450: 8448: 8442: 8441: 8439: 8438: 8433: 8428: 8423: 8418: 8413: 8403: 8400: 8395: 8390: 8388:MIT/GNU Scheme 8385: 8380: 8375: 8370: 8365: 8359: 8354: 8349: 8344: 8339: 8331: 8329: 8323: 8322: 8320: 8319: 8314: 8308: 8303: 8300: 8295: 8290: 8285: 8279: 8273: 8268: 8262: 8257: 8252: 8246: 8240: 8238: 8227: 8218: 8212: 8211: 8208: 8207: 8205: 8204: 8199: 8194: 8187: 8185: 8178: 8177: 8175: 8174: 8169: 8161: 8156: 8151: 8146: 8140: 8135: 8130: 8125: 8123:Dynamic typing 8120: 8115: 8109: 8103: 8099: 8098: 8091: 8090: 8083: 8076: 8068: 8062: 8061: 8056: 8051: 8046: 8041: 8036: 8034:Lisp FAQ Index 8031: 8017: 8011: 8010: 8006: 8005: 7995: 7984: 7983: 7979: 7978: 7973: 7968: 7963: 7955: 7944: 7935: 7934: 7930: 7929: 7924: 7919: 7914: 7908: 7907: 7903: 7902: 7889: 7869: 7864: 7854: 7843: 7842: 7837: 7836:External links 7834: 7832: 7831: 7817: 7816: 7815: 7772: 7766: 7748: 7731: 7725: 7711:Sussman, Julie 7699: 7693: 7674: 7654: 7636: 7615: 7613: 7610: 7608: 7607: 7580: 7553: 7526: 7501: 7474: 7447: 7422: 7394: 7367: 7358: 7349: 7328: 7311: 7299: 7280: 7259: 7249: 7242: 7219: 7199: 7185: 7168: 7132:(6): 419–429, 7112: 7105:. 2003-07-23. 7094: 7076: 7061: 7036: 7024: 7012: 6988: 6976: 6965: 6947: 6936: 6921: 6912: 6886: 6860: 6834: 6804: 6792: 6771: 6751: 6731: 6711: 6691: 6664: 6639: 6614: 6600: 6579: 6558: 6539: 6532: 6510: 6478: 6467: 6433: 6430:on 2007-12-14. 6415: 6395: 6388: 6361: 6357:on 2010-07-17. 6337:(March 1960). 6329:; Maling, K.; 6306: 6285: 6273: 6243: 6200: 6180: 6148: 6127: 6098: 6080: 6054: 6028: 6021: 6003: 5986: 5965: 5954: 5934: 5905: 5881: 5863: 5848: 5830: 5805: 5784: 5777: 5757: 5736: 5716:"Introduction" 5706: 5704: 5701: 5700: 5699: 5692: 5689: 5655: 5652: 5651: 5650: 5649:system (ATMS). 5636: 5625: 5611: 5605: 5596:ObjectLisp or 5594: 5582: 5581:Object systems 5579: 5504: 5406: 5305: 5300:tail recursion 5228: 5205: 5192: 5189: 5093: 5021:stack overflow 4971:tail recursion 4951: 4948: 4686: 4683: 4635:C preprocessor 4626: 4623: 4590: 4587: 4583:self-reference 4469: 4366:has the value 4237: 4234: 4117: 3962: 3952: 3949: 3886: 3843: 3830: 3827: 3824: 3821: 3760: 3729: 3673: 3645: 3633: 3630: 3455: 3452: 3340:(in Scheme, a 3314:Main article: 3311: 3308: 3212: 3209: 3113: 3026: 2970: 2927: 2909: 2906: 2864: 2761: 2741:equivalent to 2725: 2722:giving syntax 2681:infix notation 2654: 2648: 2645: 2588: 2532: 2453: 2450: 2384: 2381: 2380: 2379: 2364: 2361: 2334:lecture said, 2211: 2210: 2196: 2189: 2178: 2168: 2163: 2156: 2151: 2146: 2125: 2122: 2101: 2098: 2094:window manager 2036:type inference 1917: 1916:Major dialects 1914: 1755: 1752: 1751: 1750: 1732: 1718: 1711: 1676: 1669: 1659: 1653: 1647: 1615: 1609: 1599: 1589: 1579: 1569: 1551: 1525: 1503: 1488: 1480: 1438: 1435: 1414: 1411: 1390: 1387: 1384: 1383: 1377: 1374: 1373: 1367: 1364: 1363: 1357: 1354: 1353: 1347: 1344: 1343: 1337: 1334: 1333: 1327: 1324: 1323: 1317: 1314: 1313: 1307: 1304: 1303: 1297: 1291: 1288: 1287: 1281: 1278: 1277: 1271: 1268: 1267: 1261: 1258: 1257: 1251: 1248: 1247: 1241: 1238: 1237: 1231: 1228: 1227: 1221: 1218: 1217: 1211: 1208: 1207: 1205: 1199: 1196: 1195: 1189: 1186: 1185: 1179: 1176: 1175: 1169: 1166: 1165: 1162: 1156: 1153: 1152: 1146: 1143: 1142: 1136: 1133: 1132: 1126: 1123: 1122: 1119: 1116: 1113: 1107: 1104: 1103: 1101: 1095: 1092: 1091: 1089: 1083: 1080: 1079: 1077: 1071: 1068: 1067: 1065: 1059: 1056: 1055: 1053: 1046: 1045: 1042: 1039: 1036: 1033: 1030: 1027: 1024: 1021: 1018: 1015: 1012: 1009: 1006: 998: 997: 990: 983: 975: 973: 969: 966: 937:Daniel Edwards 706:was the first 669: 668: 659: 658: 657: 648: 647: 646: 645: 644: 642: 639: 552:dynamic typing 472:(historically 465: 464: 462: 461: 456: 451: 446: 441: 436: 431: 426: 421: 416: 411: 402: 397: 392: 387: 382: 377: 372: 367: 362: 357: 352: 347: 342: 337: 332: 327: 322: 317: 312: 306: 303: 302: 298: 297: 290: 289: 285: 284: 282: 281: 276: 271: 266: 261: 256: 251: 246: 241: 236: 231: 226: 221: 216: 211: 206: 201: 196: 191: 186: 181: 176: 171: 166: 161: 156: 150: 147: 146: 140: 139: 130: 124: 123: 110: 106: 105: 99: 93: 92: 87: 81: 80: 62:Multi-paradigm 59: 53: 52: 26: 9: 6: 4: 3: 2: 9798: 9787: 9784: 9782: 9779: 9777: 9774: 9772: 9769: 9767: 9764: 9762: 9759: 9757: 9754: 9752: 9749: 9747: 9744: 9743: 9741: 9726: 9718: 9716: 9713: 9711: 9708: 9706: 9703: 9701: 9698: 9690: 9689: 9686: 9680: 9679: 9675: 9673: 9670: 9668: 9665: 9663: 9660: 9658: 9655: 9653: 9650: 9648: 9645: 9643: 9640: 9638: 9635: 9633: 9630: 9628: 9625: 9623: 9620: 9618: 9615: 9611: 9610:Object Pascal 9608: 9607: 9606: 9603: 9601: 9598: 9596: 9593: 9591: 9588: 9586: 9583: 9581: 9578: 9576: 9573: 9571: 9568: 9566: 9563: 9561: 9558: 9556: 9553: 9551: 9548: 9546: 9543: 9541: 9538: 9536: 9533: 9531: 9528: 9526: 9523: 9521: 9518: 9512: 9509: 9507: 9504: 9503: 9502: 9499: 9498: 9497: 9494: 9492: 9489: 9487: 9484: 9480: 9477: 9476: 9475: 9472: 9470: 9467: 9466: 9463: 9457: 9454: 9452: 9449: 9447: 9444: 9443: 9440: 9436: 9429: 9424: 9422: 9417: 9415: 9410: 9409: 9406: 9394: 9391: 9389: 9386: 9384: 9381: 9379: 9376: 9374: 9371: 9369: 9366: 9364: 9361: 9359: 9356: 9354: 9353:Frame problem 9351: 9349: 9346: 9344: 9341: 9339: 9336: 9335: 9332: 9328: 9327:John McCarthy 9321: 9316: 9314: 9309: 9307: 9302: 9301: 9298: 9288: 9287: 9278: 9277: 9268: 9267: 9258: 9257: 9252: 9248: 9247: 9236: 9222: 9219: 9217: 9214: 9213: 9211: 9209: 9205: 9199: 9196: 9194: 9191: 9189: 9186: 9184: 9181: 9179: 9176: 9174: 9171: 9169: 9166: 9165: 9163: 9161: 9157: 9151: 9150:Julie Sussman 9148: 9146: 9143: 9141: 9138: 9136: 9133: 9131: 9128: 9127: 9125: 9123: 9119: 9113: 9110: 9108: 9105: 9103: 9100: 9098: 9097:David A. Moon 9095: 9092: 9088: 9085: 9083: 9080: 9078: 9077:Scott Fahlman 9075: 9074: 9072: 9070: 9066: 9060: 9057: 9055: 9054:Steve Russell 9052: 9050: 9047: 9045: 9042: 9040: 9037: 9035: 9034:John McCarthy 9032: 9030: 9029:David Luckham 9027: 9024: 9022: 9019: 9016: 9014: 9011: 9009: 9006: 9004: 9001: 8999: 8998:Matthew Flatt 8996: 8994: 8991: 8989: 8986: 8984: 8981: 8979: 8976: 8974: 8971: 8969: 8966: 8965: 8962: 8959: 8955: 8945: 8942: 8940: 8937: 8934: 8931: 8928: 8925: 8924: 8922: 8918: 8912: 8909: 8907: 8904: 8902: 8899: 8897: 8894: 8892: 8889: 8887: 8884: 8883: 8881: 8877: 8874: 8872:Organizations 8870: 8860: 8857: 8856: 8854: 8850: 8843: 8840: 8838: 8835: 8833: 8830: 8827: 8824: 8822: 8819: 8818: 8816: 8812: 8809: 8805: 8799: 8796: 8794: 8791: 8789: 8786: 8785: 8783: 8779: 8776: 8774: 8768: 8762: 8759: 8755: 8752: 8751: 8750: 8747: 8746: 8744: 8742: 8738: 8729: 8726: 8724: 8721: 8719: 8715: 8712: 8710: 8709: 8705: 8703: 8701: 8697: 8691: 8688: 8686: 8683: 8681: 8678: 8676: 8673: 8671: 8668: 8666: 8663: 8661: 8658: 8656: 8653: 8651: 8648: 8646: 8643: 8641: 8638: 8636: 8633: 8631: 8628: 8626: 8623: 8621: 8618: 8616: 8613: 8611: 8608: 8606: 8603: 8601: 8598: 8596: 8593: 8591: 8587: 8584: 8582: 8579: 8577: 8574: 8571: 8570: 8565: 8561: 8558: 8556: 8553: 8551: 8548: 8546: 8543: 8541: 8538: 8537: 8528: 8525: 8523: 8520: 8517: 8514: 8513: 8511: 8509: 8505: 8499: 8496: 8494: 8491: 8489: 8486: 8484: 8481: 8480: 8478: 8476: 8472: 8469: 8465: 8455: 8452: 8451: 8449: 8447: 8443: 8437: 8434: 8432: 8429: 8427: 8424: 8422: 8419: 8417: 8414: 8411: 8407: 8404: 8402:Pocket Scheme 8401: 8399: 8396: 8394: 8391: 8389: 8386: 8384: 8381: 8379: 8376: 8374: 8371: 8369: 8366: 8363: 8360: 8358: 8355: 8353: 8350: 8348: 8345: 8343: 8340: 8338: 8337: 8333: 8332: 8330: 8328: 8324: 8318: 8315: 8312: 8309: 8307: 8304: 8301: 8299: 8296: 8294: 8291: 8289: 8286: 8283: 8280: 8277: 8274: 8272: 8269: 8266: 8263: 8261: 8258: 8256: 8253: 8250: 8247: 8245: 8242: 8241: 8239: 8237: 8231: 8228: 8226: 8222: 8219: 8217: 8213: 8203: 8200: 8198: 8195: 8192: 8189: 8188: 8186: 8183: 8179: 8173: 8170: 8168: 8165: 8162: 8160: 8159:S-expressions 8157: 8155: 8152: 8150: 8147: 8144: 8143:M-expressions 8141: 8139: 8136: 8134: 8131: 8129: 8126: 8124: 8121: 8119: 8116: 8114: 8111: 8110: 8107: 8104: 8100: 8096: 8089: 8084: 8082: 8077: 8075: 8070: 8069: 8066: 8060: 8057: 8055: 8052: 8050: 8047: 8045: 8042: 8040: 8037: 8035: 8032: 8029: 8025: 8021: 8018: 8016: 8013: 8012: 8008: 8007: 8003: 7999: 7996: 7993: 7989: 7986: 7985: 7981: 7980: 7977: 7974: 7972: 7969: 7967: 7964: 7961: 7960: 7956: 7954: 7950: 7949: 7945: 7942: 7941: 7937: 7936: 7932: 7931: 7928: 7925: 7923: 7920: 7918: 7915: 7913: 7910: 7909: 7905: 7904: 7899: 7898:The New Stack 7895: 7890: 7887: 7881: 7877: 7876: 7870: 7868: 7865: 7862: 7858: 7855: 7852: 7851:John McCarthy 7848: 7845: 7844: 7840: 7839: 7825: 7824: 7818: 7812: 7808: 7804: 7798: 7794: 7793: 7787: 7786: 7781: 7777: 7773: 7769: 7767:0-596-00662-4 7763: 7759: 7758: 7753: 7749: 7747: 7743: 7739: 7735: 7732: 7728: 7726:0-262-01153-0 7722: 7718: 7717: 7712: 7708: 7704: 7700: 7696: 7694:1-57870-011-6 7690: 7686: 7682: 7681: 7675: 7665:on 2006-10-12 7661: 7657: 7655:0-89791-570-4 7651: 7644: 7643: 7637: 7626: 7622: 7617: 7616: 7597: 7596: 7591: 7584: 7570: 7569: 7564: 7557: 7543: 7542: 7537: 7530: 7516: 7512: 7505: 7491: 7490: 7485: 7478: 7463: 7462: 7457: 7451: 7436: 7435:Interlisp.org 7432: 7426: 7411: 7409: 7404: 7398: 7384: 7383: 7378: 7371: 7362: 7353: 7346: 7342: 7338: 7332: 7326: 7325: 7320: 7315: 7308: 7303: 7297:, Alan Bawden 7296: 7292: 7289: 7284: 7269: 7263: 7253: 7245: 7239: 7232: 7231: 7223: 7209: 7203: 7195: 7189: 7181: 7180: 7172: 7165: 7161: 7157: 7153: 7149: 7145: 7140: 7139:10.1.1.4.8633 7135: 7131: 7127: 7123: 7116: 7109: 7104: 7098: 7091: 7086: 7080: 7072: 7065: 7050: 7046: 7045:"IEEE Scheme" 7040: 7033: 7028: 7021: 7016: 7009: 6998: 6992: 6985: 6980: 6973: 6969: 6962: 6958: 6955: 6951: 6944: 6940: 6933: 6929: 6925: 6916: 6900: 6896: 6890: 6874: 6870: 6864: 6849: 6845: 6838: 6822: 6818: 6814: 6808: 6801: 6796: 6781: 6775: 6761: 6755: 6741: 6735: 6721: 6715: 6701: 6700:"Planet Lisp" 6695: 6680:on 2012-04-21 6679: 6675: 6668: 6654:on 2013-06-03 6653: 6649: 6643: 6629:on 2006-10-04 6628: 6624: 6618: 6610: 6604: 6589: 6583: 6568: 6562: 6554: 6550: 6543: 6535: 6533:0-13-152414-3 6529: 6525: 6521: 6514: 6498: 6497: 6489: 6482: 6476: 6471: 6457:on 2006-06-02 6453: 6446: 6445: 6437: 6429: 6425: 6419: 6408: 6407: 6399: 6391: 6389:0-262-13011-4 6385: 6381: 6374: 6373: 6365: 6353: 6349: 6342: 6341: 6336: 6332: 6328: 6324: 6320: 6316: 6310: 6292:Common Lisp: 6289: 6276: 6270: 6266: 6262: 6258: 6254: 6247: 6240: 6236: 6232: 6228: 6224: 6220: 6214: 6210: 6204: 6193: 6192: 6184: 6170:on 2020-12-13 6166: 6159: 6152: 6138: 6131: 6122: 6117: 6113: 6109: 6102: 6091: 6084: 6067: 6066: 6058: 6044:on 2013-10-04 6043: 6039: 6032: 6024: 6022:9781447117193 6018: 6014: 6007: 5999: 5998: 5990: 5976: 5973:Paul Graham. 5969: 5962: 5961:Intelligence. 5957: 5955:0-465-02656-7 5951: 5947: 5946: 5938: 5924: 5920: 5916: 5909: 5895: 5891: 5885: 5874: 5867: 5859: 5855: 5851: 5849:1-55558-041-6 5845: 5841: 5834: 5820:on 2014-04-03 5819: 5815: 5814:"Conclusions" 5809: 5802: 5798: 5794: 5788: 5780: 5774: 5770: 5769: 5761: 5746: 5740: 5726:on 2016-04-08 5725: 5721: 5717: 5711: 5707: 5698: 5695: 5694: 5688: 5686: 5683: 5679: 5675: 5671: 5667: 5665: 5661: 5648: 5644: 5640: 5637: 5634: 5630: 5626: 5623: 5619: 5615: 5612: 5610: 5606: 5603: 5599: 5595: 5592: 5588: 5587: 5586: 5502: 5500: 5404: 5396: 5322:&optional 5303: 5301: 5226: 5224: 5203: 5201: 5200:Hello, World! 5196: 5188: 5091: 5070: 5060: 5058: 5052: 5043: 5042: 5041:continuations 5035: 5031: 5029: 5024: 5022: 5018: 4996: 4992: 4982: 4972: 4967: 4966:structures.) 4947: 4945: 4941: 4937: 4933: 4928: 4925: 4874: 4853: 4820: 4783: 4762: 4723: 4720: 4718: 4714: 4713: 4708: 4704: 4700: 4696: 4692: 4682: 4674: 4672: 4667: 4662: 4659: 4654: 4650: 4648: 4644: 4640: 4636: 4631: 4622: 4620: 4616: 4612: 4608: 4604: 4600: 4596: 4586: 4584: 4580: 4579:philosophical 4576: 4575: 4570: 4565: 4467: 4463: 4444:evaluates to 4402:evaluates to 4359: 4351:and comma-at 4350: 4341: 4331: 4330: 4325: 4320: 4313:or, usually, 4278: 4259:evaluates to 4233: 4213: 4203: 4198: 4196: 4145:This changes 4115: 4099: 3960: 3958: 3841: 3825: 3819: 3812: 3727: 3713: 3643: 3629: 3561: 3560:list notation 3461: 3451: 3449: 3445: 3439: 3437: 3433: 3427: 3400: 3380: 3375: 3373: 3372: 3355: 3351: 3348:, called the 3347: 3343: 3339: 3335: 3327: 3322: 3317: 3307: 3305: 3301: 3297: 3292: 3288: 3238: 3234: 3230: 3226: 3222: 3218: 3208: 3111: 3024: 3021: 3019: 3010:evaluates to 2968: 2925: 2905: 2862: 2860: 2857:operators do 2856: 2852: 2848: 2844: 2840: 2835: 2810:evaluates to 2759: 2750: 2723: 2717: 2713: 2708: 2682: 2652: 2644: 2586: 2530: 2522: 2517: 2502: 2500: 2481: 2459: 2449: 2447: 2443: 2438: 2436: 2432: 2428: 2424: 2419: 2417: 2416:M-expressions 2413: 2409: 2408:S-expressions 2405: 2400: 2398: 2394: 2390: 2378: 2376: 2372: 2367: 2366: 2360: 2358: 2354: 2350: 2347:community as 2346: 2340: 2335: 2333: 2329: 2325: 2323: 2319: 2314: 2311: 2308: 2304: 2300: 2296: 2292: 2288: 2284: 2280: 2276: 2272: 2268: 2264: 2260: 2255: 2253: 2249: 2245: 2241: 2237: 2233: 2229: 2228: 2222: 2220: 2216: 2215:homoiconicity 2209: 2205: 2201: 2197: 2194: 2190: 2187: 2183: 2179: 2177: 2173: 2169: 2167: 2164: 2161: 2157: 2155: 2152: 2150: 2147: 2145: 2141: 2138: 2137: 2136: 2134: 2130: 2121: 2119: 2115: 2111: 2107: 2097: 2095: 2092: 2088: 2084: 2080: 2076: 2072: 2068: 2065:, Nyquist in 2064: 2060: 2056: 2052: 2048: 2044: 2039: 2037: 2033: 2029: 2025: 2021: 2017: 2013: 2009: 2005: 2003: 1999: 1998:continuations 1995: 1991: 1987: 1983: 1978: 1976: 1972: 1968: 1964: 1960: 1956: 1955:Lisp Machines 1952: 1948: 1944: 1940: 1936: 1932: 1928: 1926: 1922: 1913: 1911: 1907: 1902: 1900: 1896: 1892: 1888: 1884: 1880: 1876: 1871: 1869: 1865: 1860: 1856: 1851: 1847: 1845: 1841: 1837: 1836: 1831: 1827: 1823: 1819: 1815: 1811: 1807: 1803: 1798: 1795: 1793: 1788: 1784: 1779: 1777: 1773: 1769: 1765: 1761: 1748: 1744: 1740: 1736: 1733: 1730: 1726: 1722: 1719: 1715: 1712: 1709: 1708:compatibility 1705: 1701: 1697: 1693: 1689: 1685: 1681: 1677: 1674: 1670: 1667: 1663: 1660: 1657: 1654: 1651: 1648: 1645: 1641: 1637: 1633: 1629: 1625: 1624: 1619: 1616: 1613: 1610: 1607: 1603: 1600: 1597: 1596:Lisp machines 1593: 1590: 1587: 1583: 1582:Standard Lisp 1580: 1578:was based on. 1577: 1573: 1570: 1567: 1563: 1559: 1555: 1552: 1549: 1545: 1541: 1537: 1533: 1529: 1526: 1523: 1519: 1515: 1511: 1507: 1504: 1501: 1497: 1493: 1489: 1486: 1481: 1478: 1477: 1474: 1470: 1466: 1462: 1458: 1452: 1448: 1443: 1434: 1423: 1421: 1410: 1408: 1404: 1403:Micro Planner 1400: 1396: 1382: 1375: 1372: 1365: 1362: 1355: 1352: 1345: 1342: 1335: 1332: 1325: 1322: 1315: 1312: 1305: 1302: 1296: 1289: 1286: 1279: 1276: 1269: 1266: 1259: 1256: 1249: 1246: 1239: 1236: 1229: 1226: 1219: 1216: 1209: 1204: 1197: 1194: 1187: 1184: 1177: 1174: 1167: 1161: 1154: 1151: 1144: 1141: 1134: 1131: 1124: 1112: 1105: 1100: 1093: 1088: 1081: 1076: 1069: 1064: 1057: 1052: 1047: 1003: 996: 991: 989: 984: 982: 977: 976: 965: 963: 959: 958: 953: 949: 945: 940: 938: 934: 930: 928: 924: 918: 914: 888: 861: 857: 853: 849: 845: 841: 837: 833: 828: 826: 820: 818: 814: 810: 806: 802: 798: 792: 789: 787: 783: 782: 777: 776:punched cards 773: 769: 768:Steve Russell 764: 762: 761:Vaughan Pratt 758: 754: 720: 719:S-expressions 716: 715:M-expressions 711: 709: 705: 701: 699: 694: 693: 688: 684: 683:John McCarthy 676: 675:Steve Russell 672: 671:John McCarthy 663: 652: 638: 609: 608: 607:s-expressions 602: 600: 596: 592: 588: 584: 580: 575: 573: 569: 565: 561: 557: 553: 549: 545: 541: 537: 533: 529: 528:Alonzo Church 525: 521: 516: 514: 510: 506: 502: 498: 494: 490: 486: 483: 482:parenthesized 479: 475: 471: 460: 457: 455: 452: 450: 447: 445: 442: 440: 437: 435: 432: 430: 427: 425: 422: 420: 417: 415: 412: 410: 406: 403: 401: 398: 396: 393: 391: 388: 386: 383: 381: 378: 376: 373: 371: 368: 366: 363: 361: 358: 356: 353: 351: 348: 346: 343: 341: 338: 336: 333: 331: 328: 326: 323: 321: 318: 316: 313: 311: 308: 307: 304: 299: 295: 291: 288:Influenced by 286: 280: 277: 275: 272: 270: 267: 265: 262: 260: 257: 255: 252: 250: 247: 245: 242: 240: 237: 235: 232: 230: 227: 225: 222: 220: 217: 215: 212: 210: 207: 205: 202: 200: 197: 195: 192: 190: 187: 185: 182: 180: 177: 175: 172: 170: 167: 165: 162: 160: 157: 155: 152: 151: 148: 145: 141: 138: 134: 131: 129: 125: 111: 107: 103: 102:Steve Russell 100: 98: 94: 91: 90:John McCarthy 88: 86: 82: 79: 75: 71: 67: 63: 60: 58: 54: 50: 45: 37: 33: 19: 9710:Generational 9700:Alphabetical 9696: 9676: 9584: 9501:Visual Basic 9362: 9284: 9274: 9264: 9254: 9244: 9216:Rod Burstall 9183:Brian Harvey 8749:Lisp machine 8706: 8567: 8334: 8225:Standardized 8164:Self-hosting 8145:(deprecated) 8133:Linked lists 8118:Conditionals 8094: 8028:the original 7971:Land of Lisp 7957: 7946: 7938: 7897: 7879: 7874: 7857:Lisp History 7822: 7806: 7796: 7784: 7760:. O'Reilly. 7755: 7752:Graham, Paul 7714: 7679: 7667:. Retrieved 7660:the original 7641: 7629:. Retrieved 7624: 7599:. Retrieved 7595:The Register 7593: 7583: 7572:. Retrieved 7566: 7563:"ChrysaLisp" 7556: 7545:. Retrieved 7539: 7529: 7518:. Retrieved 7514: 7504: 7493:. Retrieved 7487: 7477: 7466:. Retrieved 7464:. March 2022 7459: 7450: 7439:. Retrieved 7434: 7425: 7414:. Retrieved 7406: 7397: 7386:. Retrieved 7382:The Register 7380: 7370: 7361: 7352: 7345:Peter Norvig 7331: 7323: 7314: 7302: 7283: 7272:. Retrieved 7262: 7252: 7229: 7222: 7211:. Retrieved 7202: 7188: 7178: 7171: 7129: 7125: 7115: 7106: 7097: 7088: 7079: 7064: 7052:. Retrieved 7048: 7039: 7027: 7015: 7007: 7000:. Retrieved 6991: 6979: 6968: 6950: 6939: 6924: 6915: 6903:. Retrieved 6898: 6889: 6877:. Retrieved 6872: 6863: 6853:November 10, 6851:. Retrieved 6847: 6837: 6827:November 10, 6825:. Retrieved 6821:the original 6817:cemerick.com 6816: 6807: 6795: 6784:. Retrieved 6782:. Lisp50.org 6774: 6763:. Retrieved 6754: 6743:. Retrieved 6734: 6723:. Retrieved 6714: 6703:. Retrieved 6694: 6682:. Retrieved 6678:the original 6667: 6656:. Retrieved 6652:the original 6642: 6631:. Retrieved 6627:the original 6617: 6603: 6592:. Retrieved 6582: 6571:. Retrieved 6561: 6552: 6542: 6523: 6513: 6501:. Retrieved 6494: 6481: 6470: 6459:. Retrieved 6452:the original 6443: 6436: 6428:the original 6418: 6405: 6398: 6371: 6364: 6352:the original 6339: 6315:McCarthy, J. 6309: 6288: 6278:, retrieved 6256: 6246: 6238: 6203: 6190: 6183: 6172:. Retrieved 6165:the original 6151: 6140:. Retrieved 6130: 6107: 6101: 6083: 6072:. Retrieved 6064: 6057: 6046:. Retrieved 6042:the original 6031: 6012: 6006: 5996: 5989: 5978:. Retrieved 5968: 5959: 5944: 5937: 5926:. Retrieved 5908: 5897:. Retrieved 5893: 5884: 5866: 5839: 5833: 5822:. Retrieved 5818:the original 5808: 5800: 5797:the original 5787: 5767: 5760: 5749:. Retrieved 5739: 5728:. Retrieved 5724:the original 5719: 5710: 5685:workstations 5668: 5662:, including 5657: 5584: 5572:return-value 5566:return-value 5533:return-value 5498: 5496: 5392: 5297: 5220: 5197: 5194: 5156: 5071: 5061: 5053: 5038: 5036: 5032: 5027: 5025: 4968: 4963:if-then-else 4953: 4929: 4926: 4875: 4854: 4821: 4784: 4763: 4724: 4721: 4710: 4706: 4702: 4698: 4691:command line 4688: 4675: 4663: 4657: 4655: 4651: 4632: 4628: 4592: 4572: 4566: 4562: 4540:'bizarre 4464: 4357: 4348: 4340:grave accent 4327: 4323: 4321: 4279: 4239: 4212:set car bang 4211: 4199: 4194: 4144: 4100: 4022: 3956: 3954: 3802: 3709: 3635: 3559: 3459: 3457: 3440: 3431: 3428: 3401: 3378: 3376: 3369: 3353: 3349: 3341: 3337: 3331: 3299: 3293: 3289: 3229:alphanumeric 3216: 3214: 3167: 3077: 3022: 3009: 2960: 2911: 2903: 2854: 2850: 2846: 2842: 2838: 2836: 2809: 2751: 2740: 2715: 2709: 2678: 2650: 2618: 2559: 2518: 2503: 2479: 2455: 2439: 2426: 2422: 2420: 2411: 2403: 2401: 2396: 2393:"statements" 2386: 2368: 2342: 2337: 2332:Turing Award 2330:in his 1972 2326: 2315: 2256: 2252:if–then–else 2251: 2246:-structure. 2243: 2227:if–then–else 2225: 2223: 2212: 2204:compile time 2140:Conditionals 2127: 2103: 2040: 2006: 1979: 1929: 1919: 1903: 1872: 1852: 1848: 1839: 1833: 1799: 1796: 1780: 1757: 1695: 1665: 1621: 1447:Lisp machine 1424: 1416: 1392: 955: 941: 931: 923:machine code 919: 851: 846:number) and 843: 829: 822: 808: 800: 796: 794: 790: 786:machine code 779: 765: 712: 702: 690: 681: 605: 603: 583:Linked lists 578: 576: 556:conditionals 542:, including 517: 473: 469: 468: 9705:Categorical 9168:Hal Abelson 9102:Kent Pitman 9069:Common Lisp 9021:Louis Hodes 9008:Paul Graham 9003:Phyllis Fox 8773:of practice 8754:TI Explorer 8347:Chez Scheme 8197:CommonLoops 8059:Lisp Weekly 8044:Planet Lisp 7953:Paul Graham 7886:NASA robots 7880:CoRecursive 7341:Kent Pitman 7156:1721.1/6335 6905:31 December 6879:31 December 6760:"Quicklisp" 6720:"LispForum" 6503:23 December 6335:Russell, S. 6327:Luckham, D. 5923:1721.1/6094 5894:clojure.org 5633:Common Lisp 5629:constraints 5616:, built at 5609:CommonLoops 5598:Object Lisp 5395:Common Lisp 5202:" program: 5198:The basic " 5039:re-entrant 4983:'s complex 4981:Common Lisp 4936:Common Lisp 4822:The symbol 4666:interpreted 4643:Objective-C 4338:character ( 4195:destructive 3448:hash tables 3432:cdring down 3379:proper list 3371:linked list 3272:, the list 3233:source code 3186:fdefinition 3177:fdefinition 3124:fdefinition 2387:Lisp is an 2371:Common Lisp 2355:-descended 2193:parentheses 2172:expressions 2129:Paul Graham 2110:R7RS Scheme 2106:R6RS Scheme 2059:Visual Lisp 2018:(CLR), the 1941:, Maclisp, 1931:Common Lisp 1921:Common Lisp 1906:Paul Graham 1822:Planet Lisp 1802:open source 1783:Paul Graham 1760:Common Lisp 1743:Naughty Dog 1729:concurrency 1704:portability 1680:Common Lisp 1618:Common Lisp 1562:Franz Liszt 1540:InterLisp-D 1510:Project MAC 1420:Common Lisp 1331:Visual LISP 1215:Chez Scheme 1160:Common Lisp 1118: R6RS 1115: R5RS 952:Common Lisp 825:interpreter 591:source code 589:, and Lisp 501:Common Lisp 169:Common Lisp 9740:Categories 9570:JavaScript 9446:Comparison 9049:David Park 9044:Joel Moses 9025:Mike Levin 8901:Lucid Inc. 8852:Curriculum 8685:Spice Lisp 8586:Franz Lisp 8576:Emacs Lisp 8436:TinyScheme 8260:Clozure CL 7982:Interviews 7738:transcript 7669:2008-10-17 7631:2008-10-17 7601:2022-02-02 7574:2022-02-02 7547:2022-02-02 7520:2022-02-02 7515:Interim-os 7495:2022-02-02 7468:2022-02-02 7441:2022-02-02 7416:2022-02-02 7388:2024-04-04 7274:2013-11-15 7213:2006-10-13 6786:2013-11-15 6765:2023-10-12 6745:2023-10-12 6740:"Lispjobs" 6725:2023-10-12 6705:2023-10-12 6658:2013-11-15 6633:2006-10-13 6594:2013-11-15 6573:2013-11-15 6496:MIT AI Lab 6461:2006-08-19 6280:2022-07-25 6174:2019-03-18 6142:2010-03-14 6074:2006-10-13 6048:2006-10-13 5980:2013-03-14 5928:2020-08-01 5899:2022-10-27 5824:2014-06-04 5751:2016-12-10 5730:2016-12-10 5703:References 5600:, used by 5044:using the 4991:tail calls 4792:function, 4705:them, and 4329:quasiquote 4137:'goose 4023:the lists 3712:cons pairs 3231:string in 3221:data types 2683:would be " 2458:whitespace 2307:reflective 2267:Xerox PARC 2176:statements 2087:Emacs Lisp 2079:TinyScheme 2057:and later 2047:Emacs Lisp 2028:JavaScript 2014:, and the 1951:Spice Lisp 1768:Emacs Lisp 1739:Andy Gavin 1628:Spice Lisp 1554:Franz Lisp 1473:Franz Lisp 1451:MIT Museum 1295:PLT Scheme 1225:Emacs Lisp 1183:MIT Scheme 1150:Franz Lisp 673:(top) and 570:, and the 360:JavaScript 301:Influenced 269:Spice Lisp 184:Franz Lisp 174:Emacs Lisp 74:reflective 70:procedural 66:functional 9667:Smalltalk 9091:10th rule 8920:Education 8906:Symbolics 8896:Harlequin 8807:Education 8771:Community 8600:Interlisp 8416:Scheme 48 8393:MultiLisp 8368:GNU Guile 8288:LispWorks 8154:Recursion 8039:lisppaste 8022:(via the 8009:Resources 8004:(Podcast) 7998:Interview 7799:chapter: 7536:"Interim" 7511:"Interim" 7484:"Mezzano" 7134:CiteSeerX 7054:27 August 7002:27 August 6520:"Purpose" 6499:. AIM-349 6380:MIT Press 6323:Hodes, L. 6223:Newsgroup 5680:'s later 5674:Symbolics 5622:Symbolics 5414:factorial 5361:factorial 5313:factorial 5281:factorial 5236:factorial 5223:factorial 4995:iteration 4703:evaluates 4679:eval-when 4658:efficient 4324:backquote 4220:is named 2896:'time 2893:'task 2647:Operators 2442:functions 2397:evaluated 2263:Smalltalk 2200:load time 2188:data type 2154:Recursion 1996:and full 1908:released 1844:Quicklisp 1826:LispForum 1814:lisppaste 1792:AI winter 1700:consensus 1528:Interlisp 1518:Macintosh 1487:would be. 1463:from the 1321:GNU Guile 1075:Interlisp 856:registers 577:The name 564:recursion 449:Smalltalk 199:Interlisp 97:Developer 9725:Category 9491:Assembly 9451:Timeline 9368:ALGOL 60 9286:Category 9276:Category 8879:Business 8741:Hardware 8690:Zetalisp 8675:S-1 Lisp 8660:Picolisp 8550:BBN LISP 8545:AutoLISP 8493:StarLogo 8454:OpenLisp 8410:features 8167:compiler 8102:Features 7754:(2004). 7713:(1996). 7291:Archived 7164:14161480 6957:Archived 6899:MIT EECS 6331:Park, D. 6297:Scheme: 5858:20631879 5691:See also 5658:Several 5512:-reverse 5191:Examples 4979:loop to 4671:bytecode 4611:Picolisp 4581:idea of 4423:, while 4316:'foo 4217:set-car! 4207:set-car! 3480:, where 3346:pointers 3324:Box-and- 3204:function 2351:and the 2277:and the 2259:Alan Kay 2250:took up 2248:Algol 60 2240:Algol 58 2208:run time 2174:with no 2160:pointers 2116:and ISO 2071:LilyPond 2067:Audacity 2055:AutoLISP 2053:editor, 1947:S-1 Lisp 1830:Lispjobs 1688:standard 1636:S-1 Lisp 1592:ZetaLisp 1576:AutoLISP 1574:, which 1522:McCarthy 1469:man page 1381:Chialisp 1285:OpenLisp 1245:PicoLisp 1235:AutoLISP 968:Timeline 948:ZetaLisp 946:such as 834:for the 805:compiled 497:dialects 279:Zetalisp 239:Picolisp 159:AutoLISP 144:Dialects 57:Paradigm 9678:more... 9657:Scratch 9560:Haskell 9550:Fortran 9506:classic 9456:History 9266:Commons 8935:(CSAIL) 8911:Xanalys 8832:On Lisp 8655:PC-LISP 8645:newLISP 8630:Maclisp 8590:PC-LISP 8569:history 8555:Clojure 8518:(POP-1) 8498:UCBLogo 8488:NetLogo 8483:MSWLogo 8378:JScheme 8352:Chicken 8336:History 8267:(CMUCL) 8202:Flavors 8184:systems 7948:On Lisp 7841:History 7685:107–158 7234:(print) 6684:4 April 6319:Fox, P. 6231:Usenet: 6225::  5614:Flavors 5499:reverse 5480:finally 5403:macro: 5057:Haskell 5047:call/cc 4932:eagerly 4619:AutoCAD 4607:newLISP 4595:dynamic 4349:unquote 4108:with a 3326:pointer 2349:Fortran 2271:Flavors 2232:Fortran 2133:Fortran 2091:Sawfish 2063:AutoCAD 2049:in the 2032:Haskell 2008:Clojure 1935:Maclisp 1887:Liskell 1818:IRC bot 1772:Clojure 1721:Clojure 1717:models. 1686:(ANSI) 1614:(1975). 1546:-based 1514:Multics 1506:Maclisp 1500:TOPS-10 1449:in the 1341:Clojure 1311:newLISP 1173:Le Lisp 1063:Maclisp 944:Maclisp 836:IBM 704 813:IBM 704 772:IBM 704 641:History 513:Clojure 493:Fortran 345:Haskell 229:newLISP 219:Maclisp 164:Clojure 133:Dynamic 117: ( 9697:Lists: 9632:Python 9627:Prolog 9605:Pascal 9595:MATLAB 9580:Kotlin 9540:Erlang 9479:Simula 9122:Scheme 8957:People 8844:(SICP) 8828:(HTDP) 8723:Genera 8718:McCLIM 8615:LeLisp 8581:EuLisp 8527:POP-11 8516:COWSEL 8446:ISLISP 8406:Racket 8373:Ikarus 8364:(GOAL) 8357:Gambit 8342:Bigloo 8327:Scheme 8313:(SBCL) 8306:Poplog 8302:Movitz 8251:(ABCL) 8234:Common 8193:(CLOS) 8182:Object 8138:Macros 7764:  7723:  7691:  7652:  7568:GitHub 7541:GitHub 7489:GitHub 7461:GitHub 7408:GitHub 7240:  7162:  7136:  7032:librep 6530:  6386:  6271:  6233:  6213:PDP-10 6019:  5952:  5856:  5846:  5775:  5670:Genera 5645:and a 5542:dolist 5486:return 5101:#' 5098:mapcar 5087:mapcar 5081:mapcar 5006:dolist 4944:Scheme 4891:lambda 4707:prints 4599:static 4546:; bad! 4358:splice 4223:rplaca 4210:(read 4006:'x 3985:'c 3982:'b 3979:'a 3891:append 3848:append 3806:append 3714:, the 3659:'a 3444:arrays 3225:number 3198:#' 3180:'f 3168:where 3139:lambda 3133:#' 3127:'f 2975:lambda 2932:lambda 2921:lambda 2915:lambda 2849:. The 2493:, and 2375:Scheme 2299:Scheme 2281:. The 2206:, and 2186:string 2182:symbol 2118:ISLISP 2020:Python 1990:Scheme 1973:, the 1925:Scheme 1899:Scheme 1889:, and 1864:Python 1776:Racket 1774:, and 1764:Scheme 1673:Scheme 1662:ISLISP 1656:EuLisp 1634:, and 1612:Scheme 1602:LeLisp 1496:PDP-10 1485:LISP 2 1461:4.3BSD 1431:define 1407:SHRDLU 1399:PDP-10 1379:  1369:  1359:  1349:  1339:  1329:  1319:  1309:  1301:Racket 1299:  1293:  1283:  1275:ISLISP 1273:  1265:EuLisp 1263:  1255:Gambit 1253:  1243:  1233:  1223:  1213:  1201:  1191:  1181:  1171:  1158:  1148:  1138:  1128:  1111:Scheme 1109:  1097:  1085:  1073:  1061:  1051:LISP 2 770:on an 566:, the 511:, and 509:Racket 505:Scheme 414:Python 330:Elixir 320:COWSEL 259:Scheme 249:Racket 209:LeLisp 204:ISLISP 179:EuLisp 137:strong 9672:Swift 9662:Shell 9575:Julia 9545:Forth 9535:COBOL 9496:BASIC 9474:ALGOL 9256:Books 8929:(MIT) 8814:Books 8798:X3J13 8680:SKILL 8640:MLisp 8610:*Lisp 8564:Apple 8560:Dylan 8522:POP-2 8284:(GCL) 8278:(ECL) 8255:CLISP 8000:with 7827:(PDF) 7789:(PDF) 7663:(PDF) 7646:(PDF) 7160:S2CID 6491:(PDF) 6455:(PDF) 6448:(PDF) 6410:(PDF) 6376:(PDF) 6355:(PDF) 6344:(PDF) 6209:PDP-6 6195:(PDF) 6168:(PDF) 6161:(PDF) 6093:(PDF) 6069:(PDF) 5876:(PDF) 5678:Xerox 5509:defun 5411:defun 5346:zerop 5310:defun 5293:))))) 5257:zerop 5233:defun 5210:print 5131:' 5107:' 4934:. In 4906:print 4870:print 4858:print 4834:quote 4699:reads 4615:Emacs 4603:scope 4534:stuff 4531:third 4510:stuff 4495:three 4483:' 4474:defun 4381:then 4304:quote 4289:' 4283:quote 4187:goose 4163:goose 4128:third 4111:goose 3930:' 3918:' 3912:' 3894:' 3866:' 3851:' 3783:' 3768:' 3740:' 3684:' 3417:first 3211:Atoms 3154:block 3083:defun 3031:defun 2716:n-ary 2549:quote 2480:atoms 2452:Lists 2425:, or 2353:ALGOL 2279:mixin 2236:ALGOL 2051:Emacs 1895:Julia 1816:, an 1806:CLiki 1692:X3J13 1682:– an 1678:ANSI 1671:IEEE 1650:Dylan 1572:XLISP 1427:defun 1193:XLISP 1044:2020 1041:2015 1038:2010 1035:2005 1032:2000 1029:1995 1026:1990 1023:1985 1020:1980 1017:1975 1014:1970 1011:1965 1008:1960 1005:1958 753:MLisp 595:macro 444:Swift 439:Scala 424:Rebol 405:POP-2 365:Julia 340:Forth 335:Excel 325:Dylan 310:CLIPS 296:(IPL) 264:SKILL 9647:Rust 9642:Ruby 9617:Perl 9585:Lisp 9565:Java 9511:.NET 9363:Lisp 9246:List 9160:Logo 8728:Scsh 8708:List 8475:Logo 8426:SIOD 8398:Pico 8383:Kawa 8298:Mocl 8236:Lisp 7813:-23. 7762:ISBN 7721:ISBN 7689:ISBN 7650:ISBN 7343:and 7238:ISBN 7056:2019 7004:2019 6907:2018 6881:2018 6855:2013 6829:2013 6686:2012 6528:ISBN 6505:2021 6384:ISBN 6269:ISBN 6017:ISBN 5950:ISBN 5854:OCLC 5844:ISBN 5773:ISBN 5682:Star 5589:The 5560:push 5551:list 5518:list 5462:then 5438:from 5429:loop 5400:loop 5388:)))) 5017:jump 5012:loop 4986:loop 4957:cond 4921:)))) 4918:read 4912:eval 4900:loop 4879:eval 4795:eval 4788:eval 4785:The 4752:read 4728:read 4725:The 4717:REPL 4645:and 4617:and 4571:(in 4525:setf 4438:snue 4396:snue 4363:snue 4229:setf 4122:setf 4092:and 4053:and 4035:are 4029:and 4003:cons 3994:setf 3976:list 3967:setf 3957:tail 3803:The 3765:cons 3734:cons 3723:cons 3717:cons 3678:list 3650:list 3639:list 3534:)))) 3423:rest 3420:and 3408:and 3365:next 3362:and 3359:data 3352:and 3342:pair 3338:cons 3316:Cons 3302:for 3300:atom 3217:LISP 3171:setf 3160:b... 3118:setf 3098:b... 2853:and 2845:and 2793:list 2775:list 2730:incf 2720:incf 2714:(or 2605:list 2593:list 2537:list 2526:list 2322:heap 2305:, a 2244:cond 2180:The 2144:goto 2083:GIMP 2077:and 2075:SIOD 2024:YARV 1984:and 1971:LLVM 1965:and 1923:and 1800:The 1785:and 1714:ACL2 1584:and 1471:for 962:ANSI 891:and 868:and 830:Two 817:bugs 809:eval 807:the 801:eval 797:eval 781:eval 757:CGOL 739:cons 724:car] 631:arg3 628:arg2 625:arg1 579:LISP 522:for 474:LISP 470:Lisp 434:Ruby 400:Perl 395:OPS5 370:Logo 355:Ioke 189:GOAL 119:1960 112:1960 78:meta 42:Lisp 32:Lisp 18:LISP 9652:SQL 9622:PHP 9590:Lua 9525:C++ 9486:APL 9469:Ada 9208:POP 8670:RPL 8650:NIL 8635:MDL 8620:LFE 8540:Arc 8508:POP 8421:SCM 7990:at 7740:of 7339:by 7321:in 7152:hdl 7144:doi 6301:or 6261:doi 6116:doi 5919:hdl 5618:MIT 5527:let 5492:))) 5489:fac 5471:fac 5453:fac 5450:for 5432:for 5397:'s 5382:acc 5355:acc 5328:acc 5075:map 5066:for 5023:). 5009:or 4888:or 4825:foo 4773:123 4767:foo 4719:). 4647:C++ 4597:or 4519:))) 4504:let 4492:two 4489:one 4456:baz 4453:bar 4450:foo 4432:foo 4417:baz 4414:bar 4408:foo 4390:foo 4375:baz 4372:bar 4307:foo 4295:foo 4175:to 4172:bar 4151:to 4148:foo 4131:foo 4032:bar 4026:foo 4018:))) 4015:foo 4012:cdr 3997:bar 3970:foo 3625:))) 3558:in 3531:nil 3462:as 3446:), 3411:cdr 3405:car 3396:cdr 3390:car 3384:nil 3354:cdr 3350:car 3278:BAR 3269:FOO 3251:BAR 3245:FOO 3163:))) 3034:foo 2993:arg 2981:arg 2964:arg 2950:arg 2938:arg 2881:nil 2875:and 2851:and 2847:not 2839:and 2831:nil 2769:nil 2707:". 2581:foo 2572:foo 2552:foo 2513:nil 2497:foo 2472:foo 2437:). 2435:XML 2265:at 2061:in 1943:NIL 1891:LFE 1875:Arc 1741:at 1632:NIL 1520:or 1361:LFE 1351:Arc 1130:NIL 1087:MDL 884:ɑːr 871:cdr 865:car 848:cdr 840:car 759:by 733:car 530:'s 454:Tcl 429:Red 385:Nim 375:Lua 315:CLU 254:RPL 234:NIL 224:MDL 214:LFE 154:Arc 9742:: 9600:ML 9555:Go 9530:C# 8716:, 8595:Hy 8588:, 8566:, 7896:. 7878:. 7849:– 7811:16 7809:: 7805:. 7778:; 7736:, 7709:; 7705:; 7687:. 7623:. 7592:. 7565:. 7538:. 7513:. 7486:. 7458:. 7433:. 7405:. 7379:. 7158:, 7150:, 7142:, 7130:26 7128:, 7124:, 7087:. 7047:. 7006:. 6897:. 6871:. 6846:. 6815:. 6551:. 6522:. 6493:. 6382:. 6333:; 6325:; 6321:; 6267:, 6255:, 6237:. 6229:. 6221:. 5958:, 5892:. 5852:. 5718:. 5624:). 5575:)) 5569:)) 5536:)) 5530:(( 5444:to 5367:1- 5340:if 5334:)) 5302:: 5287:1- 5251:if 5225:: 5187:. 5181:55 5178:44 5175:33 5172:22 5169:11 5152:)) 5149:50 5146:40 5143:30 5140:20 5137:10 5059:. 5003:, 5000:do 4976:do 4924:. 4885:if 4849:)) 4764:A 4641:, 4609:, 4585:. 4543:)) 4507:(( 4498:)) 4480:() 4435:,@ 4420:)) 4354:,@ 4319:. 4277:. 3988:)) 3942:)) 3915:() 3878:)) 3795:)) 3752:)) 3374:. 3195:. 3073:)) 2999:)) 2972:(( 2956:)) 2869:or 2855:or 2843:or 2841:, 2834:. 2805:)) 2766:if 2755:if 2749:. 2640:)) 2614:)) 2555:)) 2507:() 2487:, 2377:). 2345:AI 2221:. 2202:, 2135:: 2120:. 2108:, 2096:. 2004:. 1949:, 1945:, 1885:, 1883:Nu 1881:, 1879:Hy 1877:, 1838:. 1770:, 1766:, 1762:, 1630:, 1445:A 1422:. 1371:Hy 910:ər 788:. 763:. 748:)) 708:AI 637:. 574:. 562:, 558:, 554:, 550:, 546:, 515:. 507:, 503:, 409:11 390:Nu 380:ML 350:Io 194:Hy 135:, 76:, 72:, 68:, 64:: 9637:R 9520:C 9427:e 9420:t 9413:v 9319:e 9312:t 9305:v 9093:) 9089:( 8572:) 8562:( 8431:T 8412:) 8408:( 8087:e 8080:t 8073:v 8030:) 7900:. 7888:. 7863:) 7770:. 7729:. 7697:. 7672:. 7634:. 7604:. 7577:. 7550:. 7523:. 7498:. 7471:. 7444:. 7419:. 7391:. 7277:. 7246:. 7216:. 7196:. 7154:: 7146:: 7073:. 7058:. 6909:. 6883:. 6857:. 6831:. 6789:. 6768:. 6748:. 6728:. 6708:. 6688:. 6661:. 6636:. 6611:. 6597:. 6576:. 6555:. 6536:. 6507:. 6464:. 6412:. 6392:. 6263:: 6211:/ 6177:. 6145:. 6124:. 6118:: 6095:. 6077:. 6051:. 6025:. 6000:. 5983:. 5931:. 5921:: 5902:. 5878:. 5860:. 5827:. 5781:. 5754:. 5733:. 5635:. 5563:e 5557:( 5554:) 5548:e 5545:( 5539:( 5524:( 5521:) 5515:( 5506:( 5483:( 5477:) 5474:i 5468:* 5465:( 5459:1 5456:= 5447:n 5441:1 5435:i 5426:( 5423:) 5420:n 5417:( 5408:( 5385:n 5379:* 5376:( 5373:) 5370:n 5364:( 5358:( 5352:) 5349:n 5343:( 5337:( 5331:1 5325:( 5319:n 5316:( 5307:( 5290:n 5284:( 5278:( 5275:n 5272:* 5269:( 5266:1 5263:) 5260:n 5254:( 5248:( 5245:) 5242:n 5239:( 5230:( 5216:) 5207:( 5184:) 5166:( 5160:+ 5134:( 5128:) 5125:5 5122:4 5119:3 5116:2 5113:1 5110:( 5104:+ 5095:( 4915:( 4909:( 4903:( 4897:( 4864:3 4846:3 4843:2 4840:1 4837:( 4831:( 4816:3 4810:) 4807:2 4804:1 4801:( 4758:+ 4746:) 4743:2 4740:1 4737:+ 4734:( 4715:( 4639:C 4555:) 4549:( 4537:) 4528:( 4522:( 4513:( 4501:( 4486:( 4471:( 4459:) 4447:( 4441:) 4429:( 4426:` 4411:( 4405:( 4399:) 4393:, 4387:( 4384:` 4378:) 4369:( 4345:, 4335:` 4310:) 4301:( 4274:5 4268:5 4262:5 4256:) 4253:3 4250:2 4247:+ 4244:( 4190:) 4184:b 4181:x 4178:( 4166:) 4160:b 4157:a 4154:( 4140:) 4134:) 4125:( 4119:( 4105:c 4095:c 4089:b 4083:) 4080:c 4077:b 4074:( 4068:) 4065:c 4062:b 4059:x 4056:( 4050:) 4047:c 4044:b 4041:a 4038:( 4009:( 4000:( 3991:( 3973:( 3964:( 3939:6 3936:5 3933:( 3927:) 3924:a 3921:( 3909:) 3906:3 3903:2 3900:1 3897:( 3888:( 3875:4 3872:3 3869:( 3863:) 3860:2 3857:1 3854:( 3845:( 3829:) 3826:n 3823:( 3820:O 3792:4 3789:3 3786:( 3780:) 3777:2 3774:1 3771:( 3762:( 3749:3 3746:2 3743:( 3737:1 3731:( 3702:) 3699:4 3696:) 3693:3 3690:2 3687:( 3681:1 3675:( 3665:) 3662:3 3656:2 3653:1 3647:( 3622:d 3619:. 3616:c 3613:( 3610:. 3607:b 3604:( 3601:. 3598:a 3595:( 3589:d 3583:) 3580:d 3577:. 3574:c 3571:b 3568:a 3565:( 3555:) 3552:d 3549:c 3546:b 3543:a 3540:( 3528:. 3525:d 3522:( 3519:. 3516:c 3513:( 3510:. 3507:b 3504:( 3501:. 3498:a 3495:( 3489:b 3483:a 3477:) 3474:b 3471:. 3468:a 3465:( 3442:( 3284:) 3281:1 3275:( 3263:) 3260:2 3257:) 3254:1 3248:( 3242:( 3192:f 3157:f 3151:( 3148:) 3145:a 3142:( 3136:( 3130:) 3121:( 3115:( 3107:f 3101:) 3095:) 3092:a 3089:( 3086:f 3080:( 3070:d 3067:c 3064:b 3061:a 3058:+ 3055:( 3052:) 3049:d 3046:c 3043:b 3040:a 3037:( 3028:( 3013:6 3005:) 3002:5 2996:1 2990:+ 2987:( 2984:) 2978:( 2953:1 2947:+ 2944:( 2941:) 2935:( 2929:( 2899:) 2887:) 2872:( 2866:( 2825:) 2819:4 2816:3 2813:( 2799:4 2796:3 2790:( 2787:) 2781:2 2778:1 2772:( 2763:( 2747:x 2736:) 2733:x 2727:( 2704:4 2701:+ 2698:3 2695:+ 2692:2 2689:+ 2686:1 2674:) 2671:4 2668:3 2665:2 2662:1 2659:+ 2656:( 2637:4 2634:3 2631:( 2628:2 2625:1 2622:( 2611:4 2608:3 2602:( 2599:2 2596:1 2590:( 2575:) 2569:2 2566:1 2563:( 2546:( 2543:2 2540:1 2534:( 2490:2 2484:1 2475:) 2469:2 2466:1 2463:( 2414:( 2406:( 2357:C 2195:) 1790:" 1731:. 1668:. 1524:. 1203:T 994:e 987:t 980:v 913:/ 907:d 904:ʊ 901:k 898:ˈ 895:/ 887:/ 881:k 878:/ 874:( 850:( 842:( 745:B 742:A 736:( 730:( 634:) 622:f 619:( 613:f 419:R 407:/ 274:T 121:) 38:. 20:)

Index

LISP
Lisp
Lisp (disambiguation)

Paradigm
Multi-paradigm
functional
procedural
reflective
meta
Designed by
John McCarthy
Developer
Steve Russell
Typing discipline
Dynamic
strong
Dialects
Arc
AutoLISP
Clojure
Common Lisp
Emacs Lisp
EuLisp
Franz Lisp
GOAL
Hy
Interlisp
ISLISP
LeLisp

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑