Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Declarative programming


 

Declarative programming is an approach to computer programming that involves the creation of a set of conditions that describe a solution space, but leaves the interpretation of the specific steps needed to arrive at that solution up to an unspecified interpreter. Declarative programming thus takes a different approach from the traditional imperative programming found in Fortran, C++ or Java which requires the programmer to provide a list of instructions to execute in a specified order.

In other words, declarative programming provides the what, but leaves the how up to interpretation. Advantages of this approach are that

  1. it isolates the complex problem solving for the computer,
  2. it helps avoid the reinvention of the wheel problem,
  3. it allows for re-use/re-interpretation in different contexts (e.g. parallel processing), and
  4. it centralizes and condenses the problem definition thereby making for more comprehensible coding practices.

Declarative programming includes both functional programming and logic programming.

Declarative programming was also known as Value-oriented programming, but this term has lately fallen out of use.

Declarative languages describe relationships between variables in terms of functions, inference rules, or term-rewriting rules. The language executor (an interpreter or compiler) applies a fixed algorithmFlowcharts were often used to represent algorithms. An algorithm is a finite set of well-defined instructions for accomplishing some task which, given an initial state, will result in a corresponding recognisable end-state (contrast with heuristic). Algor to these relations to produce a result.

Declarative programming languages are extensively used in solving artificial intelligenceThis article is about modelling human thought with computers,. For other uses of the term AI see Ai''. Artificial intelligence also known as machine intelligence is defined as intelligence exhibited by anything manufactured (i. artificial) by humans or ot and constraint-satisfaction problems as well as more mundane areas such as databases and configuration management.

1 Example languages

Representative examples of declarative programming languages include Prolog, LispLisp is a family of functional programming languages with a long history. Developed first as an abstract notation for recursive functions, it later became the favored language of artificial intelligence research during the field's heyday in the 1970s and, and Haskell. Other examples include MirandaMiranda is a non-strict purely functional programming language developed by Professor David Turner as a successor to his earlier programming languages Sasl and KRC, using some concepts from ML and Hope. Marketed by Research Software Ltd. of England, of wh, and SQLStructured Query Language SQL is the most popular computer language used to create, modify and query databases. Technically, SQL is a declarative computer language for use with "quasi- relational databases". Theorists note that many of the original SQL fe.

Declarative programming languages provides an exhaustive list.

Read more »

Non User