Declarative Programming Paradigm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "([^\s])([\s]{1,7})\<P\>" to "$1 <P>") |
m (Text replacement - "\<P\>([\s]{1,7})([^\s])" to "<P> $2") |
||
| Line 17: | Line 17: | ||
=== 2015 === | === 2015 === | ||
* (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/declarative_programming Retrieved:2015-5-7. | * (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/declarative_programming Retrieved:2015-5-7. | ||
** In [[computer science]], '''declarative programming</B> 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]]. Many languages applying this style attempt to minimize or eliminate [[side effect (computer science)|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 [[language primitive|primitive]]s <ref> [http://foldoc.org/index.cgi?query=declarative+language Declarative language] in The Free On-line Dictionary of Computing, Editor Denis Howe. </ref> (the ''how'' being left up to the language's implementation). This is in contrast with [[imperative programming]], in which [[algorithm]]s are implemented in terms of explicit steps. Declarative programming often considers [[program (machine)|programs]] as theories of a [[formal logic]], and computations as deductions in that logic space. Declarative programming may greatly simplify writing [[parallel computing|parallel programs]]. <P> | ** In [[computer science]], '''declarative programming</B> 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]]. Many languages applying this style attempt to minimize or eliminate [[side effect (computer science)|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 [[language primitive|primitive]]s <ref> [http://foldoc.org/index.cgi?query=declarative+language Declarative language] in The Free On-line Dictionary of Computing, Editor Denis Howe. </ref> (the ''how'' being left up to the language's implementation). This is in contrast with [[imperative programming]], in which [[algorithm]]s are implemented in terms of explicit steps. Declarative programming often considers [[program (machine)|programs]] as theories of a [[formal logic]], and computations as deductions in that logic space. Declarative programming may greatly simplify writing [[parallel computing|parallel programs]]. <P> Common declarative languages include those of [[database query language]]s (e.g., [[SQL]], [[XQuery]]), [[regular expression]]s, [[logic programming]], [[functional programming]], and [[configuration management]] systems. | ||
<references/> | <references/> | ||
Latest revision as of 04:38, 18 August 2021
A Declarative Programming Paradigm is a programming paradigm that emphasizes the expression of computation logic without describing its control flow.
- Context:
- It can be adhered to by a Declarative Software Program (with declarative programming code).
- It can be adhered to by a Declarative Programming Language.
- It can range from being a Logic Programming Paradigm to being a Functional Programming Paradigm to being a Constraint Programming Paradigm.
- …
- Counter-Example(s):
- See: Side Effect (Computer Science), Problem Domain, Language Primitive, Answer Set Programming, Formal Logic, Parallel Computing.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/declarative_programming Retrieved:2015-5-7.
- 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. 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 [1] (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.
Common declarative languages include those of database query languages (e.g., SQL, XQuery), regular expressions, logic programming, functional programming, and configuration management systems.
- 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. 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 [1] (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.
- ↑ Declarative language in The Free On-line Dictionary of Computing, Editor Denis Howe.
2003
- (Baral, 2003) ⇒ Chitta Baral. (2003). “Knowledge Representation, Reasoning and Declarative Problem Solving." Cambridge University Press.