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.
|Published (Last):||8 March 2009|
|PDF File Size:||12.63 Mb|
|ePub File Size:||6.1 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.
The Formal Semantics of Programming Languages
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. An important tenet of denotational semantics is that semantics should be compositional : the denotation of a program phrase should be built out of the denotations of its subphrases. Denotational semantics originated in the work of Christopher Strachey and Dana Scott published in the early s.
The formal semantics of programming languages - an introduction