Abstract

A gentle introduction for graduate students and researchers in the art of formalizing mathematics on the basis of type theory. 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.
Original languageEnglish
Place of PublicationCambridge
PublisherCambridge University Press
Number of pages436
ISBN (Print)978-1-107-03650-5
DOIs
Publication statusPublished - 2014

Fingerprint

Formal Proof
Type Theory
Lambda Calculus
Type Systems
Exercise
Computer Science
Calculus
Cover
Logic
Algebra
Dependent

Cite this

Nederpelt, R.P. ; Geuvers, J.H. / Type theory and formal proof : an introduction. Cambridge : Cambridge University Press, 2014. 436 p.
@book{2bc2d48b6c464b5e902a7cefcec6d17b,
title = "Type theory and formal proof : an introduction",
abstract = "A gentle introduction for graduate students and researchers in the art of formalizing mathematics on the basis of type theory. 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.",
author = "R.P. Nederpelt and J.H. Geuvers",
year = "2014",
doi = "10.1017/CBO9781139567725",
language = "English",
isbn = "978-1-107-03650-5",
publisher = "Cambridge University Press",
address = "United Kingdom",

}

Type theory and formal proof : an introduction. / Nederpelt, R.P.; Geuvers, J.H.

Cambridge : Cambridge University Press, 2014. 436 p.

Research output: Book/ReportBookAcademic

TY - BOOK

T1 - Type theory and formal proof : an introduction

AU - Nederpelt, R.P.

AU - Geuvers, J.H.

PY - 2014

Y1 - 2014

N2 - A gentle introduction for graduate students and researchers in the art of formalizing mathematics on the basis of type theory. 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.

AB - A gentle introduction for graduate students and researchers in the art of formalizing mathematics on the basis of type theory. 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.

U2 - 10.1017/CBO9781139567725

DO - 10.1017/CBO9781139567725

M3 - Book

SN - 978-1-107-03650-5

BT - Type theory and formal proof : an introduction

PB - Cambridge University Press

CY - Cambridge

ER -