Lucid, a nonprocedural language with iteration
Communications of the ACM
First version of a data flow procedure language
Programming Symposium, Proceedings Colloque sur la Programmation
The Implementation of APL on an Associative Processor
Proceedings of the Sagamore Computer Conference on Parallel Processing
High level language oriented hardware and the post-von Neumann era
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Concepts of high-level-language computer architecture
ACM '75 Proceedings of the 1975 annual conference
The architecture of an ALGOL 60 computer implemented with distributed processors
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Folds, a declarative formal language definition system
Folds, a declarative formal language definition system
| Hi-index | 0.00 |
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.