Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Domains and Lambda-Calculi - Roberto M. Amadio, Pierre-Louis Curien

Domains and Lambda-Calculi

Buch | Softcover
504 Seiten
2008
Cambridge University Press (Verlag)
978-0-521-06292-3 (ISBN)
CHF 94,25 inkl. MwSt
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 ways independent of both language and platform. To do this the authors explain denotational and operational semantics and exploit the duality between them.
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 modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is 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.

Preface; Notation; 1. Continuity and computability; 2. Syntactic theory of λ-calculus; 3. D∞ models and intersection types; 4. Interpretation of λ-calculi in CCC's; 5. CCC's of algebraic dcpo's; 6. The language PCF; 7. Domain equations; 8. Values and computations; 9. Powerdomains; 10. Stone duality; 11. Dependent and second order types; 12. Stability; 13. Towards linear logic; 14. Sequentiality; 15. Domains and realizability; 16. Functions and processes; Appendix 1: summary of recursion theory; Appendix 2: summary of category theory; References and bibliography; Index.

Erscheint lt. Verlag 15.5.2008
Reihe/Serie Cambridge Tracts in Theoretical Computer Science
Zusatzinfo 85 Line drawings, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 152 x 228 mm
Gewicht 758 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 0-521-06292-6 / 0521062926
ISBN-13 978-0-521-06292-3 / 9780521062923
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95