Towards a theory of semantics and compilers for programming languages

DOI10.1016/S0022-0000(69)80016-4zbMath0174.28903WikidataQ121840436 ScholiaQ121840436MaRDI QIDQ2532605

Edward K. Blum

Publication date: 1969

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items (6)

On transformations of programs ⋮ Proving a compiler correct: A simple approach ⋮ SEMANOL (73), a metalanguage for programming the semantics of programming languages ⋮ A generalization of the homomorphism concept ⋮ Unnamed Item ⋮ Implementation of data types by algebraic methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Turing Machine Simulator
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• Computability of Recursive Functions

This page was built for publication: Towards a theory of semantics and compilers for programming languages