Declarative programming: Difference between revisions

Revision as of 07:05, 1 December 2004

Revision as of 00:41, 2 December 2004

Line 5:

#it isolates the complex problem solving for the computer,

#it helps avoid the [[reinvention of the wheel]] problem,

#it allows for re-use/re-interpretation in different contexts (e.g. different language bindings for [[parallel processingIDL]]), and

#it centralizes and condenses the problem definition thereby making for more comprehensible coding practices.

Line 14:

Declarative languages describe relationships between variables in terms of [[function (programming)|function]]s, [[inference rule]]s, or [[term-rewriting]] rules. The language executor (an [[Interpreter (computing)|interpreter]] or [[compiler]]) applies a fixed [[algorithm]] to these relations to produce a result.

Declarative programming languages are extensively used in solving [[artificial intelligence]] and, [[constraint-satisfaction problem]]s, as[[database]]s, well[[configuration asmanagement]] moreand mundane[[Inter-process areascommunication]]. such asThe [[databaseXML]]s andcommunity [[configurationis management]]constantly producing new dialects that are declarative in nature.

==Example languages==

Representative examples of declarative programming languages include [[Prolog (programming language)|Prolog]], [[Lisp programming language|Lisp]], and [[Haskell (programming language)|Haskell]]. Other examples include, [[Miranda programming language|Miranda]], [[SQL]], and [[SQLWSDL]].

[[:Category:Declarative programming languages]] provides an exhaustive list.