Operational Domain Theory and Topology of a Sequential Programming Language

A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. 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.

• Type: Conference
• Year: 2005
• Where: LICS
• Authors: Martín Hötzel Escardó, Weng Kin Ho
• Keywords: Compact Sets, Computer Science, Denotational Semantics, Domain-theoretic Techniques, LICS 2005