Towards a theory of semantics and compilers for programming languages

Authors:
E. K. Blum
Affiliations:
-
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 7
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
A Variant to Turing's Theory of Computing Machines

Journal of the ACM (JACM)
Computability of Recursive Functions

Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages

Journal of the ACM (JACM)
A Turing Machine Simulator

Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Programming Languages, Information Structures, and Machine Organization.

Programming Languages, Information Structures, and Machine Organization.

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of imbedding a programming language L into a formal system is introduced and used as the basis of defining the semantics &Fgr; of the language. &Fgr; is an operator which maps a program p in L onto a function. The pair (L, &Fgr;) is called a programming system. If (L, &Fgr;) and (L,' &Fgr;') are two programming systems, a mapping &Ggr; from L into L' is called a compiler. A compiler is said to be correct if &Fgr;'(&Ggr;(p)) &equil; &Fgr;(p) for p in L. These ideas are illustrated in terms of two programming systems, one for recursive functions and the other for Turing machines.