Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized Polish prefix notation. Originally specified in 1958, Lisp is the second-oldest high-level programming language in widespread use today; only Fortran is older (by one year). Like Fortran, Lisp has changed a great deal since its early days, and a number of dialects have existed over its history. Today, the most widely known general-purpose Lisp dialects are Common Lisp and Scheme. Lisp was originally created as a practical mathematical notation for computer programs, influenced by the notation of Alonzo Church’s lambda calculus. It quickly became the favored programming language for artificial intelligence (AI) research. As one of the earliest programming languages, Lisp pioneered many ideas in computer science, including tree data structures, automatic storage management, dynamic typing, conditionals, higher-order functions, recursion, and the self-hosting compiler. The name LISP derives from ”LISt Processing”. Linked lists are one of Lisp language’s major data structures, and Lisp source code is itself made up of lists. As a result, Lisp programs can manipulate source code as a data structure, giving rise to the macro systems that allow programmers to create new syntax or even new domain-specific languages embedded in Lisp. The interchangeability of code and data also gives Lisp its instantly recognizable syntax. All program code is written as s-expressions, 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 f that takes three arguments might be called using (f arg1 arg2 arg3).
Keywords for this software
References in zbMATH (referenced in 126 articles , 1 standard article )
Showing results 121 to 126 of 126.
- Fish, J.; Belytschko, T.: Elements with embedded localization zones for large deformation problems (1988)
- Levit, Creon; Jespersen, Dennis: Explicit and implicit solution of the Navier-Stokes equations on a massively parallel computer (1988)
- McDonald, John Alan; Pedersen, Jan: Computing environments for data analysis. III: Programming environments (1988)
- Walther, Christoph: Argument-bounded algorithms as a basis for automated termination proofs (1988)
- Takeuchi, Ikuo; Okuno, Hiroshi; Ohsato, Nobuyasu: A list processing language TAO with multiple programming paradigms (1986)
- McCarthy, John: Recursive functions of symbolic expressions and their computation by machine. I (1960)