View in EDS

Operational domain theory and topology of sequential programming languages

Saved in:
Bibliographic Details
Title: Operational domain theory and topology of sequential programming languages
Authors: Escardó, Martı´n m.escardo@cs.bham.ac.uk, Ho, Weng Kin1
Source: Information & Computation. Mar2009, Vol. 207 Issue 3, p411-437. 27p.
Subjects: Programming languages, Comparative linguistics, Information theory, Artificial languages
Abstract: Abstract: A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and order. We further develop this, and, moreover, we additionally export topological techniques. In particular, we work with an operational notion of compact set and show that total programs with values on certain types are uniformly continuous on compact sets of total elements. We apply this and other conclusions to prove the correctness of non-trivial programs that manipulate infinite data. What is interesting is that the development applies to sequential programming languages, in addition to languages with parallel features. [Copyright &y& Elsevier]
Copyright of Information & Computation is the property of Academic Press Inc. 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: 36607141
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Operational domain theory and topology of sequential programming languages
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Escardó%2C+Martı´n%22">Escardó, Martı´n</searchLink><i> m.escardo@cs.bham.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Ho%2C+Weng+Kin%22">Ho, Weng Kin</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Information+%26+Computation%22">Information & Computation</searchLink>. Mar2009, Vol. 207 Issue 3, p411-437. 27p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Comparative+linguistics%22">Comparative linguistics</searchLink><br /><searchLink fieldCode="DE" term="%22Information+theory%22">Information theory</searchLink><br /><searchLink fieldCode="DE" term="%22Artificial+languages%22">Artificial languages</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and order. We further develop this, and, moreover, we additionally export topological techniques. In particular, we work with an operational notion of compact set and show that total programs with values on certain types are uniformly continuous on compact sets of total elements. We apply this and other conclusions to prove the correctness of non-trivial programs that manipulate infinite data. What is interesting is that the development applies to sequential programming languages, in addition to languages with parallel features. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Information & Computation is the property of Academic Press Inc. 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=36607141
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.ic.2008.12.003
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 27
        StartPage: 411
    Subjects:
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Comparative linguistics
        Type: general
      – SubjectFull: Information theory
        Type: general
      – SubjectFull: Artificial languages
        Type: general
    Titles:
      – TitleFull: Operational domain theory and topology of sequential programming languages
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Escardó, Martı´n
      – PersonEntity:
          Name:
            NameFull: Ho, Weng Kin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2009
              Type: published
              Y: 2009
          Identifiers:
            – Type: issn-print
              Value: 08905401
          Numbering:
            – Type: volume
              Value: 207
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Information & Computation
              Type: main
ResultId 1