In computer science , denotational semantics initially known as mathematical semantics or Scott—Strachey semantics is an approach of formalizing the meanings of programming languages by constructing mathematical objects called denotations that describe the meanings of expressions from the languages. Other approaches provide formal semantics of programming languages including axiomatic semantics and operational semantics. Broadly speaking, denotational semantics is concerned with finding mathematical objects called domains that represent what programs do. For example, programs or program phrases might be represented by partial functions or by games between the environment and the system.
|Published (Last):||18 October 2010|
|PDF File Size:||6.2 Mb|
|ePub File Size:||1.90 Mb|
|Price:||Free* [*Free Regsitration Required]|
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurrency.
View PDF. Save to Library. Create Alert. Launch Research Feed. Share This Paper. Topics from this paper. Semantics computer science. Programming language. Citations Publications citing this paper. Calculational semantics: Deriving programming theories from equations by functional predicate calculus Raymond T. Mosses Computer Science FM Homeier Contributions to the meta-theory of structural operational semantics Matteo Cimini Computer Science Reasoning about programs using operational semantics and the role of a proof support tool John R Hughes Computer Science, Mathematics References Publications referenced by this paper.
From Foundations of Computing. The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects. Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics.
The formal semantics of programming languages - an introduction