Tree programming

From Wikipedia, the free encyclopedia

This article or section has multiple issues. Please help improve the article or discuss these issues on the talk page.

It is in need of attention from an expert on the subject. may be able to help recruit one. Tagged since February 2009.
It needs to be expanded. Tagged since February 2009.
It may need copy editing for grammar, style, cohesion, tone or spelling. Tagged since February 2009.

This article may be confusing or unclear to readers. Please help clarify the article; suggestions may be found on the talk page. (January 2008)

This article needs additional citations for verification.
Please help improve this article by adding reliable references. Unsourced material may be challenged and removed. (September 2007)

This article may require cleanup to meet Wikipedia's quality standards. Please improve this article if you can. (December 2008)

Programming paradigms

Agent-oriented
Component-based
- Flow-based
- Pipeline
Concatenative
Concurrent computing
Declarative (contrast: Imperative)
- Functional
  - Dataflow
    - Cell-oriented (spreadsheets)
    - Reactive
- Goal-directed
Event-driven
Feature-oriented
Function-level (contrast: Value-level)
Imperative (contrast: Declarative)
- Greater separation of concerns
  - Aspect-oriented
  - Subject-oriented
- Array (contrast: Scalar)
- Automata-based
- Object-oriented
  - Class-based
  - Prototype-based
- Procedural
  - Structured
- Role-oriented
- Scalar (contrast: Array)
Iterative (contrast: Recursive)
Metaprogramming
Modular
Nondeterministic
Parallel computing
- Process-oriented
Programming in the large and programming in the small
Recursive (contrast: Iterative)
Tree
Value-level (contrast: Function-level)

Tree programming refers to the use of a programming language to analyze data trees, in a way unique from conventional programming languages.^{[clarification needed]} This should not be confused with list-based programming languages like Lisp and Scheme.