Abstract
Two languages, one a simple structured programming language, the other a simple goto language, are defined. A denotational semantics is given for each language. An interpreter for the goto language is given and is proved correct with respect to the denotational semantics. A compiler from the structured to the goto language is defined and proved to be a semantically invariant translation of programs. The proofs are by computational induction.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
