"The Schematics of Computation"

Paper Summary:

This paper explains that, in the introductory textbook in programming "The Schematics of Computation" by Vincent S. Manis and James J. Little, the authors take the strengths of a number of different programming languages and combine them into a general language called Scheme, which incorporates the best aspects of C and C++ into a language that is more easily understood. The author points out that their language is one of the better methods of teaching programming because Scheme has minimal syntax, good support for a variety of programming paradigms including the functional, the imperative, object oriented and logic programming and can run on several operating systems including MS-DOS, Windows, Macintosh and Unix Platforms. The paper concludes that the concept of an artificial language and an artificial computer are not new, but the authors have done an excellent job of creating a beginners' language with bells and whistles not always found in some high level languages.

Table of Contents
Introduction to Programming
Basic Data types and Programming Concepts
Chapter I: Foundations for Understanding Computation and Introduce to an Artificial Programming Language Called Scheme
Chapter Two: Recursive Procedures
Chapter Three: Concepts of Text Processing, Encryption, Input/Output and Graphics
Chapter IV: List Processing Covering Structures, Quote and Symbols, Collections, Mapping, Filtering and Reduction.
Chapter V: Balances and Boxes, Mutating Data Structures, Variables that Vary
Chapter VI: Classes Delegation and Object Oriented Design
Chapter VII: Programming Languages
Chapter VIII: Databases
Chapter IX: Algorithms
Chapter X: Rule-Based Computing
Chapter XI: Machines
Chapter XII: Evaluator
Introduction to Operating Systems

From the Paper:

"This is the fundamental means for expressing repetition in Scheme. Recursive procedures express a way of reducing a problem in size in each recursive call until the base call is reached. There are several basic ways of using recursion these include mathematical functions like factorial and power to single repetitions. Another aspect of recursion is bisection, a recursive solution technique for mathematical equations. Multiway recursion offers a way of exploring multiple and alternative subproblems and combining the results. To test a recursive program it is best to use a small amount of test data where the results can be estimated. If the program is performing correctly the answers will fall within the accepted range of estimation, if not the results will fall outside of that range."

More papers on "The Schematics of Computation":

• Essay # 66410 : "The History of Computers: From Past to Present"
• Essay # 32287 : "Looking Back to the Future of Computer Technology"
• Comparison Essay # 87161 : "The Message of Computers"

APA Citation:

MLA Citation: