Haskell High Performance Programming.

Boost the performance of your Haskell applications using optimization, concurrency, and parallel programmingAbout This Book Explore the benefits of lazy evaluation, compiler features, and tools and libraries designed for high performance Write fast programs at extremely high levels of abstraction Wo...

Full description

Saved in:
Bibliographic Details
Online Access: Full Text (via ProQuest)
Main Author: Thomasson, Samuli
Format: eBook
Language:English
Published: Packt Publishing, 2016.
Edition:1.
Subjects:

MARC

LEADER 00000cam a2200000Ma 4500
001 b12307323
003 CoU
005 20220624053332.0
006 m o d
007 cr |||||||||||
008 161007s2016 xx o 000 0 eng d
019 |a 959910559  |a 961414965  |a 968067332  |a 969075557 
020 |a 1786466910  |q (ebk) 
020 |a 9781786466914 
020 |z 1786464217 
020 |z 9781786464217 
035 |a (OCoLC)ebqac960041594 
035 |a (OCoLC)960041594  |z (OCoLC)959910559  |z (OCoLC)961414965  |z (OCoLC)968067332  |z (OCoLC)969075557 
037 |a ebqac4699622 
040 |a IDEBK  |b eng  |e pn  |c IDEBK  |d YDX  |d OCLCQ  |d NLE  |d OCLCO  |d OCLCF  |d FEM  |d COO  |d EBLCP  |d OCLCQ  |d MERUC  |d OCLCQ  |d LVT  |d UKAHL  |d OCLCQ 
049 |a GWRE 
050 4 |a T55.4-60.8 
100 1 |a Thomasson, Samuli. 
245 1 0 |a Haskell High Performance Programming. 
250 |a 1. 
260 |b Packt Publishing,  |c 2016. 
300 |a 1 online resource (408) 
336 |a text  |b txt  |2 rdacontent. 
337 |a computer  |b c  |2 rdamedia. 
338 |a online resource  |b cr  |2 rdacarrier. 
347 |a text file  |2 rda. 
505 0 |a Cover; Copyright; Credits; About the Author; About the Reviewer; www.PacktPub.com; Table of Contents; Preface; Chapter 1: Identifying Bottlenecks; Meeting lazy evaluation; Writing sum correctly; Weak head normal form; Folding correctly; Memoization and CAFs; Constant applicative form; Recursion and accumulators; The worker/wrapper idiom; Guarded recursion; Accumulator parameters; Inspecting time and space usage; Increasing sharing and minimizing allocation; Compiler code optimizations; Inlining and stream fusion; Polymorphism performance; Partial functions; Summary. 
505 8 |a Chapter 2: Choosing the Correct Data StructuresAnnotating strictness and unpacking datatype fields; Unbox with UNPACK; Using anonymous tuples; Performance of GADTs and branching; Handling numerical data; Handling binary and textual data; Representing bit arrays; Handling bytes and blobs of bytes; Working with characters and strings; Using the text library; Builders for iterative construction; Builders for strings; Handling sequential data; Using difference lists; Difference list performance; Difference list with the writer monad; Using zippers; Accessing both ends fast with Seq. 
505 8 |a Handling tabular dataUsing the vector package; Handling sparse data; Using the containers package; Using the unordered-containers package; Ephemeral data structures; Mutable references are slow; Using mutable arrays; Using mutable vectors; Bubble sort with vectors; Working with monads and monad stacks; The list monad and its transformer; Free monads; Working with monad transformers; Speedup via continuation-passing style; Summary; Chapter 3: Profile and Benchmark to Your Heart's Content; Profiling time and allocations; Setting cost centres manually; Setting cost centres automatically. 
505 8 |a Installing libraries with profilingDebugging unexpected crashes with profiler; Heap profiling; Cost centre-based heap profiling; Objects outside the heap; Retainer profiling; Biographical profiling; Benchmarking using the criterion library; Profile and monitor in real time; Monitoring over HTTP with ekg; Summary; Chapter 4: The Devil's in the Detail; The anatomy of a Haskell project; Useful fields and flags in cabal files; Test suites and benchmarks; Using the stack tool; Multi-package projects; Erroring and handling exceptions; Handling synchronous errors; The exception hierarchy. 
505 8 |a Handling asynchronous errorsThrow and catch in other monads besides IO; Writing tests for Haskell; Property checks; Unit testing with HUnit; Test frameworks; Trivia at term-level; Coding in GHC PrimOps; Control inlining; Using rewrite rules; Specializing definitions; Phase control; Trivia at type-level; Phantom types; Functional dependencies; Type families and associated types; Useful GHC extensions; Monomorphism Restriction; Extensions for patterns and guards; Strict-by-default Haskell; Summary; Chapter 5: Parallelize for Performance; Primitive parallelism and the runtime system; Spark away. 
505 8 |a Subtle evaluation -- pseq. 
520 |a Boost the performance of your Haskell applications using optimization, concurrency, and parallel programmingAbout This Book Explore the benefits of lazy evaluation, compiler features, and tools and libraries designed for high performance Write fast programs at extremely high levels of abstraction Work through practical examples that will help you address the challenges of writing efficient codeWho This Book Is For To get the most out of this book, you need to have a working knowledge of reading and writing basic Haskell. No knowledge of performance, optimization, or concurrency is required. What You Will Learn Program idiomatic Haskell that's also surprisingly efficient Improve performance of your code with data parallelism, inlining, and strictness annotations Profile your programs to identify space leaks and missed opportunities for optimization Find out how to choose the most efficient data and control structures Optimize the Glasgow Haskell Compiler and runtime system for specific programs See how to smoothly drop to lower abstractions wherever necessary Execute programming for the GPU with Accelerate Implement programming to easily scale to the cloud with Cloud HaskellIn Detail Haskell, with its power to optimize the code and its high performance, is a natural candidate for high performance programming. It is especially well suited to stacking abstractions high with a relatively low performance cost. This book addresses the challenges of writing efficient code with lazy evaluation and techniques often used to optimize the performance of Haskell programs. We open with an in-depth look at the evaluation of Haskell expressions and discuss optimization and benchmarking. You will learn to use parallelism and we'll explore the concept of streaming. We'll demonstrate the benefits of running multithreaded and concurrent applications. Next we'll guide you through various profiling tools that will help you identify performance issues in your program. We'll end our journey by looking at GPGPU, Cloud and Functional Reactive Programming in Haskell. At the very end there is a catalogue of robust library recommendations with code samples. By the end of the book, you will be able to boost the performance of any app and prepare it to stand up to real-world punishment. Style and approach This easy-to-follow guide teaches new practices and techniques to optimize your code, and then moves towards more advanced ways to effectively write efficient Haskell code. Small and simple practical examples will help you test the concepts yourself, and you will be able to easily adapt them for any application. 
588 0 |a Print version record. 
650 0 |a Haskell (Computer program language) 
650 0 |a Functional programming (Computer science) 
650 7 |a Functional programming (Computer science)  |2 fast  |0 (OCoLC)fst00936086. 
650 7 |a Haskell (Computer program language)  |2 fast  |0 (OCoLC)fst00951830. 
776 0 8 |i Print version:  |a Thomasson, Samuli.  |t Haskell High Performance Programming.  |b 1.  |d Packt Publishing, 2016  |z 1786464217  |z 9781786464217  |w (OCoLC)949751074. 
856 4 0 |u https://ebookcentral.proquest.com/lib/ucb/detail.action?docID=4699622  |z Full Text (via ProQuest) 
907 |a .b123073236  |b 07-07-22  |c 07-07-22 
998 |a web  |b  - -   |c f  |d b   |e z  |f eng  |g xx   |h 0  |i 1 
915 |a M 
956 |a Ebook Central Academic Complete 
956 |b Ebook Central Academic Complete 
999 f f |i 777a60a4-ae82-5e45-82fc-3307610e46f6  |s c8082ec2-21f5-5397-84e8-a2d221757bbb 
952 f f |p Can circulate  |a University of Colorado Boulder  |b Online  |c Online  |d Online  |e T55.4-60.8  |h Library of Congress classification  |i web  |n 1