Browse Prior Art Database

IEEE Computer Volume 11 Number 12 -- BOOK REVIEWS Disclosure Number: IPCOM000131363D
Original Publication Date: 1978-Dec-01
Included in the Prior Art Database: 2005-Nov-10
Document File: 3 page(s) / 19K

Publishing Venue

Software Patent Institute

Related People

Dr. Francis P. Mathur: AUTHOR [+2]


BOOK REVIEWS * B78-31 Logical Construction of Programs -- Jean Dominique Warner (New York: Van Nostrand Reinhold, 1974, $15.00, 230 pp.) * B78-32 Computer Architecture, 2nd ed. -- Caxton C. Foster (New York: Van Nostrand Reinhold, 1976, $16.95.)

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 35% of the total text.

Page 1 of 3


This record contains textual material that is copyright ©; 1978 by the Institute of Electrical and Electronics Engineers, Inc. All rights reserved. Contact the IEEE Computer Society (714-821-8380) for copies of the complete work that was the source of this textual material and for all use beyond that as a record from the SPI Database.


Recently published books and new periodicals may be submitted for review to the Book Reviews Editor:

Dr. Francis P. Mathur

Professor and Computer Science Coordinator Mathematics Department California State Polytechnic University 3801 WestTempleAuenue Pomona, CA 91 i68 Telephone: {714) 598- 4421

{Note: publications reviewed in this section are not available from the IEEE Computer Society. Please order directly from the publisher.)


B78-31 Logical Construction of Programs -- Jean Dominique Warner (New York: Van Nostrand Reinhold, 1974, $15.00, 230 pp.)

This sweet little introductory book on programming was translated from the French -- and reads that way. Novel in its approach, the book divides the technique of programming into two parts: data and pro. gram structure, and the process of program optimization. Let's take each part in turn.

The main feature of Part I, on the programming process, is that it is language independent. The graphics used do a wonderful job of assisting the development of block- structured algorithms without having to resort to any particular language semantics. Naturally, there is a de facto semantics, namely English -- but that doesn't get in the way of this very clear exposition. The material is very, very well structured (one would almost expect it!). The emphasis is on hierarchical organizations of both data and program control-flow, but to keep it intellectually interesting there are series of rules and "laws" (which are somewhat stronger than rules), that deal with abstractions of such common notions as subroutines, informational mappings, and the like.

An example rule is: "The hierarchical structure of the program is deduced from that of the input data" (page 24). The implication is that the only good program is one that emulates the structure of the input file being processed -- and there probably won't be too much argument with that position.

Where the approach really shines is in the treatment of "complex structures," meaning here those which mix iteration (repetition), selection, and the equivalent complex data structures -- what we would otherwise call the "general program." By sticking resolutely to the firm base established before, the text captures the generality of the simple programming rules and delivers it up to the reader. All this would not be unusual, except for the fact this is done just by manipulation of graphical devices, such as bracketed brackets, little structure diagrams, and the like.

IEEE Computer Society, Dec 01, 1978 Page 1 IEEE Computer Volum...