denotational semantics


Also found in: Wikipedia.

denotational semantics

(theory)
A technique for describing the meaning of programs in terms of mathematical functions on programs and program components. Programs are translated into functions about which properties can be proved using the standard mathematical theory of functions, and especially domain theory.

Compare axiomatic semantics, operational semantics, standard semantics.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Komendantsky, "Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus", Electronic Notes in Theoretical Computer Science, Vol.
Partial Metrics and Denotational Semantics. From the discussion in Section 1.1 we can infer that the Scott model does not incorporate a "metric" tool to measure the information content of the elements that form such a model.
In the light of the preceding facts, it seems interesting to wonder if it is possible to obtain a fixed point technique, which refines the original Matthews technique, based on the use of a new version of Theorem 1 which simultaneously incorporates the contractive condition (4) and a weaker notion of completeness and, in addition, it allows analyzing the meaning of recursive denotational semantics in the spirit of Scott and maintaining the original ideas of Matthews.
Schellekens: The Smyth completion: a common foundation for denotational semantics and complexity analysis, Electronic Notes Theor.
Subsequent chapters investigate topics including cognitive properties of human factors and error models in engineering and socialization, user-centered interactive data mining, denotational semantics of real-time process algebra, and unifying rough set analysis and formal concept analysis based on a logic approach to granular computing.
A denotational semantics for deliberation dialogues.
A denotational semantics for SQL's select statement with optional credibility and plausibility constructs is given.
The proof system is proved to be correct for full CCP and complete for the class of programs in which the denotational semantics characterizes exactly the strongest postcondition.
Fodor frankly admits, however, that denotational semantics, in addition to having well known difficulties in any case, seems incompatible with his computationalism.
Operational semantics provide an abstract implementation-oriented account of program meaning, denotational semantics give a more abstract mathematical account, and axiomatic semantics focus on partial correctness issues (see Nielson and Nielson [1992] and Tennent [1991] for a thorough discussion).
In addition, he formulated and strongly advanced full abstraction, the study of relationships between operational and denotational semantics."
The next section lays groundwork for the rest of the article by describing the denotational semantics of the subset of VHDL above.