Books
From HaskellWiki
(Fix formatting of language definition section) 
(Make formatting consistent with rest of page.) 

Line 256:  Line 256:  
===Foundations=== 
===Foundations=== 

−  ;[[Image:TaPL.jpgCover]] 
+  <DL> 
−  [http://www.amazon.com/TypesProgrammingLanguagesBenjaminPierce/dp/0262162091/ref=pd_sim_b_4/10400091636568732 Types and Programming Languages] 
+  <DT>[[Image:TaPL.jpgframelessrightCover]] 
−  :Benjamin C. Pierce. 645 pages, The MIT Press, (February 1, 2002), English. ISBN 0262162091<br>From the cover: 
+  [http://www.amazon.com/TypesProgrammingLanguagesBenjaminPierce/dp/0262162091/ref=pd_sim_b_4/10400091636568732 Types and Programming Languages] by Benjamin C. Pierce. 645 pages, The MIT Press, (February 1, 2002), English. ISBN 0262162091 
−  <blockquote> A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systemsand of programming languages from a typetheoretic perspectivehas important applications in software engineering, language design, highperformance compilers, and security. This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material. The core topics include the untyped lambdacalculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of objectoriented languages.</blockquote> 
+  <DD>From the cover:<BR> 
+  A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systemsand of programming languages from a typetheoretic perspectivehas important applications in software engineering, language design, highperformance compilers, and security. This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material. The core topics include the untyped lambdacalculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of objectoriented languages. 

−  ;[[Image:Advanced_TaPL.jpgCover]] [http://www.amazon.com/AdvancedTopicsTypesProgrammingLanguages/dp/0262162288/ref=pd_sim_b_1/10400091636568732 Advanced Topics in Types and Programming Languages] 
+  <DT>[[Image:Advanced_TaPL.jpgframelessrightCover]] [http://www.amazon.com/AdvancedTopicsTypesProgrammingLanguages/dp/0262162288/ref=pd_sim_b_1/10400091636568732 Advanced Topics in Types and Programming Languages] by Benjamin C. Pierce (Editor), Hardcover: 608 pages, The MIT Press (December 23, 2004), Language: English, ISBN 0262162288.<DD> 
−  :Benjamin C. Pierce (Editor), Hardcover: 608 pages, The MIT Press (December 23, 2004), Language: English, ISBN 0262162288.<br>From the cover: 
+  From the cover:<BR> 
−  <blockquote> The study of type systems for programming languages now touches many areas of computer science, from language design and implementation to software engineering, network security, databases, and analysis of concurrent and distributed systems. This book offers accessible introductions to key ideas in the field, with contributions by experts on each topic. The topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for lowlevel languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in MLstyle type inference. Advanced Topics in Types and Programming Languages builds on Benjamin Pierce's Types and Programming Languages (MIT Press, 2002); most of the chapters should be accessible to readers familiar with basic notations and techniques of operational semantics and type systems  the material covered in the first half of the earlier book. Advanced Topics in Types and Programming Languages can be used in the classroom and as a resource for professionals. Most chapters include exercises, ranging in difficulty from quick comprehension checks to challenging extensions, many with solutions. 
+  The study of type systems for programming languages now touches many areas of computer science, from language design and implementation to software engineering, network security, databases, and analysis of concurrent and distributed systems. This book offers accessible introductions to key ideas in the field, with contributions by experts on each topic. The topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for lowlevel languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in MLstyle type inference. Advanced Topics in Types and Programming Languages builds on Benjamin Pierce's Types and Programming Languages (MIT Press, 2002); most of the chapters should be accessible to readers familiar with basic notations and techniques of operational semantics and type systems  the material covered in the first half of the earlier book. Advanced Topics in Types and Programming Languages can be used in the classroom and as a resource for professionals. Most chapters include exercises, ranging in difficulty from quick comprehension checks to challenging extensions, many with solutions. 
−  </blockquote> 

−  ;[http://www2.cs.cmu.edu/~rwh/plbook/ Programming Languages: Theory and Practice] 
+  <DT>[http://www2.cs.cmu.edu/~rwh/plbook/ Programming Languages: Theory and Practice] by Robert Harper. (Draft). 
−  :Robert Harper. (Draft). <blockquote> A working draft of a planned book on the theoretical foundations of practical programming languages. </blockquote> 
+  <DD>A working draft of a planned book on the theoretical foundations of practical programming languages. 
−  ;[http://homepages.cwi.nl/~jve/cs/ Computational Semantics and Type Theory] 
+  <DT>[http://homepages.cwi.nl/~jve/cs/ Computational Semantics and Type Theory] 
−  :Jan van Eijck. Draft. [http://www.cwi.nl/~jve/cs/cs.pdf Text online]. 
+  by Jan van Eijck. Draft. 
+  <DD>[http://www.cwi.nl/~jve/cs/cs.pdf Text online]. 

−  ;[http://www.cs.man.ac.uk/~pt/stable/Proofs+Types.html Proofs and Types] 
+  <DT>[http://www.cs.man.ac.uk/~pt/stable/Proofs+Types.html Proofs and Types] 
−  :By JeanYves Girard, translated and with appendices by Paul Taylor and Yves Lafont. Based on a short graduate course on typed lambdacalculus given at the Universit Paris VII in the autumn term of 19867. 
+  by JeanYves Girard translated and with appendices by Paul Taylor and Yves Lafont. 
+  <DD> 

+  Based on a short graduate course on typed lambdacalculus given at the Universit Paris VII in the autumn term of 19867. 

−  ;[http://www.cs.uu.nl/wiki/Techno/ProgrammingLanguageTheoryTextsOnline Programming language theory texts online] 
+  <DT>[http://www.cs.uu.nl/wiki/Techno/ProgrammingLanguageTheoryTextsOnline Programming language theory texts online] 
−  :Collection of online programming language theory texts maintained by Frank Atanassow 
+  <DD> 
+  Collection of online programming language theory texts maintained by Frank Atanassow 

−  ;[http://www.cs.chalmers.se/Cs/Research/Logic/book/ Programming in MartinLöf's Type Theory: An Introduction] 
+  <DT>[http://www.cs.chalmers.se/Cs/Research/Logic/book/ Programming in MartinLöf's Type Theory: An Introduction] by Bengt Nordström, Kent Petersson and Jan M. Smith. 1990. 
−  :Bengt Nordström, Kent Petersson and Jan M. Smith. 1990. 
+  <DD> 
+  
+  </DL> 

===Monadic Programming=== 
===Monadic Programming=== 
Revision as of 15:46, 23 September 2012
Books covering many aspects of Haskell.
Contents 
1 Language and library definition

Simon Peyton Jones: "Haskell 98 language and libraries: the Revised Report", Cambridge University Press, 2003, Hardback, 272 pages, ISBN 0521826144, £45.00

Book Description
Haskell is the world's leading lazy functional programming language, widely used for teaching, research, and applications. The language continues to develop rapidly, but in 1998 the community decided to capture a stable snapshot of the language: Haskell 98. All Haskell compilers support Haskell 98, so practitioners and educators alike have a stable base for their work. This book constitutes the agreed definition of the Haskell 98, both the language itself and its supporting libraries. It has been considerably revised and refined since the original definition, and appears in print for the first time. It should be a standard reference work for anyone involved in research, teaching, or application of Haskell.The entire language definition is also available online: Language and library specification.
2 Textbooks
 Miran Lipovača: Learn You a Haskell for Great Good!, Paperback: 360 pages, No Starch Press (April 2011), English, ISBN: 9781593272838
 Book Description
It's all in the name: Learn You a Haskell for Great Good! is a hilarious, illustrated guide to this complex functional language. Packed with the author's original artwork, pop culture references, and most importantly, useful example code, this book teaches functional fundamentals in a way you never thought possible.  Graham Hutton: Programming in Haskell, Paperback: 200 pages, Cambridge University Press (January 31, 2007), English, ISBN 0521692695

Book Description
Haskell is one of the leading languages for teaching functional programming, enabling students to write simpler and cleaner code, and to learn how to structure and reason about programs. This introduction is ideal for beginners: it requires no previous programming experience and all concepts are explained from first principles via carefully chosen examples. Each chapter includes exercises that range from the straightforward to extended projects, plus suggestions for further reading on more advanced topics. The author is a leading Haskell researcher and instructor, wellknown for his teaching skills. The presentation is clear and simple, and benefits from having been refined and classtested over several years. The result is a text that can be used with courses, or for selflearning. Features include: freely accessible Powerpoint slides for each chapter; solutions to exercises, and examination questions (with solutions) available to instructors; downloadable code that's fully compliant with the latest Haskell release.
 Bryan O'Sullivan, Don Stewart, and John Goerzen: Real World Haskell, Paperback: 700 pages, O'Reilly, November 2008, English, ISBN10: 0596514980, ISBN13: 9780596514983
 See Real World Haskell.
 Paul Hudak: The Haskell School of Expression: Learning Functional Programming through Multimedia, Cambridge University Press, New York, 2000, 416pp, 15 line diagrams, 75 exercises, Paperback $29.95, ISBN 0521644089, Hardback $74.95, ISBN 0521643384

Book Description
This book teaches functional programming as a way of thinking and problem solving, using Haskell, the most popular purely functional language. Rather than using the conventional mathematical examples commonly found in other programming language textbooks, the author draws examples from multimedia applications, including graphics, animation, and computer music, thus rewarding the reader with working programs for inherently more interesting applications. Aimed at both beginning and advanced programmers, this tutorial begins with a gentle introduction to functional programming and moves rapidly on to more advanced topics. An underlying theme is the design and implementation of domain specific languages, using three examples: FAL (a Functional Animation Language), IRL (an Imperative Robot Language), and MDL (a Music Description Language). Details about programming in Haskell are presented in boxes throughout the text so they can be easily referred to and found quickly.The book's Web Site contains source files for all programs in the text, as well as the graphics libraries to run them under Windows and Linux platforms. It also contains PowerPoint slides useful for teaching a course using the textbook.
 There is a review of SOE on this wiki: The Monad.Reader/Issue3/SoE Review.
 Simon Thompson: Haskell: The Craft of Functional Programming, Second Edition, AddisonWesley, 507 pages, paperback, 1999. ISBN 0201342758.

Book Description
The second edition of Haskell: The Craft of Functional Programming is essential reading for beginners to functional programming and newcomers to the Haskell programming language. The emphasis is on the process of crafting programs and the text contains many examples and running case studies, as well as advice an program design, testing, problem solving and how to avoid common pitfalls.Building on the strengths of the first edition, the book includes many new and improved features:
 Complete coverage of Haskell 98, the standard version of Haskell which will be stable and supported by implementations for years to come.
 An emphasis on software engineering principles, encouraging a disciplined approach to building reusable libraries of software components.
 Detailed coverage of the Hugs interpreter with an appendix covering other implementations.
 A running case study of pictures emphasizes the builtin functions which appear in the standard prelude and libraries. It is also used to give an early preview of some of the more complex language features, such as highorder functions.
 List comprehensions and the standard functions over lists are covered before recursion.
 Early coverage of polymorphism supporting the "toolkit" approach and encouraging the resuse of builtin functions and types.
 Extensive reference material containing details of further reading in books, journals and on the World Wide Web.
 Accompanying Web Site supporting the book, containing all the program code, further teaching materials and other useful resources.
Synopsis
This books introduces Haskell at a level appropriate for those with little or no prior experience of functional programming. The emphasis is on the process of crafting programs, solving problems, and avoiding common errors.  Richard Bird: Introduction to Functional Programming using Haskell, 2nd edition, Prentice Hall Press, 1998, 460 pp., ISBN 0134843460.

From the cover:
After the success of the first edition, Introduction to Functional Programming using Haskell has been thoroughly updated and revised to provide a complete grounding in the principles and techniques of programming with functions.
The second edition uses the popular language Haskell to express functional programs. There are new chapters on program optimisation, abstract datatypes in a functional setting, and programming in a monadic style. There are completely new case studies, and many new exercises.
As in the first edition, there is an emphasis on the fundamental techniques for reasoning about functional programs, and for deriving them systematically from their specifications.
The book is selfcontained, assuming no prior knowledge of programming, and is suitable as an introductory undergraduate text for first or secondyear students.
 Antony Davie: An Introduction to Functional Programming Systems Using Haskell, Cambridge University Press, 1992. ISBN 0521258308 (hardback). ISBN 0521277248 (paperback).
 Cover:
Functional programming is a style of programming that has become increasingly popular during the past few years. Applicative programs have the advantage of being almost immediately expressible as functional descriptions; they can be proved correct and transformed through the referential transparency property.
This book presents the basic concepts of functional programming, using the language Haskell for examples. The author incorporates a discussion of lambda calculus and its relationship with Haskell, exploring the implications for raparallelism. Contents: SASL for Beginners / Examples of SASL Programming / More Advanced Applicative Programming Techniques / Lambda Calculus / The Relationship Between Lambda Calculus and SASL / Program Transformation and Efficiency / Correctness, Equivalence and Program Verification / Landin's SECD Machine and Related Implementations / Further Implementation Techniques / Special Purpose Hardware / The Applicative Style of Semantics / Other Applicative Languages / Implications for Parallelism / Functional Programming in Von Neumann Languages
 Fethi Rabhi and Guy Lapalme: Algorithms: A functional programming approach,
AddisonWesley, 235 pages, paperback, 1999. ISBN 0201596040

Book Description
The authors challenge more traditional methods of teaching algorithms by using a functional programming context, with Haskell as an implementation language. This leads to smaller, clearer and more elegant programs which enable the programmer to understand the algorithm more quickly and to use that understanding to explore alternative solutions.
Key features: Most chapters are selfcontained and can be taught independently from each other.
 All programs are in Haskell'98 and provided on a WWW site.
 End of chapter exercises throughout.
 Comprehensive index and bibliographical notes.
Synopsis
The book is organised as a classic algorithms book according to topics such as Abstract Data Types, sorting and searching. It uses a succession of practical programming examples to develop in the reader problemsolving skills which can be easily transferred to other language paradigms. It also introduces the idea of capturing algorithmic design strategies (e.g. DivideandConquer, Dynamic Programming) through higherorder functions.
Target audience
The book is intended for computer science students taking algorithms and/or (basic or advanced) functional programming courses.  Jeremy Gibbons and Oege de Moor (eds.): The Fun of Programming,Palgrave, 2002, 288 pages. ISBN 0333992857.

Book description:
In this textbook, leading researchers give tutorial expositions on the current state of the art of functional programming. The text is suitable for an undergraduate course immediately following an introduction to functional programming, and also for selfstudy. All new concepts are illustrated by plentiful examples, as well as exercises. A website gives access to accompanying software.  Simon Peyton Jones: Implementation of Functional Programming Language], 500 pages, PrenticeHall, 1987. ISBN 0134533259.
 This 1987 book is now out of print, but it is now available online in its entirety.
 Simon Peyton Jones, David Lester: Implementing Functional Languages, Paperback: 288 pages, Prentice Hall (August 1992), English, ISBN 0137219520

The book is out of print. The full sources and a postscript version are
available for free.
This book gives a practical approach to understanding the implementations of nonstrict functional languages using lazy graph reduction. The emphasis of the book is on building working prototypes of several functional language implementations (template instantiation, GMachine, TIM, parallel GMachine. In each case the authors provide a complete working prototype of a particular implementation, and then lead the reader through a sequence of improvements which expand its scope. This enables readers to develop, modify and experiment with their own implementations and for use as a source of practical laboratory work material.
 Simon Thompson: Type Theory and Functional Programming, AddisonWesley, 1991. ISBN 0201416670. Hardcover: 388 pages.

Now out of print, the original version is available here.
Preface: Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scientists it provides a framework which brings together logic and programming languages in a most elegant and fertile way: program development and verification can proceed within a single system. Viewed in a different way, type theory is a functional programming language with some novel features, such as the totality of all its functions, its expressive type system allowing functions whose result type depends upon the value of its input, and sophisticated modules and abstract types whose interfaces can contain logical assertions as well as signature information. A third point of view emphasizes that programs (or functions) can be extracted from proofs in the logic.
 Claudio Cesar de Sá and Marcio Ferreira da Silva: Haskell: Uma Abordagem Prática, Novatec Editora Ltda., 2006, 296 pages, ISBN 8575220950. The price is R$ 62,00 (in Reais). Language: Portuguese

This book is being published by Novatec Editora Ltda. You can access directly here.
Book description:
This book brings a comprehensive vision of Haskell language. No knowledge in another functional programming language is expected. In addition, no background in programming is required. The book presents issues from basic up to an intermediate level; it also includes some advanced aspects of Haskell. The title of the book, Haskell: Uma Abordagem Prática, in English Haskell: A Practical Approach, is the essence of the book. The result is a text that can be used in courses of programming and paradigms languages. Finally, many practical examples can be found throughout the book.An additional page containing comments on this book is found here: [1]. Other data as bibtex entry, cover's book in several formats, Winhugs2001 for download, and so on. This page is Portuguese.
 Blas C. Ruiz, Francisco Gutiérrez, Pablo Guerrero y José E. Gallardo. Razonando con Haskell, Thompson 2004. ISBN 8497322770. Language: Spanish
 Descripción El objetivo principal de este libro es el de servir como libro de texto de las asignaturas de Programación Declarativa correspondientes a los estudios de Informática o Ciencias de la Computación, y otras ciencias en general ( Matemáticas, Física, etc.). El texto es fruto de una larga experiencia docente de los autores dentro de las distintas asignaturas que desarrollan la Programación Funcional en distintas titulaciones de la Universidad de Málaga. Aún así, su lectura no queda condicionada a un conocimiento previo sobre lenguajes de programación (de computadores), ni sobre Informática. De esta forma, el libro puede ser utilizado por todo aquel que desee tener un conocimiento amplio sobre la Programación Funcional.
 Haskell Primer: The first functional language to learn. Jun Mukai. In Japanese. Yen 2,730.
 Practical Haskell Programming, Minero Aoki and Nobuo Yamashita. A primer on functional programming for real world programs. In Japanese. Yen 2,940.
 Purely Functional Data Structures Chris Okasaki, 232 pp., Cambridge University Press, 1998. ISBN 0521631246

From the cover:
Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures and data structure design techniques from the point of view of functional languages. It includes code for a wide assortment both of classical data structures and of data structures developed exclusively for functional languages.This handy reference for professional programmers working with functional languages can also be used as a tutorial or for selfstudy. Haskell source code for the book  Функциональное программирование на языке Haskell
 Справочник по языку Haskell
 Практика работы на языке Haskell
 14 занимательных эссе о языке Haskell и функциональном программировании
 Introducere in Haskell 98 prin exemple : Dan Popa, 230 pp., Edusoft Bacau, Romania, (Ian, 31, 2007),Romanian, ISBN 9789738934481
 De pe coperta
(ro) Cartea este simultan un manual introductiv de Haskell si o carte auxiliara pentru studentii de la cursul de limbaje formale. Veti avea satisfactia cunoasterii unui limbaj modern (...) in care algoritmul de sortare Quicksort se scrie pe 6 randuri, asa cum se poate vedea de altfel si in imaginea de pe coperta I. (...) Cartea cuprinde o serie de capitole folosite la Universitatea Bacau in calitate de auxiliare de laborator la disciplina Limbaje Formale si Automate.
(en) This book is simultaneosly a manual of Haskell and an auxiliary book for the students of the FLA course (Formal Languges and Automata). You will be satisfied by this modern language,Haskell. Why ? Using Haskell the Quicksort algorithm can be writen on 6 lines (or less), as you can see on the cover. And that's not all ... This book is used at Bacau State University, Romania.
2.1 Foundations

Types and Programming Languages by Benjamin C. Pierce. 645 pages, The MIT Press, (February 1, 2002), English. ISBN 0262162091
 From the cover:
A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systemsand of programming languages from a typetheoretic perspectivehas important applications in software engineering, language design, highperformance compilers, and security. This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material. The core topics include the untyped lambdacalculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of objectoriented languages.  Advanced Topics in Types and Programming Languages by Benjamin C. Pierce (Editor), Hardcover: 608 pages, The MIT Press (December 23, 2004), Language: English, ISBN 0262162288.

From the cover:
The study of type systems for programming languages now touches many areas of computer science, from language design and implementation to software engineering, network security, databases, and analysis of concurrent and distributed systems. This book offers accessible introductions to key ideas in the field, with contributions by experts on each topic. The topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for lowlevel languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in MLstyle type inference. Advanced Topics in Types and Programming Languages builds on Benjamin Pierce's Types and Programming Languages (MIT Press, 2002); most of the chapters should be accessible to readers familiar with basic notations and techniques of operational semantics and type systems  the material covered in the first half of the earlier book. Advanced Topics in Types and Programming Languages can be used in the classroom and as a resource for professionals. Most chapters include exercises, ranging in difficulty from quick comprehension checks to challenging extensions, many with solutions.  Programming Languages: Theory and Practice by Robert Harper. (Draft).
 A working draft of a planned book on the theoretical foundations of practical programming languages.
 Computational Semantics and Type Theory by Jan van Eijck. Draft.
 Text online.
 Proofs and Types by JeanYves Girard translated and with appendices by Paul Taylor and Yves Lafont.
 Based on a short graduate course on typed lambdacalculus given at the Universit Paris VII in the autumn term of 19867.
 Programming language theory texts online
 Collection of online programming language theory texts maintained by Frank Atanassow
 Programming in MartinLöf's Type Theory: An Introduction by Bengt Nordström, Kent Petersson and Jan M. Smith. 1990.
2.2 Monadic Programming
2.2.1 Foreword of the book (en)
I am delighted to introduce this book on the use of monads in Haskell as a way of structuring interpreters. In the early days, Haskell's most distinctive feature was lazy evaluation. Laziness forced us to take a pure approach to input/output, which meant that Haskell's I/O was initially rather weak. This weakness ultimately proved a strength, however, because it led us to the discovery that monads were not just an abstract mathematical concept, but were immediately applicable as a powerful program structuring mechanism.
Monadic programming is not just to do with input/output: it is much more powerful. That is why I am pleased to see this book, which describes in some detail how to write a language interpreter using a monadic approach.
In retrospect, the discovery of monads as a practical programming pattern is one of Haskell's most substantial contributions to the world of programming  and it is one that you will share if you work through this book.
I am also very happy to see Haskell growing in popularity among our brothers and sisters in Eastern Europe, and in Romania in particular. Enjoy!
Simon P.J.
2.3 Mathematics
See Books and tutorials/Mathematics