Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)

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.



$$ Buy "Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)" on Amazon $$

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 1717
2. Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)
3. Modal Logic (Cambridge Tracts in Theoretical Computer Science)
4. Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)
5. Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)
6. Basic Proof Theory (Cambridge Tracts in Theoretical Computer Science)
7. Rippling: Meta-Level Guidance for Mathematical Reasoning (Cambridge Tracts in Theoretical Computer Science)
8. Rippling: Meta-Level Guidance for Mathematical Reasoning (Cambridge Tracts in Theoretical Computer Science)
9. Domains, Requirements, and Software Design (Texts in Theoretical Computer Science. An EATCS Series)
10. Software Engineering 3: Domains, Requirements, and Software Design (Texts in Theoretical Computer Science. An EATCS Series)
11. C by Example (Cambridge Computer Science Texts)
12. Handbook of Theoretical Computer Science : Algorithms and Complexity
13. Handbook of Theoretical Computer Science : Algorithms and Complexity
14. Handbook of Theoretical Computer Science : Algorithms and Complexity
15. Handbook of Theoretical Computer Science : Algorithms and Complexity
16. Theoretical Computer Science: Essays in Memory of Shimon Even