Proving a compiler correct: A simple approach
type: Item
instance of: scholarly article
title: Proving a compiler correct: A simple approach
zbMATH Open document ID: 0304.68022
DOI: 10.1016/S0022-0000(75)80007-9
author: Andrea Maggiolo-Schettini
author: G. M. Germano
published in: Journal of Computer and System Sciences
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3476565
Wikidata QID: Q123218781
MaRDI profile type: Publication
cites work: Towards a theory of semantics and compilers for programming languages
cites work: Q5612462
cites work: A flow diagram composition of Markov's normal algorithms without concluding formulas
cites work: Equivalence of partial recursivity and computability by algorithms without concluding formulas
cites work: Q4087154
cites work: Q4107887
cites work: Sequence-to-sequence recursiveness
cites work: Q4113810
cites work: Semantics of context-free languages
cites work: Q5574395
cites work: Q4068067
cites work: Q5685626
description: scientific article; zbMATH DE number 3476565