1996•Information and ComputationOpen access

From Operational Semantics to Domain Theory

Ian A. Mason, Scott F. Smith, Carolyn Talcott

Abstract

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 56 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Domain theory, Equivalence (formal languages), Monotonic function, Least fixed point, Operational semantics, Abstraction, Uniqueness, Domain (mathematical analysis)