Von Neumann programming languages

From Wikipedia, the free encyclopedia

A von Neumann language is any of those programming languages that are high-level abstract isomorphic copies of von Neumann architectures. As of 2004, most current programming languages fit into this description, likely as a consequence of the extensive domination of the von Neumann computer architecture during the past 50 years.

The differences between FORTRAN, C, and even Java, although considerable, are ultimately constrained by the fact that all three are based on the programming style of the von Neumann computer (if, for example, Java objects were all executed in parallel with asynchronous message passing and attribute-based declarative addressing, then Java would not be in the group).

The isomorphism between von Neumann programming languages and architectures is in the following manner:

  • program variables → computer storage cells
  • control statements → computer test-and-jump instructions
  • assignment statements → fetching, storing instructions
  • expressions → memory reference and arithmetic instructions

Using a metaphor from Backus, assignment statements in von Neumann languages split programming into two worlds: the right side and left side of assignment statements. The right side consists of expressions, an orderly mathematical space with potentially useful algebraic properties: most computation takes place here. The left side consists of statements, a disorderly mathematical space with few useful mathematical properties (structured programming can be seen as a limited heuristic that does apply in this space, though).

Backus claimed that there exists now in computer science a vicious cycle where the long standing emphasis on von Neumann languages has continued the primacy of the von Neumann computer architecture... and our dependency on it has made non-von Neumann languages uneconomical and thus limited their further development: the lack of widely available and effective non-von Neumann languages has deprived computer designers of the motivation and the intellectual foundation necessary to develop new computer architectures.

Some examples of non-von Neumann languages are: APL, FP, FL, J, NGL, ZPL, Mercury, and Plankalkül.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.