Interpretive interface: resources and program representation in computer organization
Conference
·
OSTI ID:7141680
Traditional machine architectures are based on premises of slow memory access and fixed, low-level instruction interpretation. Improved memory technology and machine understanding allow new, more efficient program representations. A Canonic Interpretive Form (CIF) of higher-level-language programs is proposed to measure the ''minimum'' space to represent and time to interpret a given program. This ''ideal'' is a basis for a comparison with traditional machine languages which require ten times more program space than the CIF. Synthesis of program forms (called Directly Executed Languages--DELs) which approach CIF measures is proposed as well as results of a recently completed FORTRAN DEL (DELTRAN). 4 figures, 7 tables.
- Research Organization:
- Stanford Univ., CA (USA)
- OSTI ID:
- 7141680
- Report Number(s):
- SU-326-P.39-21; CONF-770413-5
- Country of Publication:
- United States
- Language:
- English
Similar Records
Theory of interpretive architectures: ideal language machines. Technical report No. 170
Theory of interpretive architectures: some notes on DEL design and a FORTRAN case study. Technical report No. 171
Structure of directly executed languages: a new theory of interpretive system design
Technical Report
·
Wed Jan 31 23:00:00 EST 1979
·
OSTI ID:6861139
Theory of interpretive architectures: some notes on DEL design and a FORTRAN case study. Technical report No. 171
Technical Report
·
Wed Jan 31 23:00:00 EST 1979
·
OSTI ID:6130444
Structure of directly executed languages: a new theory of interpretive system design
Technical Report
·
Mon Feb 28 23:00:00 EST 1977
·
OSTI ID:5159542