No label defined (Q4039770)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 192881
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 192881

      Statements

      5 June 1993
      0 references
      \(\lambda\)-calculus
      0 references
      functional programming
      0 references
      combinators
      0 references
      FP
      0 references
      MIRANDA
      0 references
      graph reduction
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references