Declarative language
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Declarative_language".

In computer science, Declarative programming is a programming paradigm that attempts to minimize or eliminate side effects by describing what the program should accomplish, rather than describing how to go about accomplishing it^[1]. This is a different approach from imperative programming, which requires a detailed description of the algorithm to be run. Regular expressions are a very common declarative language.

Declarative programming has become of particular interest recently, as it may greatly simplify writing parallel programs [1].

Definition

Declarative programming is often defined in a number of different ways:

• Any style of programming that is not imperative
• A program that describes what computation should be performed and not how to compute it
• Any programming language that lacks side effects (or more specifically, is referentially transparent)
• A language with a clear correspondence to mathematical logic. [2]

These definitions are roughly equivalent.

Overview

Declarative programming is an umbrella term that includes a number of more well-known programming paradigms.

• Functional programming^[2]

Functional programming, and in particular purely functional programming, attempts to minimize or eliminate side effects, and is therefore considered declarative. Most functional languages, however, do permit side effects in practice.

While functional languages typically do appear to specify "how," a compiler for a purely functional programming language is free to extensively rewrite the behavior of a function, so long as the same result is returned for the same inputs. This can be used to, for example, make a function compute its result in parallel. Because the "how" is not required to actually be the steps followed at all, functional programming is still usually considered a form of declarative programming.

• Logic programming^[3]

Logic programming languages such as Prolog state and query relations. The specifics of how these queries are answered is up to the implementation and its theorem prover. Like functional programming, many logic programming languages permit side effects, and as a result are not strictly declarative.

• Constraint programming
• Dataflow programming
• Domain specific languages

Some well-known examples of declarative DSLs include regular expressions, CSS, and a subset of SQL (SELECT queries, for example). DSLs have the advantage of being useful while not necessarily needing to be Turing-complete, which makes it easier for a language to be purely declarative.

Many markup languages such as HTML, XSLT, SVG, or user interface markup languages are often declarative. HTML, for example, only describes what should appear on a webpage.

• Hybrid languages

Makefiles, for example, specify dependancies in a declarative fashion [3], but include an imperative list of actions to take as well. Similarly, yacc specifies a context free grammar declaratively, but includes code snippets from a host language, which is usually imperative (such as C).

See also

• Category:Declarative programming languages
• Imperative programming (contrast)
• Functional programming
• Logic programming
• Constraint programming
• Domain-specific language

References

External links

• Frans Coenen. Characteristics of declarative programming languages. 1999.
• Olof Torgersson. A Note on Declarative Programming Paradigms and the Future of Definitional Programming. 1996.