Finite Automata (D. Perrin). Context-Free Languages (J. Berstel, L. Boasson). Formal Languages and Power Series (A. Salomaa). Automata on Infinite Objects (W. Thomas). Graph Rewriting: an Algebraic and Logic Approach (B. Courcelle). Rewrite Systems (N. Dershowitz, J.-P. Jouannaud). Functional Programming and Lambda Calculus (H.P. Barendregt). Type Systems for Programming Languages (J.C. Mitchell). Recursive Applicative Program Schemes (B. Courcelle). Logic Programming (K.R. Apt). Denotational Semantics (P.D. Mosses). Semantic Domains (G.A. Gunter, D.S. Scott). Algebraic Specification (M. Wirsing). Logics of Programs (D. Kozen, J. Tiuryn). Methods and Logics for Proving Programs (P. Cousot). Temporal and Modal Logic (E.A. Emerson). Elements of Relational Database Theory (P. Kanellakis). Distributed Computing: Models and Methods (L. Lamport, N. Lynch). Operational and Algebraic Semantics of Concurrent Processes (R. Milner). Subject Index.
Addressing the central areas of theoretical computer science, the
handbook provides the student or professional with a comprehensive
perspective on the main results and developments in this field.
Consisting of 37 chapters, written by American and European
researchers, it will be ideally suited for study and reference.
Current Awareness Bulletin
S. Bloom
The editor, Jan van Leeuwen, deserves high praise for a job well
done.
Zentralblatt für Mathematik
Ask a Question About this Product More... |