Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

ALGOL

Known as: Algol programming language, Algorithmic Language, Algol-like 
ALGOL (short for Algorithmic Language) is a family of imperative computer programming languages, originally developed in the mid-1950s, which greatly… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
The Semantic Web promises to open innumerable opportunities for automation and information retrieval by standardizing the… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2002
2002
Recently Senizergues showed decidability of the equivalence problem for deterministic pushown automata. The proof of decidability… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Many problems require recursively specified types of data and a collection of tools that operate on those data. Over time, these… Expand
  • figure 1
  • figure 5
  • figure 12
  • figure 13
  • figure 14
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Abstract The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest… Expand
Is this relevant?
1996
1996
Turchin`s supercompiler is a program transformer that includes both partial evaluation and deforestation. Although known in the… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
 
Is this relevant?
Highly Cited
1982
Highly Cited
1982
PS-algol is a dialect of algol for the programming of problems that would normally require a database management system. It… Expand
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level… Expand
Is this relevant?
Highly Cited
1974
Highly Cited
1974
In this paper, we describe a simple language for parallel programming. Its semantics is studied thoroughly. The desirable… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1974
Highly Cited
1974
This paper describes an efficient algorithm to determine whether an arbitrary graph <italic>G</italic> can be embedded in the… Expand
  • figure 3
  • figure 8
  • figure 9
Is this relevant?