View in EDS PDF Full Text

Structure of a LISP System Using Two-Level Storage.

Saved in:
Bibliographic Details
Title: Structure of a LISP System Using Two-Level Storage.
Authors: Bobrow, Daniel G.1, Murphy, Daniel L.1, McIlroy, M. D.
Source: Communications of the ACM. Mar1967, Vol. 10 Issue 3, p155-159. 5p. 1 Diagram.
Subjects: LISP (Computer program language), List processing (Electronic computers), Programming languages, Computer storage devices, Systems programming (Computer science), Information storage & retrieval systems
Abstract: In an ideal list-processing system there would be enough core memory to contain all the data and programs. Described in this paper are a number of techniques that have been used to build a LISP system utilizing a drum for its principal storage medium, with a surprisingly low time penalty for use of this slow storage device. The techniques include careful segmentation of system programs, allocation of virtual memory to allow address arithmetic for type determination, and a special algorithm for building reasonably linearized lists. A scheme for binding variables is described which is good in this environment and allows for complete compatibility between compiled and interpreted programs with no special declarations. [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: 5308601
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Structure of a LISP System Using Two-Level Storage.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bobrow%2C+Daniel+G%2E%22">Bobrow, Daniel G.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Murphy%2C+Daniel+L%2E%22">Murphy, Daniel L.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22McIlroy%2C+M%2E+D%2E%22">McIlroy, M. D.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Mar1967, Vol. 10 Issue 3, p155-159. 5p. 1 Diagram.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22LISP+%28Computer+program+language%29%22">LISP (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22List+processing+%28Electronic+computers%29%22">List processing (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+devices%22">Computer storage devices</searchLink><br /><searchLink fieldCode="DE" term="%22Systems+programming+%28Computer+science%29%22">Systems programming (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In an ideal list-processing system there would be enough core memory to contain all the data and programs. Described in this paper are a number of techniques that have been used to build a LISP system utilizing a drum for its principal storage medium, with a surprisingly low time penalty for use of this slow storage device. The techniques include careful segmentation of system programs, allocation of virtual memory to allow address arithmetic for type determination, and a special algorithm for building reasonably linearized lists. A scheme for binding variables is described which is good in this environment and allows for complete compatibility between compiled and interpreted programs with no special declarations. [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=5308601
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/363162.363185
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 5
        StartPage: 155
    Subjects:
      – SubjectFull: LISP (Computer program language)
        Type: general
      – SubjectFull: List processing (Electronic computers)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Computer storage devices
        Type: general
      – SubjectFull: Systems programming (Computer science)
        Type: general
      – SubjectFull: Information storage & retrieval systems
        Type: general
    Titles:
      – TitleFull: Structure of a LISP System Using Two-Level Storage.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bobrow, Daniel G.
      – PersonEntity:
          Name:
            NameFull: Murphy, Daniel L.
      – PersonEntity:
          Name:
            NameFull: McIlroy, M. D.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar1967
              Type: published
              Y: 1967
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 10
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1