Code: 05065239
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 ... more
513.30 zł
Availability:
50/50We think title might be available. Upon your order we will do our best to get it within 6 weeks.Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 299 loyalty points
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.
Book category Books in English Computing & information technology Computer programming / software development Compilers
513.30 zł
Since 2008, we have served long line of book lovers, but each of them was always on the first place.
Copyright! ©2008-24 libristo.pl All rights reservedPrivacyPoučení o cookies
You & Books. All covered.
Shopping cart ( Empty )