eCite Digital Repository

From Operational Semantics to Domain Theory


Mason, IA and Smith, SF and Talcott, CL, From Operational Semantics to Domain Theory, Information and Computation, 128, (1) pp. 26-47. ISSN 0890-5401 (1996) [Refereed Article]

DOI: doi:10.1006/inco.1996.0061


This paper builds domain theoretic concepts upon an operational foundation. The basic operational theory consists of a single step reduction system from which an operational ordering and equivalence on programs are defined. The theory is then extended to include concepts from domain theory, including the notions of directed set, least upper bound, complete partial order, monotonicity, continuity, finite element, ω-algebraicity, full abstraction, and least fixed point properties. We conclude by using these concepts to construct a (strongly) fully abstract continuous model for our language. In addition we generalize a result of Milner and prove the uniqueness of such models. © 1996 Academic Press, Inc.

Item Details

Item Type:Refereed Article
Research Division:Information and Computing Sciences
Research Group:Theory of computation
Research Field:Theory of computation not elsewhere classified
Objective Division:Information and Communication Services
Objective Group:Other information and communication services
Objective Field:Other information and communication services not elsewhere classified
UTAS Author:Mason, IA (Dr Mason)
ID Code:8769
Year Published:1996
Web of Science® Times Cited:14
Deposited By:Applied Computing and Mathematics
Deposited On:1996-08-01
Last Modified:2011-08-22

Repository Staff Only: item control page