Semantics With Applications: A Formal Introduction
by Hanne Riis Nielson, Flemming Nielson
Publisher: John Wiley & Sons 1992
ISBN/ASIN: 0471929808
ISBN-13: 9780471929802
Number of pages: 250
Description:
The book covers the foundations of structural operational semantics (where computations consist of many small steps) and natural semantics (where computations consist of one big step). It shows how to describe the semantics of declarative as well as imperative language constructs and will also touch upon non-sequential constructs. It also presents proof principles for operational semantics and investigate the relationship between the two approaches to operational semantics. Problems from areas such as compiler construction, software validation, and program verication will be used to demonstrate the practical utility of semantics.
Download or read it online for free here:
Download link
(1.2MB, PDF)
Similar books
Lectures on the Curry-Howard Isomorphismby Morten Heine B. Sorensen, Pawel Urzyczyn - Elsevier Science
This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.
(12269 views)
Topics in History and Comparing Programming Languagesby Dennie Van Tassel - Gavilan College
This website contains files on the history of computer programming language statements. The files compare programming language statements in several different languages tracing the statement from early languages to present languages.
(8357 views)
Concrete Semantics: With Isabelle/HOLby Tobias Nipkow, Gerwin Klein - Springer
The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a tool for formal proofs about computer science artefacts. All the mathematics is formalised in Isabelle and much of it is executable.
(7478 views)
Formal Languagesby Keijo Ruohonen - Tampere University of Technology
In these notes the classical Chomskian formal language theory is fairly fully dealt with, omitting however much of automata constructs and computability issues. Surveys of Lindenmayer system theory and the mathematical theory of codes are given.
(9913 views)