Programming Language Semantics (Cont.)
-
Axiomatic semantics,
which are an approach based on mathematical logic to proving the correctness of computer programs.
-
Denotational semantics,
which are a technique of describing the “meaning” of programs as mathematical functions, allowing people to prove theorems and reason about programs as mathematical entities.
-
Fixed-point semantics,
which use fixpoint theory to define the semantics of computer programs in terms of the least fixpoints of recursive programs.
-
Operational semantics,
which describe how a valid program is interpreted as sequences of computational steps.
These sequences then are the meaning of the program.
-
Translational semantics,
which define a language by using an attribute grammar, which is a formal way to define attributes for the productions of a formal grammar, associating these attributes to values.