Lambda-calculus and combinators: an introduction
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2008
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke. - Includes bibliographical references and index. - Previous ed.: published as Introduction to combinators and [lambda]-calculus. 1986 |
| Beschreibung: | xi, 345 Seiten Illustrationen |
| ISBN: | 9780521898850 0521898854 |
Internformat
MARC
| LEADER | 00000nam a22000002c 4500 | ||
|---|---|---|---|
| 001 | BV035217100 | ||
| 003 | DE-604 | ||
| 005 | 20191030 | ||
| 007 | t | ||
| 008 | 081216s2008 a||| |||| 00||| eng d | ||
| 020 | |a 9780521898850 |9 978-0-521-89885-0 | ||
| 020 | |a 0521898854 |c (hbk.) : £35.00 hbk. : £35.00 : CIP entry (July) |9 0-521-89885-4 | ||
| 035 | |a (OCoLC)319213274 | ||
| 035 | |a (DE-599)BSZ284901636 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-573 |a DE-91G | ||
| 050 | 0 | |a QA9.5 | |
| 082 | 0 | |a 511.3/5 |2 22 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a DAT 544f |2 stub | ||
| 100 | 1 | |a Hindley, James Roger |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lambda-calculus and combinators |b an introduction |c J. Roger Hindley (Department of Mathematics, Swansea University, Wales, UK), Jonathan P. Seldin (Department of Mathematics and Computer Science, University of Letherbridge, Alberta, Canada) |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2008 | |
| 300 | |a xi, 345 Seiten |b Illustrationen | ||
| 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. - Includes bibliographical references and index. - Previous ed.: published as Introduction to combinators and [lambda]-calculus. 1986 | ||
| 650 | 7 | |a Lambda-calcul |2 ram | |
| 650 | 7 | |a Logique combinatoire |2 ram | |
| 650 | 4 | |a Lambda calculus | |
| 650 | 4 | |a Combinatory logic | |
| 650 | 0 | 7 | |a Kombinatorische Logik |0 (DE-588)4164750-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |D s |
| 689 | 0 | 1 | |a Kombinatorische Logik |0 (DE-588)4164750-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Seldin, Jonathan P. |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017023236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017023236 | ||
Datensatz im Suchindex
| _version_ | 1804138478431109120 |
|---|---|
| adam_text | LAMBDA-CALCULUS AND COMBINATORS, AN INTRODUCTION J. ROGER HINDLEY
DEPARTMENT OF MATHEMATICS, SWANSEA UNIVERSITY, WALES, UK JONATHAN P.
SELDIN DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE, UNIVERSITY OF
LETHBRIDGE, ALBERTA, CANADA CAMBRIDGE UNIVERSITY PRESS CONTENTS PREFACE
PAGE IX 1 THE A-CALCULUS 1 1A INTRODUCTION 1 IB TERM-STRUCTURE AND
SUBSTITUTION 5 1C /3-REDUCTION 11 ID ^-EQUALITY 16 2 COMBINATORY LOGIC
21 2A INTRODUCTION TO CL 21 2B WEAK REDUCTION 24 2C ABSTRACTION IN CL 26
2D WEAK EQUALITY 29 3 THE POWER OF A AND COMBINATORS 33 3A INTRODUCTION
33 3B THE FIXED-POINT THEOREM 34 3C BOHM S THEOREM 36 3D THE
QUASI-LEFTMOST-REDUCTION THEOREM 40 3E HISTORY AND INTERPRETATION 43 4
REPRESENTING THE COMPUTABLE FUNCTIONS 47 4A INTRODUCTION 47 4B PRIMITIVE
RECURSIVE FUNCTIONS 50 4C RECURSIVE FUNCTIONS 56 4D ABSTRACT NUMERALS
AND Z 61 5 THE UNDECIDABILITY THEOREM 63 6 THE FORMAL THEORIES A/3 AND
CLW; 6 9 6A THE DEFINITIONS OF THE THEORIES 69 6B FIRST-ORDER THEORIES
72 CONTENTS VII 10 11 12 13 6C EQUIVALENCE OF THEORIES EXTENSIONALITY IN
A-CALCULUS 7A EXTENSIONAL EQUALITY 7B /377-REDUCTION IN A-CALCULUS
EXTENSIONALITY IN COMBINATORY LOGIC 8A EXTENSIONAL EQUALITY 8B AXIOMS
FOR EXTENSIONALITY IN CL 8C STRONG REDUCTION CORRESPONDENCE BETWEEN A
AND CL 9A INTRODUCTION 9B THE EXTENSIONAL EQUALITIES 9C NEW ABSTRACTION
ALGORITHMS IN CL 9D COMBINATORY /3-EQUALITY SIMPLE TYPING, CHURCH-STYLE
10A SIMPLE TYPES 10B TYPED A-CALCULUS IOC TYPED CL SIMPLE TYPING,
CURRY-STYLE IN CL 11A INTRODUCTION 11B THE SYSTEM TA^ 11C
SUBJECT-CONSTRUCTION 11D ABSTRACTION HE SUBJECT-REDUCTION 11F TYPABLE
CL-TERMS 11G LINK WITH CHURCH S APPROACH 11H PRINCIPAL TYPES 111 ADDING
NEW AXIOMS 11J PROPOSITIONS-AS-TYPES AND NORMALIZATION 11K THE
EQUALITY-RULE EQ SIMPLE TYPING, CURRY-STYLE IN A 12A THE SYSTEM TA^ 12B
BASIC PROPERTIES OF TA^* 12C TYPABLE A-TERMS 12D PROPOSITIONS-AS-TYPES
AND NORMALIZATION 12E THE EQUALITY-RULE EQ GENERALIZATIONS OF TYPING
13A INTRODUCTION 13B DEPENDENT FUNCTION TVDES. INTRODUCTION 73 76 76 79
82 82 85 89 92 92 95 100 102 107 107 109 115 119 119 122 126 127 130 134
137 138 143 147 155 159 159 165 170 173 176 180 180 181 VIII CONTENTS
13C BASIC GENERALIZED TYPING, CURRY-STYLE IN A 183 13D DEDUCTIVE RULES
TO DEFINE TYPES 187 13E CHURCH-STYLE TYPING IN A 191 13F NORMALIZATION
IN PTSS 202 13G PROPOSITIONS-AS-TYPES 209 13H PTSS WITH EQUALITY 217 14
MODELS OF CL 220 14A APPLICATIVE STRUCTURES 220 14B COMBINATORY ALGEBRAS
223 15 MODELS OF A-CALCULUS 229 15A THE DEFINITION OF A-MODEL 229 15B
SYNTAX-FREE DEFINITIONS 236 15C GENERAL PROPERTIES OF A-MODELS 242 16
SCOTT S DOO AND OTHER MODELS 247 16A INTRODUCTION: COMPLETE PARTIAL
ORDERS 247 16B CONTINUOUS FUNCTIONS 252 16C THE CONSTRUCTION OF DOO 256
16D BASIC PROPERTIES OF D^ 261 16E DOO IS A A-MODEL 267 16F SOME OTHER
MODELS 271 APPENDIX AL BOUND VARIABLES AND A-CONVERSION 276 APPENDIX A2
CONFLUENCE PROOFS 282 APPENDIX A3 STRONG NORMALIZATION PROOFS 293
APPENDIX A4 CARE OF YOUR PET COMBINATOR 305 APPENDIX A5 ANSWERS TO
STARRED EXERCISES 307 REFERENCES 323 LIST OF SYMBOLS 334 INDEX 337
|
| any_adam_object | 1 |
| author | Hindley, James Roger Seldin, Jonathan P. |
| author_facet | Hindley, James Roger Seldin, Jonathan P. |
| author_role | aut aut |
| author_sort | Hindley, James Roger |
| author_variant | j r h jr jrh j p s jp jps |
| building | Verbundindex |
| bvnumber | BV035217100 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.5 |
| callnumber-search | QA9.5 |
| callnumber-sort | QA 19.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 |
| classification_tum | DAT 544f |
| ctrlnum | (OCoLC)319213274 (DE-599)BSZ284901636 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02071nam a22004572c 4500</leader><controlfield tag="001">BV035217100</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20191030 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081216s2008 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521898850</subfield><subfield code="9">978-0-521-89885-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521898854</subfield><subfield code="c">(hbk.) : £35.00 hbk. : £35.00 : CIP entry (July)</subfield><subfield code="9">0-521-89885-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)319213274</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ284901636</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-29T</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">22</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">DAT 544f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hindley, James Roger</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lambda-calculus and combinators</subfield><subfield code="b">an introduction</subfield><subfield code="c">J. Roger Hindley (Department of Mathematics, Swansea University, Wales, UK), Jonathan P. Seldin (Department of Mathematics and Computer Science, University of Letherbridge, Alberta, Canada)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 345 Seiten</subfield><subfield code="b">Illustrationen</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. - Includes bibliographical references and index. - Previous ed.: published as Introduction to combinators and [lambda]-calculus. 1986</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Lambda-calcul</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logique combinatoire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatory logic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Logik</subfield><subfield code="0">(DE-588)4164750-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lambda-Kalkül</subfield><subfield code="0">(DE-588)4166495-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Lambda-Kalkül</subfield><subfield code="0">(DE-588)4166495-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kombinatorische Logik</subfield><subfield code="0">(DE-588)4164750-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">Seldin, Jonathan P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=017023236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017023236</subfield></datafield></record></collection> |
| id | DE-604.BV035217100 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:28:50Z |
| institution | BVB |
| isbn | 9780521898850 0521898854 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017023236 |
| oclc_num | 319213274 |
| open_access_boolean | |
| owner | DE-29T DE-573 DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-573 DE-91G DE-BY-TUM |
| physical | xi, 345 Seiten Illustrationen |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Hindley, James Roger Verfasser aut Lambda-calculus and combinators an introduction J. Roger Hindley (Department of Mathematics, Swansea University, Wales, UK), Jonathan P. Seldin (Department of Mathematics and Computer Science, University of Letherbridge, Alberta, Canada) Cambridge Cambridge University Press 2008 xi, 345 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Hier auch später erschienene, unveränderte Nachdrucke. - Includes bibliographical references and index. - Previous ed.: published as Introduction to combinators and [lambda]-calculus. 1986 Lambda-calcul ram Logique combinatoire ram Lambda calculus Combinatory logic Kombinatorische Logik (DE-588)4164750-6 gnd rswk-swf Lambda-Kalkül (DE-588)4166495-4 gnd rswk-swf Lambda-Kalkül (DE-588)4166495-4 s Kombinatorische Logik (DE-588)4164750-6 s DE-604 Seldin, Jonathan P. Verfasser aut GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017023236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hindley, James Roger Seldin, Jonathan P. Lambda-calculus and combinators an introduction Lambda-calcul ram Logique combinatoire ram Lambda calculus Combinatory logic Kombinatorische Logik (DE-588)4164750-6 gnd Lambda-Kalkül (DE-588)4166495-4 gnd |
| subject_GND | (DE-588)4164750-6 (DE-588)4166495-4 |
| title | Lambda-calculus and combinators an introduction |
| title_auth | Lambda-calculus and combinators an introduction |
| title_exact_search | Lambda-calculus and combinators an introduction |
| title_full | Lambda-calculus and combinators an introduction J. Roger Hindley (Department of Mathematics, Swansea University, Wales, UK), Jonathan P. Seldin (Department of Mathematics and Computer Science, University of Letherbridge, Alberta, Canada) |
| title_fullStr | Lambda-calculus and combinators an introduction J. Roger Hindley (Department of Mathematics, Swansea University, Wales, UK), Jonathan P. Seldin (Department of Mathematics and Computer Science, University of Letherbridge, Alberta, Canada) |
| title_full_unstemmed | Lambda-calculus and combinators an introduction J. Roger Hindley (Department of Mathematics, Swansea University, Wales, UK), Jonathan P. Seldin (Department of Mathematics and Computer Science, University of Letherbridge, Alberta, Canada) |
| title_short | Lambda-calculus and combinators |
| title_sort | lambda calculus and combinators an introduction |
| title_sub | an introduction |
| topic | Lambda-calcul ram Logique combinatoire ram Lambda calculus Combinatory logic Kombinatorische Logik (DE-588)4164750-6 gnd Lambda-Kalkül (DE-588)4166495-4 gnd |
| topic_facet | Lambda-calcul Logique combinatoire Lambda calculus Combinatory logic Kombinatorische Logik Lambda-Kalkül |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017023236&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hindleyjamesroger lambdacalculusandcombinatorsanintroduction AT seldinjonathanp lambdacalculusandcombinatorsanintroduction |