GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
TRAC, a procedure-describing language for the reactive typewriter
Communications of the ACM
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
The definition of the control and environment structure of programming languages
The definition of the control and environment structure of programming languages
LISP 1.5 Programmer's Manual
The SNOBOL4 programming language
The SNOBOL4 programming language
The contour model of block structured processes
ACM SIGPLAN Notices
A history of the SNOBOL programming languages
History of programming languages I
| Hi-index | 0.00 |
A program of a high level language can be executed either by applying a suitable high level machine to the program or by translating the program to an equivalent program in another language for which a machine exists. Constructing a high level machine for each language is an interesting solution, but such a solution requires the construction of many machines and also does not enable the semanticist to compare programming languages. Using an existing conventional machine whose machine language is the target language of a translator provides an un-interesting solution which also does not allow the semanticist to easily compare programming languages. If we use a high level machine, such as GLOSS, whose machine language is the target language of a translator, then we can write a translator which merely rearranges syntax and does not lose any semantics. Such a solution is interesting to the semanticist if a large class of programming languages can be translated into this high level machine by syntax rearrangement because the high level machine can serve as a medium of programming language comparison.