[Jerker]Beginning Haskell

相似文件 换一批

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Beginning Haskell

Book Description
Beginning Haskell provides a broad-based introduction to the Haskell language, its libraries and environment, and to the functional programming paradigm that is fast growing in importance in the software industry. The book takes a project-based approach to learning the language that is unified around the building of a web-based storefront. Excellent coverage is given to the Haskell ecosystem and supporting tools. These include the Cabal build tool for managing projects and modules, the HUnit and QuickCheck tools for software testing, the Scotty framework for developing web applications, Persistent and Esqueleto for database access, and also parallel and distributed programming libraries.
Book Details

• Publisher:        Apress
• By:        Alejandro Serrano Mena
• ISBN:        978-1-4302-6250-3
• Year:        2014
• Pages:        428
• Language:        English
• File size:        5.1 MB
• File format:        PDF
• Download: To Be Uploaded
  

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：Beginning haskell beginn begin ning supporting software industry learning building

Chapter 6 Summary

In this chapter you finally got in touch with the notion of monad:

• Several implementations of the K-means clustering algorithm have been presented, starting with a handwritten one, then refining it using our own combinators, and finally creating versions using theState and RWS monads,
• Gathering information from incomplete data lead to define combinators for working with Maybe values in an easier way,
• From the similarities in the code using Maybe and using State the notion of monad was devised: a way to combine computations with some special characteristic, such as being able to fail or having an internal state,
• Monads are one of the most important constructions in Haskell and come with a custom syntax, called do notation, which you have studied in depth. This is the most used style of writing monadic code,
• You have seen several other monads: Reader, which holds a read-only context; Writer, which outputs a write-only value that is combined using a monoid structure; RWS, which combines the threeReader, Writer, and State monads; and ST, which implements controlled mutable variables,
• Apart from monads, in this chapter lenses have also been introduced as a way to query and update data structures in a common and powerful way.
  

Chapter 5 Summary

• You have seen how lazy evaluation allows you to work with seemingly infinite or cyclic structures, making for elegant patterns in the code.
• A long explanation has been given about the lazy evaluation model, explaining the special role of thunks for delaying evaluation until a value is needed, and at the same time increasing sharing of evaluated computations.
• At the same time, you have looked at the shortcomings of lazy evaluation, the most important being increased memory consumption and uncertainty about the moment in which a thunk will become evaluated.
• You have learned how to annotate the code using seq, or strictness annotations in both pattern matching and data types to work around these problems,
• The GHC profiler is a powerful tool for detecting time and space leaks: its basic usage and interpretation of its results have been shown in this chapter.
  
  

本帖隐藏的内容

Alejandro Serrano Mena (auth.)-Beginning Haskell_ A Project-Based Approach-Apres.pdf (4.47 MB)

2015-7-3 09:46:30 上传

Chapter 7 Summary

This chapter has gone deeper into the notion of monad, which was introduced in the previous chapter:

• The list monad, which models nondeterministic computations that may return more than one value, has been explained. You have seen how this monad can be used to implement search problems.
• In cases where the list monad doesn’t give enough control over the search, the Logic monad can implement fair conjunction and disjunction.
• You have learned about an important extension of Monad, MonadPlus, which allows modeling failure and choice. Using its functions mzero and mplus, you now know how to implement the Apriori rule-learning algorithm.
• A high-level view of monad utility functions, such as sequence, mapM…, has been done.
• You have learned how the comprehension syntax can be generalized to work on any monad with the MonadComprehensions GHC extension. This has enabled you to relate Haskell monads with other notions in Scala and C#,
• Finally, you have learned how to combine monads using monad transformers.