LISP

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 125 articles , 1 standard article )

Showing results 1 to 20 of 125.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Kaufmann, Matt; Moore, J. Strother: Limited second-order functionality in a first-order setting (2020)
  2. Greenman, Ben; Takikawa, Asumu; New, Max S.; Feltey, Daniel; Findler, Robert Bruce; Vitek, Jan; Felleisen, Matthias: How to evaluate the performance of gradual type systems (2019)
  3. Moore, J. Strother: Milestones from the Pure Lisp Theorem Prover to ACL2 (2019)
  4. Reingold, Edward M.; Dershowitz, Nachum: Calendrical calculations. The ultimate edition (2018)
  5. Beebe, Nelson H. F.: The mathematical-function computation handbook. Programming using the MathCW portable software library (2017)
  6. Würthinger, Thomas; Wimmer, Christian; Stadler, Lukas: Unrestricted and safe dynamic code evolution for Java (2013) ioport
  7. Ducournau, Roland; Privat, Jean: Metamodeling semantics of multiple inheritance (2011)
  8. Chadwick, Bryan; Lieberherr, Karl: A functional approach to generic programming using adaptive traversals (2010)
  9. Culpepper, Ryan; Felleisen, Matthias: Debugging hygienic macros (2010)
  10. Demaine, Erik D.; Langerman, Stefan; Price, Eric: Confluently persistent tries for efficient version control (2010)
  11. Langmaack, Hans: On Trojan horses of Thompson-Goerigk-type, their generation, intrusion, detection and prevention (2010)
  12. Medina-Bulo, Inmaculada; Palomo-Lozano, Francisco; Ruiz-Reina, José-Luis: A verified common lisp implementation of Buchberger’s algorithm in ACL2 (2010)
  13. Pirkelbauer, Peter; Solodkyy, Yuriy; Stroustrup, Bjarne: Design and evaluation of C++ open multi-methods (2010)
  14. Stump, Aaron: Directly reflective meta-programming (2010)
  15. Bresson, Jean; Agon, Carlos; Assayag, Gérard: Visual Lisp/CLOS programming in OpenMusic (2009) ioport
  16. De Sá, Leonardo Bruno; Mesquita, Antonio: Evolutionary synthesis of low-sensitivity digital filters using adjacency matrix (2009)
  17. Kaufmann, Matt; Moore, J. Strother; Ray, Sandip; Reeber, Erik: Integrating external deduction tools with ACL2 (2009)
  18. Martín-Mateos, Francisco-Jesus; Rubio, Julio; Ruiz-Reina, Jose-Luis: ACL2 verification of simplicial degeneracy programs in the Kenzo system (2009)
  19. Sperber, Michael; Dybvig, R. Kent; Flatt, Matthew; van Straaten, Anton; Findler, Robby; Matthews, Jacob: Revised(^6) report on the algorithmic language scheme (2009)
  20. Wessel, Michael; Möller, Ralf: Flexible software architectures for ontology-based information systems (2009)

1 2 3 ... 5 6 7 next