Algebraic Approach To Compiler Design, An

By:

Augusto Sampaio

Format:

Hardback

Series:

AMAST Series in Computing

Show Hide Adult Content

Unavailable

Sorry, this product is not currently available to order

Description

This work investigates the design of compilers for procedural languages, based on the algebraic laws which these languages satisfy. The particular strategy adopted is to reduce an arbitrary source program to a general "normal form", capable of representing an arbitrary target machine. This is acheived by a series of normal form reduction theorems which are proved algebraically from the more basic laws. The normal form and the related reduction theorems can then be instantiated to design compilers for distinct target machines. This constitutes the main novelty of the author's approach to compilation, together with the fact that the entire process is formalized within a single and uniform semantic framework of a procedural language and its algebraic laws. Furthermore, by mechanizing the approach using the OBJ3 term rewriting system it is shown that a prototype compiler is developed as a byproduct of its own proof of correctness.

Release date Australia

April 19th, 1997

Author

Augusto Sampaio

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational

Pages

204

Series

AMAST Series in Computing

Dimensions

157x220x18

ISBN-13

9789810223915

Product ID

3244783

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Computers & Internet Books: