Difference between revisions of "Declarative programming"
Karl Jones (Talk | contribs) (→Examples) |
Karl Jones (Talk | contribs) (→Examples) |
||
| Line 16: | Line 16: | ||
** [[SQL]] | ** [[SQL]] | ||
** [[XQuery]] | ** [[XQuery]] | ||
| − | * [[Regular expression| | + | * [[Regular expression|Regular expressions]] |
* [[Logic programming]] | * [[Logic programming]] | ||
* [[Functional programming]] | * [[Functional programming]] | ||
Revision as of 06:21, 3 September 2015
In computer science, declarative programming is a programming paradigm, a style of building the structure and elements of computer programs, that expresses the logic of a computation without describing its control flow.
Description
Many languages applying this style attempt to minimize or eliminate side effects by describing what the program should accomplish in terms of the problem domain, rather than describing how to go about accomplishing it as a sequence of the programming language primitives (the how being left up to the language's implementation).
This is in contrast with imperative programming, in which algorithms are implemented in terms of explicit steps.
Declarative programming often considers programs as theories of a formal logic, and computations as deductions in that logic space. Declarative programming may greatly simplify writing parallel programs.
Examples
Common declarative programming languages include:
- Database query languages
- Regular expressions
- Logic programming
- Functional programming
- Configuration management systems
See also
External Links
- Declarative programming @ Wikipedia
