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.
References in periodicals archive ?
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 top-level of denotational semantics for the select statement, applied to a database d, is given below.
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.
2 [Logics and Meanings of Programs): Semantics of Programming Languages -- denotational semantics General Terms: Languages, Theory, Verification Additional Key Words and Phrases: Constraint programming, dynamic scheduling, proof theory, strongest postcondition
Fodor frankly admits, however, that denotational semantics, in addition to having well known difficulties in any case, seems incompatible with his computationalism.
The second kind of difficulty--Frege cases suggests that Fodor's denotational semantics cannot accommodate intuitions about belief reports and the like, intuitions which translate directly into plausible intentional generalizations.
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.
We briefly describe the essential features of VHDL in Section 2 and give a denotational semantics for the language in Section 3.