View in EDS

On the static and dynamic extents of delimited continuations

Saved in:
Bibliographic Details
Title: On the static and dynamic extents of delimited continuations
Authors: Biernacki, Dariusz1 dabi@brics.dk, Danvy, Olivier1 danvy@brics.dk, Shan, Chung-chieh2 ccshan@cs.rutgers.edu
Source: Science of Computer Programming. May2006, Vol. 60 Issue 3, p274-297. 24p.
Subjects: Statics, Dynamics, Search algorithms, Computer systems
Abstract: Abstract: We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias ) and the dynamic delimited-control operator control (alias ). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum. We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of ‘control queue’. [Copyright &y& Elsevier]
Copyright of Science of Computer Programming is the property of Elsevier B.V. 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 Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 20524054
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the static and dynamic extents of delimited continuations
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Biernacki%2C+Dariusz%22">Biernacki, Dariusz</searchLink><relatesTo>1</relatesTo><i> dabi@brics.dk</i><br /><searchLink fieldCode="AR" term="%22Danvy%2C+Olivier%22">Danvy, Olivier</searchLink><relatesTo>1</relatesTo><i> danvy@brics.dk</i><br /><searchLink fieldCode="AR" term="%22Shan%2C+Chung-chieh%22">Shan, Chung-chieh</searchLink><relatesTo>2</relatesTo><i> ccshan@cs.rutgers.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Science+of+Computer+Programming%22">Science of Computer Programming</searchLink>. May2006, Vol. 60 Issue 3, p274-297. 24p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Statics%22">Statics</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamics%22">Dynamics</searchLink><br /><searchLink fieldCode="DE" term="%22Search+algorithms%22">Search algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias ) and the dynamic delimited-control operator control (alias ). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum. We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of ‘control queue’. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Science of Computer Programming is the property of Elsevier B.V. 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=20524054
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.scico.2006.01.002
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 24
        StartPage: 274
    Subjects:
      – SubjectFull: Statics
        Type: general
      – SubjectFull: Dynamics
        Type: general
      – SubjectFull: Search algorithms
        Type: general
      – SubjectFull: Computer systems
        Type: general
    Titles:
      – TitleFull: On the static and dynamic extents of delimited continuations
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Biernacki, Dariusz
      – PersonEntity:
          Name:
            NameFull: Danvy, Olivier
      – PersonEntity:
          Name:
            NameFull: Shan, Chung-chieh
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2006
              Type: published
              Y: 2006
          Identifiers:
            – Type: issn-print
              Value: 01676423
          Numbering:
            – Type: volume
              Value: 60
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Science of Computer Programming
              Type: main
ResultId 1