Type theory and formal proof : an introduction / Rob Nederpelt, Eindhoven University of Technology, the Netherlands, Herman Geuvers, Radbound University Nijmegen, and Eindhoven University of Technology, the Netherlands.
By: Nederpelt, R. P. (Rob P.) [author.].
Contributor(s): Geuvers, Herman [author.].
Material type:
TextPublisher: Cambridge ; New York : Cambridge University Press, 2014Description: xxv, 436 pages ; UKP 50.00 26 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9781107036505 (hbk.) :.Subject(s): Type theory | COMPUTERS / Programming Languages / GeneralDDC classification: 551.3 Online resources: Cover image Summary: "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 culminating in 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 formalize mathematics. The only prerequisites are a good knowledge of undergraduate algebra and analysis. 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 familiarize themselves with the material"-- Provided by publisher.
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| Book | Chennai Mathematical Institute General Stacks | 511.35 NED (Browse shelf) | Available | 9935 |
Formerly CIP. Uk
Includes bibliographical references (pages 411-417) and indexes.
"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 culminating in 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 formalize mathematics. The only prerequisites are a good knowledge of undergraduate algebra and analysis. 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 familiarize themselves with the material"-- Provided by publisher.