Abstract

This chapter focuses on the theoretical machine or programming system called “incremental computer,” which departs from the foundations of conventional computers and programming systems. Its language has no instructions or statements, but well-formed expressions or forms instead. The machine does not execute programs or procedures but evaluates forms directly. Although the language, design, and performance of this incremental computer may seem offbeat, they are rooted in the results of extensive research carried out during the past decade. The chapter discusses the general concepts, the language of the incremental computer, its memory structure, and its operation. There may be incompleteness and inconsistency because of lack of experimentation, but the information contained here is sufficient to pinpoint many of the problems, perhaps elicit solutions more suitable than the ones proposed, and provide an initial guideline for the implementation of an incremental computer. It is advisable that such initial implementation take place in terms of an interpreter, operating on a conventional machine, which accepts as language the language of the incremental computer.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.