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. (C) 2008 Elsevier Inc. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 411-437 |
| Number of pages | 27 |
| Journal | Information and Computation |
| Volume | 207 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Mar 2009 |