| 000 | 02943nam a2200493 i 4500 | ||
|---|---|---|---|
| 001 | 6267263 | ||
| 003 | IEEE | ||
| 005 | 20220712204613.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 151223s2005 maua ob 001 eng d | ||
| 010 | _z 2005051092 (print) | ||
| 020 |
_a9780262256179 _qelectronic |
||
| 020 |
_z0262562146 _qpbk. : alk. paper |
||
| 020 |
_z9780262562140 _qprint |
||
| 035 | _a(CaBNVSL)mat06267263 | ||
| 035 | _a(IDAMS)0b000064818b4223 | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA76.73.S34 _bF76 2005eb |
|
| 082 | 0 | 0 |
_a005.13/3 _222 |
| 100 | 1 |
_aFriedman, Daniel P., _eauthor. _921816 |
|
| 245 | 1 | 4 |
_aThe reasoned schemer / _cDaniel P. Friedman, William E. Byrd, Oleg Kiselyov ; drawings by Duane Bibby. |
| 264 | 1 |
_aCambridge, Massachusetts : _bMIT Press, _cc2005. |
|
| 264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2005] |
|
| 300 |
_a1 PDF (x, 169 pages) : _billustrations. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 500 | _aIncludes index. | ||
| 506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
| 520 | _aThe goal of The Reasoned Schemer is to help the functional programmer think logically and the logic programmer think functionally. The authors of The Reasoned Schemer believe that logic programming is a natural extension of functional programming, and they demonstrate this by extending the functional language Scheme with logical constructs -- thereby combining the benefits of both styles. The extension encapsulates most of the ideas in the logic programming language Prolog.The pedagogical method of The Reasoned Schemer is a series of questions and answers, which proceed with the characteristic humor that marked The Little Schemer and The Seasoned Schmer. Familiarity with a functional language or with the first eight chapters of The Little Schemer is assumed. Adding logic capabilities required the introduction of new forms. The authors' goal is to show to what extent writing logic programs is the same as writing functional programs using these forms. In this way, the reader of The Reasoned Schemer will come to understand how simple logic programming is and how easy it is to define functions that behave like relations. | ||
| 530 | _aAlso available in print. | ||
| 538 | _aMode of access: World Wide Web | ||
| 588 | _aDescription based on PDF viewed 12/23/2015. | ||
| 650 | 0 |
_aScheme (Computer program language) _921817 |
|
| 655 | 0 |
_aElectronic books. _93294 |
|
| 700 | 1 |
_aByrd, William E. _921818 |
|
| 700 | 1 |
_aKiselyov, Oleg. _921819 |
|
| 710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. _921820 |
|
| 710 | 2 |
_aMIT Press, _epublisher. _921821 |
|
| 776 | 0 | 8 |
_iPrint version _z9780262562140 |
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267263 |
| 942 | _cEBK | ||
| 999 |
_c72921 _d72921 |
||