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 |
