Overview
- Authors:
-
-
Ernest G. Manes
-
Department of Mathematics and Statistics, University of Massachusetts, Amherst, USA
-
Michael A. Arbib
-
Departments of Computer Science, Neurobiology and Physiology, University of Southern California, Los Angeles, USA
Access this book
Other ways to access
About this book
In the 1930s, mathematical logicians studied the notion of "effective comput ability" using such notions as recursive functions, A-calculus, and Turing machines. The 1940s saw the construction of the first electronic computers, and the next 20 years saw the evolution of higher-level programming languages in which programs could be written in a convenient fashion independent (thanks to compilers and interpreters) of the architecture of any specific machine. The development of such languages led in turn to the general analysis of questions of syntax, structuring strings of symbols which could count as legal programs, and semantics, determining the "meaning" of a program, for example, as the function it computes in transforming input data to output results. An important approach to semantics, pioneered by Floyd, Hoare, and Wirth, is called assertion semantics: given a specification of which assertions (preconditions) on input data should guarantee that the results satisfy desired assertions (postconditions) on output data, one seeks a logical proof that the program satisfies its specification. An alternative approach, pioneered by Scott and Strachey, is called denotational semantics: it offers algebraic techniques for characterizing the denotation of (i. e. , the function computed by) a program-the properties of the program can then be checked by direct comparison of the denotation with the specification. This book is an introduction to denotational semantics. More specifically, we introduce the reader to two approaches to denotational semantics: the order semantics of Scott and Strachey and our own partially additive semantics.
Similar content being viewed by others
Article
Open access
31 January 2023
Table of contents (14 chapters)
-
-
Denotational Semantics of Control
-
-
- Ernest G. Manes, Michael A. Arbib
Pages 3-37
-
- Ernest G. Manes, Michael A. Arbib
Pages 38-70
-
- Ernest G. Manes, Michael A. Arbib
Pages 71-97
-
- Ernest G. Manes, Michael A. Arbib
Pages 98-115
-
Semantics of Recursion
-
Front Matter
Pages 117-117
-
- Ernest G. Manes, Michael A. Arbib
Pages 119-145
-
- Ernest G. Manes, Michael A. Arbib
Pages 146-175
-
- Ernest G. Manes, Michael A. Arbib
Pages 176-179
-
- Ernest G. Manes, Michael A. Arbib
Pages 180-209
-
- Ernest G. Manes, Michael A. Arbib
Pages 210-231
-
Data Types
-
Front Matter
Pages 233-233
-
- Ernest G. Manes, Michael A. Arbib
Pages 235-257
-
- Ernest G. Manes, Michael A. Arbib
Pages 258-278
-
- Ernest G. Manes, Michael A. Arbib
Pages 279-292
-
- Ernest G. Manes, Michael A. Arbib
Pages 293-317
-
- Ernest G. Manes, Michael A. Arbib
Pages 318-340
-
Back Matter
Pages 341-353
Authors and Affiliations
-
Department of Mathematics and Statistics, University of Massachusetts, Amherst, USA
Ernest G. Manes
-
Departments of Computer Science, Neurobiology and Physiology, University of Southern California, Los Angeles, USA
Michael A. Arbib