This book, which contains contributions from leading researchers in France, USA and Great Britain, gives detailed accounts of a variety of methods for describing the semantics of programming languages, i.e. for attaching to programs mathematical objects that encompass their meaning. Consideration is given to both denotational semantics, where the meaning of a program is regarded as a function from inputs to outputs, and operational semantics, where the meaning includes the sequence of states or terms generated internally during the computation. The major problems considered include equivalence relations between operational and denotational semantics, rules for obtaining optimal computations (especially for nondeterministic programs), equivalence of programs, meaning-preserving transformations of programs and program proving by assertions. Such problems are discussed for a variety of programming languages and formalisms, and a wealth of mathematical tools is described.Traditional mathematical practice considers an algebra effectively computable iff it has a a#39;decidable word problema#39;, meaning that it can be presented as a quotient of a free algebra in such a way that one can decide in a finite number of steps whether or not two terms represent the ... If Initiality, induction, and computability 501.

Title | : | Algebraic Methods in Semantics |

Author | : | Maurice Nivat, John C. Reynolds |

Publisher | : | CUP Archive - 1985 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.