Part 1 FUNCTIONAL PROGRAMMING

1 Basic concepts

2 Advanced concepts: Miranda

Part 2 MODELS OF COMPUTATION

3 The l-calculus

4 Term rewriting systems

5  Graph rewriting systems

Part 3 ANALYSIS OF FUNCTIONAL PROGRAMS

6  Type assignment systems

7  Strictness analysis

Part 4 IMPLEMENTATION ON SEQUENTIAL ARCHITECTURES

8  Clean

9  Translation into Clean

10 The abstract ABC machine

11 Translating Clean into ABC code

The main methodological connection between programming language theory and category theory is the fact that both theories are essentially “theories of functions.” A crucial point, though, is that the categorical notion of morphism generalizes the set-theoretical description of function in a very broad sense, which provides a unified understanding of various aspects of the theory of programs. This is one of the reasons for the increasing role of category theory in the semantic investigation of programs if compared, say, to the set-theoretic approach.

Our purpose in writing this tutorial is not to teach programming, nor even to teach functional programming. Rather, it is intended to serve as a supplement to the Haskell Report [4], which is otherwise a rather dense technical exposition. Our goal is to provide a gentle introduction to Haskell for someone who has experience with at least one other language, preferably a functional language (even if only an "almost-functional" language such as ML or Scheme).

This book integrates the vital areas of object-orientation, functional programming, design patterns, and language design. The most important concepts from functional programming are captured with six design patterns.

These patterns can be used with any object-oriented language to advance software design. The patterns form a system, i.e., a collaborating set of patterns. In their "Related Patterns" sections the patterns refer to each other and to many other published design patterns.