Andere Kunden interessierten sich auch für
![Language Prototyping: An Algebraic Specification Approach]( "Language Prototyping: An Algebraic Specification Approach")
Language Prototyping: An Algebraic Specification Approach124,99 €![Cafeobj Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification]( "Cafeobj Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification")
Cafeobj Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification43,99 €![Non-Deterministic Concurrent Logic Programming in Pandora]( "Non-Deterministic Concurrent Logic Programming in Pandora")
Non-Deterministic Concurrent Logic Programming in Pandora92,99 €![An Integrated Approach to Software Engineering]( "An Integrated Approach to Software Engineering")
An Integrated Approach to Software Engineering104,99 €![Real Time Programming: Languages, Specification and Verification]( "Real Time Programming: Languages, Specification and Verification")
Real Time Programming: Languages, Specification and Verification113,99 €![Object-Oriented Software: Design and Maintenance]( "Object-Oriented Software: Design and Maintenance")
Object-Oriented Software: Design and Maintenance63,99 €![Introduction to Windows and Graphics Programming with Visual C++ (with Companion Media Pack) (Second Edition)]( "Introduction to Windows and Graphics Programming with Visual C++ (with Companion Media Pack) (Second Edition)")
Introduction to Windows and Graphics Programming with Visual C++ (with Companion Media Pack) (Second Edition)82,99 €
This book 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 achieved 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 formalised within a single and uniform semantic framework of a procedural language and its algberaic laws. Furthermore, by mechanising 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.