Lambda calculus with types:
This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the fi...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | , , |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2013
|
| Schriftenreihe: | Perspectives in logic
|
| Links: | https://doi.org/10.1017/CBO9781139032636 |
| Zusammenfassung: | This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types. |
| Umfang: | 1 Online-Ressource (xxii, 833 Seiten) |
| ISBN: | 9781139032636 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781139032636 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020622.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 110225s2013||||enk o ||1 0|eng|d | ||
| 020 | |a 9781139032636 | ||
| 100 | 1 | |a Barendregt, H. P. | |
| 245 | 1 | 0 | |a Lambda calculus with types |c Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others] |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2013 | |
| 300 | |a 1 Online-Ressource (xxii, 833 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Perspectives in logic | |
| 520 | |a This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types. | ||
| 700 | 1 | |a Alessi, Fabio | |
| 700 | 1 | |a Dekkers, Wil | |
| 700 | 1 | |a Statman, Richard | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521766142 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107471313 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9781139032636 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781139032636 |
|---|---|
| _version_ | 1825574049974059008 |
| adam_text | |
| any_adam_object | |
| author | Barendregt, H. P. |
| author2 | Alessi, Fabio Dekkers, Wil Statman, Richard |
| author2_role | |
| author2_variant | f a fa w d wd r s rs |
| author_facet | Barendregt, H. P. Alessi, Fabio Dekkers, Wil Statman, Richard |
| author_role | |
| author_sort | Barendregt, H. P. |
| author_variant | h p b hp hpb |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01958nam a2200301 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781139032636</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020622.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">110225s2013||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139032636</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barendregt, H. P.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lambda calculus with types</subfield><subfield code="c">Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxii, 833 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Perspectives in logic</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Alessi, Fabio</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dekkers, Wil</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Statman, Richard</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521766142</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107471313</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9781139032636</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781139032636 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:04Z |
| institution | BVB |
| isbn | 9781139032636 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xxii, 833 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Perspectives in logic |
| spelling | Barendregt, H. P. Lambda calculus with types Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others] Cambridge Cambridge University Press 2013 1 Online-Ressource (xxii, 833 Seiten) txt c cr Perspectives in logic This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types. Alessi, Fabio Dekkers, Wil Statman, Richard Erscheint auch als Druck-Ausgabe 9780521766142 Erscheint auch als Druck-Ausgabe 9781107471313 |
| spellingShingle | Barendregt, H. P. Lambda calculus with types |
| title | Lambda calculus with types |
| title_auth | Lambda calculus with types |
| title_exact_search | Lambda calculus with types |
| title_full | Lambda calculus with types Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others] |
| title_fullStr | Lambda calculus with types Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others] |
| title_full_unstemmed | Lambda calculus with types Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others] |
| title_short | Lambda calculus with types |
| title_sort | lambda calculus with types |
| work_keys_str_mv | AT barendregthp lambdacalculuswithtypes AT alessifabio lambdacalculuswithtypes AT dekkerswil lambdacalculuswithtypes AT statmanrichard lambdacalculuswithtypes |