Type theory and formal proof: an introduction
Gespeichert in:
Beteiligte Personen: | , |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Cambridge
Cambridge Univ. Press
2014
|
Ausgabe: | 1. publ. |
Schlagwörter: | |
Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027601105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
Umfang: | XXV, 436 S. |
ISBN: | 9781107036505 |
Internformat
MARC
LEADER | 00000nam a22000002c 4500 | ||
---|---|---|---|
001 | BV042161466 | ||
003 | DE-604 | ||
005 | 20220110 | ||
007 | t| | ||
008 | 141031s2014 xx |||| 00||| eng d | ||
016 | 7 | |a 016838318 |2 DE-101 | |
020 | |a 9781107036505 |c hbk. : £50.00 |9 978-1-107-03650-5 | ||
020 | |z 9781316056349 |c PDF ebook : No price |9 9781316056349 | ||
035 | |a (OCoLC)897379125 | ||
035 | |a (DE-599)BSZ414202430 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-473 |a DE-573 |a DE-188 |a DE-83 | ||
082 | 0 | |a 551.3 | |
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
100 | 1 | |a Nederpelt, Rob |d 1942- |e Verfasser |0 (DE-588)115937077X |4 aut | |
245 | 1 | 0 | |a Type theory and formal proof |b an introduction |c Rob Nederpelt ; Herman Geuvers |
250 | |a 1. publ. | ||
264 | 1 | |a Cambridge |b Cambridge Univ. Press |c 2014 | |
300 | |a XXV, 436 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
650 | 4 | |a Type theory | |
650 | 0 | 7 | |a Beweistheorie |0 (DE-588)4145177-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Typentheorie |0 (DE-588)4121795-0 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Typentheorie |0 (DE-588)4121795-0 |D s |
689 | 0 | 1 | |a Beweistheorie |0 (DE-588)4145177-6 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Geuvers, Herman |d 1964- |e Verfasser |0 (DE-588)1066888620 |4 aut | |
856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027601105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027601105 |
Datensatz im Suchindex
_version_ | 1819309816016797696 |
---|---|
adam_text | Titel: Type theory and formal proof
Autor: Nederpelt, Rob
Jahr: 2014
Contents
Foreword, by Henk Barendregt page xiii
Preface xv
Acknowledgements xxvii
Greek aiphabet xxviii
1 Untyped lambda calculus 1
1.1 Input Output, behaviour of functions 1
1.2 The essence of functions 2
1.3 Lambda-terms 4
1.4 Free and bound variables 8
1.5 Alpha conversion 9
1.6 Substitution 11
1.7 Lambda-terms modulo a-equivalence 14
1.8 Beta reduction 16
1.9 Normal forms and confluence 19
1.10 Fixed Point Theorem 24
1.11 Conclusions 26
1.12 Further reading 27
Exercises 29
2 Simply typed lambda calculus 33
2.1 Adding types 33
2.2 Simple types 34
2.3 Church-typing and Curry-typing 36
2.4 Derivation rules for Church s A- 39
2.5 Different formats for a derivation in A— 44
2.6 Kinds of problems to be solved in type theory 46
2.7 Well-typedness in A—»• 47
2.8 Type Checking in A— 50
2.9 Term Finding in A— 51
53
59
63
64
65
66
69
69
71
72
73
76
78
80
80
82
85
85
88
90
93
94
95
97
99
100
100
101
103
103
105
107
109
115
118
119
121
123
123
125
Contents
2.10 General properties of A—»
2.11 Reduction and A—
2.12 Consequences
2.13 Conclusions
2.14 Further reading
Exercises
Second order typed lambda calculus
3.1 Type-abstraction and type-application
3.2 II-types
3.3 Second order abstraction and application rules
3.4 The System A2
3.5 Example of a derivation in A2
3.6 Properties of A2
3.7 Conclusions
3.8 Further reading
Exercises
Types dependent on types
4.1 Type constructors
4.2 Sort-rule and var-rule in Au;
4.3 The weakening rule in Xlü
4.4 The formation rule in Au
4.5 Application and abstraction rules in Au;
4.6 Shortened derivations
4.7 The conversion rule
4.8 Properties of Aa;
4.9 Conclusions
4.10 Further reading
Exercises
Types dependent on terms
5.1 The missing extension
5.2 Derivation rules of AP
5.3 An example derivation in AP
5.4 Minimal predicate logic in AP
5.5 Example of a logical derivation in AP
5.6 Conclusions
5.7 Further reading
Exercises
The Calculus of Constructions
6.1 The system AC
6.2 The A-cube
Contents ix
6.3 Properties of AC 128
6.4 Conclusions 132
6.5 Further reading 133
Exercises I34
7 The encoding of logical notions in AC 137
7.1 Absurdity and negation in type theory 137
7.2 Conjunction and disjunction in type theory 139
7.3 An example of propositional logic in AC 144
7.4 Classical logic in AC 146
7.5 Predicate logic in AC 150
7.6 An example of predicate logic in AC 154
7.7 Conclusions 157
7.8 Further reading 159
Exercises 162
8 Definitions 165
8.1 The nature of definitions 165
8.2 Inductive and recursive definitions 167
8.3 The format of definitions 168
8.4 Instantiations of definitions 170
8.5 A formal format for definitions 172
8.6 Definitions depending on assumptions 174
8.7 Giving names to proofs 175
8.8 A general proof and a specialised version 178
8.9 Mathematical statements as formal definitions 180
8.10 Conclusions 182
8.11 Further reading 183
Exercises 185
9 Extension of AC with definitions 189
9.1 Extension of AC to the system ADo 189
9.2 Judgements extended with definitions 190
9.3 The rule for adding a definition 192
9.4 The rule for instantiating a definition 193
9.5 Definition unfolding and 5-conversion 197
9.6 Examples of 5-conversion 200
9.7 The conversion rule extended with A 202
9.8 The derivation rules for ADo 203
9.9 A closer look at the derivation rules of ADo 204
9.10 Conclusions 206
9.11 Further reading 207
Exercises 208
x Contents
10 Rules and properties of AD 211
10.1 Descriptive versus primitive definitions 211
10.2 Axioms and axiomatic notions 212
10.3 Rules for primitive definitions 214
10.4 Properties of AD 215
10.5 Normalisation and confluence in AD 219
10.6 Conclusions 221
10.7 Further reading 221
Exercises 223
11 Flag-style natural deduction in AD 225
11.1 Formal derivations in AD 225
11.2 Comparing formal and flag-style AD 228
11.3 Conventions about flag-style proofs in AD 229
11.4 Introduction and elimination rules 232
11.5 Rules for constructive propositional logic 234
11.6 Examples of logical derivations in AD 237
11.7 Suppressing unaltered parameter lists 239
11.8 Rules for classical propositional logic 240
11.9 Alternative natural deduction rules for V 243
11.10 Rules for constructive predicate logic 246
11.11 Rules for classical predicate logic 249
11.12 Conclusions 252
11.13 Further reading 253
Exercises 254
12 Mathematics in AD: a first attempt 257
12.1 An example to start with 257
12.2 Equality 259
12.3 The congruence property of equality 262
12.4 Orders 264
12.5 A proof about Orders 266
12.6 Unique existence 268
12.7 The descriptor l 271
12.8 Conclusions 274
12.9 Further reading 275
Exercises 276
13 Sets and subsets 279
13.1 Dealing with subsets in AD 279
13.2 Basic set-theoretic notions 282
13.3 Special subsets 287
13.4 Relations 288
Contents xi
13.5 Maps 291
13.6 Representation of mathematical notions 295
13.7 Conclusions 296
13.8 Further reading 297
Exercises 302
14 Numbers and arithmetic in AD 305
14.1 The Peano axioms for natural numbers 305
14.2 Introducing integers the axiomatic way 308
14.3 Basic properties of the new N 313
14.4 Integer addition 316
14.5 An example of a basic computation in AD 320
14.6 Arithmetical laws for addition 322
14.7 Closure under addition for natural and negative numbers 324
14.8 Integer subtraction 327
14.9 The opposite of an integer 330
14.10 Inequality relations on Z 332
14.11 Multiplication of integers 335
14.12 Divisibility 338
14.13 Irrelevance of proof 340
14.14 Conclusions 341
14.15 Further reading 343
Exercises 344
15 An elaborated example 349
15.1 Formalising a proof of Bezout s Lemma 349
15.2 Preparatory work 352
15.3 Part I of the proof of Bezout s Lemma 354
15.4 Part II of the proof 357
15.5 Part III of the proof 360
15.6 The holes in the proof of Bezout s Lemma 363
15.7 The Minimum Theorem for Z 364
15.8 The Division Theorem 369
15.9 Conclusions 371
15.10 Further reading 373
Exercises 376
16 Further perspectives 379
16.1 Useful applications of AD 379
16.2 Proof assistants based on type theory 380
16.3 Future of the field 384
16.4 Conclusions 386
16.5 Further reading 387
xii
Contents
Appendix A Logic in AD 391
A.l Constructive propositional logic 391
A.2 Classical propositional logic 393
A.3 Constructive predicate logic 395
A.4 Classical predicate logic 396
Appendix B Arithmetical axioms, definitions and lemmas 397
Appendix C Two complete example proofs in AD 403
C.l Closure under addition in N 403
C.2 The Minimum Theorem 405
Appendix D Derivation rules for AD 409
References 411
Index of names 419
Index of definitions 421
Index of Symbols 423
Index of subjects 425
|
any_adam_object | 1 |
author | Nederpelt, Rob 1942- Geuvers, Herman 1964- |
author_GND | (DE-588)115937077X (DE-588)1066888620 |
author_facet | Nederpelt, Rob 1942- Geuvers, Herman 1964- |
author_role | aut aut |
author_sort | Nederpelt, Rob 1942- |
author_variant | r n rn h g hg |
building | Verbundindex |
bvnumber | BV042161466 |
classification_rvk | SK 130 ST 130 |
ctrlnum | (OCoLC)897379125 (DE-599)BSZ414202430 |
dewey-full | 551.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 551 - Geology, hydrology, meteorology |
dewey-raw | 551.3 |
dewey-search | 551.3 |
dewey-sort | 3551.3 |
dewey-tens | 550 - Earth sciences |
discipline | Geologie / Paläontologie Informatik Mathematik |
edition | 1. publ. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01709nam a22004332c 4500</leader><controlfield tag="001">BV042161466</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220110 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">141031s2014 xx |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">016838318</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107036505</subfield><subfield code="c">hbk. : £50.00</subfield><subfield code="9">978-1-107-03650-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781316056349</subfield><subfield code="c">PDF ebook : No price</subfield><subfield code="9">9781316056349</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)897379125</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ414202430</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">551.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nederpelt, Rob</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115937077X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Type theory and formal proof</subfield><subfield code="b">an introduction</subfield><subfield code="c">Rob Nederpelt ; Herman Geuvers</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXV, 436 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Type theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Typentheorie</subfield><subfield code="0">(DE-588)4121795-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Typentheorie</subfield><subfield code="0">(DE-588)4121795-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Geuvers, Herman</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1066888620</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027601105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027601105</subfield></datafield></record></collection> |
id | DE-604.BV042161466 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T17:03:46Z |
institution | BVB |
isbn | 9781107036505 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027601105 |
oclc_num | 897379125 |
open_access_boolean | |
owner | DE-384 DE-473 DE-BY-UBG DE-573 DE-188 DE-83 |
owner_facet | DE-384 DE-473 DE-BY-UBG DE-573 DE-188 DE-83 |
physical | XXV, 436 S. |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Cambridge Univ. Press |
record_format | marc |
spellingShingle | Nederpelt, Rob 1942- Geuvers, Herman 1964- Type theory and formal proof an introduction Type theory Beweistheorie (DE-588)4145177-6 gnd Typentheorie (DE-588)4121795-0 gnd |
subject_GND | (DE-588)4145177-6 (DE-588)4121795-0 |
title | Type theory and formal proof an introduction |
title_auth | Type theory and formal proof an introduction |
title_exact_search | Type theory and formal proof an introduction |
title_full | Type theory and formal proof an introduction Rob Nederpelt ; Herman Geuvers |
title_fullStr | Type theory and formal proof an introduction Rob Nederpelt ; Herman Geuvers |
title_full_unstemmed | Type theory and formal proof an introduction Rob Nederpelt ; Herman Geuvers |
title_short | Type theory and formal proof |
title_sort | type theory and formal proof an introduction |
title_sub | an introduction |
topic | Type theory Beweistheorie (DE-588)4145177-6 gnd Typentheorie (DE-588)4121795-0 gnd |
topic_facet | Type theory Beweistheorie Typentheorie |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027601105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT nederpeltrob typetheoryandformalproofanintroduction AT geuversherman typetheoryandformalproofanintroduction |