Operational domain theory and topology of sequential programming languages
Saved in:
| 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 |
Be the first to leave a comment!
