View in EDS PDF Full Text

PL/I List Processing.

Saved in:
Bibliographic Details
Title: PL/I List Processing.
Authors: Lawson, Jr., Harold W.1
Source: Communications of the ACM. Jun67, Vol. 10 Issue 6, p358-367. 10p. 4 Diagrams.
Subjects: List processing (Electronic computers), Electronic data processing, Computer programming, Computer software, Programming languages, Data structures
Abstract: The concepts of list processing have been introduced into the PL/ I language. With these new facilities, it is possible to write PL/I procedures that operate on simple and complex data list organizations. Most list-processing languages have suffered from their inability to deal directly with complex data structures and/or from their inability to perform the complete range of programming language operations upon the data list structures. These two problems have been eliminated in the list-processing facilities of PL/I. The basic concepts of list processing and the philosophy of the PL/I language extensions are discussed. In addition, several detailed list-processing examples are provided. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5247875
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: PL/I List Processing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lawson%2C+Jr%2E%2C+Harold+W%2E%22">Lawson, Jr., Harold W.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Jun67, Vol. 10 Issue 6, p358-367. 10p. 4 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22List+processing+%28Electronic+computers%29%22">List processing (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The concepts of list processing have been introduced into the PL/ I language. With these new facilities, it is possible to write PL/I procedures that operate on simple and complex data list organizations. Most list-processing languages have suffered from their inability to deal directly with complex data structures and/or from their inability to perform the complete range of programming language operations upon the data list structures. These two problems have been eliminated in the list-processing facilities of PL/I. The basic concepts of list processing and the philosophy of the PL/I language extensions are discussed. In addition, several detailed list-processing examples are provided. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5247875
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/363332.363344
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 358
    Subjects:
      – SubjectFull: List processing (Electronic computers)
        Type: general
      – SubjectFull: Electronic data processing
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Computer software
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Data structures
        Type: general
    Titles:
      – TitleFull: PL/I List Processing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lawson, Jr., Harold W.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun67
              Type: published
              Y: 1967
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 10
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1