Type Theory and Formal Proof

Douban
Type Theory and Formal Proof

Log ind eller registrer dig for at anmelde eller tilføje dette element til din samling.

ISBN: 9781107036505
forfatter: Rob Nederpelt / Herman Geuvers
forlag: Cambridge University Press
udgivelsesdato: 2014 -10
indbinding: Hardcover
pris: USB 80.00
antal sider: 490

/ 10

1 bedømmelser

Ingen nok bedømmelser
Lån eller køb

An Introduction

Rob Nederpelt / Herman Geuvers   

overblik

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.

contents

Foreword
Preface
Acknowledgements
Greek alphabet
1. Untyped lambda calculus
2. Simply typed lambda calculus
3. Second order typed lambda calculus
4. Types dependent on types
5. Types dependent on terms
6. The Calculus of Constructions
7. The encoding of logical notions in λC
8. Definitions
9. Extension of λC with definitions
10. Rules and properties of λD
11. Flag-style natural deduction in λD
12. Mathematics in λD: a first attempt
13. Sets and subsets
14. Numbers and arithmetic in λD
15. An elaborated example
16. Further perspectives
Appendix A. Logic in λD
Appendix B. Arithmetical axioms, definitions and lemmas
Appendix C. Two complete example proofs in λD
Appendix D. Derivation rules for λD
References
Index of names
Index of technical notions
Index of defined constants
Index of subjects.

kommentarer
anmeldelser
笔记