Domain Theory in Logical Form

Domain Theory in Logical Form (1991)

by Samson Abramsky

Venue:	Annals of Pure and Applied Logic
Citations:	214 - 10 self

Datum	Value	Source
TITLE	Domain Theory in Logical Form	INFERENCE
AUTHOR NAME	Samson Abramsky	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computing; Imperial College of Science and Technology	SVM HeaderParse 0.2
AUTHOR ADDR	180 Queen’s Gate; London SW7 2BZ	SVM HeaderParse 0.2
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:	SVM HeaderParse 0.2
YEAR	1991	INFERENCE
VENUE	Annals of Pure and Applied Logic	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	1--77	INFERENCE
VOLUME	51	INFERENCE
CITATIONS	70 found	ParsCit 1.0