The little prover /:
The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Massachusetts :
MIT Press,
[2015]
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example. |
| Beschreibung: | 1 online resource (xiii, 229 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 0262330563 9780262330565 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn914255579 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mn||||||||| | ||
| 008 | 150722t20152015maua ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d N$T |d YDXCP |d OCLCF |d JSTOR |d OSU |d IEEEE |d OCLCQ |d OCLCO |d OCLCA |d EBLCP |d IDB |d K6U |d COCUF |d MOR |d PIFAG |d FVL |d ZCU |d MERUC |d ESU |d OCLCQ |d IGB |d IOG |d OCLCO |d U3W |d D6H |d EZ9 |d STF |d VTS |d CEF |d GFC |d MERER |d ICG |d OCLCQ |d CUY |d OCLCO |d OCLCQ |d VT2 |d AU@ |d OCLCQ |d OCLCO |d WYU |d YOU |d MTU |d TKN |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d LEAUB |d DKC |d OCLCQ |d SFB |d OCLCQ |d OCLCO |d MM9 |d RECBK |d HS0 |d UWK |d UKAHL |d OCLCQ |d TUHNV |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ |d UEJ |d OCLCQ |d OCLCO | ||
| 019 | |a 1164884732 |a 1166299017 |a 1170328811 |a 1172118533 | ||
| 020 | |a 0262330563 |q (electronic bk.) | ||
| 020 | |a 9780262330565 |q (electronic bk.) | ||
| 020 | |z 9780262527958 |q (paperback |q alkaline paper) | ||
| 020 | |z 0262527952 |q (paperback |q alkaline paper) | ||
| 035 | |a (OCoLC)914255579 |z (OCoLC)1164884732 |z (OCoLC)1166299017 |z (OCoLC)1170328811 |z (OCoLC)1172118533 | ||
| 037 | |a 22573/ctt17kknt5 |b JSTOR | ||
| 050 | 4 | |a QA76.9.A96 |b F745 2015 | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 072 | 7 | |a COM051000 |2 bisacsh | |
| 082 | 7 | |a 511.3/6028563 |2 23 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Friedman, Daniel P., |e author. |1 https://id.oclc.org/worldcat/entity/E39PBJw4Bb7Qwg6CC7cvDXHwG3 |0 http://id.loc.gov/authorities/names/n83185951 | |
| 245 | 1 | 4 | |a The little prover / |c Daniel P. Friedman and Carl Eastlund ; drawings by Duane Bibby ; foreword by J. Strother Moore ; afterword by Matthias Felleisen. |
| 264 | 1 | |a Cambridge, Massachusetts : |b MIT Press, |c [2015] | |
| 264 | 4 | |c ©2015 | |
| 300 | |a 1 online resource (xiii, 229 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 520 | |a The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example. | ||
| 505 | 0 | |a Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index. | |
| 546 | |a English. | ||
| 650 | 0 | |a Automatic theorem proving. |0 http://id.loc.gov/authorities/subjects/sh85010111 | |
| 650 | 0 | |a LISP (Computer program language) |0 http://id.loc.gov/authorities/subjects/sh85077449 | |
| 650 | 6 | |a Théorèmes |x Démonstration automatique. | |
| 650 | 6 | |a LISP (Langage de programmation) | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Programming |x General. |2 bisacsh | |
| 650 | 7 | |a Automatic theorem proving |2 fast | |
| 650 | 7 | |a LISP (Computer program language) |2 fast | |
| 700 | 1 | |a Eastlund, Carl, |e author. | |
| 700 | 1 | |a Bibby, Duane, |e illustrator. |1 https://id.oclc.org/worldcat/entity/E39PCjCCd6f7JhmmF6dg9GfkTb |0 http://id.loc.gov/authorities/names/no93009407 | |
| 700 | 1 | |a Moore, J Strother, |d 1947- |e writer of foreword. |1 https://id.oclc.org/worldcat/entity/E39PBJdWTbGrydXp6FvqcWjcT3 |0 http://id.loc.gov/authorities/names/n79073002 | |
| 700 | 1 | |a Felleisen, Matthias, |e writer of afterword. | |
| 758 | |i has work: |a The little prover (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGrMQT6wX4DKbc7jhmfqFC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Friedman, Daniel P. |t Little prover. |d Cambridge, Massachusetts : The MIT Press, [2015] |z 9780262527958 |w (DLC) 2015001271 |w (OCoLC)902854169 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1030727 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH37587285 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH37519593 | ||
| 938 | |a EBSCOhost |b EBSC |n 1030727 | ||
| 938 | |a IEEE |b IEEE |n 7176537 | ||
| 938 | |a Recorded Books, LLC |b RECE |n rbeEB00827905 | ||
| 938 | |a YBP Library Services |b YANK |n 12539037 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn914255579 |
|---|---|
| _version_ | 1816882318638317568 |
| adam_text | |
| any_adam_object | |
| author | Friedman, Daniel P. Eastlund, Carl |
| author2 | Bibby, Duane |
| author2_role | ill |
| author2_variant | d b db |
| author_GND | http://id.loc.gov/authorities/names/n83185951 http://id.loc.gov/authorities/names/no93009407 http://id.loc.gov/authorities/names/n79073002 |
| author_facet | Friedman, Daniel P. Eastlund, Carl Bibby, Duane |
| author_role | aut aut |
| author_sort | Friedman, Daniel P. |
| author_variant | d p f dp dpf c e ce |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A96 F745 2015 |
| callnumber-search | QA76.9.A96 F745 2015 |
| callnumber-sort | QA 276.9 A96 F745 42015 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index. |
| ctrlnum | (OCoLC)914255579 |
| dewey-full | 511.3/6028563 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/6028563 |
| dewey-search | 511.3/6028563 |
| dewey-sort | 3511.3 76028563 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04861cam a2200673 i 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn914255579</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mn|||||||||</controlfield><controlfield tag="008">150722t20152015maua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCF</subfield><subfield code="d">JSTOR</subfield><subfield code="d">OSU</subfield><subfield code="d">IEEEE</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCA</subfield><subfield code="d">EBLCP</subfield><subfield code="d">IDB</subfield><subfield code="d">K6U</subfield><subfield code="d">COCUF</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">FVL</subfield><subfield code="d">ZCU</subfield><subfield code="d">MERUC</subfield><subfield code="d">ESU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IGB</subfield><subfield code="d">IOG</subfield><subfield code="d">OCLCO</subfield><subfield code="d">U3W</subfield><subfield code="d">D6H</subfield><subfield code="d">EZ9</subfield><subfield code="d">STF</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">GFC</subfield><subfield code="d">MERER</subfield><subfield code="d">ICG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CUY</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VT2</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">WYU</subfield><subfield code="d">YOU</subfield><subfield code="d">MTU</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">LEAUB</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">MM9</subfield><subfield code="d">RECBK</subfield><subfield code="d">HS0</subfield><subfield code="d">UWK</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">TUHNV</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UEJ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">1164884732</subfield><subfield code="a">1166299017</subfield><subfield code="a">1170328811</subfield><subfield code="a">1172118533</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262330563</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262330565</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780262527958</subfield><subfield code="q">(paperback</subfield><subfield code="q">alkaline paper)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0262527952</subfield><subfield code="q">(paperback</subfield><subfield code="q">alkaline paper)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)914255579</subfield><subfield code="z">(OCoLC)1164884732</subfield><subfield code="z">(OCoLC)1166299017</subfield><subfield code="z">(OCoLC)1170328811</subfield><subfield code="z">(OCoLC)1172118533</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">22573/ctt17kknt5</subfield><subfield code="b">JSTOR</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A96</subfield><subfield code="b">F745 2015</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM051000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/6028563</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Friedman, Daniel P.,</subfield><subfield code="e">author.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJw4Bb7Qwg6CC7cvDXHwG3</subfield><subfield code="0">http://id.loc.gov/authorities/names/n83185951</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The little prover /</subfield><subfield code="c">Daniel P. Friedman and Carl Eastlund ; drawings by Duane Bibby ; foreword by J. Strother Moore ; afterword by Matthias Felleisen.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts :</subfield><subfield code="b">MIT Press,</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 229 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Automatic theorem proving.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85010111</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">LISP (Computer program language)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85077449</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorèmes</subfield><subfield code="x">Démonstration automatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">LISP (Langage de programmation)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatic theorem proving</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">LISP (Computer program language)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Eastlund, Carl,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bibby, Duane,</subfield><subfield code="e">illustrator.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjCCd6f7JhmmF6dg9GfkTb</subfield><subfield code="0">http://id.loc.gov/authorities/names/no93009407</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moore, J Strother,</subfield><subfield code="d">1947-</subfield><subfield code="e">writer of foreword.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJdWTbGrydXp6FvqcWjcT3</subfield><subfield code="0">http://id.loc.gov/authorities/names/n79073002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Felleisen, Matthias,</subfield><subfield code="e">writer of afterword.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">The little prover (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGrMQT6wX4DKbc7jhmfqFC</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Friedman, Daniel P.</subfield><subfield code="t">Little prover.</subfield><subfield code="d">Cambridge, Massachusetts : The MIT Press, [2015]</subfield><subfield code="z">9780262527958</subfield><subfield code="w">(DLC) 2015001271</subfield><subfield code="w">(OCoLC)902854169</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1030727</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH37587285</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH37519593</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">1030727</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">IEEE</subfield><subfield code="b">IEEE</subfield><subfield code="n">7176537</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Recorded Books, LLC</subfield><subfield code="b">RECE</subfield><subfield code="n">rbeEB00827905</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">12539037</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn914255579 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:26:43Z |
| institution | BVB |
| isbn | 0262330563 9780262330565 |
| language | English |
| oclc_num | 914255579 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiii, 229 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | MIT Press, |
| record_format | marc |
| spelling | Friedman, Daniel P., author. https://id.oclc.org/worldcat/entity/E39PBJw4Bb7Qwg6CC7cvDXHwG3 http://id.loc.gov/authorities/names/n83185951 The little prover / Daniel P. Friedman and Carl Eastlund ; drawings by Duane Bibby ; foreword by J. Strother Moore ; afterword by Matthias Felleisen. Cambridge, Massachusetts : MIT Press, [2015] ©2015 1 online resource (xiii, 229 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. Print version record. The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example. Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index. English. Automatic theorem proving. http://id.loc.gov/authorities/subjects/sh85010111 LISP (Computer program language) http://id.loc.gov/authorities/subjects/sh85077449 Théorèmes Démonstration automatique. LISP (Langage de programmation) MATHEMATICS General. bisacsh COMPUTERS Programming General. bisacsh Automatic theorem proving fast LISP (Computer program language) fast Eastlund, Carl, author. Bibby, Duane, illustrator. https://id.oclc.org/worldcat/entity/E39PCjCCd6f7JhmmF6dg9GfkTb http://id.loc.gov/authorities/names/no93009407 Moore, J Strother, 1947- writer of foreword. https://id.oclc.org/worldcat/entity/E39PBJdWTbGrydXp6FvqcWjcT3 http://id.loc.gov/authorities/names/n79073002 Felleisen, Matthias, writer of afterword. has work: The little prover (Text) https://id.oclc.org/worldcat/entity/E39PCGrMQT6wX4DKbc7jhmfqFC https://id.oclc.org/worldcat/ontology/hasWork Print version: Friedman, Daniel P. Little prover. Cambridge, Massachusetts : The MIT Press, [2015] 9780262527958 (DLC) 2015001271 (OCoLC)902854169 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1030727 Volltext |
| spellingShingle | Friedman, Daniel P. Eastlund, Carl The little prover / Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index. Automatic theorem proving. http://id.loc.gov/authorities/subjects/sh85010111 LISP (Computer program language) http://id.loc.gov/authorities/subjects/sh85077449 Théorèmes Démonstration automatique. LISP (Langage de programmation) MATHEMATICS General. bisacsh COMPUTERS Programming General. bisacsh Automatic theorem proving fast LISP (Computer program language) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85010111 http://id.loc.gov/authorities/subjects/sh85077449 |
| title | The little prover / |
| title_auth | The little prover / |
| title_exact_search | The little prover / |
| title_full | The little prover / Daniel P. Friedman and Carl Eastlund ; drawings by Duane Bibby ; foreword by J. Strother Moore ; afterword by Matthias Felleisen. |
| title_fullStr | The little prover / Daniel P. Friedman and Carl Eastlund ; drawings by Duane Bibby ; foreword by J. Strother Moore ; afterword by Matthias Felleisen. |
| title_full_unstemmed | The little prover / Daniel P. Friedman and Carl Eastlund ; drawings by Duane Bibby ; foreword by J. Strother Moore ; afterword by Matthias Felleisen. |
| title_short | The little prover / |
| title_sort | little prover |
| topic | Automatic theorem proving. http://id.loc.gov/authorities/subjects/sh85010111 LISP (Computer program language) http://id.loc.gov/authorities/subjects/sh85077449 Théorèmes Démonstration automatique. LISP (Langage de programmation) MATHEMATICS General. bisacsh COMPUTERS Programming General. bisacsh Automatic theorem proving fast LISP (Computer program language) fast |
| topic_facet | Automatic theorem proving. LISP (Computer program language) Théorèmes Démonstration automatique. LISP (Langage de programmation) MATHEMATICS General. COMPUTERS Programming General. Automatic theorem proving |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1030727 |
| work_keys_str_mv | AT friedmandanielp thelittleprover AT eastlundcarl thelittleprover AT bibbyduane thelittleprover AT moorejstrother thelittleprover AT felleisenmatthias thelittleprover AT friedmandanielp littleprover AT eastlundcarl littleprover AT bibbyduane littleprover AT moorejstrother littleprover AT felleisenmatthias littleprover |