Declarative Programming Paradigm
Jump to navigation
Jump to search
A Declarative Programming Paradigm is a Computer Science that ...
- See: Computer Science, Programming Paradigm, Computation, Control Flow, Side Effect (Computer Science), Problem Domain, Language Primitive, Imperative Programming, Algorithm, Program (Machine), Formal Logic, Parallel Computing, Database Query Language.
References
2014
- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/declarative_programming Retrieved:2014-8-9.
- 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 is 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 paradigm is the style of programming where code is written to specify what information to be outputted but not how to perform the act of data producing.
Examples of declarative programming languages are SQL (Structured query language) and Prolog
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 is 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.