Declarative programming: Difference between revisions

Revision as of 22:34, 20 November 2004

Revision as of 05:12, 30 November 2004

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 well as more mundane areas such as databases[[database]]s and [[configuration management]].

==Example languages==