Functional Programming

Learn the main concepts behind functional programming such as currying, partial application, and monads, and how to combine functional programming with your imperative programming projects.

This is an introduction to the techniques of functional programming, the associated computational models and the implementation of functional programming languages on both sequential and parallel machines. The book presents the features of functional programming languages, using Miranda as an example language. It focuses on an alternative computational model - Graph Rewriting Systems. The book demonstrates and discusses the potential power of concurrent functional programming and the implementation on loosely coupled parallel architectures. All the chapters include a summary and exercises.

This book explores the role of Martin-Lof's Constructive Type Theory in computer programming. The main focus of the book is how the theory can be successfully applied in practice. Introductory sections provide the necessary background in logic, lambda calculus and constructive mathematics, and exercises and chapter summaries are included to reinforce understanding.

Several formalisms for program construction have appeared. One such formalism is the type theory developed by Per Martin-Lof. Well suited as a theory for program construction, it makes possible the expression of both specifications and programs within the same formalism. Furthermore, the proof rules can be used to derive a correct program from a specification as well as to verify that a given program has a certain property.

This book provides a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. It is intended to be a source of practical laboratory work material and to help students to develop, modify and experiment with their own implementations.

This is a teaching material about functional programming in Scheme. The current version of the material is a 2nd edition. Scheme is a pragmatic choice of programming language in the functional programming paradigm, with unique flexibility due to the membership of the Lisp family of languages. Furthermore, Scheme is both very powerful and rather small compared to other Lisp languages.

Since its inception in 2005, Qi has generated great interest over the internet. Here for the first time is the hardcopy exposition of the language, remastered for the issue of Qi II in 2008. This second edition fixes the language standard for Qi. The book is both a comprehensive introduction to Qi and to functional programming. The first half of the book covers foundational material and is suitable for an undergraduate introduction to functional programming. The second half of the book explores the theoretical foundations of Qi, including lambda calculus, type theory and logic programming and concludes with Qi applications in computational logic and expert systems.

This book introduces the concepts of functional and symbolic programming, applies these techniques to some problems of varying complexity, and eventually discusses the implementation of an abstraction layer for solving problems in an abstract, architecture-neutral way by the example of a purely symbolic LISP interpreter.

Sketchy LISP is a step-by-step introduction to functional programming in Scheme. By means of numerous examples of varying complexity, it takes the reader on an entertaining and informative tour through the language.

Design patterns inspired by functional programming concepts can advance object-oriented design. This book promotes the idea that concepts from the world of functional programming can be captured with design pattern descriptions. These can then be used to benefit from functional programming concepts with ordinary object-oriented languages. The functional patterns are evaluated for their impact on language design and a new approach to a dual-paradigm language is presented.