A Theory of Objects or Computability Complexity and Languages

A Theory of Objects

Author: Martin Abadi

Procedural languages are generally well understood. Their foundations have been cast in calculi that prove useful in matters of implementation and semantics. So far, an analogous understanding has not emerged for object-oriented languages. In this book the authors take a novel approach to the understanding of object-oriented languages by introducing object calculi and developing a theory of objects around them. The book covers both the semantics of objects and their typing rules, and explains a range of object-oriented concepts, such as self, dynamic dispatch, classes, inheritance, prototyping, subtyping, covariance and contravariance, and method specialization. Researchers and graduate students will find this an important development of the underpinnings of object-oriented programming.

Table of Contents:

	Preface
	Prologue	1
1	Object Orientation	7
2	Class-Based Languages	11
3	Advanced Class-Based Features	25
4	Object-Based Languages	35
5	Modeling Object-Oriented Languages	51
6	Untyped Calculi	57
7	First-Order Calculi	79
8	Subtyping	93
9	Recursion	113
10	Untyped Imperative Calculi	129
11	First-Order Imperative Calculi	141
12	A First-Order Language	153
13	Second-Order Calculi	169
14	A Semantics	185
15	Definable Covariant Self Types	201
16	Primitive Covariant Self Types	221
17	Imperative Calculi with Self Types	241
18	Interpretations of Object Calculi	257
19	A Second-Order Language	273
20	A Higher-Order Calculus	287
21	A Language with Matching	305
	Epilogue	325
App. A	Fragments	329
App. B	Systems	337
App. C	Proofs	347
	List of Figures	363
	List of Tables	365
	List of Notations	371
	List of Languages	381
	Bibliography	383
	Index	391

Go to: Daughters of Britannia or The Conscience of a Liberal

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Author: Ron Sigal

This book is a rigorous but readable introduction to some of the central topics in theoretical computer science. The main subjects are computability theory, formal languages, logic and automated deduction, computational complexity (including NP-completeness), and programming language semantics.

Booknews

A rigorous but readable introduction to some of the central topics in theoretical computer science, including computability theory, formal languages, logic and automated deduction, computational complexity including NP-completeness, and programming language semantics. This second edition features more than triple the exercises of the previous edition and a new discussion of computability theory; a section on the denotational and operational semantics of recursion equations has been added. Annotation c. Book News, Inc., Portland, OR (booknews.com)