Amadio / Curien | Domains and Lambda-Calculi | Buch | 978-0-521-62277-6 | www.sack.de

Buch, Englisch, Band 46, 500 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 961 g

Reihe: Cambridge Tracts in Theoretical Computer Science

Amadio / Curien

Domains and Lambda-Calculi


Erscheinungsjahr 2003
ISBN: 978-0-521-62277-6
Verlag: Cambridge University Press

Buch, Englisch, Band 46, 500 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 961 g

Reihe: Cambridge Tracts in Theoretical Computer Science

ISBN: 978-0-521-62277-6
Verlag: Cambridge University Press


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.

Amadio / Curien Domains and Lambda-Calculi jetzt bestellen!

Weitere Infos & Material


Preface; Notation; 1. Continuity and computability; 2. Syntactic theory of ?-calculus; 3. D8 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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.