Includes bibliographical references (pages 479-485) and index.
CONTENTS NOTE
Text of Note
Judgments and rules -- Statistics and dynamics -- Total functions -- Finite data types -- Types and propositions -- Infinite data types -- Variable types -- Partiality and recursive types -- Dynamic types -- Subtyping -- Dynamic dispatch -- Control flow -- Symbolic data -- Mutable state -- Parallelism -- Concurrency and distribution -- Modularity -- Equational reasoning.
0
SUMMARY OR ABSTRACT
Text of Note
This text develops a comprehensive theory of programming languages based on type systems and structural operational semantics. Language concepts are precisely defined by their static and dynamic semantics, presenting the essential tools both intuitively and rigorously while relying on only elementary mathematics. These tools are used to analyze and prove properties of languages and provide the framework for combining and comparing language features. --Amazon.