F# for Scientists
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > F# for Scientists
F# for Scientists

F# for Scientists


     0     
5
4
3
2
1



International Edition


X
About the Book

"This work strikes a balance between the pure functional aspects of F# and the object-oriented and imperative features that make it so useful in practice, enable .NET integration, and make large-scale data processing possible." —Thore Graepel, PhD, Researcher, Microsoft Research Ltd. Over the next five years, F# is expected to become one of the world's most popular functional programming languages for scientists of all disciplines working on the Windows platform. F# is free and, unlike MATLAB® and other software with numerical/scientific origins, is a full-fledged programming language. Developed in consultation with Don Syme of Microsoft Research Ltd.—who wrote the language—F# for Scientists explains and demonstrates the powerful features of this important new programming language. The book assumes no prior experience and guides the reader from the basics of computer programming to the implementation of state-of-the-art algorithms. F# for Scientists begins with coverage of introductory material in the areas of functional programming, .NET, and scientific computing, and goes on to explore: Program structure Optimization Data structures Libraries Numerical analysis Databases Input and output Interoperability Visualization Screenshots of development using Visual Studio are used to illustrate compilation, debugging, and interactive use, while complete examples of a few whole programs are included to give readers a complete view of F#'s capabilities. Written in a clear and concise style, F# for Scientists is well suited for researchers, scientists, and developers who want to program under the Windows platform. It also serves as an ideal supplemental text for advanced undergraduate and graduate students with a background in science or engineering.

Table of Contents:
Foreword. Preface. Acknowledgments. List of Figures. List of Tables. Acronyms. 1. Introduction. 1.1 Programming guidelines. 1.2 A brief history of F#. 1.3 Benefits of F#. 1.4 Introducing F#. 1.5 Imperative programming. 1.6 Functional programming. 2. Program Structure. 2.1 Nesting. 2.2 Factoring. 2.3 Modules. 2.4 Objects. 2.5 Functional design patterns. 2.6 F# development. 3. Data Structures. 3.1 Algorithmic complexity. 3.2 Arrays. 3.3 Lists. 3.4 Sets. 3.5 Hash tables. 3.6 Maps. 3.7 Choosing a data structure. 3.8 Sequences. 3.9 Heterogeneous containers. 3.10 Trees. 4. Numerical Analysis. 4.1 Number representation. 4.2 Algebra. 4.3 Interpolation. 4.4 Quadratic solutions. 4.5 Mean and variance. 4.6 Other forms of arithmetic. 5. Input and Output. 5.1 Printing. 5.2 Generic printing. 5.3 Reading from and writing to files. 5.4 Serialization. 5.5 Lexing and parsing. 6. Simple Examples. 6.1 Functional. 6.2 Numerical. 6.3 String related. 6.4 List related. 6.5 Array related. 6.6 Higher-order functions. 7. Visualization. 7.1 Windows Forms. 7.2 Managed DirectX. 7.3 Tesselating objects into triangles. 8. Optimization. 8.1 Timing. 8.2 Profiling. 8.3 Algorithmic optimizations. 8.4 Lower-level optimizations. 9. Libraries. 9.1 Loading .NET libraries. 9.2 Charting and graphing. 9.3 Threads. 9.4 Random numbers. 9.5 Regular expressions. 9.6 Vectors and matrices. 9.7 Downloading from the Web. 9.8 Compression. 9.9 Handling XML. 9.10 Calling native libraries. 9.11 Fourier transform. 9.12 Mataprogramming. 10. Databases. 10.1 Protein data bank. 10.2 Web services. 10.3 Relational databases. 11. Interoperability. 11.1 Excel. 11.2 MATLAB. 11.3 Mathematica. 12. Complete Examples. 12.1 Fast Fourier transform. 12.2 Semi-circle law. 12.3 Finding n th.-nearest neighbors. 12.4 Logistic map. 12.5 Real-time particle dynamics. Appendix A: Troubleshooting. A.1 Value restriction. A.2 Mutable array contents. A.3 Negative literals. A.4 Accidental capture. A.5 Local and non-local variable definitions. A.6 Merging lines. A.7 Applications that do not die. A.8 Beware of "it". Glossary. Bibliography. Index.

About the Author :
Jon Harrop, PhD, has taught mathematics, biology, and computer science. He founded Flying Frog Consultancy; has produced several products for computational scientists, including the book OCaml for Scientists; and has consulted for high-tech companies on the commercial use of functional programming languages.

Review :
"The hardbound book is a really solid treatment." (Computing Reviews, February 5, 2009)


Best Sellers


Product Details
  • ISBN-13: 9780470242117
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: Wiley-Interscience
  • Height: 244 mm
  • No of Pages: 368
  • Returnable: N
  • Weight: 617 gr
  • ISBN-10: 0470242116
  • Publisher Date: 22 Aug 2008
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 23 mm
  • Width: 163 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
F# for Scientists
John Wiley & Sons Inc -
F# for Scientists
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

F# for Scientists

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!