| 000 | 02898cam a22003014a 4500 | ||
|---|---|---|---|
| 001 | 12172918 | ||
| 005 | 20210414113931.0 | ||
| 008 | 000914s2001 maua b 001 0 eng | ||
| 010 | _a 00048169 | ||
| 020 | _a9780262062183 | ||
| 020 | _a0262062186 | ||
| 040 |
_aDLC _cDLC _dDLC |
||
| 042 | _apcc | ||
| 050 | 0 | 0 | _aQA76.6.H697 |
| 082 | 0 | 0 |
_a005.1/2 _221 |
| 245 | 0 | 0 |
_aHow to design programs : _ban introduction to programming and computing. / _cMatthias Felleisen ... [et al.] |
| 260 |
_aCambridge, Mass. : _bMIT Press, _cc2001. |
||
| 300 |
_axxx, 693 p. : _bill. : _c24cm. |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _aContents: Processing simple forms of data: Students, teachers and computers -- Numbers of expressions, simple programs -- Programs are function plus variable definintions -- Conditional expressions and functions -- Symbolic information -- Compound data, part 1: structures -- The varieties of data: I: Intermezzo 1: syntax and semantics -- II: Processing arbitrarily large data -- Compound data, part 2: Lists -- More on processing list -- Natuaral numbers -- Composing functions, revisited again -- Intermezzo 2: List abbreviations: III: More on processing arbitrarily large data: More self-referential data definitions -- Mutually referential data definitions -- Development through iterative refinement -- Processing two complex pieces of data -- Intermezzo 3: Local definitions and lexical scope: IV: Abstracting designs -- Similarities in definintions -- Functions are values -- Designing abstractions from examples -- Designinig abstractions with first-class functions -- Mathematical examples -- Intermezzo 4: Defining functions on the fly -- V: Generative recursion: A new form of recursion -- Designing algorithms -- Variations on a theme -- Algorithms that backtrack -- Intermezzo 5: The cost of computing and vectors -- VI: Accumulating knowledge: The loss of knowledge -- Designing accumulator-style functions -- More uses of accumulation -- Intermezzo 6: The nature of inexact numbers -- VII: Changing the state of variables: Memory for functions -- Assignment to variables -- Designing funtions with memory -- Examples of memory usage -- Intermezzo 7: The final syntax and semantics: VIII: Changing compound values -- Encapsulation -- Mutable structures -- Designing functions that change structures -- Equality -- Changing structures, vectors and objects -- Epilogue. | ||
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aElectronic data processing. | |
| 700 | 1 | _aFelleisen, Matthias. | |
| 856 | 4 | 1 |
_3Table of contents _uhttp://www.loc.gov/catdir/toc/fy032/00048169.html |
| 906 |
_a7 _bcbc _corignew _d1 _eocip _f20 _gy-gencatlg |
||
| 942 |
_2lcc _cBK |
||
| 999 |
_c787 _d8287 |
||