 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science) by Roberto M. Amadio, Pierre-Louis Curien ISBN-10: 9780521622776 ISBN-10: 0-521-62277-8 ISBN-13: 9780521622776 ISBN-13: 978-0-521-62277-6 Hardcover 1998-08-13 Cambridge University Press Find Lowest Price |
Editorials | ||
Product Description This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science. | ||
Book Description This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. To do this the authors explain denotational and operational semantics and exploit the duality between them. | ||
Reviews | ||
A near Psychotic Break-7 on the Ritcher Scale Written by two psychotic professors who are experts in the field. The book, though written for mature readers , is lucid and leads the reader scenically to thre climax on Process Algebras. The book is a bit disjointed though. In Theoretical Computer Science, where the more general a "general emotional disturbance" is the better, I suggest that the authors should have had worsened their illness somwhat (I am being funny now!) by utilizing Category Theory, Domain Equations, and Universal Algebra as a unifying framework for the topics in the rest of the book. Also, they should have ncluded more on Category Theory and in particular, Domain Equations in this book. They should had shown the interrelationships between the three frameworks as well: the book would have been lengthened somewhat but more complete. Although I am just about to read the book, I feel I am mature enough to follow where a Math book is going upon looking through it in sequence. I am an undergrad at CUNY Bachelaureate Program Queens College Math Department who is trying not to be arrogant. | ||