|
|
|
|
LEADER |
00000cam a2200000Mu 4500 |
001 |
EBOOKCENTRAL_ocn850153220 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n||||||||| |
008 |
130625s2013 enk ob 001 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d N15
|d OCLCO
|d YDXCP
|d OCLCQ
|d OCLCF
|d DEBSZ
|d UV0
|d E7B
|d OCLCQ
|d BUB
|d BUF
|d UAB
|d OCLCQ
|d AU@
|d UKAHL
|d REDDC
|d OCLCQ
|d VLY
|d LUN
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 851692850
|a 864409513
|a 879517380
|a 909642686
|a 1040653004
|a 1097116061
|a 1117592090
|a 1122187781
|a 1170505961
|a 1171107909
|
020 |
|
|
|a 9781107059009
|
020 |
|
|
|a 1107059003
|
020 |
|
|
|a 9781139093996
|q (electronic bk.)
|
020 |
|
|
|a 1139093991
|q (electronic bk.)
|
020 |
|
|
|a 9781107057722
|q (e-book)
|
020 |
|
|
|a 1107057728
|q (e-book)
|
020 |
|
|
|a 1107019028
|
020 |
|
|
|a 9781107019027
|
020 |
|
|
|a 1107684064
|
020 |
|
|
|a 9781107684065
|
020 |
|
|
|z 9781107019027
|q (hardback)
|
020 |
|
|
|z 9781107684065
|q (pbk.)
|
029 |
1 |
|
|a DEBSZ
|b 431407339
|
029 |
1 |
|
|a NZ1
|b 15142810
|
035 |
|
|
|a (OCoLC)850153220
|z (OCoLC)851692850
|z (OCoLC)864409513
|z (OCoLC)879517380
|z (OCoLC)909642686
|z (OCoLC)1040653004
|z (OCoLC)1097116061
|z (OCoLC)1117592090
|z (OCoLC)1122187781
|z (OCoLC)1170505961
|z (OCoLC)1171107909
|
050 |
|
4 |
|a QA76.62
|b .H37 2013
|
082 |
0 |
4 |
|a 005.133
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Hansen, Michael R.
|
245 |
1 |
0 |
|a Functional Programming Using F♯
|
260 |
|
|
|a Cambridge :
|b Cambridge University Press,
|c 2013.
|
300 |
|
|
|a 1 online resource (376 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
588 |
0 |
|
|a Print version record.
|
504 |
|
|
|a Includes bibliographical references and index.
|
520 |
|
|
|a This comprehensive introduction to the principles of functional programming using F♯ shows how to apply basic theoretical concepts to produce succinct and elegant programs. It demonstrates the role of functional programming in a wide spectrum of applications including databases and systems. Coverage also includes advanced features in the .NET library, the imperative features of F♯ and topics such as text processing, sequences, computation expressions and asynchronous computation. with a broad spectrum of examples and exercises, the book is perfect for courses in functional programming and for self-study. Enhancing its use as a text is an accompanying website with downloadable programs, lecture slides, mini-projects and links to further F♯ sources.
|
505 |
0 |
|
|a Preface; 1 Getting started; 1.1 Values, types, identifiers and declarations; 1.2 Simple function declarations; 1.3 Anonymous functions. Function expressions; 1.4 Recursion; 1.5 Pairs; 1.6 Types and type checking; 1.7 Bindings and environments; 1.8 Euclid's algorithm; 1.9 Evaluations with environments; 1.10 Free-standing programs; Summary; Exercises; 2 Values, operators, expressions and functions; 2.1 Numbers. Truth values. The unit type; 2.2 Operator precedence and association; 2.3 Characters and strings; 2.4 If-then-else expressions; 2.5 Overloaded functions and operators
|
505 |
8 |
|
|a 4 Lists4.1 The concept of a list; 4.2 Construction and decomposition of lists; 4.3 Typical recursions over lists; 4.4 Polymorphism; 4.5 The value restrictions on polymorphic expressions; 4.6 Examples. A model-based approach; Summary; Exercises; 5 Collections: Lists, maps and sets; 5.1 Lists; 5.2 Finite sets; 5.3 Maps; Summary; Exercises; 6 Finite trees; 6.1 Chinese boxes; 6.2 Symbolic differentiation; 6.3 Binary trees. Parameterized types; 6.4 Traversal of binary trees. Search trees; 6.5 Expression trees; 6.6 Trees with a variable number of sub-trees. Mutual recursion; 6.7 Electrical circuits
|
505 |
8 |
|
|a 8.8 Imperative functions on lists and other collections8.9 Imperative tree traversal; 8.10 Arrays; 8.11 Imperative set and map; 8.12 Functions on collections. Enumerator functions; 8.13 Imperative queue; 8.14 Restrictions on polymorphic expressions; Summary; Exercises; 9 Efficiency; 9.1 Resource measures; 9.2 Memory management; 9.3 Two problems; 9.4 Solutions using accumulating parameters; 9.5 Iterative function declarations; 9.6 Tail recursion obtained using continuations; Summary; Exercises; 10 Text processing programs; 10.1 Keyword index example: Problem statement
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Functional programming (Computer science)
|
650 |
|
0 |
|a F♯ (Computer program language)
|
650 |
|
6 |
|a Programmation fonctionnelle.
|
650 |
|
7 |
|a F♯ (Computer program language)
|2 fast
|
650 |
|
7 |
|a Functional programming (Computer science)
|2 fast
|
700 |
1 |
|
|a Rischel, Hans.
|
758 |
|
|
|i has work:
|a Functional programming using F♯ (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCFvFVTx9B7WmmJ9mWqDC33
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|a Hansen, Michael R.
|t Functional Programming Using F♯.
|d Cambridge : Cambridge University Press, ©2013
|z 9781107019027
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1182946
|z Texto completo
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH26478920
|
938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL1182946
|
938 |
|
|
|a ebrary
|b EBRY
|n ebr10718569
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 10745653
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 10705797
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 10762186
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 10794811
|
994 |
|
|
|a 92
|b IZTAP
|