direct execution of an algebraic oriented language
Now, new high level languages are being developed to make easier the program writing. These languages provide program proving facilities, to make the software more reliable. They are intended to describe the user's problems and to ignore voluntarily the execution constraints on a computer. For these languages, the direct execution is an attractive solution so we are building a machine executing directly a very high level language suited to the algebraic problems. This language has some unconventional features, such as: non-ordered statements, equivalence between equations and instructions, explicit recurrence description. These language peculiarities led to a machine organization composed of specific mechanisms, most of these mechanisms being reentrant. In this paper, we describe in a first section the language properties. In a second section, we describe the direct execution problems and finally we discuss the general features of our machine.
direct execution algebraic oriented language high level language specific mechanism call for need single assignment reentrant mechanism