History of Programming Languages

History of Programming Languages
Author: Richard L. Wexelblat
Publisher: Academic Press
Total Pages: 784
Release: 2014-05-27
Genre: Reference
ISBN: 1483266168

History of Programming Languages presents information pertinent to the technical aspects of the language design and creation. This book provides an understanding of the processes of language design as related to the environment in which languages are developed and the knowledge base available to the originators. Organized into 14 sections encompassing 77 chapters, this book begins with an overview of the programming techniques to use to help the system produce efficient programs. This text then discusses how to use parentheses to help the system identify identical subexpressions within an expression and thereby eliminate their duplicate calculation. Other chapters consider FORTRAN programming techniques needed to produce optimum object programs. This book discusses as well the developments leading to ALGOL 60. The final chapter presents the biography of Adin D. Falkoff. This book is a valuable resource for graduate students, practitioners, historians, statisticians, mathematicians, programmers, as well as computer scientists and specialists.

Guide to Reference Sources in the Computer Sciences

Guide to Reference Sources in the Computer Sciences
Author: Ciel Michèle Carter
Publisher: New York : Macmillan Information
Total Pages: 264
Release: 1974
Genre: Computers
ISBN:

Critical, evaluative reviews of computer science reference sources. Good starting point for learning the computer reference literature or to find a source of needed information. Published 1974.

Iterative Methods for the Solution of Equations

Iterative Methods for the Solution of Equations
Author: Joseph Frederick Traub
Publisher: American Mathematical Soc.
Total Pages: 328
Release: 1982
Genre: Mathematics
ISBN: 9780828403122

From the Preface (1964): ``This book presents a general theory of iteration algorithms for the numerical solution of equations and systems of equations. The relationship between the quantity and the quality of information used by an algorithm and the efficiency of the algorithm is investigated. Iteration functions are divided into four classes depending on whether they use new information at one or at several points and whether or not they reuse old information. Known iteration functions are systematized and new classes of computationally effective iteration functions are introduced. Our interest in the efficient use of information is influenced by the widespread use of computing machines ... The mathematical foundations of our subject are treated with rigor, but rigor in itself is not the main object. Some of the material is of wider application ... Most of the material is new and unpublished. Every attempt has been made to keep the subject in proper historical perspective ... ''