Semantical proofs of correctness for programs performing non-deterministic tests on real numbers (Q3060187): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive characterization of computable real-valued functions and relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of a sequential language for exact real-number computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain-Theoretic Foundations of Functional Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:35, 3 July 2024

scientific article
Language Label Description Also known as
English
Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
scientific article

    Statements

    Semantical proofs of correctness for programs performing non-deterministic tests on real numbers (English)
    0 references
    0 references
    1 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    denotational semantics
    0 references
    Smyth power domains
    0 references