Interpretations of recursion under unbounded nondeterminacy
type: Item
instance of: scholarly article
title: Interpretations of recursion under unbounded nondeterminacy
zbMATH Open document ID: 0663.68016
DOI: 10.1016/0304-3975(88)90142-9
author: W. H. Hesselink
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
full work available at URL: 1988ThCompSciHesselink1.pdf
review text: This well written article concerns the semantics of language that contains unbounded nondeterminacy. Although already many papers have been written on this issue, the author succeeds in treating the subject from an original and interesting perspective. He does so by giving a denotational semantics without the standard tools of cpos or limits, thus circumventing the usual problems in the denotational semantics of unbounded nondeterminism. Instead, he bases both his operational and denotational semantics on an axiomatically defined notion of interpretation, using elementary mathematical means. Next, the well known notions of weakest (liberal) preconditions are characterized as smallest (largest) preparator functions, which are a kind of objects dual to interpretations. Finally, a characterization is given of the spectrum of interpretations which cannot deliver unjustified meaningful values upon divergence. Again, corresponding preparator functions are determined.
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 4084983
zbMATH Keywords: operational semantics
zbMATH Keywords: weakest preconditions
zbMATH Keywords: unbounded nondeterminacy
zbMATH Keywords: denotational semantics
reviewed by: John-Jules Meyer
MaRDI profile type: Publication
OpenAlex ID: W1996725025
cites work: Q3325069
cites work: Proof rules and transformations dealing with fairness
cites work: Q3917476
cites work: Countable nondeterminism and random assignment
cites work: Q3899466
cites work: Programming as a Discipline of Mathematical Nature
cites work: Predicative programming Part I
cites work: A mathematical approach to nondeterminism in data types
cites work: Deadlock and fairness in morphisms of transition systems
cites work: Some Properties of Predicate Transformers
cites work: Q3922147
cites work: Specification-oriented semantics for communicating processes
cites work: Q3906397
cites work: Q4109269
Wikidata QID: Q127975297
description: scientific article; zbMATH DE number 4084983