Nantilus
Type theory and formal proof : an introduction
"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...
Enregistré dans:
| Auteurs principaux : | , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Type theory and formal proof : an introduction / Rob Nederpelt, ..., Herman Geuvers, ... |
| Publié : |
Cambridge, New York (N. Y.) :
Cambridge University Press
, 2014 |
| Description matérielle : | 1 vol. (XXV-436 p.) |
| Sujets : |
| LEADER | 02522cam a2200493 4500 | ||
|---|---|---|---|
| 001 | PPN182109402 | ||
| 003 | http://www.sudoc.fr/182109402 | ||
| 005 | 20220503055800.0 | ||
| 010 | |a 978-1-10-703650-5 |b rel. |d 65.62 EUR. | ||
| 010 | |a 1-10-703650-X |b rel. | ||
| 020 | |a US |b 2014010865 | ||
| 020 | |a GB |b B490054 | ||
| 035 | |a (OCoLC)874733138 | ||
| 073 | 1 | |a 9781107036505 | |
| 100 | |a 20141128h20142014k y0frey0103 ba | ||
| 101 | 0 | |a eng | |
| 102 | |a GB | ||
| 105 | |a a a 001yy | ||
| 106 | |a r | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c n |2 rdamedia | ||
| 182 | 1 | |6 z01 |a n | |
| 183 | |6 z01 |a nga |2 RDAfrCarrier | ||
| 200 | 1 | |a Type theory and formal proof |e an introduction |f Rob Nederpelt, ..., Herman Geuvers, ... | |
| 214 | 0 | |a Cambridge |a New York (N. Y.) |c Cambridge University Press |d 2014 | |
| 215 | |a 1 vol. (XXV-436 p.) |c fig. |d 26 cm | ||
| 320 | |a Bibliogr. p. [411]-417. Index | ||
| 330 | |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"-- | ||
| 606 | |3 PPN034147411 |a Théorie des types |2 rameau | ||
| 606 | |3 PPN027576345 |a Lambda-calcul |2 rameau | ||
| 676 | |a 551.3 |v 23 | ||
| 680 | |a QA9 |b .N37 2014 | ||
| 686 | |a 03-02 |c 2010 |2 msc | ||
| 686 | |a 03F03 |c 2010 |2 msc | ||
| 686 | |a 03F07 |c 2010 |2 msc | ||
| 700 | 1 | |3 PPN128713372 |a Nederpelt |b Rob P. |f 19..-.... |4 070 | |
| 701 | 1 | |3 PPN074514229 |a Geuvers |b Herman |4 070 | |
| 801 | 3 | |a FR |b Abes |c 20220401 |g AFNOR | |
| 801 | 0 | |b DLC |g AACR2 | |
| 801 | 2 | |b YDX |g AACR2 | |
| 930 | |5 441092208:726031682 |b 441092208 |j u | ||
| 979 | |a CCFA | ||
| 998 | |a 926018 | ||