Constraint-type statements in programming languages
Communications of the ACM
A note on the use of a digital computer for doing tedious algebra and programmming
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
MPACT: microprocessor application to control-firmware translator
ACM SIGDA Newsletter
An overview of nonprocedural languages
Proceedings of the ACM SIGPLAN symposium on Very high level languages
The design of a procedureless programming language
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Recursive definitions for iterative algorithms
ACM SIGPLAN Notices
A language design for concurrent processes
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Some techniques for compile-time analysis of user-computer interactions
IBM Journal of Research and Development
Language facilities for programming user-computer dialogues
IBM Journal of Research and Development
| Hi-index | 0.00 |
This paper presents the basis for such a system. A variant of the algorithm outlined here has been coded and tested; however time limitations prevent the detailed discussion of the full system. We present here a simplified version with a few remarks on extensions. The system presented here is believed to be unique. Bobrow1 has proposed a system wherein a set of simultaneous equations are stored and a list of “wanted” variables presented. The return is a list of values of the “wanted” variables; either numeric or algebraic values. This differs from our system, where the output is an executable program for calculating “wanted” variables, wherein specific values of variables are not entered until run time. Veronis2 devised a scheme for using the computer to write the repetitive FORTRAN statements required for a program to solve simultaneous ordinary differential equations. Again, this differs considerably from the system presented here.