| 000 | 02458nam a22003378i 4500 | ||
|---|---|---|---|
| 001 | CR9780511811326 | ||
| 003 | UkCbUP | ||
| 005 | 20201015164326.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 101021s1996||||enk o ||1 0|eng|d | ||
| 020 | _a9780511811326 (ebook) | ||
| 020 | _z9780521570503 (hardback) | ||
| 020 | _z9780521565431 (paperback) | ||
| 040 |
_aUkCbUP _beng _erda _cUkCbUP |
||
| 050 | 0 | 0 |
_aQA76.73.M6 _bP38 1996 |
| 082 | 0 | 0 |
_a005.13/3 _220 |
| 100 | 1 |
_aPaulson, Lawrence C., _eauthor. |
|
| 245 | 1 | 0 |
_aML for the working programmer / _cLawrence C. Paulson. |
| 250 | _aSecond edition. | ||
| 264 | 1 |
_aCambridge : _bCambridge University Press, _c1996. |
|
| 300 |
_a1 online resource (xviii, 476 pages) : _bdigital, PDF file(s). |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 500 | _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). | ||
| 520 | _aThe new edition of this successful and established textbook retains its two original intentions of explaining how to program in the ML language, and teaching the fundamentals of functional programming. The major change is the early and prominent coverage of modules, which are extensively used throughout. In addition, the first chapter has been totally rewritten to make the book more accessible to those without experience of programming languages. The main features of new Standard Library for the revised version of ML are described and many new examples are given, while references have also been updated. Dr Paulson has extensive practical experience of ML and has stressed its use as a tool for software engineering; the book contains many useful pieces of code, which are freely available (via the Internet) from the author. He shows how to use lists, trees, higher-order functions and infinite data structures. Many illustrative and practical examples are included.. Efficient functional implementations of arrays, queues, priority queues, etc. are described. Larger examples include a general top-down parser, a lambda-calculus reducer and a theorem prover. The combination of careful explanation and practical advice will ensure that this textbook continues to be the preferred text for many courses on ML. | ||
| 650 | 0 | _aML (Computer program language) | |
| 776 | 0 | 8 |
_iPrint version: _z9780521570503 |
| 856 | 4 | 0 | _uhttps://doi.org/10.1017/CBO9780511811326 |
| 999 |
_c121211 _d121211 |
||