東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Type theory and formal proof : = an ...

Nederpelt, R. P.

Linked to FindBook

Google Book

Amazon

博客來

Type theory and formal proof : = an introduction /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Type theory and formal proof :/ Rob Nederpelt, Herman Geuvers.
Reminder of title:	an introduction /
Author:	Nederpelt, R. P.
other author:	Geuvers, Herman,
Published:	Cambridge ;Cambridge University Press, : 2014.,
Description:	axxv, 436 p. :ill ;26 cm.
Subject:	Type theory. -
ISBN:	9781107036505

Type theory and formal proof : = an introduction /
Nederpelt, R. P.

Type theory and formal proof :an introduction /Rob Nederpelt, Herman Geuvers. - Cambridge ;Cambridge University Press,2014. - axxv, 436 p. :ill ;26 cm.

Includes bibliographical references (p. [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.

ISBN: 9781107036505US80.00

LCCN: 2014010865Subjects--Topical Terms:

664822
Type theory.

LC Class. No.: QA9 / .N37 2014

Dewey Class. No.: 551.3

Type theory and formal proof : = an introduction /
LDR:01775cam a2200241 a 4500 001 1991266
003 DLC
005 20150605182652.0
008 150930s2014 enk b 001 0 eng
010 $a 2014010865
020 $a 9781107036505 $q (hbk.) : $c US80.00
020 $a 110703650X $q (hbk.)
020 $a 9781139567725 $q (ebk.)
020 $a 1139567721 $q (ebk.)
020 $a 9781316056349 $q (ebk.)
020 $a 1316056341 $q (ebk.)
040 $a DLC $b eng
050 0 0 $a QA9 $b .N37 2014
082 0 0 $a 551.3 $2 23
100 1 $a Nederpelt, R. P. $q (Rob P.) $3 1641233
245 1 0 $a Type theory and formal proof : $b an introduction / $c Rob Nederpelt, Herman Geuvers.
260 # $a Cambridge ; $a New York : $b Cambridge University Press, $c 2014.
300 $a axxv, 436 p. : $b ill ; $c 26 cm.
504 $a Includes bibliographical references (p. [411]-417) and indexes.
520 # $a 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.
650 # 0 $a Type theory. $3 664822
700 1 # $a Geuvers, Herman, $d 1964- $3 1004025