1989•DAIMI Report SeriesOpen access

Logics of Domains

Guo‐Qiang Zhang

Abstract

This dissertation studies the logical aspects of domains as used in the denotational semantics of programming languages. Frameworks of domain logics are introduced which serve as basic tools for the systematic derivation of proof systems from the denotational semantics of programming languages. The proof systems so derived are guaranteed to agree with the denotational semantics in the sense that the denotation of any program coincides with the set of assertations true of it. The study focuses on two frameworks for denotational semantics: the sep domains, and the less standard, but important, category of dI-domains with stable functions

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 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: Denotational semantics, Denotational semantics of the Actor model, Normalisation by evaluation, Denotation (semiotics), Action semantics, Domain theory, Programming language, Semantics (computer science)