Abstract

The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme:

Citations

1310	A Discipline of Programming - Dijkstra - 1976
1225	A calculus of communicating systems - Milner - 1980
1219	An axiomatic basis for computer programming - Hoare - 1969
999	The temporal logic of programs - Pnueli - 1977
816	S.: Categories for the working mathematician - Lane - 1998
448	Algebraic laws for nondeterminism and concurrency - Hennessy, Milner - 1985
396	Model Theory - Chang - 1973
379	Introduction to Higher Order Categorical Logic - Lambek, Scott - 1986
363	LCF considered as a programming language - Plotkin - 1977
304	A Compendium of Continuous Lattices - Gierz, Hofmann, et al. - 1980
294	Calculi for synchrony and asynchrony - Milner - 1983
221	Principal type schemes for functional programs - Damas, Milner - 1982
196	A power domain construction - Plotkin - 1976
164	Toposes, Triples and Theories - Barr, Wells - 1985
159	The Category-theoretic Solution of Recursive Domain Equations - Smyth, Plotkin - 1982
158	An introduction to inductive definitions - Aczel - 1977
137	The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition - Barendregt - 1984
115	Abstract interpretation of declarative languages - Abramsky, Hankin - 1987
114	The theory of representations for Boolean algebras - Stone - 1936
104	Fully Abstract Models of Typed Lambda Calculi, Th - Milner - 1977
87	Full abstraction for a simple parallel programming language - Hennessy, Plotkin - 1979
87	Abstract Interpretations and Optimising Transformations for Applicative Programs - Mycroft - 1981
81	A probabilistic PDL - Kozen - 1985
78	Denotational semantics of concurrency - Bakker, Zucker - 1982
78	Theory of programming language and semantics - Milne, Starchey - 1976
76	The Denotational Description of Programming Languages - Gordon - 1979
62	On observing nondeterminism and concurrency - Hennessy, Milner - 1980
62	domains and predicate transformers: a topological view - Smyth, Power - 1983
59	First Order Dynamic Logic - Harel - 1979
59	Events in Computation - Winskel - 1980
57	Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes - Plotkin - 1981
52	Full abstraction for sequential languages: The state of the art - Berry, Curien, et al.
50	Using information systems to solve recursive domain equations - Larsen, Winskel - 1984
48	Extended type structures and filter lambda models - Coppo, Dezani-Ciancaglini, et al. - 1984
37	Domain Theory and the Logic of Observable Properties - Abramsky - 1987
34	Spaces, volume 3 of Cambridge - Stone - 1982
32	Theory and practice of sequential algorithms: the kernel of the applicative language CDS0 - Berry, Curien - 1985
31	Process logic - Pratt - 1979
28	A framework for intuitionistic modal logic - Plotkin, Stirling - 1986
26	On Semantic Foundations for Applicative Multiprogramming - Abramsky - 1983
26	Lectures on predomains and partial functions - Plotkin - 1985
21	Interpretation of Analysis by means of Functionals of Finite Type - Kreisel - 1959
17	A powerdomain for countable non-determinism - Plotkin - 1982
15	Vietoris locales and localic semi-lattices - Johnstone - 1985
15	Infinite words, infinite trees, infinite computations - Nivat - 1981
15	A complete proof system for SCCS with modal assertions - Winskel - 1986
13	Profinite solutions for recursive domain equations - Gunter - 1985
12	Universal profinite domains - Gunter - 1987
12	On the duality of dynamic algebras and Kripke models - Kozen - 1981
12	Metric spaces, generalised logic, and closed categories - Lawvere