Topology via logic
Interdefinability of parallel operations in PCF
Theoretical Computer Science - Special issue: Part B: Logic, semantics, and theory of programming
Research topics in functional programming
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Handbook of logic in computer science (vol. 1)
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Handbook of logic in computer science (vol. 3)
From operational semantics to domain theory
Information and Computation
Domains and lambda-calculi
Bisimilarity as a theory of functional programming
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Computable analysis: an introduction
Computable analysis: an introduction
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Theoretical Computer Science
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Operational Semantics and Program Equivalence
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Computability and totality in domains
Mathematical Structures in Computer Science
Local realizability toposes and a modal logic for computability
Mathematical Structures in Computer Science
Full abstraction, totality and PCF
Mathematical Structures in Computer Science
On sequential functionals of type 3
Mathematical Structures in Computer Science
Domain-theoretic Foundations of Functional Programming
Domain-theoretic Foundations of Functional Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
An Operational Domain-theoretic Treatment of Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
What sequential games, the tychonoff theorem and the double-negation shift have in common
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
| Hi-index | 0.00 |
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.