Difference between revisions of "Books"

From HaskellWiki
Jump to: navigation, search
(Teaching Haskell)
m (fixed typo in the description of Parallel and Concurrent Programming)
 
(281 intermediate revisions by 67 users not shown)
Line 1: Line 1:
  +
Books covering many aspects of Haskell.
   
=The Haskell Bookshelf=
 
  +
==Language and library definition==
 
==Language Definition==
 
   
 
<DL>
 
<DL>
<DT>Simon Peyton Jones: [http://titles.cambridge.org/catalogue.asp?isbn=0521826144 <EM>Haskell 98 Language and Libraries</EM>], Cambridge University Press, 2003, Hardback, 272 pages, ISBN: 0521826144, £35.00
 
  +
<BR>
 
  +
<DT>[[Image:Haskell_98_Language_and_Libraries.jpg|frameless|right|Cover]]
<BLOCKQUOTE>
 
  +
Simon Peyton Jones: [http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=0521826144 "Haskell 98 language and libraries: the Revised Report"], Cambridge University Press, 2003, Hardback, 272 pages, ISBN 0521826144, £45.00
  +
<DD>
 
<B>Book Description</B><BR>
 
<B>Book Description</B><BR>
 
Haskell is the world's leading lazy functional programming language,
 
Haskell is the world's leading lazy functional programming language,
Line 20: Line 20:
 
time. It should be a standard reference work for anyone involved in
 
time. It should be a standard reference work for anyone involved in
 
research, teaching, or application of Haskell.
 
research, teaching, or application of Haskell.
</BLOCKQUOTE>
 
  +
</DT></DL>
 
  +
The entire language definition is also available online:
  +
[[Language_and_library_specification|Language and library
  +
specification]].
  +
</DL>
   
== Textbooks==
+
==Textbooks==
   
 
<DL>
 
<DL>
<DT>Paul Hudak: [http://www.haskell.org/soe <EM>The Haskell School of Expression: Learning Functional Programming through Multimedia</EM>], Cambridge University Press, New York, 2000, 416
 
  +
pp, 15 line diagrams, 75 exercises, Paperback $29.95, ISBN:
 
  +
<dt>John Whitington : [[Image: Hftvb-cover.jpg|frameless|right|70px|Cover]] [https://haskellfromtheverybeginning.com/ Haskell from the Very Beginning], ISBN13 9780957671133, Paperback/eBook: 216 pages. Coherent Press (October 2019)
0521644089, Hardback $74.95, ISBN: 0521643384
 
  +
<dd>
<BR>
 
  +
<B>Book Description</B><BR>
  +
In Haskell from the Very Beginning John Whitington takes a no-prerequisites approach to teaching the basics of a modern general-purpose programming language. Each small, self-contained chapter introduces a new topic, building until the reader can write quite substantial programs. There are plenty of questions and, crucially, worked answers and hints.
  +
  +
Haskell from the Very Beginning will appeal both to new programmers, and to experienced programmers eager to explore functional languages such as Haskell. It is suitable both for formal use within an undergraduate or graduate curriculum, and for the interested amateur.
  +
  +
<dt>Vitaly Bragilevsky : [[Image: Hid-cover.jpg|frameless|right|70px|Cover]] [https://www.manning.com/books/haskell-in-depth Haskell in Depth], ISBN13 9781617295409, Paperback/eBook: 625 pages (estimated). Manning Publications (Fall 2019, estimated)
  +
<dd>
  +
<B>Book Description</B><BR>
  +
Haskell in Depth is the perfect second book on Haskell. After a quick refresher on Haskell basics, this hands-on guide dives into examples and application scenarios designed to teach how Haskell works and how to apply it correctly. You’ll learn about managing projects with Cabal and Stack, tackle error-handling and testing, and package programs and libraries for production deployment.
  +
  +
You’ll appreciate coverage of advanced Haskell features including programming polymorphically, working effectively with types, concurrent programming, data processing, web services, and more. Because it’s organized to make specific topics easy to find, you’ll return to this book again and again as your go-to Haskell reference.
  +
  +
<dt>Will Kurt : [[Image: Gph-cover.jpg|frameless|right|70px|Cover]] [https://www.manning.com/books/get-programming-with-haskell Get Programming with Haskell], ISBN13 9781617293764, Paperback/eBook: 616 pages. Manning Publications (March 2018)
  +
<dd>
  +
<B>Book Description</B><BR>
  +
Get Programming with Haskell leads you through short lessons, examples, and exercises designed to make Haskell your own. It has crystal-clear illustrations and guided practice. You will write and test dozens of interesting programs and dive into custom Haskell modules. You will gain a new perspective on programming plus the practical ability to use Haskell in the everyday world. (The 80 IQ points: not guaranteed!)
  +
  +
<dt>[[Image:beginning_haskell.jpg|frameless|right|70px|Cover]] Alejandro Serrano Mena: [http://www.apress.com/9781430262503 <em>Beginning Haskell</em>], Paperback / eBook: 498 pages, Apress (January 2014), English, ISBN: 978-1-43026-250-3
  +
<dd><B>Book Description</B><BR>
  +
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.
  +
  +
<dt>[[Image:Lyah.png|frameless|right|70px|Cover]] Miran Lipovača: [http://www.nostarch.com/lyah.htm <em>Learn You a Haskell for Great Good!</em>], Paperback: 360 pages, No Starch Press (April 2011), English, ISBN: 978-1-59327-283-8
  +
<dd><B>Book Description</B><BR>
  +
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.
  +
  +
<dt>[[Image:pih.jpg|frameless|right|70px|Cover]] Graham Hutton: [http://www.cs.nott.ac.uk/~pszgmh/pih.html <em>Programming in Haskell</em>], Paperback: 318 pages, 120 exercises, Cambridge University Press (September 1, 2016), English, ISBN-13: 978-1316626221
  +
<dd>
  +
<B>Book Description</B><BR>
  +
This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and example code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable and traversable types.
  +
  +
<dt>[[Image:Rwh-thumb.png|frameless|right|Cover]] Bryan O'Sullivan, Don Stewart, and John Goerzen: [http://book.realworldhaskell.org/ <em>Real World Haskell</em>], Paperback: 700 pages, O'Reilly, November 2008, English, ISBN-10: 0596514980, ISBN-13: 978-0596514983
  +
<dd>
  +
See ''[[Real World Haskell]]''.
  +
  +
<br>
  +
<dt>[[Image:pcph-thumb.gif|70px|frameless|right|Cover]] Simon Marlow: [https://simonmar.github.io/pages/pcph.html <em>Parallel and Concurrent Programming in Haskell</em>], Paperback: 322 pages, O'Reilly, August 2013, English, ISBN-10: 1449335942, ISBN-13: 978-1449335946
  +
<dd>
  +
<B>Book Description</B><BR>
  +
If you have a working knowledge of Haskell, this hands-on book shows you how to use the language’s many APIs and frameworks for writing both parallel and concurrent programs. You’ll learn how parallelism exploits multicore processors to speed up computation-heavy programs, and how concurrency enables you to write programs with threads for multiple interactions.
  +
  +
Author Simon Marlow walks you through the process with lots of code examples that you can run, experiment with, and extend. Divided into separate sections on Parallel and Concurrent Haskell, this book also includes exercises to help you become familiar with the concepts presented:
  +
  +
* Express parallelism in Haskell with the Eval monad and Evaluation Strategies
  +
* Parallelize ordinary Haskell code with the Par monad
  +
* Build parallel array-based computations, using the Repa library
  +
* Use the Accelerate library to run computations directly on the GPU
  +
* Work with basic interfaces for writing concurrent code
  +
* Build trees of threads for larger and more complex programs
  +
* Learn how to build high-speed concurrent network servers
  +
* Write distributed programs that run on multiple machines in a network
  +
  +
  +
<DT>[[Image:The_Haskell_School_of_Expression.jpg|frameless|right|Cover]] Paul Hudak: [http://www.cs.yale.edu/homes/hudak/SOE/ <EM>The Haskell School of Expression: Learning Functional Programming through Multimedia</EM>], Cambridge University Press, New York, 2000, 416pp, 15 line diagrams, 75 exercises, Paperback $29.95, ISBN 0521644089, Hardback $74.95, ISBN 0521643384
  +
<dd>
 
<B>Book Description</B><BR>
 
<B>Book Description</B><BR>
 
This book teaches functional programming as a way of thinking and
 
This book teaches functional programming as a way of thinking and
Line 41: Line 97:
 
introduction to functional programming and moves rapidly on to more
 
introduction to functional programming and moves rapidly on to more
 
advanced topics. An underlying theme is the design and implementation
 
advanced topics. An underlying theme is the design and implementation
of domain specific languages, using three examples: FAL (a Functional
+
of <em>domain specific languages</em>, using three examples: FAL (a Functional
 
Animation Language), IRL (an Imperative Robot Language), and MDL (a
 
Animation Language), IRL (an Imperative Robot Language), and MDL (a
 
Music Description Language). Details about programming in Haskell
 
Music Description Language). Details about programming in Haskell
 
are presented in boxes throughout the text so they can be easily
 
are presented in boxes throughout the text so they can be easily
 
referred to and found quickly.
 
referred to and found quickly.
<P>
 
  +
The book's Web Site contains source files for all programs in the
+
The book's [http://plucky.cs.yale.edu/soe 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
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.
 
teaching a course using the textbook.
   
<DT>Simon Thompson: [http://www.cs.ukc.ac.uk/people/staff/sjt/craft2e/ <EM>Haskell: The Craft of Functional Programming</EM>], Second Edition,
 
  +
*There is a review of SOE on this wiki: [[The Monad.Reader/Issue3/SoE Review]].
Addison-Wesley, 507&nbsp;pages, paperback, 1999. ISBN
 
  +
0-201-34275-8.<BR>
 
  +
<DT>[[Image:The_Craft_of_Functional_Programming.jpg|frameless|right|Cover]] Simon Thompson: [http://www.cs.ukc.ac.uk/people/staff/sjt/craft2e/ <EM>Haskell: The Craft of Functional Programming</EM>], Second Edition, Addison-Wesley, 507&nbsp;pages, paperback, 1999. ISBN 0-201-34275-8.
  +
<dd>
 
<B>Book Description</B><BR>
 
<B>Book Description</B><BR>
 
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.
 
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.
Line 68: Line 125:
 
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.
 
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.
   
<DT>Richard Bird: [http://www.prenhall.com/allbooks/ptr_0134843460.html <EM>Introduction to Functional Programming using Haskell</EM>], 2nd edition, Prentice Hall Press, 1998, 460 pp., ISBN: 0-13-484346-0.<BR>
 
  +
<DT>[[Image:Bird_TFWH.jpg|frameless|right|70 px|Cover]] Richard Bird: [https://www.cambridge.org/core/books/thinking-functionally-with-haskell/79F91D976F0C7229082325B41824EBBC# <EM>Thinking Functionally with Haskell</EM>], Cambridge University Press, 2014, 354 pp., ISBN-10: 1107452643, ISBN-13: 978-1107452640.
From the cover:
 
  +
<dd>
  +
Richard Bird is famed for the clarity and rigour of his writing. His new textbook, which introduces functional programming to students, emphasises fundamental techniques for reasoning mathematically about functional programs. By studying the underlying equational laws, the book enables students to apply calculational reasoning to their programs, both to understand their properties and to make them more efficient. The book has been designed to fit a first- or second-year undergraduate course and is a thorough overhaul and replacement of his earlier textbooks. It features case studies in Sudoku and pretty-printing, and over 100 carefully selected exercises with solutions.
   
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.
 
  +
<DT>[[Image:Introduction_to_Functional_Programming_Systems_Using_Haskell.jpg|frameless|right|Cover]] Antony Davie: [http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=0521277248 <EM>An Introduction to Functional Programming Systems Using Haskell</EM>], Cambridge University Press, 1992. ISBN 0-521-25830-8 (hardback). ISBN 0-521-27724-8 (paperback).
 
  +
<dd>Cover:
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 self-contained, assuming no prior knowledge of programming, and is suitable as an introductory undergraduate text for first- or second-year students.
 
 
 
<DT>Antony Davie: [http://www.cup.org/Titles/25/0521258308.html <EM>An Introduction to Functional Programming Systems Using Haskell</EM>], Cambridge University Press, 1992. ISBN 0-521-25830-8 (hardback). ISBN 0-521-27724-8 (paperback).<BR>
 
Cover:
 
   
 
Functional programming is a style of programming that has become increasingly popular during the past few years.
 
Functional programming is a style of programming that has become increasingly popular during the past few years.
Line 89: Line 138:
 
This book presents the basic concepts of functional programming, using the language Haskell for examples. The author
 
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
 
incorporates a discussion of lambda calculus and its relationship with Haskell, exploring the implications for
parallelism. Contents: SASL for Beginners / Examples of SASL Programming / More Advanced Applicative Programming
+
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
 
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
 
Efficiency / Correctness, Equivalence and Program Verification / Landin's SECD Machine and Related
Line 96: Line 145:
 
Languages
 
Languages
   
<DT>Fethi Rabhi and Guy Lapalme: [http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html <EM> Algorithms: A functional programming approach</EM>],
+
<DT>[[Image:Algorithms_A_Functional_Approach.jpg|frameless|right|Cover]] Fethi Rabhi and Guy Lapalme: [http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html <EM> Algorithms: A functional programming approach</EM>],
Addison-Wesley, 235&nbsp;pages, paperback, 1999. ISBN
+
Addison-Wesley, 235&nbsp;pages, paperback, 1999. ISBN 0-201-59604-0<BR>
0-201-59604-0<BR>
+
<DD>
<BLOCKQUOTE>
 
 
<B>Book Description</B><BR>
 
<B>Book Description</B><BR>
 
The authors challenge more traditional methods of teaching algorithms
 
The authors challenge more traditional methods of teaching algorithms
Line 122: Line 171:
 
The book is intended for computer science students taking algorithms
 
The book is intended for computer science students taking algorithms
 
and/or (basic or advanced) functional programming courses.
 
and/or (basic or advanced) functional programming courses.
</BLOCKQUOTE>
 
   
<dt>Jeremy Gibbons and Oege de Moor (eds.): [//www.palgrave.com/catalogue/catalogue.asp?Title_Id=0333992857 <em>The Fun of Programming</em>],Palgrave, 2002, 288 pages. ISBN 0333992857.
+
<dt>[[Image:Fun_of_Programming.jpg|frameless|right|Cover]] Jeremy Gibbons and Oege de Moor (eds.): [http://www.palgrave.com/catalogue/catalogue.asp?Title_Id=0333992857 <em>The Fun of Programming</em>],Palgrave, 2002, 288 pages. ISBN 0333992857.
<blockquote>
+
<dd>
 
<b>Book description:</b><br>
 
<b>Book description:</b><br>
 
In this textbook, leading researchers give tutorial expositions on the current state of the art of functional
 
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
 
programming. The text is suitable for an undergraduate course immediately following an introduction to
 
functional programming, and also for self-study. All new concepts are illustrated by plentiful examples,
 
functional programming, and also for self-study. All new concepts are illustrated by plentiful examples,
as well as exercises. A website gives access to accompanying software.
+
as well as exercises. A [http://web.comlab.ox.ac.uk/oucl/publications/books/fop/ website] gives access to accompanying software.
</blockquote>
 
   
<dt> Cordelia Hall and John O'Donnell: [http://www.dcs.gla.ac.uk/~jtod/discrete-mathematics/ <em>Discrete Mathematics Using a Computer</em>],
 
  +
<dt>Simon Peyton Jones: [http://research.microsoft.com/Users/simonpj/Papers/slpj-book-1987/index.htm <em>Implementation of Functional Programming] Language</em>], 500 pages, Prentice-Hall, 1987. ISBN 0134533259.
Springer, 2000, 360 pages. ISBN 1-85233-089-9.
 
  +
<dd>
<blockquote>
 
  +
This 1987 book is now out of print, but it is now available [http://research.microsoft.com/Users/simonpj/Papers/slpj-book-1987/index.htm online] in its entirety.
<b>Book description:</b><br>
 
  +
This book introduces the main topics of discrete mathematics with a strong emphasis on
 
  +
<dt>Simon Peyton Jones, David Lester: [http://www.amazon.com/Implementing-Functional-Languages-Prentice-Hall-International/dp/0137219520/sr=1-1/qid=1162002704/ref=sr_1_1/104-0009163-6568732?ie=UTF8&s=books <em>Implementing Functional Languages</em>], Paperback: 288 pages, Prentice Hall (August 1992), English, ISBN 0137219520 <br>
applications to computer science. It uses computer programs to implement and illustrate
 
  +
<dd>
the mathematical ideas, helping the reader to gain a concrete understanding of the
 
  +
The book is out of print. The full sources and a postscript version are
abstract mathematics. The programs are also useful for practical calculations, and they
 
  +
[http://research.microsoft.com/Users/simonpj/Papers/papers.html available for free].
can serve as a foundation for larger software packages.
 
  +
  +
This book gives a practical approach to understanding the
  +
implementations of non-strict functional languages using lazy graph
  +
reduction. The emphasis of the book is on building working prototypes of
  +
several functional language implementations (template- instantiation,
  +
G-Machine, TIM, parallel G-Machine. 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.
  +
  +
<dt>[[Image:TTFP.jpg|frameless|right|Cover]] Simon Thompson: [http://www.amazon.com/Functional-Programming-International-Computer-Science/dp/0201416670/sr=1-1/qid=1162002856/ref=sr_1_1/104-0009163-6568732?ie=UTF8&s=books <em>Type Theory and Functional Programming</em>], Addison-Wesley, 1991. ISBN 0-201-41667-0. Hardcover: 388 pages.
  +
<dd>
  +
Now out of print, the original version is available [http://www.cs.kent.ac.uk/people/staff/sjt/TTFP/ here].
   
Designed for first and second year undergraduate students, the book is also ideally suited
 
  +
<em>Preface</em>:
to self-study. No prior knowledge of functional programming is required; the book and
 
  +
Constructive Type theory has been a topic of research interest to computer scientists,
the online documentation provide everything you will need.
 
  +
mathematicians, logicians and philosophers for a number of years. For computer scientists it provides
</blockquote>
 
  +
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.
   
<dt>Kees Doets and Jan van Eijck: [http://www.cwi.nl/~jve/HR <em>The Haskell Road to Logic, Maths and Programming</em>]. King's College Publications, London, 2004. ISBN 0-9543006-9-6 (14.00 pounds, $25.00).
 
  +
<DT>[[Image:Uma_Abordagem_Pratica.jpg|frameless|right|Cover]] Claudio Cesar de Sá and Marcio Ferreira da Silva: <em> Haskell: Uma Abordagem Prática</em>, [http://www.novatec.com.br Novatec Editora Ltda.], 2006, 296 pages, ISBN 85-7522-095-0. The price is R$ 62,00 (in Reais). Language: Portuguese
<blockquote>
 
  +
<dd>
  +
This book is being published by Novatec Editora Ltda. You can access directly [http://www.novateceditora.com.br/livros/haskell/ here].
  +
<br>
 
<b>Book description:</b><br>
 
<b>Book description:</b><br>
The purpose of this book is to teach logic and mathematical reasoning
 
  +
This book brings a comprehensive vision of Haskell language. No
in practice, and to connect logical reasoning with computer
 
  +
knowledge in another functional programming language is expected. In
programming. Throughout the text, abstract concepts are linked to
 
  +
addition, no background in programming is required. The book presents
concrete representations in Haskell. Everything one has to know about
 
  +
issues from basic up to an intermediate level; it also includes some
programming in Haskell to understand the examples in the book is
 
  +
advanced aspects of Haskell. The title of the book, <em>Haskell: Uma
explained as we go along, but we do not cover every aspect of the
 
  +
Abordagem Prática</em>, in English <em>Haskell: A Practical Approach</em>, 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.
language. Haskell is a marvelous demonstration tool for logic and
 
maths because its functional character allows implementations to
 
remain very close to the concepts that get implemented, while the
 
laziness permits smooth handling of infinite data structures.
 
   
We do not assume that our readers have previous experience with either
 
  +
An additional page containing comments on this book is found here:
programming or construction of formal proofs. We do assume previous
 
  +
[http://www2.joinville.udesc.br/~coca/index.php/Main/PaginaDoLivroDeHaskell].
acquaintance with mathematical notation, at the level of secondary
 
  +
Other data as bibtex entry, cover's book in several formats, Winhugs-2001 for download, and so on. This page is Portuguese.
school mathematics. Wherever necessary, we will recall relevant
 
facts. Everything one needs to know about mathematical
 
reasoning or programming is explained as we go along. We do assume
 
that our readers are able to retrieve software from the Internet and
 
install it, and that they know how to use an editor for constructing
 
program texts.
 
   
After having worked through the material in the book, i.e., after
 
  +
<dt>[[Image:portada.jpg|frameless|right|Cover]] Blas C. Ruiz, Francisco Gutiérrez, Pablo Guerrero y José E. Gallardo. [http://www.lcc.uma.es/~pepeg/pfHaskell/index.html <em>Razonando con Haskell</em>], Thompson 2004. ISBN 84-9732-277-0. Language: Spanish
having digested the text and having carried out a substantial number
 
  +
<dd>
of the exercises, the reader will be able to write interesting
 
  +
Descripción El objetivo principal de este libro es el de servir como
programs, reason about their correctness, and document them in a clear
 
  +
libro de texto de las asignaturas de Programación Declarativa
fashion. The reader will also have learned how to set up mathematical
 
  +
correspondientes a los estudios de Informática o Ciencias de la
proofs in a structured way, and how to read and digest mathematical
 
  +
Computación, y otras ciencias en general ( Matemáticas, Física, etc.).
proofs written by others.
 
  +
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.
   
The book can be used as a course textbook, but since it comes with
 
  +
<dt>[[Image:haskell-jp.jpg|frameless|right|Cover]] [http://www.amazon.co.jp/gp/product/4839919623 Haskell Primer: The first functional language to learn]. Jun Mukai. In Japanese. Yen 2,730.
solutions to all exercises (electronically available from the authors
 
  +
<dd>
upon request) it is also well suited for private study. The source
 
code of all programs discussed in the text, a list of errata,
 
further relevant material and an email link to the authors
 
can be found [http://www.cwi.nl/~jve/HR here].
 
</blockquote>
 
   
<dt>Simon Peyton Jones: <em>Implementation of Functional Programming Language</em>,Prentice-Hall, 1987. ISBN 0134533259.
 
  +
<dt>[[Image:Haskell-jp-2.jpg|frameless|right|Cover]] [http://www.amazon.co.jp/gp/product/4797336021 Practical Haskell Programming], Minero Aoki and Nobuo Yamashita. A primer on functional programming for real world programs. In Japanese. Yen 2,940.
<blockquote></blockquote>
 
  +
<dd>
   
<dt>Simon Peyton Jones, David Lester: <em>Implementing Functional Languages</em>, 1992.<br>
 
  +
<dt>[[Image:Purely_Functional_Data_Structures.jpg|frameless|right|Cover]] [http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=0521663504 Purely Functional Data Structures] [http://www.eecs.usma.edu/webs/people/okasaki/ Chris Okasaki], 232 pp., Cambridge University Press, 1998. ISBN 0-521-63124-6
<blockquote>
 
  +
<dd>
The book is out of print. The full sources and a postscript version are
 
  +
From the cover:<BR/> 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 self-study. [http://www.eecs.usma.edu/webs/people/okasaki/pfds-haskell.tar.gz Haskell source code for the book]
[http://research.microsoft.com/Users/simonpj/Papers/papers.html available for free].
 
</blockquote>
 
</DL>
 
   
==Papers available on the Web==
 
  +
<DT>[[Функциональное программирование на языке Haskell]]
   
===General Introductions to Haskell===
 
  +
<DT>[[Справочник по языку Haskell]]
   
<UL>
 
  +
<DT>[[Практика работы на языке Haskell]]
<LI>[../tutorial/ <EM>A
 
Gentle Introduction to Haskell</EM>] by Paul Hudak, John Peterson, and Joseph H. Fasel.<BR>
 
The title is a bit misleading. Some knowledge of another functional programming language is expected. The emphasis is on the type system and those features which are really new in Haskell (compared to other functional programming languages).
 
   
<li>[http://www-106.ibm.com/developerworks/edu/os-dw-linuxhask-i.html Beginning Haskell] from IBM developerWorks<br>
 
  +
<DT>[[14 занимательных эссе о языке Haskell и функциональном программировании]]
This tutorial targets programmers of imperative languages wanting to learn about functional programming in the language Haskell. If you have programmed in languages such as C, Pascal, Fortran, C++, Java, Cobol, Ada, Perl, TCL, REXX, JavaScript, Visual Basic, or many others, you have been using an imperative paradigm. This tutorial provides a gentle introduction to the paradigm of functional programming, with specific illustrations in the Haskell 98 language. (Free registration required.)
 
<p>
 
<li>Yet Another Haskell Tutorial by Hal Daume III et al. ([//www.isi.edu/~hdaume/htut/tutorial.ps Postscript], [//www.isi.edu/~hdaume/htut/tutorial.pdf Pdf])<br>
 
A tutorial for Haskell that is still under construction but covers already much ground.
 
<p>
 
<LI>[http://www.numeric-quest.com/haskell/hcompanion/index.html Haskell Companion] by Jan Skibinski<BR>
 
A tutorial on most common concepts and definitions of functional language Haskell.
 
   
<LI>[http://www.informatik.uni-bonn.de/~ralf/teaching/Hskurs_toc.html Online Haskell Course] by Ralf Hinze (in German).
 
  +
<dt>
  +
[[Image:Cartea-lui-Dan-Popa-coperta-1.png|frameless|right|Cover]] [http://www.edusoft.ro/detalii.php?id=81 Introducere in Haskell 98 prin exemple ]: Dan Popa, 230 pp., Edusoft Bacau, Romania, (Ian, 31, 2007),Romanian, ISBN 978-973-8934-48-1
  +
<dd><b>De pe coperta</b><BR>
  +
(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.
  +
<br>
  +
(en) This book is simultaneously 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.
   
<LI>[functional-programming.dvi <EM>Functional Programming</EM>
 
  +
<dt>James Church : [[Image: Getting_Started_with_Haskell_Data_Analysis.png|frameless|right|70px|Cover]] [https://india.packtpub.com/in/big-data-and-business-intelligence/getting-started-haskell-data-analysis Getting Started with Haskell Data Analysis], ISBN13 9781789802863, Paperback/eBook: 160 pages. Packt October 2018)
by Jeroen Fokker, 1995.](153 pages, 600 KB)<BR>
 
  +
<dd>
Textbook for learning functional programming with Gofer.
 
  +
<B>Book Description</B><BR>
Here without Chapters&nbsp;6 and&nbsp;7.
 
  +
Every business and organization that collects data is capable of tapping into its own data to gain insights how to improve. Haskell is a purely functional and lazy programming language, well-suited to handling large data analysis problems. This book will take you through the more difficult problems of data analysis in a hands-on manner.
   
<LI>[http://www.cs.ou.edu/cs1323h/textbook/haskell.shtml <EM>Two Dozen Short Lessons in Haskell</EM> by Rex Page].
 
  +
This book will help you get up-to-speed with the basics of data analysis and approaches in the Haskell language. You'll learn about statistical computing, file formats (CSV and SQLite3), descriptive statistics, charts, and progress to more advanced concepts such as understanding the importance of normal distribution. While mathematics is a big part of data analysis, we've tried to keep this course simple and approachable so that you can apply what you learn to the real world.
A draft of a textbook on functional programming, available by ftp.
 
It calls for active participation from readers by omitting
 
material at certain points and asking the reader to attempt to fill in the missing
 
information based on knowledge they have already acquired. The missing information is then
 
supplied on the reverse side of the page.
 
   
<LI>[haskeller.dvi <EM>The Little Haskeller</EM>] by Cordelia Hall and John Hughes, 9. November 1993, 26 pages.<BR>
 
  +
By the end of this book, you will have a thorough understanding of data analysis, and the different ways of analyzing data. You will have a mastery of all the tools and techniques in Haskell for effective data analysis.
An introduction using the Chalmers Haskell B interpreter (hbi).
 
Attention: it relies very much on the user interface of hbi which is quite
 
different for other Haskell systems.
 
   
<LI>[http://www.di.uminho.pt/afp98/PAPERS/Tutorial.ps <EM>Haskell Tutorial</EM>]
 
  +
<dt>Yogesh Sajanikar : [[Image: Haskell_Cookbook.png|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/haskell-cookbook Haskell Cookbook], ISBN13 9781786461353, Paperback/eBook: 396 pages. Packt (September 2017)
by José Barros and João Almeida.
 
  +
<dd>
From a course given at the [http://www.di.uminho.pt/afp98/preprogram/html 3rd International Summer School on Advanced Functional Programming].
 
  +
<B>Book Description</B><BR>
<p>
 
  +
Haskell Cookbook provides recipes that start by illustrating the principles of functional programming in Haskell, and then gradually build up your expertise in creating industrial-strength programs to accomplish any goal. The book covers topics such as Functors, Applicatives, Monads, and Transformers. You will learn various ways to handle state in your application and explore advanced topics such as Generalized Algebraic Data Types, higher kind types, existential types, and type families. The book will discuss the association of lenses with type classes such as Functor, Foldable, and Traversable to help you manage deep data structures.
<li>[http://www.cs.mu.oz.au/~bjpop/papers/mira2hask.ps.gz <em>Haskell for Miranda Programmers</em>] by Kevin Glynn and Bernie Pope.
 
<p>
 
<li>[http://pleac.sourceforge.net/pleac_haskell/t1.html <em>PLEAC-Haskell</em>]<br>
 
Following the Perl Cookbook (by Tom Christiansen and Nathan Torkington, published by O'Reilly) spirit, the PLEAC Project aims to gather fans of programming, in order to implement the solutions in other programming languages.
 
<p>
 
<li>[ftp://ftp.geoinfo.tuwien.ac.at/navratil/HaskellTutorial.pdf <em>Haskell-Tutorial</em>] by Damir Medak and Gerhard Navratil<br>
 
The fundamentals of functional languages for beginners.
 
<LI>[http://www.reid-consulting-uk.ltd.uk/docs/ffi.html A Guide to Haskell's Foreign Function Interface] A guide to using the foreign function interface extension, using the rich set of functions in the Foreign libraries, design issues, and FFI preprocessors,
 
</ul>
 
   
===References===
 
  +
<dt>[[Image:HaskellDataAnalysis.png|70px|frameless|right|Cover]] Nishant Shukla: [http://haskelldata.com <em>Haskell Data Analysis Cookbook</em>], Paperback: 334 pages, Packt, June 2014, English, ISBN-10: 1783286334, ISBN-13: 978-1783286331
<ul>
+
<dd>
<li>[http://www.cs.uu.nl/~afie/haskell/tourofsyntax.html <em>Tour of the Haskell Syntax</em>] by Arjan van IJzendoorn.
+
<B>Book Description</B><BR>
<li>[http://zvon.org/other/haskell/Outputglobal/index.html <em>Haskell Reference</em>] by Miloslav Nic.
+
This book will take you on a voyage through all the steps involved in data analysis. It provides synergy between Haskell and data modeling, consisting of carefully chosen examples featuring some of the most popular machine learning techniques.
<li>[http://www.cs.uu.nl/~afie/haskell/tourofprelude.html <em>A Tour of the Haskell Prelude</em>] by Bernie Pope and Arjan van IJzendoorn.
 
<li>[http://www.cse.unsw.edu.au/~paull/cs1011/inbuilt.html <em>Useful Haskell functions</em>]
 
An explanation for beginners of many Haskell functions that are predefined in the Haskell Prelude.
 
</ul>
 
   
  +
You will begin with how to obtain and clean data from various sources. You will then learn how to use various data structures such as trees and graphs. The meat of data analysis occurs in the topics involving statistical techniques, parallelism, concurrency, and machine learning algorithms, along with various examples of visualizing and exporting results. By the end of the book, you will be empowered with techniques to maximize your potential when using Haskell for data analysis.
   
=== Motivation for Using Haskell ===
 
  +
The [https://github.com/BinRoot/Haskell-Data-Analysis-Cookbook GitHub public repository] contains over 130 practical recipes to accompany every chapter of the book. Use it as a Swiss Army Knife of algorithms and code snippets. Try a recipe a day, like a kata for your mind.
<UL>
 
<LI>[http://www.md.chalmers.se/~rjmh/Papers/whyfp.html <EM>Why Functional Programming Matters</EM>] by [http://www.md.chalmers.se/~rjmh/ John Hughes], The Computer Journal, Vol. 32, No. 2, 1989, pp. 98 - 107. Also in: David A. Turner (ed.): Research Topics in Functional Programming, Addison-Wesley, 1990, pp. 17 - 42.<BR>
 
Exposes the advantages of functional programming languages.
 
Demonstrates how higher-order functions and lazy evaluation enable new forms
 
of modularization of programs.
 
   
<LI>
 
  +
<dt>Samuli Thomasson: [[Image: HaskellHighPerformanceProgramming.png‎|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/haskell-high-performance-programming Haskell High Performance Programming Book], ISBN 139781786464217, Paperback, 408 pages Packt, September 2016
[http://www.cs.ukc.ac.uk/pubs/1997/224/index.html <EM>Higher-order + Polymorphic = Reusable</EM>] by [http://www.cs.ukc.ac.uk/people/staff/sjt/index.html Simon Thompson]. Unpublished, May 1997.<BR>
 
  +
<dd>
<STRONG>Abstract:</STRONG>
 
  +
<B>Book Description</B><BR>
This paper explores how certain ideas in object oriented languages have their correspondents in functional languages. In particular we look at the analogue of the iterators of the C++ standard template library. We also give an example of the use of constructor classes which feature in Haskell 1.3 and Gofer.
 
  +
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.
  +
Learn to use parallelism and explore the concept of streaming. This book demonstrates the benefits of running multithreaded and concurrent applications. Next it will guide you through various profiling tools that will help you identify performance issues in your program.
   
</UL>
 
   
===Analysis and Design Methods===
 
  +
<dt> Ryan Lemmer: [[Image:Haskell Design Patterns.png|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/haskell-design-patterns/?utm_source=GC-wiki.haskell.org&utm_medium=pod&utm_campaign=178398872X Haskell Design Patterns], Paperback: 166 pages, Packt, November 2015, English, ISBN-10: 1-783-98872-X, ISBN-13: 9781783988723
  +
<dd>
  +
<B>Book Description</B><BR>
  +
Design patterns and idioms can widen our perspective by showing us where to look, what to look at, and ultimately how to see what we are looking at. At their best, patterns are a shorthand method of communicating better ways to code (writing less, more maintainable, and more efficient code).
   
<ul>
 
  +
This book starts with Haskell 98 and through the lens of patterns and idioms investigates the key advances and programming styles that together make "modern Haskell". Your journey begins with the three pillars of Haskell. Then you'll experience the problem with Lazy I/O, together with a solution. You'll also trace the hierarchy formed by Functor, Applicative, Arrow, and Monad. Next you'll explore how Fold and Map are generalized by Foldable and Traversable, which in turn is unified in a broader context by functional Lenses. You'll delve more deeply into the Type system, which will prepare you for an overview of Generic programming. In conclusion you go to the edge of Haskell by investigating the Kind system and how this relates to Dependently-typed programming.
<li>[http://www.cs.ukc.ac.uk/pubs/2001/1152/index.html <em>FAD: A Functional Analysis and Design Methodology</em>] by Dan Russell.
 
Phd thesis, Computing Laboratory, University of Kent at Canterbury, January 2001.<br>
 
<STRONG>Abstract:</STRONG>
 
This thesis presents the functional analysis and design methodology FAD. By functional we mean that it naturally supports
 
software development within the functional programming paradigm (FP).
 
<p>
 
Every popular methodology has a graphical modelling language which presents various pictorial representations of a
 
system. FAD's modelling language provides the typical elements of functional programming, types and functions, plus
 
elements to support modular development such as modules, subsystems and two forms of signature which specify an
 
interface or a behavioural requirement. The language also includes relationships and associations between these
 
elements, and provides simple representations of functional designs. The methodology has an integrated set of techniques
 
which guide the development of an implementable solution from the deliverables of requirements engineering. FAD's data
 
dictionary provides an organised repository for entities during and after development.
 
<p>
 
The thesis thus provides a development medium which has hitherto been absent from the functional programming paradigm.
 
</ul>
 
   
  +
<dt> James Church: [[Image:Learning_Haskell_Data_Analysis_cov.png|frameless|right|70px|Cover]] [https://www.packtpub.com/big-data-and-business-intelligence/learning-haskell-data-analysis/?utm_source=GCwiki.haskell.org&utm_medium=pod&utm_campaign=1784394707 Learning Haskell Data Analysis], Paperback: 198 pages, Packt, May 2015, English, ISBN-10: 1-784-39470-7, ISBN-13: 9781784394707
  +
<dd>
  +
<B>Book Description</B><BR>
  +
This book provides you with the skills to handle large amounts of data, even if that data is in a less than perfect state. Each chapter in the book helps to build a small library of code that will be used to solve a problem for that chapter.
   
=== Teaching Haskell ===
 
  +
The book starts with creating databases out of existing datasets, cleaning that data, and interacting with databases within Haskell in order to produce charts for publications. It then moves towards more theoretical concepts that are fundamental to introductory data analysis, but in a context of a real-world problem with real-world data. As you progress in the book, you will be relying on code from previous chapters in order to help create new solutions quickly. By the end of the book, you will be able to manipulate, find, and analyze large and small sets of data using your own Haskell libraries.
<UL>
+
</dt>
<LI>
 
[http://www.cs.ukc.ac.uk/pubs/1997/208/index.html <EM>Where do I begin? A problem solving approach to teaching functional programming</EM>]
 
by [http://www.cs.ukc.ac.uk/people/staff/sjt/index.html Simon Thompson].
 
In Krzysztof Apt, Pieter Hartel, and Paul Klint, editors, First International Conference on Declarative Programming Languages in Education. Springer-Verlag, September 1997.
 
<BR>
 
<STRONG>Abstract:</STRONG>
 
This paper introduces a problem solving method for teaching functional programming, based on Polya's `How To Solve It', an introductory investigation of mathematical method. We first present the language independent version, and then show in particular how it applies to the development of programs in Haskell. The method is illustrated by a sequence of examples and a larger case study.
 
   
<LI>
 
  +
<dt> Julien Dehos: [[Image:Book-ellipses-jd.jpg|frameless|right|70px|Cover]] [https://www.editions-ellipses.fr/programmation-fonctionnelle-introduction-applications-haskell-lusage-letudiant-developpeur-p-13083.html La programmation fonctionnelle - Introduction et applications en Haskell à l'usage de l'étudiant et du développeur], 264 pages, Ellipses Références sciences, 2019, French, ISBN: 9782340028777
[http://www.cs.ukc.ac.uk/pubs/1995/214/index.html <EM>Functional programming through the curriculum</EM>] by
 
  +
<dd>
[http://www.cs.ukc.ac.uk/people/staff/sjt/index.html Simon Thompson]and Steve Hill.
 
  +
Ce livre a pour objectif d’initier à la programmation fonctionnelle en général et au langage Haskell en particulier ; ceci de façon réellement exploitable. Il en présente les principales notions ainsi que différentes applications (intelligence artificielle pour des jeux, application web, convertisseur de fichiers textes, etc.). Enfin, il indique comment mettre en oeuvre le style fonctionnel dans des langages comme C++ et JavaScript.
In Pieter H. Hartel and Rinus Plasmeijer, editors, Functional Programming
 
  +
</dt>
Languages in Education, LNCS 1022, pages 85-102. Springer-Verlag, December 1995.
 
<BR>
 
<STRONG>Abstract:</STRONG>
 
This paper discusses our experience in using a functional language in topics across the computer science curriculum. After examining the arguments for taking a functional approach, we look in detail at four case studies from different areas: programming language semantics, machine architectures, graphics and formal languages.
 
</UL>
 
   
  +
</DL>
   
=== Proving Program Correctness ===
 
  +
===Foundations===
   
<UL>
+
<DL>
<LI>
+
<DT>[[Image:TaPL.jpg|frameless|right|Cover]]
[http://www.cs.ukc.ac.uk/pubs/1992/123/index.html <EM>Formulating Haskell</EM>] by
+
[http://www.amazon.com/Types-Programming-Languages-Benjamin-Pierce/dp/0262162091/ref=pd_sim_b_4/104-0009163-6568732 Types and Programming Languages] by Benjamin C. Pierce. 645 pages, The MIT Press, (February 1, 2002), English. ISBN 0262162091
[http://www.cs.ukc.ac.uk/people/staff/sjt/index.html Simon Thompson].
+
<DD>From the cover:<BR>
Technical Report 29-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1992.
+
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 systems--and of programming languages from a type-theoretic perspective-has important applications in software engineering, language design, high-performance 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 lambda-calculus, 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 object-oriented languages.
<BR>
 
<STRONG>Abstract:</STRONG>
 
The functional programming language Haskell is examined from the point of view of proving programs correct. Particular features explored include the data type definition facilities, classes, the behaviour of patterns and guards and the monad approach to IO in the Glasgow Haskell compiler.
 
</UL>
 
   
===Debugging Programs===
 
  +
<DT>[[Image:Advanced_TaPL.jpg|frameless|right|Cover]] [http://www.amazon.com/Advanced-Topics-Types-Programming-Languages/dp/0262162288/ref=pd_sim_b_1/104-0009163-6568732 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>
  +
From the cover:<BR>
  +
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 low-level 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 ML-style 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.
   
<UL>
 
  +
<DT>[http://www-2.cs.cmu.edu/~rwh/plbook/ Programming Languages: Theory and Practice] by Robert Harper. (Draft).
<LI>[http://www.cs.mu.oz.au/~bjpop/thesis.ps.gz <EM>Buddha: A Declarative Debugger for Haskell</EM>] by [http://www.cs.mu.oz.au/~bjpop/ Bernie Pope]. Honours Thesis.
 
  +
<DD>A working draft of a planned book on the theoretical foundations of practical programming languages.
<li>[http://www-users.cs.york.ac.uk/~olaf/PUBLICATIONS/frejaHatHood.html <em>Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs</em>] by Olaf Chitil, Colin Runciman and Malcolm Wallace.
 
Proceedings of the 12th International Workshop on Implementation of Functional
 
Languages, 2001.<br>
 
<STRONG>Abstract:</STRONG>
 
In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in
 
practice by applying them to a number of moderately complex programs in which errors had deliberately been introduced. We identify the
 
strengths and weaknesses of each system and then form ideas on how the systems can be improved further.
 
<LI>[http://www.cs.mu.oz.au/~lee/papers/dd.html Papers on declarative debugging]
 
</UL>
 
   
===Using Monads===
 
  +
<DT>[http://homepages.cwi.nl/~jve/cs/ Computational Semantics and Type Theory]
<UL>
 
  +
by Jan van Eijck. Draft.
<LI>[http://www.nomaware.com/monads/html/ <EM>All About Monads</EM>] by Jeff Newbern<br>
 
  +
<DD>[http://www.cwi.nl/~jve/cs/cs.pdf Text online].
This tutorial aims to explain the concept of a monad and its
 
application to functional programming in a way that is easy to
 
understand and useful to beginning and intermediate Haskell
 
programmers. Familiarity with the Haskell language is assumed, but no
 
prior experience with monads is required.
 
<LI>[http://www.dcs.gla.ac.uk/~nww/Monad.html <EM>What the hell are Monads?</EM>] by Noel Winstanley<BR>
 
A basic introduction to monads, monadic programming and IO.
 
This introduction is presented by means of examples rather than theory, and assumes a little knowledge of
 
Haskell.
 
<LI>[http://www.engr.mun.ca/~theo/Misc/haskell_and_monads.htm <EM>Monads for the Working Haskell Programmer -- a short tutorial</EM>]
 
by Theodore Norvell.<BR>
 
<LI>[http://www-fp.dcs.st-and.ac.uk/~kh/papers/io-tutorial/io-tutorial.html <EM>Monadic I/O in Haskell 1.3</EM>] by Andrew Gordon and Kevin Hammond.<BR>
 
<STRONG>Abstract:</STRONG>
 
We describe the design and use of monadic I/O in Haskell 1.3, the latest revision of the lazy
 
functional programming language Haskell. Haskell 1.3 standardises the monadic I/O
 
mechanisms now available in many Haskell systems. The new facilities allow fairly sophisticated
 
text-based application programs to be written portably in Haskell. The standard provides
 
implementors with a flexible framework for extending Haskell to incorporate new language
 
features. Apart from the use of monads, the main advances over the previous standard are:
 
character I/O based on handles (analogous to ANSI C file pointers), an error handling
 
mechanism, terminal interrupt handling and a POSIX interface. Apart from a tutorial description
 
of the new facilities we include a worked example: a derived monad for combinator parsing.
 
<!-
 
"http://www.engr.uconn.edu/~jeffm/FuncProg/Papers/monad.html" Monads Made Easy by Ahmed Hammad
 
From the Introduction:
 
This paper is designed to help others who want to know about Monads, but don't want an overly technical
 
explanation. Here I explain the basics, what monads are, what they are good for, and how to employ them. I do this
 
by writing a simple exception handling system in Haskell using these features.
 
->
 
<LI>[http://cm.bell-labs.com/cm/cs/who/wadler/topics/monads.html#monadsdeclare <EM>How to Declare an Imperative</EM>] by [http://cm.bell-labs.com/cm/cs/who/wadler/ Philip Wadler], International Logic Programming Symposium '95, MIT Press, 1995.
 
An extended version will appear in ACM Computing Surveys.<BR>
 
<STRONG>Abstract:</STRONG>
 
This tutorial describes the use of a <em>monad</em> to integrate
 
interaction into a purely declarative language. This technique has
 
been implemented in the higher-order functional language Haskell. A
 
sketch is given of how it might be added to a first-order language for
 
logic programming.
 
   
<LI>[http://cm.bell-labs.com/cm/cs/who/wadler/topics/monads.html#marktoberdorf <EM>Monads for functional programming</EM>] by [http://cm.bell-labs.com/cm/cs/who/wadler/ Philip Wadler], Marktoberdorf Summer School on Program Design Calculi,
 
  +
<DT>[http://www.cs.man.ac.uk/~pt/stable/Proofs+Types.html Proofs and Types]
Springer Verlag, NATO ASI Series F: Computer and systems sciences,
 
  +
by Jean-Yves Girard translated and with appendices by Paul Taylor and Yves Lafont.
Volume 118, August 1992.<BR>
 
  +
<DD>
<STRONG>Abstract:</STRONG>
 
  +
Based on a short graduate course on typed lambda-calculus given at the Universit Paris VII in the autumn term of 1986-7.
The use of monads to structure functional programs is described.
 
Monads provide a convenient framework for simulating effects found in
 
other languages, such as global state, exception handling, output, or
 
non-determinism. Three case studies are looked at in detail: how
 
monads ease the modification of a simple evaluator; how monads act as
 
the basis of a datatype of arrays subject to in-place update; and how
 
monads can be used to build parsers.
 
   
<li>[http://www.research.avayalabs.com/user/wadler/topics/monads.html <em>Comprehending monads</em>] by [http://cm.bell-labs.com/cm/cs/who/wadler/ Philip Wadler], Mathematical Structures in Computer Science, Special issue of selected papers from 6'th Conference on Lisp and Functional Programming, 2:461-493, 1992. <br>
 
  +
<DT>[http://www.cs.uu.nl/wiki/Techno/ProgrammingLanguageTheoryTextsOnline Programming language theory texts online]
<strong>Abstract:</strong>
 
  +
<DD>
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra.
 
  +
Collection of online programming language theory texts maintained by Frank Atanassow
Functional programmers invented list comprehensions in the 1970's to concisely express certain programs
 
involving lists. This paper shows how list comprehensions may be generalised to an arbitrary monad, and
 
how the resulting programming feature can concisely express in a pure functional language some programs
 
that manipulate state, handle exceptions, parse text, or invoke continuations. A new solution to the old
 
problem of destructive array update is also presented. No knowledge of category theory is assumed.
 
   
<LI>[http://cm.bell-labs.com/cm/cs/who/wadler/topics/monads.html#combining-monads <EM>Combining monads</EM>] by [http://cm.bell-labs.com/cm/cs/who/wadler/ Philip Wadler], Glasgow Workshop on Functional Programming, Springer Verlag Workshops in Computing Series,
 
  +
<DT>[http://www.cs.chalmers.se/Cs/Research/Logic/book/ Programming in Martin-Löf's Type Theory: An Introduction] by Bengt Nordström, Kent Petersson and Jan M. Smith. 1990.
Ayr, July 1992.<BR>
 
  +
<DD>
<STRONG>Abstract:</STRONG>
 
Monads provide a way of structuring functional programs. Most real
 
applications require a combination of primitive monads. Here we
 
describe how some monads may be combined with others to yield a
 
<em>combined monad</em>.
 
   
<LI>[http://www.cs.nott.ac.uk/Department/Staff/gmh/bib.html#monparsing <EM>Monadic Parser Combinators</EM>] by <A NAME="Hutton&Meijer96 Graham Huttonand Erik Meijer],
 
  +
</DL>
Technical report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996.
 
A condensed version of this report will appear as a functional pearl in JFP.<BR>
 
Besides being a tutorial on parser combinators it is also an introduction to monads in general.
 
   
</UL>
 
  +
===Monadic Programming===
   
<h3><a name="purity Side Effects in a Pure Language]</h3>
 
  +
<DL>
   
<ul>
 
  +
<DT>[[Image:Coperta5.jpg|frameless|right|75px|Haskell - PIM]] [[Practica_interpretarii_monadice|Practical monadic interpretation]] by Dan Popa , Language: Romanian
<li>[http://research.microsoft.com/Users/simonpj/papers/marktoberdorf/ <em>Tackling the Awkward Squad: monadic I/O, concurrency, exceptions, and foreign-language calls in Haskell</em>] by Simon Peyton Jones<br>
 
This tutorial focuses on explaining the "bits round the edges" of Haskell programs, rather than the beautiful functional core we all know and love. More specifically, it gives, in a single framework, an account of
 
<ul>
 
<li>monadic input/output (the I/O monad)
 
<li>concurrency (threads, MVars)
 
<li>exceptions (both synchronous and asynchronous)
 
<li>foreign language interfaces
 
</ul>
 
The common feature of all of these is, of course, the ubiquitous I/O monad. All except the first (basic I/O) involve proposed extensions to Haskell that are implemented in GHC, and I have tried hard to make the tutorial use exactly the same function names as GHC does. All of the extensions are described in conference papers (also available from my home page), but these papers are not tutorials, and were written with varying nomenclature over a period of several years. I hope that this tutorial gives a more comprehensible overview of the big picuture, using a common vocabulary.
 
   
</ul>
+
<DD>
  +
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.
   
=== Data Structures ===
 
  +
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.
<UL>
 
<LI>[http://www.cs.columbia.edu/~cdo/ Chris Okasaki]: [http://www.cup.org/Titles/63/0521631246.html <EM>Purely Functional Data Structures</EM>], 232 pp., Cambridge University Press, 1998. ISBN 0-521-63124-6<BR>
 
From the cover:
 
<BLOCKQUOTE>
 
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 self-study.
 
   
[http://www.cs.columbia.edu/~cdo/pfds-haskell.tar.gz Haskell source code for the book]
 
  +
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.
</BLOCKQUOTE>
 
<LI><EM>[http://www.iis.sinica.edu.tw/~trc/icfp96.ps A probabilistic approach to the problem of automatic selection of data representations]</EM> by
 
Tyng-Ruey Chuang and Wen L. Hwang, In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, pages 190-200. Philadephia, Pennsylvania, USA, May 1996.
 
</UL>
 
   
<H4>Collections</H4>
 
  +
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!
   
<UL>
 
  +
Simon P.J.
<LI>[http://www.dcs.gla.ac.uk/fp/workshops/fpw96/Proceedings96.html#PeytonJones <EM>Bulk types with class</EM>] by Simon Peyton Jones, (electronic) proceedings of the 1996 Glasgow Functional Programming Workshop.
 
  +
</DL>
<BR>
 
<STRONG>Abstract:</STRONG>
 
Bulk types - such as lists, bags, sets, finite maps, and priority queues - are ubiquitous in programming. Yet many languages don't support them well, even though they have received a great deal of attention, especially from the database community. Haskell is currently among the culprits.
 
This paper has two aims: to identify some of the technical difficulties, and to attempt to address them using Haskell's constructor classes.
 
</UL>
 
   
<H4>List-like data structures</H4>
 
  +
===Mathematics===
   
<UL>
 
  +
See [[Books and tutorials/Mathematics]]
<LI><EM>Functional Data Structures</EM> by Chris Okasaki. [http://www.cse.ogi.edu/PacSoft/summerschool96.html <EM>Advanced Functional Programming</EM>], Second International Summer School on Advanced Functional Programming Techniques, Evergreen State College, WA, USA, LNCS 1126, 1996 (editors: J. Launchbury, E. Meijer, T. Sheard), p.&nbsp;131-158.
 
<LI><EM>[http://foxnet.cs.cmu.edu/people/cokasaki/papers.html#random-access Purely Functional Random-Access Lists]</EM> by Chris Okasaki. Functional Programming Languages and Computer Architecture, June 1995, pages 86-95.
 
<LI><EM>[http://foxnet.cs.cmu.edu/people/cokasaki/papers.html#queues Simple and Efficient Purely Functional Queues and Deques]</EM> by Chris Okasaki. Journal of Functional Programming, 5(4):583-592, October 1995.
 
<LI><EM>[http://foxnet.cs.cmu.edu/people/cokasaki/papers.html#priority Optimal Purely Functional Priority Queues]</EM> by Gerth St&oslash;lting Brodal and Chris Okasaki, Journal of Functional Programming, 6(6), December 1996.
 
<LI><EM>[http://www.iis.sinica.edu.tw/~trc/fpca93.ps Real-time deques, multihead Turing machines, and purely functional programming.]</EM> by Tyng-Ruey Chuang and Benjamin Goldberg, In Conference on Functional Programming Languages and Computer Architecture, pages 289-298. Copenhagen, Denmark, June 1993. ACM Press.
 
</UL>
 
   
==== Arrays ====
+
===Miscellaneous===
<UL>
 
<LI><EM>[http://www.iis.sinica.edu.tw/~trc/lfp94.ps A randomized implementation of multiple functional arrays]</EM> by Tyng-Ruey Chuang, In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pages 173-184. Orlando, Florida, USA, June 1994.
 
<LI><EM>Fully persistent arrays for efficient incremental updates and voluminous reads</EM> by Tyng-Ruey Chuang.
 
In Bernd Krieg-Brueckner, editor, 4th European Symposium on Programming,
 
pages 110-129. Rennes, France, February 1992. LNCS 582. Springer-Verlag.
 
</UL>
 
   
==== Graphs ====
 
  +
[[Real World #haskell]]
<UL>
 
<LI><EM>Graph Algorithms with a Functional Flavour</EM> by [http://www.cse.ogi.edu/~jl/ John Launchbury], Advanced Functional Programming, First International Spring
 
School on Advanced Functional Programming Techniques, Bastad, Sweden, LNCS 925,p.&nbsp;308-331, 1995 (editors: J. Jeuring, E. Meijer).
 
   
<LI>[http://www.cse.ogi.edu/~jl/biblio-functional.html <EM>Structuring Depth First Search Algorithms in Haskell</EM>] by David King and [http://www.cse.ogi.edu/~jl/ John Launchbury].
 
  +
===Videos===
Proc. ACM Principles of Programming Languages, San Francisco, 1995.<BR>
 
<STRONG>Abstract:</STRONG>
 
Depth-first search is the key to a wide variety of graph algorithms.
 
In this paper we express depth-first search in a lazy functional
 
language, obtaining a linear-time implementation. Unlike traditional
 
imperative presentations, we use the structuring methods of functional
 
languages to construct algorithms from individual reusable components.
 
This style of algorithm construction turns out to be quite amenable to
 
formal proof, which we exemplify through a calculational-style proof
 
of a far from obvious strongly-connected components algorithm.
 
</UL>
 
   
==== Others ====
 
  +
<dt>Richard Cook : [[Image: Building-an-Application-with-Functional-Haskell-Video.png|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/building-application-functional-haskell-video Building an Application with Functional Haskell (Video)], ISBN13 9781787285088, Course Length 2 hours 9 minutes. Packt (August 2017)
  +
<dd>
  +
<B>Video Description</B><BR>
  +
This video is specifically aimed at anybody who knows the essentials of the Haskell programming language and who is interested in moving onto developing real programs that will make use of file I/O, command-line parsers and various third-party packages. This course will take you through the complete journey from writing your first Haskell program to getting familiarized with Haskell and all its functionalities.
   
<UL>
 
  +
<dt>Richard Cook : [[Image: Writing_Haskell_Programs.png|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/writing-haskell-programs-video Writing Haskell Programs (Video)], ISBN13 9781787283329, Video Length 2 hours and 43 minutes. Packt (May 2017)
<LI>[http://www.dcs.glasgow.ac.uk/jfp/bibliography/References/grantswz1996:143.html <EM>Sparse matrix representations in a functional language</EM>] by P.W. Grant, J.A. Sharp, M.F. Webster and X. Zhang, Journal of Functional Programming, 6(1):143-170, January 1996.<BR>
 
  +
<dd>
<STRONG>Abstract:</STRONG>
 
  +
<B>Video Description</B><BR>
This paper investigates several sparse matrix representation schemes and associated algorithms in Haskell for solving linear systems of equations arising from solving realistic computational fluid dynamics problems using a finite element algorithm. This work complements that of Wainwright and Sexton [J. Functional Programming, 2(1):61-72, 1992] in that a Choleski direct solver (with an emphasis on its forward/backward substitution steps) is examined. Experimental evidence comparing time and space efficiency of these matrix representation schemes is reported, together with associated forward/backward substitution implementations. Our results are in general agreement with Wainwright and Sexton's.
 
  +
This course builds on the foundations provided by the Fundamentals of Practical Haskell Programming course and helps to bridge the gap between introductory and advanced Haskell by teaching you how to manage and develop complex programs. We'll also dispel the myth that Haskell is only useful for toy programs.
</UL>
 
   
=== Parser Combinators ===
 
  +
<dt>Richard Cook : [[Image: Fundamentals_of_Practical_Haskell_Programming.png|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/fundamentals-practical-haskell-programming-video Fundamentals of Practical Haskell Programming (Video)], ISBN13 9781787288768, Video Length 2 hours and 59 minutes. Packt (March 2017)
  +
<dd>
  +
<B>Video Description</B><BR>
  +
This video course will take you through all the concepts of functional programming (FP) and Haskell language. First, we’ll address all the problems with FP and Haskell. Then we’ll help you distinguish the difference between FP and Haskell. We’ll then guide you through Haskell in depth. We’ll help you create your first Haskell program. You’ll then be given a brief insight into GHCi (Glasgow Haskell Compiler). Later we’ll explore the different values, expressions and programs in Haskell in depth.
   
<UL>
 
  +
<dt> [[Image: Haskell Data Analysis Made Easy.png|frameless|right|70px|Cover]] [https://www.packtpub.com/big-data-and-business-intelligence/haskell-data-analysis-made-easy Haskell: Data Analysis Made Easy], ISBN13 9781787283633, Course Length 7 hours 30 minutes. Packt (February 2017)
<LI><EM>How to Replace Failure by a List of Successes</EM> by <A NAME="Wadler85 Philip Wadler],
 
  +
<dd>
Functional Programming Languages and Computer Architecture, LNCS 201, 1985.
 
  +
<B>Course Description</B><BR>
<LI><EM>Higher-order functions for parsing</EM> by <A NAME="Hutton92 Graham Hutton],
 
  +
This course will introduce the basic concepts of Haskell and move on to discuss how Haskell can be used to solve the issues by using the real-world data.
J. Functional Programming 2(3):323-343, 1992.
 
  +
The course will guide you through the installation procedure, after you have all the tools that you require in place, you will explore the basic concepts of Haskell including the functions, and the data structures.
<LI>[http://www.cs.nott.ac.uk/Department/Staff/gmh/bib.html#monparsing <EM>Monadic Parser Combinators</EM>] by <A NAME="Hutton&Meijer96 Graham Huttonand Erik Meijer],
 
  +
With a good hold on the basics of Haskell and data analysis, you will then be introduced to advanced concepts of data analysis such as Kernel Density Estimation, Hypothesis testing, Regression analysis, text analysis, clustering, Naïve Bayes Classification, and Principal Component Analysis.
Technical report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996.
 
A condensed version of this report will appear as a functional pearl in JFP.<BR>
 
Besides being a tutorial on parser combinators it is also an introduction to monads in general.
 
<LI><EM>Functional Parsers</EM> by <A NAME="Fokker95 Jeroen Fokker],
 
First International Spring School on Advanced Functional Programming Techniques, LNCS 925, 1995.
 
<LI><EM>Predictive parser combinators need four values to report errors</EM> by <A NAME="Partridge&Wright96 Andrew Partridge, David Wright],
 
J. Functional Programming 6(2): 355-364, 1996.
 
<LI><EM>Combinators for parsing expressions</EM> by <A NAME="Hill96 Steve Hill],
 
J. Functional Programming 6(3):445-463, May 1996.
 
<LI>[http://www.cse.ogi.edu/PacSoft/summerschool96.html#Parsers <EM>Deterministic, Error-Correcting Combinator Parsers</EM>]
 
by <A NAME="Swierstra&Duponcheel96 S. Doaitse Swierstra and Luc Duponcheel], Second International Summer School on Advanced Functional Programming Techniques, LNCS 1126, 1996.
 
</UL>
 
   
===Schools on Advanced Funtional Programming===
 
  +
<dt>Samuel Gélineau : [[Image: Mastering Haskell Programming.png|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/mastering-haskell-programming-video Mastering Haskell Programming (Video)], ISBN13 9781786465016, Course Length 6 hours 4 minutes. Packt (February 2017)
  +
<dd>
  +
<B>Video Description</B><BR>
  +
In this course, you’ll discover different ways to structure interactions between the program and the outside world. We’ll look at some subtler aspects of the IO monad, such as lazy IO and unsafePerformIO. In addition to the IO monad, we’ll also check out two other structured forms of interaction: streaming libraries and functional reactive programming.
  +
Then we explore parallel, concurrent, and distributed programming. Thanks to purity, Haskell is especially well-suited for the first two, and so there are a number of approaches to cover. As for distributed programming, we focus on the idea of splitting a large monolithic program into smaller microservices, asking whether doing so is a good idea. We’ll also consider a different way of interacting with other microservices, and explore an alternative to microservices.
   
<EM>Advanced Functional Programming</EM>, First International Spring
 
  +
<dt>James Church : [[Image:Advanced_data.jpeg|frameless|right|70px|Cover]] [https://www.packtpub.com/big-data-and-business-intelligence/advanced-data-analysis-haskell-video Advanced Data Analysis with Haskell Video], ISBN13 9781785287237, Course Length 4 hours 4 minutes Packt, December 2016
School on Advanced Functional Programming Techniques, Bastad, Sweden, LNCS 925, Springer-Verlag, 1995 (editors: J. Jeuring, E. Meijer).
 
  +
<dd>
*<EM>Functional Parsers</EM> by Jeroen Fokker, p.&nbsp;1-23.
 
  +
<B>Video Description</B><BR>
*<EM>Monads for functional programming</EM> by Philip Wadler, p.&nbsp;24-52.
 
  +
In this video, you will be guided on how to find correlations in data, as well as multiple dependent variables. You will be given a theoretical overview of the types of regression and we’ll show you how to install the LAPACK and HMatrix libraries. By the end of the first part, you’ll be familiar with the application of N-grams and TF-IDF.
*<EM>The Design of a Pretty-printing Library</EM> by John Hughes, p.&nbsp;52-96.
 
  +
Once you’ve learned how to analyze data, the next step is organizing that data with the help of machine learning algorithms. You will be briefed on the mathematics and statistical theorems such as Baye’s law and its application, as well as eigenvalues and eigenvectors using HMatrix.
*<EM>Functional Programming with Overloading and Higher-Order Polymorphism</EM>, Mark P. Jones, p.&nbsp;97-136.
 
  +
By the end of this course, you’ll have an understanding of data analysis, different ways to analyze data, and the various clustering algorithms available. You’ll also understand Haskell and will be ready to write code with it.
*<EM>Programming with Fudgets</EM> by Thomas Hallgren and Magnus Carlsson, p.&nbsp;137-182.
 
*<EM>Constructing Medium Sized Efficient Functional Programs in Clean</EM> by Marko C.J.D. van Eekelen and Rinus J. Plasmeijer, p.&nbsp;183-227.
 
*<EM>Merging Monads and Folds for Functional Programming</EM> by Erik Meijer and Johan Jeuring, p.&nbsp;228-266.
 
*<EM>Programming with Algebras</EM> by Richard B. Kieburtz and Jeffrey Lewis, p.&nbsp;267-307.
 
*<EM>Graph Algorithms with a Functional Flavour</EM> by John Launchbury, p.&nbsp;308-331.
 
   
  +
<dt>Hakim Cassimally : [[Image: Learning_Haskell_Programming.jpeg|frameless|right|70px|Cover]] [https://www.packtpub.com/application-development/learning-haskell-programming Learning Haskell Programming Video], ISBN13 9781786465542, Course Length 4 hours 10 minutes Packt, December 2016
  +
<dd>
  +
<B>Video Description</B><BR>
  +
This video would begin with the fundamentals and building blocks of Haskell programming language with special emphasis on functional programming. It will be covering how Haskell variables, syntax work alongwith Haskell datatypes and functions.
  +
You will learn how to solve programming problems while creating an application with hands-on experience. You will then move on to learning writing expressions and high-order functions.
  +
At the end of the video, you will be able to build a complete application with Haskell alongwith learning the important functionalities.
   
[http://www.cse.ogi.edu/PacSoft/conf/summerschool96.html <EM>Advanced Functional Programming</EM>], Second International Summer School on Advanced Functional Programming Techniques, Evergreen State College, WA, USA, LNCS 1126, Springer-Verlag, 1996 (editors: J. Launchbury, E. Meijer, T. Sheard).
 
  +
<dt>James Church: [[Image: GettingStartedWithHaskellDataAnalysis1.png‎|frameless|right|70px|Cover]] [https://www.packtpub.com/big-data-and-business-intelligence/getting-started-haskell-data-analysis-video Getting Started with Haskell Data Analysis Video], Course Length: 3 hours 18 minutes, Packt, July 2016, English, ISBN-13: 9781785880841
*<EM>Composing the User Interface with Haggis</EM> by Sigbjorn Finne and Simon Peyton Jones, p.&nbsp;1-37.
 
  +
<dd>
*<EM>Haskore Music Tutorial</EM> by Paul Hudak, p.&nbsp;38-67.
 
  +
<B>Course Description</B><BR>
*<EM>Polytypic Programming</EM> by Johan Jeuring and Patrick Jansson, p.&nbsp;68-114.
 
  +
Data analysis is part computer science and part statistics. An important part of data analysis is validating your assumptions with real-world data to see if there is a pattern, or a particular user behavior that you can validate. This video course will help you get up to speed with the basics of data analysis and approaches in the Haskell language. You'll learn about statistical computing, file formats (CSV and SQLite3), descriptive statistics, charts, and onto more advanced concepts like understanding the importance of normal distribution. Whilst mathematics is a big part of data analysis, we’ve tried to keep this course simple and approachable so that you can apply what you learn to the real world.
*<EM>Implementing Threads in Standard ML</EM> by Peter Lee, p.&nbsp;115-130.
 
*<EM>Functional Data Structures</EM> by Chris Okasaki, p.&nbsp;131-158.
 
*<EM>Heap Profiling for Space Efficiency</EM> by Colin Runciman and Niklas R&ouml;jemo, p.&nbsp;159-183.
 
*<EM>Deterministic, Error-Correcting Combinator Parsers</EM> by S. Doaitse Swierstra and Luc Duponcheel, p.&nbsp;184-207.
 
*<EM>Essentials of Standard ML Modules</EM> by Mads Tofte, p.&nbsp;208-238.
 
   
[http://alfa.di.uminho.pt/~afp98/ Advanced Functional Programming, Third International School, AFP'98],
 
  +
==Joke==
in Braga, Portugal from 12th to 19th September 1998, LNCS 1608, Springer-Verlag, 1999
 
(editors: D. Swierstra, P. Henriques and J. Oliveira).<BR>
 
All lecture notes and further material are available from the web site.
 
   
  +
<DL>
  +
<dt>[[Image:FunctionalIkamusume.jpg|frameless|right|70px|Cover]] Team "Referential Transparent Sea Keepers": [http://www.paraiso-lang.org/ikmsm/ <em>Functional Ikamusume</em>]
  +
[http://www.paraiso-lang.org/ikmsm/books/index.html <em>book series</em>], Japanese
  +
<dd><B>Book Description</B><BR>
  +
Functional Ikamusume book series provides a forum for researchers, developers, and anime-watchers to publish their latest work, articles, and “mousou (妄想)” on the design, implementations, principles, and uses of functional programming and Ikamusume. The book series covers the entire spectrum of work, from practice to theory, from frank introduction of functional programming to latest research work, from Ikamusume with some functional flavor to functional programming with some Ikamusume flavor. Let’s enjoy writing articles on functional programming in frank “geso” style de-geso!!
   
== Foundations ==
 
  +
Past books are written entirely in Japanese, and books are planned to be sold in Japan, but we also accept articles in English. For more information on functional Ikamusume, see the links above (all in Japanese), or ask @xhl_kogitsune or [http://www.paraiso-lang.org/ikmsm/members.html "other members"] on twitter, or xhlkogitsune on Skype. You don’t have to be worried about what is Functional Ikamusume —— she is just Ikamusume who loves functional programming, as you love it.
<ul>
 
  +
<li>Paul Taylor: [http://www.dcs.qmul.ac.uk/~pt/Practical_Foundations/ Practical Foundations of Mathematics]<br>
 
  +
If you are interested in writing Functional Ikamusume articles, please contact xhlkogitsune on Skype or the authors on twitter. You can use Japanese or English for discussion. A text chat room is on Skype, and I’ll invite you to the chat room. While the chat is currently in Japanese, most participants can read/write English.
Cambridge University Press, ISBN: 0-521-63107-6, xii+576 pages, September 2000.
 
  +
<li>Michael Barr and Charles Wells: [http://www.cwru.edu/artsci/math/wells/pub/ttt.html Toposes, Triples and Theories]<br>
 
  +
</DL>
The revised version of their
 
formerly Springer Verlag published book is
 
online for free download. Note that they use the name <em>triple</em> instead of <em>monad</em>.
 
</ul>
 

Latest revision as of 23:54, 19 January 2020

Books covering many aspects of Haskell.

Language and library definition

Cover

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.

Textbooks

John Whitington :
Cover
Haskell from the Very Beginning, ISBN13 9780957671133, Paperback/eBook: 216 pages. Coherent Press (October 2019)

Book Description
In Haskell from the Very Beginning John Whitington takes a no-prerequisites approach to teaching the basics of a modern general-purpose programming language. Each small, self-contained chapter introduces a new topic, building until the reader can write quite substantial programs. There are plenty of questions and, crucially, worked answers and hints.

Haskell from the Very Beginning will appeal both to new programmers, and to experienced programmers eager to explore functional languages such as Haskell. It is suitable both for formal use within an undergraduate or graduate curriculum, and for the interested amateur.

Vitaly Bragilevsky :
Cover
Haskell in Depth, ISBN13 9781617295409, Paperback/eBook: 625 pages (estimated). Manning Publications (Fall 2019, estimated)

Book Description
Haskell in Depth is the perfect second book on Haskell. After a quick refresher on Haskell basics, this hands-on guide dives into examples and application scenarios designed to teach how Haskell works and how to apply it correctly. You’ll learn about managing projects with Cabal and Stack, tackle error-handling and testing, and package programs and libraries for production deployment.

You’ll appreciate coverage of advanced Haskell features including programming polymorphically, working effectively with types, concurrent programming, data processing, web services, and more. Because it’s organized to make specific topics easy to find, you’ll return to this book again and again as your go-to Haskell reference.

Will Kurt :
Cover
Get Programming with Haskell, ISBN13 9781617293764, Paperback/eBook: 616 pages. Manning Publications (March 2018)

Book Description
Get Programming with Haskell leads you through short lessons, examples, and exercises designed to make Haskell your own. It has crystal-clear illustrations and guided practice. You will write and test dozens of interesting programs and dive into custom Haskell modules. You will gain a new perspective on programming plus the practical ability to use Haskell in the everyday world. (The 80 IQ points: not guaranteed!)

Cover
Alejandro Serrano Mena: Beginning Haskell, Paperback / eBook: 498 pages, Apress (January 2014), English, ISBN: 978-1-43026-250-3

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.

Cover
Miran Lipovača: Learn You a Haskell for Great Good!, Paperback: 360 pages, No Starch Press (April 2011), English, ISBN: 978-1-59327-283-8

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.

Cover
Graham Hutton: Programming in Haskell, Paperback: 318 pages, 120 exercises, Cambridge University Press (September 1, 2016), English, ISBN-13: 978-1316626221

Book Description
This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and example code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable and traversable types.

Cover
Bryan O'Sullivan, Don Stewart, and John Goerzen: Real World Haskell, Paperback: 700 pages, O'Reilly, November 2008, English, ISBN-10: 0596514980, ISBN-13: 978-0596514983

See Real World Haskell.


Cover
Simon Marlow: Parallel and Concurrent Programming in Haskell, Paperback: 322 pages, O'Reilly, August 2013, English, ISBN-10: 1449335942, ISBN-13: 978-1449335946

Book Description
If you have a working knowledge of Haskell, this hands-on book shows you how to use the language’s many APIs and frameworks for writing both parallel and concurrent programs. You’ll learn how parallelism exploits multicore processors to speed up computation-heavy programs, and how concurrency enables you to write programs with threads for multiple interactions.

Author Simon Marlow walks you through the process with lots of code examples that you can run, experiment with, and extend. Divided into separate sections on Parallel and Concurrent Haskell, this book also includes exercises to help you become familiar with the concepts presented:

  • Express parallelism in Haskell with the Eval monad and Evaluation Strategies
  • Parallelize ordinary Haskell code with the Par monad
  • Build parallel array-based computations, using the Repa library
  • Use the Accelerate library to run computations directly on the GPU
  • Work with basic interfaces for writing concurrent code
  • Build trees of threads for larger and more complex programs
  • Learn how to build high-speed concurrent network servers
  • Write distributed programs that run on multiple machines in a network


Cover
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.

Cover
Simon Thompson: Haskell: The Craft of Functional Programming, Second Edition, Addison-Wesley, 507 pages, paperback, 1999. ISBN 0-201-34275-8.

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 built-in 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 high-order 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 built-in 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.

Cover
Richard Bird: Thinking Functionally with Haskell, Cambridge University Press, 2014, 354 pp., ISBN-10: 1107452643, ISBN-13: 978-1107452640.

Richard Bird is famed for the clarity and rigour of his writing. His new textbook, which introduces functional programming to students, emphasises fundamental techniques for reasoning mathematically about functional programs. By studying the underlying equational laws, the book enables students to apply calculational reasoning to their programs, both to understand their properties and to make them more efficient. The book has been designed to fit a first- or second-year undergraduate course and is a thorough overhaul and replacement of his earlier textbooks. It features case studies in Sudoku and pretty-printing, and over 100 carefully selected exercises with solutions.

Cover
Antony Davie: An Introduction to Functional Programming Systems Using Haskell, Cambridge University Press, 1992. ISBN 0-521-25830-8 (hardback). ISBN 0-521-27724-8 (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

Cover
Fethi Rabhi and Guy Lapalme: Algorithms: A functional programming approach,

Addison-Wesley, 235 pages, paperback, 1999. ISBN 0-201-59604-0

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 self-contained 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 problem-solving skills which can be easily transferred to other language paradigms. It also introduces the idea of capturing algorithmic design strategies (e.g. Divide-and-Conquer, Dynamic Programming) through higher-order functions.
Target audience
The book is intended for computer science students taking algorithms and/or (basic or advanced) functional programming courses.

Cover
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 self-study. 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, Prentice-Hall, 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 non-strict functional languages using lazy graph reduction. The emphasis of the book is on building working prototypes of several functional language implementations (template- instantiation, G-Machine, TIM, parallel G-Machine. 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.

Cover
Simon Thompson: Type Theory and Functional Programming, Addison-Wesley, 1991. ISBN 0-201-41667-0. 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.

Cover
Claudio Cesar de Sá and Marcio Ferreira da Silva: Haskell: Uma Abordagem Prática, Novatec Editora Ltda., 2006, 296 pages, ISBN 85-7522-095-0. 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, Winhugs-2001 for download, and so on. This page is Portuguese.

Cover
Blas C. Ruiz, Francisco Gutiérrez, Pablo Guerrero y José E. Gallardo. Razonando con Haskell, Thompson 2004. ISBN 84-9732-277-0. 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.

Cover
Haskell Primer: The first functional language to learn. Jun Mukai. In Japanese. Yen 2,730.

Cover
Practical Haskell Programming, Minero Aoki and Nobuo Yamashita. A primer on functional programming for real world programs. In Japanese. Yen 2,940.

Cover
Purely Functional Data Structures Chris Okasaki, 232 pp., Cambridge University Press, 1998. ISBN 0-521-63124-6

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 self-study. Haskell source code for the book

Функциональное программирование на языке Haskell

Справочник по языку Haskell

Практика работы на языке Haskell

14 занимательных эссе о языке Haskell и функциональном программировании

Cover
Introducere in Haskell 98 prin exemple : Dan Popa, 230 pp., Edusoft Bacau, Romania, (Ian, 31, 2007),Romanian, ISBN 978-973-8934-48-1

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 simultaneously 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.

James Church :
Cover
Getting Started with Haskell Data Analysis, ISBN13 9781789802863, Paperback/eBook: 160 pages. Packt October 2018)

Book Description
Every business and organization that collects data is capable of tapping into its own data to gain insights how to improve. Haskell is a purely functional and lazy programming language, well-suited to handling large data analysis problems. This book will take you through the more difficult problems of data analysis in a hands-on manner.

This book will help you get up-to-speed with the basics of data analysis and approaches in the Haskell language. You'll learn about statistical computing, file formats (CSV and SQLite3), descriptive statistics, charts, and progress to more advanced concepts such as understanding the importance of normal distribution. While mathematics is a big part of data analysis, we've tried to keep this course simple and approachable so that you can apply what you learn to the real world.

By the end of this book, you will have a thorough understanding of data analysis, and the different ways of analyzing data. You will have a mastery of all the tools and techniques in Haskell for effective data analysis.

Yogesh Sajanikar :
Cover
Haskell Cookbook, ISBN13 9781786461353, Paperback/eBook: 396 pages. Packt (September 2017)

Book Description
Haskell Cookbook provides recipes that start by illustrating the principles of functional programming in Haskell, and then gradually build up your expertise in creating industrial-strength programs to accomplish any goal. The book covers topics such as Functors, Applicatives, Monads, and Transformers. You will learn various ways to handle state in your application and explore advanced topics such as Generalized Algebraic Data Types, higher kind types, existential types, and type families. The book will discuss the association of lenses with type classes such as Functor, Foldable, and Traversable to help you manage deep data structures.

Cover
Nishant Shukla: Haskell Data Analysis Cookbook, Paperback: 334 pages, Packt, June 2014, English, ISBN-10: 1783286334, ISBN-13: 978-1783286331

Book Description
This book will take you on a voyage through all the steps involved in data analysis. It provides synergy between Haskell and data modeling, consisting of carefully chosen examples featuring some of the most popular machine learning techniques.

You will begin with how to obtain and clean data from various sources. You will then learn how to use various data structures such as trees and graphs. The meat of data analysis occurs in the topics involving statistical techniques, parallelism, concurrency, and machine learning algorithms, along with various examples of visualizing and exporting results. By the end of the book, you will be empowered with techniques to maximize your potential when using Haskell for data analysis.

The GitHub public repository contains over 130 practical recipes to accompany every chapter of the book. Use it as a Swiss Army Knife of algorithms and code snippets. Try a recipe a day, like a kata for your mind.

Samuli Thomasson:
Cover
Haskell High Performance Programming Book, ISBN 139781786464217, Paperback, 408 pages Packt, September 2016

Book Description
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. Learn to use parallelism and explore the concept of streaming. This book demonstrates the benefits of running multithreaded and concurrent applications. Next it will guide you through various profiling tools that will help you identify performance issues in your program.


Ryan Lemmer:
Cover
Haskell Design Patterns, Paperback: 166 pages, Packt, November 2015, English, ISBN-10: 1-783-98872-X, ISBN-13: 9781783988723

Book Description
Design patterns and idioms can widen our perspective by showing us where to look, what to look at, and ultimately how to see what we are looking at. At their best, patterns are a shorthand method of communicating better ways to code (writing less, more maintainable, and more efficient code).

This book starts with Haskell 98 and through the lens of patterns and idioms investigates the key advances and programming styles that together make "modern Haskell". Your journey begins with the three pillars of Haskell. Then you'll experience the problem with Lazy I/O, together with a solution. You'll also trace the hierarchy formed by Functor, Applicative, Arrow, and Monad. Next you'll explore how Fold and Map are generalized by Foldable and Traversable, which in turn is unified in a broader context by functional Lenses. You'll delve more deeply into the Type system, which will prepare you for an overview of Generic programming. In conclusion you go to the edge of Haskell by investigating the Kind system and how this relates to Dependently-typed programming.

James Church:
Cover
Learning Haskell Data Analysis, Paperback: 198 pages, Packt, May 2015, English, ISBN-10: 1-784-39470-7, ISBN-13: 9781784394707

Book Description
This book provides you with the skills to handle large amounts of data, even if that data is in a less than perfect state. Each chapter in the book helps to build a small library of code that will be used to solve a problem for that chapter.

The book starts with creating databases out of existing datasets, cleaning that data, and interacting with databases within Haskell in order to produce charts for publications. It then moves towards more theoretical concepts that are fundamental to introductory data analysis, but in a context of a real-world problem with real-world data. As you progress in the book, you will be relying on code from previous chapters in order to help create new solutions quickly. By the end of the book, you will be able to manipulate, find, and analyze large and small sets of data using your own Haskell libraries.

Julien Dehos:
Cover
La programmation fonctionnelle - Introduction et applications en Haskell à l'usage de l'étudiant et du développeur, 264 pages, Ellipses Références sciences, 2019, French, ISBN: 9782340028777

Ce livre a pour objectif d’initier à la programmation fonctionnelle en général et au langage Haskell en particulier ; ceci de façon réellement exploitable. Il en présente les principales notions ainsi que différentes applications (intelligence artificielle pour des jeux, application web, convertisseur de fichiers textes, etc.). Enfin, il indique comment mettre en oeuvre le style fonctionnel dans des langages comme C++ et JavaScript.

Foundations

Cover

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 systems--and of programming languages from a type-theoretic perspective-has important applications in software engineering, language design, high-performance 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 lambda-calculus, 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 object-oriented languages.

Cover
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 low-level 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 ML-style 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 Jean-Yves Girard translated and with appendices by Paul Taylor and Yves Lafont.
Based on a short graduate course on typed lambda-calculus given at the Universit Paris VII in the autumn term of 1986-7.

Programming language theory texts online
Collection of online programming language theory texts maintained by Frank Atanassow

Programming in Martin-Löf's Type Theory: An Introduction by Bengt Nordström, Kent Petersson and Jan M. Smith. 1990.

Monadic Programming

Haskell - PIM
Practical monadic interpretation by Dan Popa , Language: Romanian

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.

Mathematics

See Books and tutorials/Mathematics

Miscellaneous

Real World #haskell

Videos

Richard Cook :
Cover
Building an Application with Functional Haskell (Video), ISBN13 9781787285088, Course Length 2 hours 9 minutes. Packt (August 2017)

Video Description
This video is specifically aimed at anybody who knows the essentials of the Haskell programming language and who is interested in moving onto developing real programs that will make use of file I/O, command-line parsers and various third-party packages. This course will take you through the complete journey from writing your first Haskell program to getting familiarized with Haskell and all its functionalities.

Richard Cook :
Cover
Writing Haskell Programs (Video), ISBN13 9781787283329, Video Length 2 hours and 43 minutes. Packt (May 2017)

Video Description
This course builds on the foundations provided by the Fundamentals of Practical Haskell Programming course and helps to bridge the gap between introductory and advanced Haskell by teaching you how to manage and develop complex programs. We'll also dispel the myth that Haskell is only useful for toy programs.

Richard Cook :
Cover
Fundamentals of Practical Haskell Programming (Video), ISBN13 9781787288768, Video Length 2 hours and 59 minutes. Packt (March 2017)

Video Description
This video course will take you through all the concepts of functional programming (FP) and Haskell language. First, we’ll address all the problems with FP and Haskell. Then we’ll help you distinguish the difference between FP and Haskell. We’ll then guide you through Haskell in depth. We’ll help you create your first Haskell program. You’ll then be given a brief insight into GHCi (Glasgow Haskell Compiler). Later we’ll explore the different values, expressions and programs in Haskell in depth.

Cover
Haskell: Data Analysis Made Easy, ISBN13 9781787283633, Course Length 7 hours 30 minutes. Packt (February 2017)

Course Description
This course will introduce the basic concepts of Haskell and move on to discuss how Haskell can be used to solve the issues by using the real-world data. The course will guide you through the installation procedure, after you have all the tools that you require in place, you will explore the basic concepts of Haskell including the functions, and the data structures. With a good hold on the basics of Haskell and data analysis, you will then be introduced to advanced concepts of data analysis such as Kernel Density Estimation, Hypothesis testing, Regression analysis, text analysis, clustering, Naïve Bayes Classification, and Principal Component Analysis.

Samuel Gélineau :
Cover
Mastering Haskell Programming (Video), ISBN13 9781786465016, Course Length 6 hours 4 minutes. Packt (February 2017)

Video Description
In this course, you’ll discover different ways to structure interactions between the program and the outside world. We’ll look at some subtler aspects of the IO monad, such as lazy IO and unsafePerformIO. In addition to the IO monad, we’ll also check out two other structured forms of interaction: streaming libraries and functional reactive programming. Then we explore parallel, concurrent, and distributed programming. Thanks to purity, Haskell is especially well-suited for the first two, and so there are a number of approaches to cover. As for distributed programming, we focus on the idea of splitting a large monolithic program into smaller microservices, asking whether doing so is a good idea. We’ll also consider a different way of interacting with other microservices, and explore an alternative to microservices.

James Church :
Cover
Advanced Data Analysis with Haskell Video, ISBN13 9781785287237, Course Length 4 hours 4 minutes Packt, December 2016

Video Description
In this video, you will be guided on how to find correlations in data, as well as multiple dependent variables. You will be given a theoretical overview of the types of regression and we’ll show you how to install the LAPACK and HMatrix libraries. By the end of the first part, you’ll be familiar with the application of N-grams and TF-IDF. Once you’ve learned how to analyze data, the next step is organizing that data with the help of machine learning algorithms. You will be briefed on the mathematics and statistical theorems such as Baye’s law and its application, as well as eigenvalues and eigenvectors using HMatrix. By the end of this course, you’ll have an understanding of data analysis, different ways to analyze data, and the various clustering algorithms available. You’ll also understand Haskell and will be ready to write code with it.

Hakim Cassimally :
Cover
Learning Haskell Programming Video, ISBN13 9781786465542, Course Length 4 hours 10 minutes Packt, December 2016

Video Description
This video would begin with the fundamentals and building blocks of Haskell programming language with special emphasis on functional programming. It will be covering how Haskell variables, syntax work alongwith Haskell datatypes and functions. You will learn how to solve programming problems while creating an application with hands-on experience. You will then move on to learning writing expressions and high-order functions. At the end of the video, you will be able to build a complete application with Haskell alongwith learning the important functionalities.

James Church:
Cover
Getting Started with Haskell Data Analysis Video, Course Length: 3 hours 18 minutes, Packt, July 2016, English, ISBN-13: 9781785880841

Course Description
Data analysis is part computer science and part statistics. An important part of data analysis is validating your assumptions with real-world data to see if there is a pattern, or a particular user behavior that you can validate. This video course will help you get up to speed with the basics of data analysis and approaches in the Haskell language. You'll learn about statistical computing, file formats (CSV and SQLite3), descriptive statistics, charts, and onto more advanced concepts like understanding the importance of normal distribution. Whilst mathematics is a big part of data analysis, we’ve tried to keep this course simple and approachable so that you can apply what you learn to the real world.

Joke

Cover
Team "Referential Transparent Sea Keepers": Functional Ikamusume

book series, Japanese

Book Description
Functional Ikamusume book series provides a forum for researchers, developers, and anime-watchers to publish their latest work, articles, and “mousou (妄想)” on the design, implementations, principles, and uses of functional programming and Ikamusume. The book series covers the entire spectrum of work, from practice to theory, from frank introduction of functional programming to latest research work, from Ikamusume with some functional flavor to functional programming with some Ikamusume flavor. Let’s enjoy writing articles on functional programming in frank “geso” style de-geso!!

Past books are written entirely in Japanese, and books are planned to be sold in Japan, but we also accept articles in English. For more information on functional Ikamusume, see the links above (all in Japanese), or ask @xhl_kogitsune or "other members" on twitter, or xhlkogitsune on Skype. You don’t have to be worried about what is Functional Ikamusume —— she is just Ikamusume who loves functional programming, as you love it.

If you are interested in writing Functional Ikamusume articles, please contact xhlkogitsune on Skype or the authors on twitter. You can use Japanese or English for discussion. A text chat room is on Skype, and I’ll invite you to the chat room. While the chat is currently in Japanese, most participants can read/write English.