View in EDS

A coinductive completeness proof for the equivalence of recursive types

Saved in:
Bibliographic Details
Title: A coinductive completeness proof for the equivalence of recursive types
Authors: Cardone, Felice1 cardone@disco.unimib.it
Source: Theoretical Computer Science. Mar2002, Vol. 275 Issue 1/2, p575. 13p.
Subjects: Computer programming, Electronic data processing
Abstract: We prove that the equivalence of recursive types induced by the equality of their infinite unfoldings coincides with the equality of their interpretations as closures over the λ-model Pω. [Copyright &y& Elsevier]
Copyright of Theoretical Computer Science 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: 7772968
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A coinductive completeness proof for the equivalence of recursive types
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cardone%2C+Felice%22">Cardone, Felice</searchLink><relatesTo>1</relatesTo><i> cardone@disco.unimib.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Mar2002, Vol. 275 Issue 1/2, p575. 13p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We prove that the equivalence of recursive types induced by the equality of their infinite unfoldings coincides with the equality of their interpretations as closures over the <f>λ</f>-model <f>Pω</f>. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science 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=7772968
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/S0304-3975(01)00298-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 575
    Subjects:
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Electronic data processing
        Type: general
    Titles:
      – TitleFull: A coinductive completeness proof for the equivalence of recursive types
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cardone, Felice
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 28
              M: 03
              Text: Mar2002
              Type: published
              Y: 2002
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 275
            – Type: issue
              Value: 1/2
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1