1 Language and library definition

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.

2 Textbooks

Book Description
Haskell is one of the leading languages for teaching functional
programming, enabling students to write simpler and cleaner code, and to
learn how to structure and reason about programs. This introduction is
ideal for beginners: it requires no previous programming experience and
all concepts are explained from first principles via carefully chosen
examples. Each chapter includes exercises that range from the
straightforward to extended projects, plus suggestions for further
reading on more advanced topics. The author is a leading Haskell
researcher and instructor, well-known for his teaching skills. The
presentation is clear and simple, and benefits from having been refined
and class-tested over several years. The result is a text that can be
used with courses, or for self-learning. Features include: freely
accessible Powerpoint slides for each chapter; solutions to exercises,
and examination questions (with solutions) available to instructors;
downloadable code that's fully compliant with the latest Haskell
release.

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.

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.

From the cover:
After the success of the first edition, Introduction to Functional Programming using Haskell has been thoroughly updated and revised to provide a complete grounding in the principles and techniques of programming with functions.
The second edition uses the popular language Haskell to express functional programs. There are new chapters on program optimisation, abstract datatypes in a functional setting, and programming in a monadic style. There are completely new case studies, and many new exercises.
As in the first edition, there is an emphasis on the fundamental techniques for reasoning about functional programs, and for deriving them systematically from their specifications.
The book is self-contained, assuming no prior knowledge of programming, and is suitable as an introductory undergraduate text for first- or second-year students.

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

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.

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.

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.

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.

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.

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

(ro) Cartea este simultan un manual introductiv de Haskell si o carte auxiliara pentru studentii de la cursul de limbaje formale. Veti avea satisfactia cunoasterii unui limbaj modern (...) in care algoritmul de sortare Quicksort se scrie pe 6 randuri, asa cum se poate vedea de altfel si in imaginea de pe coperta I. (...) Cartea cuprinde o serie de capitole folosite la Universitatea Bacau in calitate de auxiliare de laborator la disciplina Limbaje Formale si Automate.
(en) This book is simultaneosly a manual of Haskell and an auxiliary book for the students of the FLA course (Formal Languges and Automata). You will be satisfied by this modern language,Haskell. Why ? Using Haskell the Quicksort algorithm can be writen on 6 lines (or less), as you can see on the cover. And that's not all ... This book is used at Bacau State University, Romania.

2.1 Foundations

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.

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.

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.