Richard Bird

Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style.

Pearls of Functional Algorithm Design

Philip Wadler

This is a thorough introduction to the fundamental concepts of functional programming.The book clearly expounds the construction of functional programming as a process of mathematical calculation, but restricts itself to the mathematics relevant to actual program construction. It covers simple and abstract datatypes, numbers, lists, examples, trees, and efficiency. It includes a simple, yet coherent treatment of the Haskell class; a calculus of time complexity; and new coverage of monadic input-output.

Introduction to Functional Programming

Introduction to Functional Programming (Prentice Hall International Series in Computer Science)

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. This engaging text will be welcomed by students and teachers alike.

Thinking Functionally with Haskell

Introduction to Functional Programming Using Haskell

An Illustrated Encyclopedia of Flowering Plants Containing More Than 1,800 Beautiful Photographs

The Complete Practical Guide to Gardening with Annuals, Bulbs & Perennials

関数プログラミング珠玉のアルゴリズムデザイン

Includes an illustrated gardener's guide to the different varieties of squashes and pumpkins, their history and cooking uses and step-by-step instructions for preparing the soil, growing under glass, providing support, harvesting and storing.

A Practical Gardening Guide for Great Results, with Step-by-Step Techniques and 150 Colour Photographs

Squashes and Pumpkins

Michael Mayhew

National Theatre (Great Britain)

Lorenzaccio by Alfred de Musset

Growing vegetables, fruits and herbs successfully: varieties, techniques, and a seasonal calendar of tasks.

The Complete Practical Guide to Kitchen Gardening, from Planning and Planting to Harvesting and Storing

The Kitchen Garden Book

Richard S. Bird

Oege de Moor

Describes an algebraic approach to programming that permits the calculation of programs. Introduces the fundamentals of algebra for programming. Presents paradigms and strategies of program construction that form the core of Algorithm Design. Discusses functions and categories; applications; relations and allegories; datatypes; recursive programs, optimization issues, thinning algorithms, dynamic programming and greedy algorithms. Appropriate for all programmers.

Algebra of Programming

Every gardener needs to know their Latin names. They may look confusing at first, but once you understand what certain key words mean, impenetrable-sounding and hard-to-pronounce species names are suddenly demystified. Many Latin names hide the secrets of where the plant is found, its colour, flowering times, leaf pattern, natural habitat and all sorts of other information that's extremely useful to the gardener: if you want a plant for a shady place, choose one with a name ending in sylvestris ('of woods'), while if your garden is dry, look out for the suffix epigeios ('of dry places').More than just a dictionary of plant names, this fascinating book explains the meaning of hundreds of Latin plant terms, grouped into handily themed sections such as plants that are named after famous women, plants that are named after the shape of their leaves, plants that are named after their fragrance or the time of year that they flower. Within these pages you'll learn that Digitalis purpurea (the common foxglove) is purple, that the sanguineum in Geranium sanguineum means 'bloody' (its common name is the bloody cranesbill), and to steer clear of any plant whose Latin name ends in infestus.

The language of plants explained

A Gardener's Latin

Touch and Go

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

Christopher Brickell

Barbara Haynes

Riina Tammsaar

Praktiline aiapidaja käsiraamat

Jeremy Gibbons

Ideal for learning or reference, this book explains the five main principles of algorithm design and their implementation in Haskell.

Richard Bird

About

Books

Join the club