Abstract
We show how the problem of code generation for a simple language can be treated fully algebraically. The algebraic approach enjoys several advantages which should be demonstrated here. First, it allows a uniform specification both of the abstract syntax and of the semantics of the source and the target language on one side and of the code generation on the other side by means of hierarchical abstract data types. Moreover, theorems about the compiler, such as the preservation of the semantics, can be proved by induction on the term structure of the abstract syntax. Furthermore, existing tools for rapid prototyping with abstract data types can be applied to validate the specification against the intention in an early stage. In addition, this paper shows how such a system can also be used for performing induction proofs of conjectures.
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.
