No label defined (Q4366777)

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 1090656
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1090656

      Statements

      23 November 1997
      0 references
      functional programming
      0 references
      CAML
      0 references
      ML
      0 references
      0 references
      0 references
      This very interesting book has three claimed goals: to provide concepts and a language well-fitted for realising complex software, to bring to the fore the fundamental problems linked with programming, and finally to communicate the pleasure of programming. These aims are fulfilled: at the end of the book, which is very pleasant and enlightening, the reader will indeed have understood the fundamentals of programming, he will have learned to program in a functional language, and he will be able to build useful and complex programs like evaluators or compilers (or strategies for his favourite solitaire). The book arose from a course on programming given by G. Cousineau at the Ecole Normale Supérieure de Paris (1990-95). An English version should appear shortly at Cambridge University Press. This book, which needs no prerequisites, should interest a wide range of people. Besides computer scientists, engineers and students, it should interest mathematicians wishing to initiate themselves to (concrete) functional programming. Functional programming is based on mathematical and logical concepts, and is closely linked to Church and Curry's work on lambda-calculus (1930). This style of programming is elegant and allows manipulations of functions as easily as concrete data; programs are cleaner, more rigorous, and closer to mathematical activity. In particular the programs are independent of the machine representation of data, and have meanings independently of a particular evaluation strategy (by contrast to imperative programming). Pure functional languages are however limited from the point of view of expressivity since e.g. they can not represent directly side-effects. The language which is presented and used here, both as programming language and as programming metalanguage, is CAML, a (typed) functional language developed in LIENS and INRIA (France) and derived from Milner's ML (Edinburgh, end of seventies). CAML, like ML, incorporates furthermore imperative features; it. remains however essentially functional in spirit and allows the use of conceptual tools close to the mathematical tradition for program specification or verification. It is a clean language and learning it is deeply instructive. CAML is used and studied in several research centres, and was chosen a few years ago by the French Department of Education and Research for teaching computer science in high-level undergraduate scientific classrooms. The book is divided into three parts, Part I is a presentation of CAML (primitives, expressions, types, semantics, evaluation strategies, a.s.o.) and of the ideas and motivations underlying it. Part II is devoted to the construction of relatively complex programs, showing the expressive power of the language. The chapters of this second part correspond to different domains and can be read independently. As stated by the authors each of them can serve as a basis for rather important programming projects. These domains are: 1. Exact arithmetic (up to rationals); here the representation of natural numbers is done via circular lists, to get round the implementation constraints, which otherwise would force us to choose between limitation of size (of integers) and exactness; 2. Formal terms, pattern matching and unification; 3. Balanced trees; 4. Solving problems on graphs (and games). 5. Syntactical analysis; 6. Geometry and drawings (ex: programs for generating Escher's tilings). Part III is devoted to the presentation of problems linked to the implementation of CAML. The principles of the machines representation of data are presented, and an evaluator, a compiler and a type synthesiser for CAML are written, in CAML. All chapters are preceded by enlightening introductions and are followed by a summary, a mention of the state of art and a short commented bibliography inspiring further reading. A great deal of examples and exercises are provided throughout the book. In some rare places the reviewer (who had no real experience in concrete programming) was hindered by a presentation she found too sketchy (ex. circular lists), but in general she found the book was very well written. A surprising exception is a wrong aside comment p. 44, 1.21-25. In conclusion the reviewer enjoyed reading this book and learned much in the process.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references