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 …

In functional programming, intermediate data structures are often used to “glue” together
small programs. Deforestation is a program transformation to remove these intermediate …

With the increasing popularity of parallel programming environments such as PC clusters,
more and more sequential programmers, with little knowledge about parallel architectures …

The problems involved in develo** efficient parallel programs have proved harder than
those in develo** efficient sequential ones, both for programmers and for compilers …

In the tradition of mathematical modelling in physics and chemistry, constructive formal
specification methods are based on the notion of a software model, understood as a state …

In the database engineering realm, the merits of transformational approaches, that can
produce in a systematic way correct, compilable and efficient database structures from …

Accumulations are recursive functions that keep intermediate results in additional
parameters which are eventually used in later stages of the computation. We present a …

In this paper we propose a new method for deriving a practical linear-time algorithm from the
specification of a maximum-weightsum problem: From the elements of a data structure x, find …

Trees are important datatypes that are often used in representing structured data such as
XML. Though trees are widely used in sequential programming, it is hard to write efficient …

The accumulation strategy consists of generalizing a function over an algebraic data
structure by inclusion of an extra parameter, an accumulating parameter, for reusing and …