Annual review in automatic programming. . V. 3 by ed Richard Goodman PDF

By ed Richard Goodman

ISBN-10: 0080097634

ISBN-13: 9780080097633

Show description

Read or Download Annual review in automatic programming. . V. 3 PDF

Similar nonfiction_12 books

New PDF release: Wars of the Iroquois: A Study in Intertribal Trade Relations

George T. Hunt’s vintage 1940 examine of the Iroquois in the course of the heart and overdue 17th century offers conflict because of depletion of typical assets within the Iroquois native land and tribal efforts to imagine the function of middlemen within the fur exchange among the Indians to the west and the Europeans.

Abdelkader Hameurlain, Josef Küng, Roland Wagner, Devis's Transactions on Large-Scale Data- and Knowledge-Centered PDF

The LNCS magazine Transactions on Large-Scale info- and Knowledge-Centered structures specializes in information administration, wisdom discovery, and data processing, that are middle and scorching themes in computing device technology. because the Nineteen Nineties, the web has develop into the most motive force in the back of software improvement in all domain names.

Extra resources for Annual review in automatic programming. . V. 3

Sample text

I M P L E M E N T A T I O N O F R E C U R S I V E PROCEDURES The implementation of recursive procedures is usually considered diíBcult, furthermore it has been reported that the object programs produced by compilers which allow recursive procedures are less efficient. Of course this is true to some extent, but the sayings are grossly exaggerated, f I n any case the implementation problem for recursive procedures has been solved by Dijkstra (Ref. 3) and also by Sattley and Ingerman (Ref 9), and accord­ ingly ambitious compiler-builders will certainly include recursive pro­ cedures.

O n behalf of the user I envisage a not unnecessarily redundant language, the semantics of which have been completely fixed by our defining machine. But now it is time for us to remember that it was also our intention that the processes described should be executed by a real computer in a reasonably efficient way. 38 Ε. W. Dijkstra In this connection I should like to quote from the University Mathe­ matical Laboratory Cambridge Technical Memorandum No 61/2, 'Some reflections on Automatic Programming and on the design of Digital Com­ puters', by M .

A disturbing picture for the future: a program being correct today, false tomorrow! Furthermore, these authors write: * The above restrictions appear to be sufficient to enable the terms of an expression to be evaluated in any order. ' This is plain language: rather than closing the gap in the semantics they propose restrictions to prevent all circumstances in which this lack of defini­ tion matters, no matter how implicit these restrictions may prove to be. If these authors had their way, I should have few illusions left about the ease with which the eventual language could be used.

Download PDF sample

Annual review in automatic programming. . V. 3 by ed Richard Goodman

by Jeff

Rated 4.19 of 5 – based on 7 votes