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

PL/I

Known as: PL/1 programming language, X3J1, PL1 language 
PL/I (Programming Language One, pronounced /piː ɛl wʌn/) is a procedural, imperative computer programming language designed for scientific… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Abstract Online product reviews (OPRs) provide abundant information for potential customers to make optimal purchase decisions… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Very large data sets often have a flat but regular structure and span multiple disks and machines. Examples include telephone… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We determined the geochemical characteristics of sediments and measured rates of the anaerobic oxidation of methane (AOM) and… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper we will present a very simple discrete Morse theory for CW complexes. In addition to proving analogues of the main… Expand
  • figure 1.1
  • figure 1.2
  • figure 6.1
  • figure 8.1
  • figure 12.1
Is this relevant?
Highly Cited
1986
Highly Cited
1986
The authors introduce a new programming language concept, called typestate, which is a refinement of the concept of type. Whereas… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1979
Highly Cited
1979
We consider the question of how powerful a relational query language should be and state two principles that we feel any query… Expand
  • figure 5
  • figure 1
Is this relevant?
Highly Cited
1972
Highly Cited
1972
As a result of a long sequence of coincidences I entered the programming profession officially on the first spring morning of… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
  • C. Zahn
  • IEEE Transactions on Computers
  • 1971
  • Corpus ID: 14739967
A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster… Expand
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
1966
Highly Cited
1966
In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself. Although not… Expand
  • figure 4
  • figure 15
  • figure 19
  • figure 18
  • figure 16
Is this relevant?
Highly Cited
1956
Highly Cited
1956
A number of recent studies have shown that &aminolevulinic acid (SAL) and porphobilinogen (PBG) are early intermediates in the… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?