Lisp
LISt Processing language. (Or mythically "Lots of Irritating Superfluous Parentheses"). Artificial Intelligence' s mother tongue, a symbolic, functional, recursive language based on the ideas of lambda-calculus, variable-length lists and trees as fundamental data types and the interpretation of code as data and vice-versa. Data objects in Lisp are lists and atoms. Lists may contain lists and atoms. Atoms are either numbers or symbols. Programs in Lisp are themselves lists of symbols which can be treated as data. Most implementations of Lisp allow functions with side-effects but there is a core of Lisp which is purely functional. All Lisp functions and programs are expressions that return values this, together with the high memory use of Lisp, gave rise to Alan Perlis' s famous quip (itself a take on an Oscar Wilde quote) that "Lisp programmers know the value of everything and the cost of nothing". The original version was LISP 1, invented by John McCarthy at MIT in the late 1950s. Lisp is actually older than any other high level language still in use except Fortran. Accordingly, it has undergone considerable change over the years. Modern variants are quite different in detail. The dominant HLL among hackers until the early 1980s, Lisp now shares the throne with C. See languages of choice. One significant application for Lisp has been as a proof by example that most newer languages, such as COBOL and Ada, are full of unnecessary crocks. When the Right Thing has already been done once, there is no justification for bogosity in newer languages. See also Association of Lisp Users, Common Lisp, {Franz Lisp}, {MacLisp}, {portable Standard Lisp}, {Interlisp}, Scheme, ELisp, Kamin' s interpreters. [Jargon File] (1995-04-16) In addition suitable contents:
[ = ] [ @ ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ application ] [ ar ] [ arc ] [ arg ] [ as ] [ Association of Lisp Users ] [ at ] [ av ] [ B ] [ b ] [ ba ] [ base ] [ bd ] [ be ] [ bj ] [ bo ] [ bogosity ] [ by ] [ C ] [ ca ] [ cat ] [ cc ] [ ch ] [ ci ] [ ck ] [ co ] [ COBOL ] [ code ] [ Common Lisp ] [ con ] [ cons ] [ core ] [ cr ] [ crock ] [ cu ] [ D ] [ data ] [ data type ] [ de ] [ diff ] [ ding ] [ do ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ Fortran ] [ Franz Lisp ] [ function ] [ functional ] [ ga ] [ ge ] [ gen ] [ gh ] [ gi ] [ gl ] [ gn ] [ gr ] [ gt ] [ gu ] [ h ] [ hack ] [ hacker ] [ hang ] [ hat ] [ hing ] [ HLL ] [ hn ] [ hr ] [ ht ] [ id ] [ iff ] [ il ] [ in ] [ int ] [ Interlisp ] [ interpreter ] [ io ] [ IS ] [ is ] [ ISP ] [ IT ] [ it ] [ J ] [ Jargon File ] [ jm ] [ John McCarthy ] [ K ] [ Kamin' s interpreters ] [ ke ] [ kn ] [ la ] [ lambda-calculus ] [ language ] [ languages of choice ] [ lc ] [ ld ] [ Lex ] [ li ] [ LIS ] [ LISP 1 ] [ list ] [ lists ] [ LL ] [ lr ] [ ls ] [ lu ] [ lv ] [ ly ] [ M ] [ ma ] [ Mac ] [ MacLisp ] [ mc ] [ memory ] [ MIT ] [ mm ] [ mo ] [ mod ] [ Mode ] [ module ] [ mother ] [ mp ] [ ms ] [ my ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ nn ] [ no ] [ ns ] [ nu ] [ numbers ] [ nz ] [ O ] [ object ] [ om ] [ pe ] [ perf ] [ ph ] [ pl ] [ portable Standard Lisp ] [ pr ] [ program ] [ programmer ] [ proof ] [ pt ] [ query ] [ rc ] [ re ] [ recursive ] [ rete ] [ Right Thing ] [ rl ] [ ro ] [ S ] [ sa ] [ sc ] [ Scheme ] [ se ] [ sh ] [ shar ] [ si ] [ side-effect ] [ sig ] [ sit ] [ so ] [ SP ] [ st ] [ Standard Lisp ] [ su ] [ sy ] [ T ] [ table ] [ th ] [ to ] [ tr ] [ tree ] [ type ] [ ua ] [ um ] [ up ] [ us ] [ va ] [ value ] [ var ] [ variable ] [ ve ] [ version ] [ vi ] [ ye ] [ yt ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (14510 Reads) |
