Lisp Programming Language: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "Exmaple" to "Example")
m (Text replacement - " programmers " to " programmers ")
Line 13: Line 13:
=== 2013 ===
=== 2013 ===
* (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/Lisp_(programming_language) Retrieved:2013-12-12.
* (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/Lisp_(programming_language) Retrieved:2013-12-12.
** '''Lisp''' (historically, '''LISP''') is a family of [[computer]] [[programming language]]s with a long history and a distinctive, fully parenthesized [[Polish notation|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 [[Programming language dialect|dialects]] have existed over its history. Today, the most widely known general-purpose Lisp dialects are [[Common Lisp]] and [[Scheme (programming language)|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 structure]]s, [[Garbage collection (computer science)|automatic storage management]], [[dynamic typing]], [[Conditional (computer programming)|conditionals]], [[higher-order function]]s, [[recursion]], and the [[self-hosting]] [[compiler]].<ref name="GRAHAM">{{cite web| title=Revenge of the Nerds| author=Paul Graham | url=http://www.paulgraham.com/icad.html | accessdate=2013-03-14}} </ref> <P> The name ''LISP'' derives from "LISt Processing". [[Linked list]]s are one of Lisp language's major [[data structure]]s, 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 (computer science)|macro]] systems that allow programmers to create new syntax or even new [[domain-specific language]]s embedded in Lisp. <P> The interchangeability of code and data also gives Lisp its instantly recognizable syntax. All program code is written as ''[[s-expression]]s'', 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 .
** '''Lisp''' (historically, '''LISP''') is a family of [[computer]] [[programming language]]s with a long history and a distinctive, fully parenthesized [[Polish notation|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 [[Programming language dialect|dialects]] have existed over its history. Today, the most widely known general-purpose Lisp dialects are [[Common Lisp]] and [[Scheme (programming language)|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 structure]]s, [[Garbage collection (computer science)|automatic storage management]], [[dynamic typing]], [[Conditional (computer programming)|conditionals]], [[higher-order function]]s, [[recursion]], and the [[self-hosting]] [[compiler]].<ref name="GRAHAM">{{cite web| title=Revenge of the Nerds| author=Paul Graham | url=http://www.paulgraham.com/icad.html | accessdate=2013-03-14}} </ref> <P> The name ''LISP'' derives from "LISt Processing". [[Linked list]]s are one of Lisp language's major [[data structure]]s, 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 (computer science)|macro]] systems that allow [[programmer]]s to create new syntax or even new [[domain-specific language]]s embedded in Lisp. <P> The interchangeability of code and data also gives Lisp its instantly recognizable syntax. All program code is written as ''[[s-expression]]s'', 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 .
<references/>
<references/>



Revision as of 01:22, 12 June 2015

A Lisp Programming Language is a programming language that approximates the Formal Language specified by John McCarthy in 1958 which specifies Program Statements as parenthesized lists (s-expressions).



References

2013

  1. Paul Graham. "Revenge of the Nerds". http://www.paulgraham.com/icad.html. Retrieved 2013-03-14.