Type Theory and Formal Proof: An Introduction

Nederpelt, Rob and Geuvers, Herman

ISBN 10: 110703650X / ISBN 13: 9781107036505

Published by Cambridge University Press, 2014

About this Item

***Simply Brit*** Welcome to our online used book store, where affordability meets great quality. Dive into a world of captivating reads without breaking the bank. We take pride in offering a wide selection of used books, from classics to hidden gems, ensuring there is something for every literary palate. All orders are shipped within 24 hours and our lightning fast-delivery within 48 hours coupled with our prompt customer service ensures a smooth journey from ordering to delivery. Discover the joy of reading with us, your trusted source for affordable books that do not compromise on quality.

Seller Inventory # 4446982

Bibliographic Details

• Title: Type Theory and Formal Proof: An Introduction
• Publisher: Cambridge University Press
• Publication Date: 2014
• Language: English
• ISBN 10: 110703650X
• ISBN 13: 9781107036505
• Binding: Hardcover
• Condition: Used; Very Good

About this title

Synopsis

Type theory is a fast-evolving field at the crossroads of logic, computer science and mathematics. This gentle step-by-step introduction is ideal for graduate students and researchers who need to understand the ins and outs of the mathematical machinery, the role of logical rules therein, the essential contribution of definitions and the decisive nature of well-structured proofs. The authors begin with untyped lambda calculus and proceed to several fundamental type systems, including the well-known and powerful Calculus of Constructions. The book also covers the essence of proof checking and proof development, and the use of dependent type theory to formalise mathematics. The only prerequisite is a basic knowledge of undergraduate mathematics. Carefully chosen examples illustrate the theory throughout. Each chapter ends with a summary of the content, some historical context, suggestions for further reading and a selection of exercises to help readers familiarise themselves with the material.

About the Authors

Rob Nederpelt was Lecturer in Logic for Computer Science until his retirement. Currently he is a guest researcher in the Faculty of Mathematics and Computer Science at Eindhoven University of Technology, The Netherlands.

Herman Geuvers is Professor in Theoretical Informatics at the Radboud University Nijmegen, and Professor in Proving with Computer Assistance at Eindhoven University of Technology, both in The Netherlands.