Lambda-calculus and combinators, an introduction:
Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2008
|
| Ausgabe: | Second edition |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xi, 345 pages) |
| ISBN: | 9780511809835 |
| DOI: | 10.1017/CBO9780511809835 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043942808 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2008 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511809835 |c Online |9 978-0-511-80983-5 | ||
| 024 | 7 | |a 10.1017/CBO9780511809835 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511809835 | ||
| 035 | |a (OCoLC)967777284 | ||
| 035 | |a (DE-599)BVBBV043942808 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511.3/5 |2 22 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 100 | 1 | |a Hindley, J. Roger |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lambda-calculus and combinators, an introduction |c J. Roger Hindley, Jonathan P. Seldin |
| 246 | 1 | 3 | |a Lambda-Calculus & Combinators |
| 250 | |a Second edition | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2008 | |
| 300 | |a 1 online resource (xi, 345 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index | |
| 520 | |a Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book | ||
| 650 | 4 | |a Lambda calculus | |
| 650 | 4 | |a Combinatory logic | |
| 650 | 0 | 7 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Logik |0 (DE-588)4164750-6 |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, J. P. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-89885-0 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511809835 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351778 | ||
| 966 | e | |u https://doi.org/10.1017/CBO9780511809835 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511809835 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176886109044736 |
|---|---|
| any_adam_object | |
| author | Hindley, J. Roger |
| author_facet | Hindley, J. Roger |
| author_role | aut |
| author_sort | Hindley, J. Roger |
| author_variant | j r h jr jrh |
| building | Verbundindex |
| bvnumber | BV043942808 |
| classification_rvk | SK 130 SK 170 |
| collection | ZDB-20-CBO |
| contents | Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index |
| ctrlnum | (ZDB-20-CBO)CR9780511809835 (OCoLC)967777284 (DE-599)BVBBV043942808 |
| 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 | Mathematik |
| doi_str_mv | 10.1017/CBO9780511809835 |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03674nmm a2200529zc 4500</leader><controlfield tag="001">BV043942808</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2008 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511809835</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-80983-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511809835</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511809835</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967777284</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942808</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</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">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hindley, J. 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, an introduction</subfield><subfield code="c">J. Roger Hindley, Jonathan P. Seldin</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Lambda-Calculus & Combinators</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</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">1 online resource (xi, 345 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book</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">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="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="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, J. P.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-89885-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511809835</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351778</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511809835</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511809835</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942808 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:18Z |
| institution | BVB |
| isbn | 9780511809835 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351778 |
| oclc_num | 967777284 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xi, 345 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Hindley, J. Roger Verfasser aut Lambda-calculus and combinators, an introduction J. Roger Hindley, Jonathan P. Seldin Lambda-Calculus & Combinators Second edition Cambridge Cambridge University Press 2008 1 online resource (xi, 345 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book Lambda calculus Combinatory logic Lambda-Kalkül (DE-588)4166495-4 gnd rswk-swf Kombinatorische Logik (DE-588)4164750-6 gnd rswk-swf Lambda-Kalkül (DE-588)4166495-4 s Kombinatorische Logik (DE-588)4164750-6 s DE-604 Seldin, J. P. Sonstige oth Erscheint auch als Druckausgabe 978-0-521-89885-0 https://doi.org/10.1017/CBO9780511809835 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Hindley, J. Roger Lambda-calculus and combinators, an introduction Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index Lambda calculus Combinatory logic Lambda-Kalkül (DE-588)4166495-4 gnd Kombinatorische Logik (DE-588)4164750-6 gnd |
| subject_GND | (DE-588)4166495-4 (DE-588)4164750-6 |
| title | Lambda-calculus and combinators, an introduction |
| title_alt | Lambda-Calculus & Combinators |
| 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, Jonathan P. Seldin |
| title_fullStr | Lambda-calculus and combinators, an introduction J. Roger Hindley, Jonathan P. Seldin |
| title_full_unstemmed | Lambda-calculus and combinators, an introduction J. Roger Hindley, Jonathan P. Seldin |
| title_short | Lambda-calculus and combinators, an introduction |
| title_sort | lambda calculus and combinators an introduction |
| topic | Lambda calculus Combinatory logic Lambda-Kalkül (DE-588)4166495-4 gnd Kombinatorische Logik (DE-588)4164750-6 gnd |
| topic_facet | Lambda calculus Combinatory logic Lambda-Kalkül Kombinatorische Logik |
| url | https://doi.org/10.1017/CBO9780511809835 |
| work_keys_str_mv | AT hindleyjroger lambdacalculusandcombinatorsanintroduction AT seldinjp lambdacalculusandcombinatorsanintroduction AT hindleyjroger lambdacalculuscombinators AT seldinjp lambdacalculuscombinators |