functional programming
(FP) A program in a functional language consists of a set of (possibly recursive) function definitions and an expression whose value is output as the program' s result. Functional languages are one kind of declarative language. They are mostly based on the typed lambda-calculus with constants. There are no side-effects to expression evaluation so an expression, e.g. a function applied to certain arguments, will always evaluate to the same value (if its evaluation terminates). Furthermore, an expression can always be replaced by its value without changing the overall result (referential transparency). The order of evaluation of subexpressions is determined by the language' s evaluation strategy. In a strict (call-by-value) language this will specify that arguments are evaluated before applying a function whereas in a non-strict (call-by-name) language arguments are passed unevaluated. Programs written in a functional language are generally compact and elegant, but have tended, until recently, to run slowly and require a lot of memory. Examples of purely functional languages are Clean, FP, Haskell, Hope, Joy, LML, Miranda, and SML. Many other languages such as Lisp have a subset which is purely functional but also contain non-functional constructs. See also lazy evaluation, reduction. {Lecture notes (ftp://ftp.cs.olemiss.edu/pub/tech-reports/umcis-1995-01.ps)}. or the same {in dvi-format (ftp://ftp.cs.olemiss.edu/pub/tech-reports/umcis-1995-01.dvi)}. {FAQ (http://www.cs.nott.ac.uk/Department/Staff/gmh/faq.html)}. {SEL-HPC Article Archive (http://www.lpac.ac.uk/SEL-HPC/Articles/)}. (2003-03-25) In addition suitable contents:
[ 2 ] [ = ] [ af ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ aq ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ av ] [ az ] [ b ] [ ba ] [ base ] [ bd ] [ be ] [ bs ] [ by ] [ C ] [ ca ] [ call-by-name ] [ call-by-value ] [ ch ] [ ci ] [ cl ] [ Clean ] [ co ] [ com ] [ compact ] [ con ] [ cons ] [ cu ] [ cy ] [ D ] [ de ] [ dec ] [ declarative language ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ elegant ] [ er ] [ era ] [ es ] [ et ] [ evaluation ] [ evaluation strategy ] [ expression ] [ FAQ ] [ fi ] [ file ] [ fo ] [ for ] [ FP ] [ Fun ] [ function ] [ functional ] [ functional language ] [ ga ] [ ge ] [ gen ] [ gi ] [ gm ] [ gr ] [ gu ] [ gy ] [ h ] [ hang ] [ hat ] [ Hope ] [ hose ] [ HP ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ Joy ] [ ke ] [ ki ] [ la ] [ lambda-calculus ] [ language ] [ lazy evaluation ] [ lc ] [ Lex ] [ li ] [ Lisp ] [ LML ] [ ls ] [ lt ] [ lu ] [ ly ] [ M ] [ ma ] [ mc ] [ memory ] [ mh ] [ Miranda ] [ ML ] [ ml ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ om ] [ op ] [ output ] [ pa ] [ PC ] [ pe ] [ ph ] [ pl ] [ ply ] [ port ] [ pr ] [ program ] [ programming ] [ purely functional language ] [ Q ] [ query ] [ rc ] [ re ] [ recursive ] [ reduction ] [ referential transparency ] [ ro ] [ ru ] [ run ] [ S ] [ sa ] [ sam ] [ SE ] [ se ] [ SEL ] [ set ] [ si ] [ side-effect ] [ sk ] [ sl ] [ SML ] [ so ] [ spec ] [ st ] [ strict ] [ struct ] [ su ] [ T ] [ th ] [ tm ] [ to ] [ tp ] [ tr ] [ tt ] [ type ] [ typed lambda-calculus ] [ ua ] [ uk ] [ um ] [ us ] [ va ] [ value ] [ ve ] [ vi ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (11337 Reads) |
