Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized Polish prefix notation.[1] 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.[2] 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).

References in zbMATH (referenced in 126 articles , 1 standard article )

Showing results 41 to 60 of 126.
Sorted by year (citations)
  1. Van Roy, Peter; Brand, Per; Duchier, Denys; Haridi, Seif; Schulte, Christian; Henz, Martin: Logic programming in the context of multiparadigm programming: The Oz experience (2003)
  2. Bauer, Christian; Frink, Alexander; Kreckel, Richard: Introduction to the GiNaC framework for symbolic computation within the (\textC^++) programming language (2002)
  3. Corless, Robert M.: Essential Maple 7. An introduction for scientific programmers (2002)
  4. Davenport, James H.: Equality in computer algebra and beyond. (2002)
  5. Echahed, Rachid; Serwe, Wendelin: Defining actions in concurrent declarative programming (2002)
  6. Ichisugi, Yuuji; Tanaka, Akira: Difference-based modules: A class-independent module mechanism (2002)
  7. Kameyama, Yukiyoshi; Sato, Masahiko: Strong normalizability of the non-deterministic catch/throw calculi (2002)
  8. Millstein, Todd; Chambers, Craig: Modular statically typed multimethods (2002)
  9. Rubio, Julio; Sergeraert, Francis: Constructive algebraic topology (2002)
  10. Ruiz-Reina, José-Luis; Alonso, José-Antonio; Hidalgo, María-José; Martín-Mateos, Francisco-Jesús: Formal proofs about rewriting using ACL2 (2002)
  11. Bittencourt, Guilherme; Tonin, Isabel: An algorithm for dual transformation in first-order logic (2001)
  12. Cunningham, Robert K.; Stevenson, Craig S.: Accurately detecting source code of attacks that increase privilege (2001)
  13. Domínguez, César; Lambán, Laureano; Pascual, Vico; Rubio, Julio: Hidden specification of a functional system (2001)
  14. Jones, Neil D.: The expressive power of higher-order types or, life without CONS (2001)
  15. Kaufmann, Matt; Moore, J. Strother: Structured theory development for a mechanized logic (2001)
  16. Otto, Harald E.: From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice (2001)
  17. Reingold, Edward M.; Dershowitz, Nachum: Calendrical calculations. With 1 CD-ROM (Windows, Macintosh). (2001)
  18. Ruiz-Reina, José-Luis; Alonso, José-Antonio; Hidalgo, María-José; Martín-Mateos, Francisco-Jesús: Formalizing rewriting in the ACL2 theorem prover (2001)
  19. Sharp, Robin S.; Limebeer, David J. N.: A motorcycle model for stability and control analysis (2001)
  20. Wand, Mitchell: A semantics for advice and dynamic join points in aspect-oriented programming (2001)