DeepRead
Cover of Type Theory and Formal Proof

Type Theory and Formal Proof

Rob Nederpelt, Herman Geuvers · 2014

Programming and computer science › Lisp and Scheme

#3,168 most recommended

About the book

A textbook introduction to type theory and its use for writing formal mathematical proofs. It starts from the untyped lambda calculus, moves through simple types and the Curry-Howard correspondence, and reaches dependent types and the systems used by modern proof assistants. Type theory gives a single framework in which proofs and programs are the same kind of object, so checking a proof can be reduced to type checking. The authors present this as a practical basis for formal mathematics that a machine can verify step by step. The book builds the argument gradually, with each stronger system motivated by the limits of the previous one.

Written by Claude from what it knows of this book.

What Hacker News says 85% recommend · 0% critical

02.552016202020262021 peak · 4
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2014
ISBN
9781107036505
Editions known
6 at Open Library
Open Library
OL21077176W

COMPUTERS / Programming Languages / GeneralLogic, symbolic and mathematicalType theory

Explore in the mosaic

Read next: its neighbours on the mosaic