Amazon cover image
Image from Amazon.com

F# for scientists / Jon Harrop ; foreword by Don Syme.

By: Material type: TextTextPublication details: Hoboken, N.J. : John Wiley, c2008Description: xxxiv, 334 p. : ill. ; 25 cmISBN:
  • 0470242116 (cloth)
  • 9780470242117 (cloth)
Subject(s): Online resources:
Contents:
Introduction. Programming guidelines -- A brief history of F# -- Benefits of F# -- Introducing F# -- Imperative programming -- Functional programming -- Program structure. Nesting -- Factoring -- Modules. Objects -- Functional design patterns -- F# development -- Data structures. Algorithmic complexity -- Arrays -- Lists -- Sets -- Hash tables -- Maps -- Choosing a data structure -- Sequences -- Heterogeneous containers -- Trees -- Numerical Analysis. Number -- Algebra --Interpolation -- Quadratic solutions -- Mean and variance -- Other forms of arithmetic -- Input and Output. Printing -- Generic printing -- Reading from and writing to files -- Serialization -- Lexing and parsing -- Simple Examples. Functional -- Numerical -- String related -- List related -- Array related -- Higher order functions -- Visualization. Windows forms -- Managed directX -- Tesselating objects into triangles -- Optimization. Timing -- Profiling -- Algorithmic optimizations -- Lower level optimizations -- Libraries. Loading .NET libraries -- Charting and graphing -- Threads -- Random numbers -- Regular expressions -- Vectors and matrices -- Downloading from the Web -- Compression -- Handling XML -- Calling native libraries -- Fourier transform -- Metaprogramming -- Databases. Protein data bank -- Web services -- Relational databases -- Interoperability. Excel interoperability -- MATLAB interoperability -- Mathematica interoperability -- Complete examples. Fast Fourier transform -- Semicircle law -- Finding nth nearest neighbors -- Logistic map -- Real time particle dynamics -- Appendix A: Troubleshooting
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Open Shelf Open Shelf UMPLIB PEKAN QA76.73.F163 H37 2008 (Browse shelf(Opens below)) 1 Available 0000037706

Includes bibliographical references (p. 325-327) and index

Introduction. Programming guidelines -- A brief history of F# -- Benefits of F# -- Introducing F# -- Imperative programming -- Functional programming -- Program structure. Nesting -- Factoring -- Modules. Objects -- Functional design patterns -- F# development -- Data structures. Algorithmic complexity -- Arrays -- Lists -- Sets -- Hash tables -- Maps -- Choosing a data structure -- Sequences -- Heterogeneous containers -- Trees -- Numerical Analysis. Number -- Algebra --Interpolation -- Quadratic solutions -- Mean and variance -- Other forms of arithmetic -- Input and Output. Printing -- Generic printing -- Reading from and writing to files -- Serialization -- Lexing and parsing -- Simple Examples. Functional -- Numerical -- String related -- List related -- Array related -- Higher order functions -- Visualization. Windows forms -- Managed directX -- Tesselating objects into triangles -- Optimization. Timing -- Profiling -- Algorithmic optimizations -- Lower level optimizations -- Libraries. Loading .NET libraries -- Charting and graphing -- Threads -- Random numbers -- Regular expressions -- Vectors and matrices -- Downloading from the Web -- Compression -- Handling XML -- Calling native libraries -- Fourier transform -- Metaprogramming -- Databases. Protein data bank -- Web services -- Relational databases -- Interoperability. Excel interoperability -- MATLAB interoperability -- Mathematica interoperability -- Complete examples. Fast Fourier transform -- Semicircle law -- Finding nth nearest neighbors -- Logistic map -- Real time particle dynamics -- Appendix A: Troubleshooting

Perpustakaan Universiti Malaysia Pahang Al-Sultan Abdullah
26600 Pekan, Pahang Darul Makmur
Phone: +609 431 5063 (Gambang) / +609 431 5035 (Pekan)
Email: umplibrary@umpsa.edu.my

Connect With Us