Operational domain theory and topology of sequential programming languages

Research output: Contribution to journalArticle

Standard

Operational domain theory and topology of sequential programming languages. / Escardo, Martin; Ho, WK.

In: Information and Computation, Vol. 207, No. 3, 01.03.2009, p. 411-437.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Bibtex

@article{0aa1345168a747ec90d8d55957b820c8,
title = "Operational domain theory and topology of sequential programming languages",
abstract = "A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and order. We further develop this, and, moreover, we additionally export topological techniques. In particular, we work with an operational notion of compact set and show that total programs with values on certain types are uniformly continuous on compact sets of total elements. We apply this and other conclusions to prove the correctness of non-trivial programs that manipulate infinite data. What is interesting is that the development applies to sequential programming languages, in addition to languages with parallel features. (C) 2008 Elsevier Inc. All rights reserved.",
author = "Martin Escardo and WK Ho",
year = "2009",
month = mar,
day = "1",
doi = "10.1016/j.ic.2008.12.003",
language = "English",
volume = "207",
pages = "411--437",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

T1 - Operational domain theory and topology of sequential programming languages

AU - Escardo, Martin

AU - Ho, WK

PY - 2009/3/1

Y1 - 2009/3/1

N2 - A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and order. We further develop this, and, moreover, we additionally export topological techniques. In particular, we work with an operational notion of compact set and show that total programs with values on certain types are uniformly continuous on compact sets of total elements. We apply this and other conclusions to prove the correctness of non-trivial programs that manipulate infinite data. What is interesting is that the development applies to sequential programming languages, in addition to languages with parallel features. (C) 2008 Elsevier Inc. All rights reserved.

AB - A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and order. We further develop this, and, moreover, we additionally export topological techniques. In particular, we work with an operational notion of compact set and show that total programs with values on certain types are uniformly continuous on compact sets of total elements. We apply this and other conclusions to prove the correctness of non-trivial programs that manipulate infinite data. What is interesting is that the development applies to sequential programming languages, in addition to languages with parallel features. (C) 2008 Elsevier Inc. All rights reserved.

U2 - 10.1016/j.ic.2008.12.003

DO - 10.1016/j.ic.2008.12.003

M3 - Article

VL - 207

SP - 411

EP - 437

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 3

ER -