"Programming languages embody the pragmatics of designing software systems, and also the mathematical concepts which underlie them. Anyone who wants to know how, for example, object-oriented programming rests upon a firm foundation in logic should read this book. It guides one surefootedly through the rich variety of basic programming concepts developed over the past forty years." -- Robin Milner, Professor of Computer Science, The Computer Laboratory, Cambridge University "Programming languages need not be designed in an intellectual vacuum; John Mitchell's book provides an extensive analysis of the fundamental notions underlying programming constructs. A basic grasp of this material is essential for the understanding, comparative analysis, and design of programming languages." -- Luca Cardelli, Digital Equipment Corporation Written for advanced undergraduate and beginning graduate students, "Foundations for Programming Languages" uses a series of typed lambda calculi to study the axiomatic, operational, and denotational semantics of sequential programming languages. Later chapters are devoted to progressively more sophisticated type systems.

Please note: Taylor & Francis does not sell or distribute the Hardback in India, Pakistan, Nepal, Bhutan, Bangladesh and Sri Lanka

Mathematical Foundations of Computer Science, Volume I is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science. This volume treats basic topics, mostly of a set-theoretical nature (sets, functions and relations, partially ordered sets, induction, enumerability, and diagonalization) and illustrates the usefulness of mathematical ideas by presenting applications to computer science. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation, and program verification. The material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in computer science and each chapter contains a large number of exercises. The volume can be used as a textbook, but it will also be useful to researchers and professionals who want a thorough presentation of the mathematical tools they need in a single source. In addition, the book can be used effectively as supplementary reading material in computer science courses, particularly those courses which involve the semantics of programming languages, formal languages and automata, and logic programming.

Foundations of Computation is a free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobart and William Smith Colleges. The course has no prerequisites other than introductory computer programming. The first half of the course covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers material on automata, formal languages and grammar that would ordinarily be encountered in an upper level course in theoretical computer science.

This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.

This easy-to-follow textbook/reference presents a concise introduction to mathematical analysis from an algorithmic point of view, with a particular focus on applications of analysis and aspects of mathematical modelling. The text describes the mathematical theory alongside the basic concepts and methods of numerical analysis, enriched by computer experiments using MATLAB, Python, Maple, and Java applets. This fully updated and expanded new edition also features an even greater number of programming exercises. Topics and features: describes the fundamental concepts in analysis, covering real and complex numbers, trigonometry, sequences and series, functions, derivatives, integrals, and curves; discusses important applications and advanced topics, such as fractals and L-systems, numerical integration, linear regression, and differential equations; presents tools from vector and matrix algebra in the appendices, together with further information on continuity; includes added material on hyperbolic functions, curves and surfaces in space, second-order differential equations, and the pendulum equation (NEW); contains experiments, exercises, definitions, and propositions throughout the text; supplies programming examples in Python, in addition to MATLAB (NEW); provides supplementary resources at an associated website, including Java applets, code source files, and links to interactive online learning material. Addressing the core needs of computer science students and researchers, this clearly written textbook is an essential resource for undergraduate-level courses on numerical analysis, and an ideal self-study tool for professionals seeking to enhance their analysis skills.

Foundations of Computer Technology is an easily accessible introduction to the architecture of computers and peripherals. This textbook clearly and completely explains modern computer systems through an approach that integrates components, systems, software, and design. It provides a succinct, systematic, and readable guide to computers, providing a springboard for students to pursue more detailed technology subjects. This volume focuses on hardware elements within a computer system and the impact of software on its architecture. It discusses practical aspects of computer organization (structure, behavior, and design) delivering the necessary fundamentals for electrical engineering and computer science students. The book not only lists a wide range of terms, but also explains the basic operations of components within a system, aided by many detailed illustrations. Material on modern technologies is combined with a historical perspective, delivering a range of articles on hardware, architecture and software, programming methodologies, and the nature of operating systems. It also includes a unified treatment on the entire computing spectrum, ranging from microcomputers to supercomputers. Each section features learning objectives and chapter outlines. Small glossary entries define technical terms and each chapter ends with an alphabetical list of key terms for reference and review. Review questions also appear at the end of each chapter and project questions inspire readers to research beyond the text. Short, annotated bibliographies direct students to additional useful reading.

Content Description #Dedicated to Wilfried Brauer.#Includes bibliographical references and index.