Scalar programming

From Wikipedia, the free encyclopedia

The factual accuracy of part of this article is disputed. The dispute is about anyone ever having proposed scalar programming. Please see the relevant discussion on the talk page before making changes.(March 2008)

Programming paradigms

Agent-oriented Component-based Flow-based Pipeline Concatenative Concurrent computing Declarative (contrast: Imperative) Functional Dataflow Cell-oriented (spreadsheets) Reactive Goal-directed Constraint Constraint logic Logic Abductive logic Inductive logic 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 Attribute-oriented Automatic Generic Template Policy-based Language-oriented Grammar-oriented Dialecting Intentional Reflective Modular Nondeterministic Parallel computing Process-oriented Programming in the large and programming in the small Recursive (contrast: Iterative) Tree Value-level (contrast: Function-level) This box: view • talk • edit

Scalar programming is a term used to refer to those programming approaches that do not follow the array programming paradigm.

The fundamental idea behind scalar programming is that operations apply to a single value at a time. This makes it a low-level programming model as it restricts the programmer to think and operate on the elemental constituents of data aggregates, and resorting to explicit loops of individual scalar operations to process the whole aggregates.

[edit] See also

• Array programming (contrast)
• Programming paradigms

This computer science article is a stub. You can help Wikipedia by expanding it.