Semantical proofs of correctness for programs performing non-deterministic tests on real numbers

DOI10.1017/S0960129510000186zbMath1213.68201MaRDI QIDQ3060187

Thomas Anberrée

Publication date: 1 December 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

denotational semantics; Smyth power domains

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68Q55: Semantics in the theory of computing

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Cites Work

• LCF considered as a programming language
• Recursive characterization of computable real-valued functions and relations
• Semantics of a sequential language for exact real-number computation
• Domain-Theoretic Foundations of Functional Programming