000 01419nam a22002897a 4500
999 _c73283
_d73283
003 CITU
005 20230214172200.0
007 cr an aaaaaaaa
008 210816b ||||| |||| 00| 0 eng d
020 _a9780511811326
041 _aeng.
082 _a005.133
100 1 _aPaulson, Lawrence C.
_eauthor
245 _aML for the working programmer /
_cLawrence C. Paulson.
264 1 _aCambridge:
_bCambridge University Press,
_cc2012.
300 _a1 online resource (xviii, 476 pages) :
336 _2rdacontent
_atext
_btext
337 _2rdamedia
_acomputer
_bc
338 _2rdacarrier
_aonline resource
_bcr
504 _aIncludes bibliographical references (p. 449-456) and index.
505 _a1. Standard ML 2. Names, functions and types 3. Lists 4. Trees and concrete data 5. Functions and infinite data 6. Reasoning about functional programs 7. Modules 8. Imperative programming in ML 9. Writing interpreters for the lambda-calculus 10. A tactical theorem prover Bibliography.
520 _aThis new edition of a successful text treats modules in more depth, and covers the revision of ML language.
650 0 _aML (Computer program language).
655 0 _aElectronic books.
856 _yFull text available at Cambridge University Press Click here to view
_uhttps://www.cambridge.org/core/books/ml-for-the-working-programmer/BDAAF5C30634CC39385F75C97274BFCC
942 _2ddc
_cER