digplanet beta 1: Athena
Share digplanet:


Applied sciences






















In computer programming, orthogonality in a programming language means that a relatively small set of primitive constructs can be combined in a relatively small number of ways to build the control and data structures of the language. The term is most-frequently used regarding assembly instruction sets, as orthogonal instruction set.

Orthogonality is an important concept, addressing how a relatively small number of components can be combined in a relatively small number of ways to get the desired results. It is associated with simplicity; the more orthogonal the design, the fewer exceptions. This makes it easier to learn, read and write programs in a programming language.[1] The meaning of an orthogonal feature is independent of context; the key parameters are symmetry and consistency (for example, a pointer is an orthogonal concept).

An example from IBM Mainframe and VAX highlights this concept. An IBM mainframe has two different instructions for adding the contents of a register to a memory cell (or another register). These statements are shown below:

A Reg1, memory_cell AR Reg1, Reg2 In the first case, the contents of Reg1 are added to the contents of a memory cell; the result is stored in Reg1. In the second case, the contents of Reg1 are added to the contents of another register (Reg2) and the result is stored in Reg1.

In contrast to the above set of statements, VAX has only one statement for addition:

ADDL operand1, operand2

In this case the two operands (operand1 and operand2) can be registers, memory cells, or a combination of both; the instruction adds the contents of operand1 to the contents of operand2, storing the result in operand1.

VAX’s instruction for addition is more orthogonal than the instructions provided by IBM; hence, it is easier for the programmer to remember (and use) the one provided by VAX.

The design of C language may be examined from the perspective of orthogonality. The C language is somewhat inconsistent in its treatment of concepts and language structure, making it difficult for the user to learn (and use) the language. Examples of exceptions follow:

Structures (but not arrays) may be returned from a function. An array can be returned if it is inside a structure. A member of a structure can be any data type (except void), or the structure of the same type. An array element can be any data type (except void). Everything is passed by value (except arrays). Void can be used as a type in a structure, but a variable of this type cannot be declared in a function.

Further reading[edit]

  • The Pragmatic Programmer: From Journeyman to Master by Andrew Hunt and David Thomas. Addison-Wesley. 2000. ISBN 978-0-201-61622-4.

External links[edit]


Template:The Concepts of Programming Languages, Robert Sebesta

Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Orthogonality_(programming) — Please support Wikipedia.
This page uses Creative Commons Licensed content from Wikipedia. A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
278 videos foundNext > 

Programming Language Evaluation - Fortran Vs Algol

Programming Languages & Design Concepts is the basic programming structure identifier for programmers. Through this DVD we are planning to compare ...

Lecture 2: Orthogonality

Orthogonality of vectors and matrices; decomposing vectors into orthogonal components.

Orthogonal complements | Alternate coordinate systems (bases) | Linear Algebra | Khan Academy

Orthogonal Complements as subspaces. Watch the next lesson: ...

Introduction to orthonormal bases | Linear Algebra | Khan Academy

Looking at sets and bases that are orthonormal -- or where all the vectors have length 1 and are orthogonal to each other. Watch the next lesson: ...

Orthogonal complement of the nullspace | Linear Algebra | Khan Academy

The orthogonal complement of the nullspace and left nullspace. Watch the next lesson: ...

Orthogonal Collocation Example Problem

Discretization of a continuous time representation allow large-scale nonlinear programming (NLP) solvers to find solutions at specified intervals in a time horizon ...

Introduction to projections | Matrix transformations | Linear Algebra | Khan Academy

Determining the projection of a vector on s line Watch the next lesson: ...

Orthogonal Collocation on Finite Elements in MATLAB

This is a practical introduction to orthogonal collocation on finite elements with Lobatto quadrature for the numerical solution of differential algebraic equations.

Projections onto subspaces | Linear Algebra | Khan Academy

Projections onto subspaces Watch the next lesson: ...

Orthogonal Matrices Part 1

278 videos foundNext > 

We're sorry, but there's no news about "Orthogonality (programming)" right now.


Oops, we seem to be having trouble contacting Twitter

Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!

Searchlight Group

Digplanet also receives support from Searchlight Group. Visit Searchlight