scientific article; zbMATH DE number 192881
This book is one of a number of books which recently appeared emphasizing the use of \(\lambda\)-calculus and combinatory logic in functional programming. Its merits lie in the simplicity of the approach: It is not encyclopedic and not `oversweetened' by programming features trying to sell theory with syntactic sugar. Instead it starts from type free \(\lambda\)-calculus, enriches this calculus by constants, combinators, and lists, discusses the use of the enriched language as a target language for functional programming in FP and MIRANDA, and then studies implementation using graph reduction in a sequential and parallel form. Following this line, the author comes across various of the problems and concepts standard in functional programming, such as higher order functions, currying, list processing, lazy evaluation, termination, completeness and efficiency of evaluation strategies, etc. On his way the author discusses related subject fields like denotational semantics and polymorphic typing. The book is very well written and systematic and elegant in its presentation. I enjoyed to read it and found that it fills the gap of an easy to access approach to functional programming using \(\lambda\)- calculus. In its formal parts the book is precise and clear, and in its informal parts it is able to communicate the right intuition, mainly using simple examples. In this way it mediates between a mathematically oriented textbook and an informal introduction. It is certainly valuable for computer science students as an introductory book to the mathematics and use of mathematics in functional programming. Its bibliographic hints are good for a start into the literature but by far not exhaustive. The merits of this book are at the same time its deficiencies: The simple approach leaves a number of topics on the way untouched or even unmentioned. No word on the SECD approach to implementation and too little on the difficulties of type checking. A too optimistic reader could win the impression that there is more mathematics to know, but otherwise he owns the key-knowledge on functional programming. Anyway, I think it is a very good book.
- Combinators and functional programming languages. Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings
- A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem
- Non-associative parallel prefix computation
- Random catalytic reaction networks
- Formal metatheory of the lambda calculus using Stoughton's substitution
- Functional back-ends within the lambda-sigma calculus
- scientific article; zbMATH DE number 675533 (Why is no real title available?)
- scientific article; zbMATH DE number 194541 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 6148924 (Why is no real title available?)
- Admissibility of cut in LC with fixed point combinator
- Lambda calculus with patterns
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039770)