denotational semantics
(redirected from Full completeness)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.
Compare axiomatic semantics, operational semantics, standard semantics.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)