University of Sussex
Browse

File(s) not publicly available

General Synthetic Domain Theory - A Logical Approach.

journal contribution
posted on 2023-06-08, 00:29 authored by Bernhard ReusBernhard Reus, Thomas Streicher
Synthetic Domain Theory (SDT) is a version of Domain Theory where "all functions are continuous". In [14, 12] there has been developed a logical and axiomatic version of SDT which is special in the sense that it captures the essence of Domain Theory `a la Scott but rules out other important notions of domain. In this article we will give a logical and axiomatic account of General Synthetic Domain Theory (GSDT) aiming to grasp the structure common to all notions of domain as advocated by various authors. As in [14, 12] the underlying logic is a sufficiently expressive version of constructive type theory. We start with a few basic axioms giving rise to a core theory on top of which we study various notions of predomains as well-complete and replete S-spaces [9], define the appropriate notion of domain and verify the usual induction principles. 1

History

Publication status

  • Published

Journal

Mathematical Structures in Computer Science

ISSN

0960-1295

Publisher

Mathematical Structures in Computer Science

Issue

2

Volume

9

Page range

177-223

ISBN

0960-1295

Department affiliated with

  • Informatics Publications

Full text available

  • No

Peer reviewed?

  • Yes

Legacy Posted Date

2012-02-06

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC